CoCaml: functional programming with regular coinductive types
From MaRDI portal
Publication:4589614
Recommendations
- Coalgebras in functional programming and type theory
- Functional programming with apomorphisms (corecursion)
- Copatterns, programming infinite structures by observations
- Let's see how things unfold: reconciling the infinite with the intensional (extended abstract)
- Programming and reasoning with guarded recursion for coinductive types
Cited in
(21)- \(\mathsf{CoreFun}\): a typed functional reversible core language
- Integrating induction and coinduction via closure operators and proof cycles
- Enhancing expressivity of checked corecursive streams
- Let's see how things unfold: reconciling the infinite with the intensional (extended abstract)
- A mechanized theory of regular trees in dependent type theory
- Generalizing inference systems by coaxioms
- scientific article; zbMATH DE number 7037626 (Why is no real title available?)
- CoCaml
- scientific article; zbMATH DE number 1314224 (Why is no real title available?)
- scientific article; zbMATH DE number 2000441 (Why is no real title available?)
- SMT solving for functional programming over infinite structures
- Foundations of regular coinduction
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let
- scientific article; zbMATH DE number 7168151 (Why is no real title available?)
- Well-founded coalgebras, revisited
- scientific article; zbMATH DE number 7649963 (Why is no real title available?)
- Checked corecursive streams: expressivity and completeness
- Classical (co)recursion: Mechanics
- Checking equivalence of corecursive streams: an inductive procedure
- A sound and complete projection for global types
- Putting the `K' into Bird's derivation of Knuth-Morris-Pratt string matching
This page was built for publication: CoCaml: functional programming with regular coinductive types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589614)
