Reference. Language Constructs for Non-Well-Founded Computation
Cite
Cited by (1)
CoCaml: Functional Programming with Regular Coinductive Types jeannin-2017-cocaml
Cites 11 works (0 here)
External (11)
- CoCaml project (website) (2012)
- Coalgebraic semantics of recursion on circular data structures (2011)
- Lecture notes on abstract interpretation (2010)
- Corecursive Algebras: A Study of General Structured Corecursion (2009)
- Recursive coalgebras of finitary functors (2007)
- Co-Logic Programming: Extending Logic Programming with Coinduction (2007)
- Coinductive Logic Programming (2006)
- Elgot algebras (2006)
- Practical Foundations of Mathematics (1999)
- The Formal Semantics of Programming Languages: An Introduction (1993)
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints (1977)