CoCaml: Functional Programming with Regular Coinductive Types
From MaRDI portal
Publication:4589614
DOI10.3233/FI-2017-1473zbMath1374.68098MaRDI QIDQ4589614
Alexandra Silva, Jean-Baptiste Jeannin, Dexter Kozen
Publication date: 10 November 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Related Items (11)
Nominal Unification and Matching of Higher Order Expressions with Recursive Let ⋮ Enhancing expressivity of checked corecursive streams ⋮ A Mechanized Theory of Regular Trees in Dependent Type Theory ⋮ Checked corecursive streams: expressivity and completeness ⋮ Classical (co)recursion: Mechanics ⋮ Well-founded coalgebras, revisited ⋮ Generalizing Inference Systems by Coaxioms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ CoCaml ⋮ Integrating induction and coinduction via closure operators and proof cycles
Uses Software
This page was built for publication: CoCaml: Functional Programming with Regular Coinductive Types
