CoCaml: functional programming with regular coinductive types
From MaRDI portal
Publication:4589614
DOI10.3233/FI-2017-1473zbMATH Open1374.68098MaRDI QIDQ4589614FDOQ4589614
Authors: Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva 
Publication date: 10 November 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
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 (19)
- Title not available (Why is that?)
- Well-founded coalgebras, revisited
- Title not available (Why is that?)
- A mechanized theory of regular trees in dependent type theory
- Title not available (Why is that?)
- Checking equivalence of corecursive streams: an inductive procedure
- Checked corecursive streams: expressivity and completeness
- Generalizing inference systems by coaxioms
- Title not available (Why is that?)
- Enhancing expressivity of checked corecursive streams
- CoCaml
- SMT solving for functional programming over infinite structures
- Let's see how things unfold: reconciling the infinite with the intensional (extended abstract)
- Integrating induction and coinduction via closure operators and proof cycles
- \(\mathsf{CoreFun}\): a typed functional reversible core language
- Title not available (Why is that?)
- Nominal Unification and Matching of Higher Order Expressions with Recursive Let
- Title not available (Why is that?)
- Classical (co)recursion: Mechanics
Uses Software
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)
