Language Constructs for Non-Well-Founded Computation
No abstract available.
Related papers
- Intrinsically Correct Algorithms and Recursive Coalgebras PLDI 2026
- Well-founded recursion with copatterns and sized types JFP 2016
- A General Fine-Grained Reduction Theory for Effect Handlers ICFP 2023
- Mixed linear and non-linear recursive types ICFP 2019
- Bindings as bounded natural functors POPL 2019
- The Eureka Programming Model for Speculative Task Parallelism ECOOP 2015
- A type system for well-founded recursion POPL 2004
- Algebra of programming in Agda: Dependent types for relational program derivation JFP 2009