CoCaml: Functional Programming with Regular Coinductive Types

Reference. CoCaml: Functional Programming with Regular Coinductive Types

Jean-Baptiste Jeannin, Dexter Kozen, Alexandra Silva · Fundamenta Informaticae · 2017 · coalgebra · DOI

Cite

Cite as @jeannin-2017-cocaml (helia, typst) · \cite{jeannin-2017-cocaml} (LaTeX)

BibTeX

bibtex · 1 line

@article{jeannin-2017-cocaml, title={CoCaml: Functional Programming with Regular Coinductive Types}, volume={150}, ISSN={1875-8681}, url={http://dx.doi.org/10.3233/fi-2017-1473}, DOI={10.3233/fi-2017-1473}, number={3-4}, journal={Fundamenta Informaticae}, publisher={SAGE Publications}, author={Jeannin, Jean-Baptiste and Kozen, Dexter and Silva, Alexandra}, editor={Baelde, David and Carayol, Arnaud and Matthes, Ralph and Walukiewicz, Igor}, year={2017}, month=Mar, pages={347–377} }

hayagriva YAML (typst)

yaml · 24 lines

jeannin-2017-cocaml:
  type: article
  title: 'CoCaml: Functional Programming with Regular Coinductive Types'
  author:
  - Jeannin, Jean-Baptiste
  - Kozen, Dexter
  - Silva, Alexandra
  date: 2017-03
  editor:
  - Baelde, David
  - Carayol, Arnaud
  - Matthes, Ralph
  - Walukiewicz, Igor
  page-range: 347-377
  url: http://dx.doi.org/10.3233/fi-2017-1473
  serial-number:
    doi: 10.3233/fi-2017-1473
    issn: 1875-8681
  parent:
    type: periodical
    title: Fundamenta Informaticae
    publisher: SAGE Publications
    issue: 3–4
    volume: 150

Download: jeannin-2017-cocaml.bib · jeannin-2017-cocaml.yml

Cites 50 works (1 here)

With notes (1)

Language Constructs for Non-Well-Founded Computation jeannin-2013-languageESOP · 2013

PDF · DOI · pldb

External (49)

Well-Founded Coalgebras, Revisited (2016)
Safe Corecursion in coFJ (2013)
Wellfounded recursion with copatterns: a unified approach to termination and productivity (2013)
Copatterns: programming infinite structures by observations (2013)
The power of parameterization in coinductive proof (2013)
Co-induction Simply: Automatic Co-inductive Proofs in a Program Verifier (2013)
Regular corecursion in Prolog (2012)
Translating Corecursive Featherweight Java in Coinductive Logic Programming (2012)
Corecursive Featherweight Java (2012)
Computing with Capsules (2012)
New (2012)
Wikipedia: p-adic numbers (2012)
Functional programming with structured graphs (2012)
Coalgebraic Semantics of Recursion on Circular Data Structures (2011)
Capsules and Closures (2011)
Coalgebras in functional programming and type theory (2011)
An Introduction to p-adic Numbers and p-adic Analysis (2011)
A coinductive calculus of binary trees (2010)
Library ocaml-cyclist (2010)
Beating the Productivity Checker Using Embedded Languages (2010)
Corecursive Algebras: A Study of General Structured Corecursion (2009)
Efficient nondestructive equality checking for trees and graphs (2008)
Inductive and Coinductive Components of Corecursive Functions in Coq (2008)
Coalgebraic Reasoning in Coq: Bisimulation and the lambda-Coiteration Scheme (2008)
Recursive Coalgebras of Finitary Functors (2007)
Co-logic programming: Extending logic programming with coinduction (2007)
Behavioural Differential Equations and Coinduction for Binary Trees (2007)
Elgot Algebras (2006)
Representing cyclic structures as nested datatypes (2006)
Iterative algebras at work (2006)
Initializing Mutually Referential Abstract Objects: The Value Recursion Challenge (2006)
Coinductive logic programming (2006)
Relaxing the Value Restriction (2004)
Compilation of extended recursion in call-by-value functional languages (2003)
Recursion in the call-by-value lambda-calculus (2002)
Cycle Therapy: A Prescription for Fold and Unfold on Regular Trees (2001)
Coalgebra-to-Algebra Morphisms (1999)
Practical Foundations of Mathematics (1999)
ML and the Address Operator (1998)
A Co-iterative Characterization of Synchronous Stream Functions (1998)
Structural Recursive Definitions in Type Theory (1998)
Revisiting catamorphisms over datatypes with embedded functions (or, programs from outer space) (1996)
Infinite Objects in Type Theory (1993)
The Revised Report on the Syntactic Theories of Sequential Control and State (1992)
A new representation of the rational numbers for fast easy arithmetic (1979)
Rational Algebraic Theories and Fixed-Point Solutions (1976)
Initial Algebra Semantics (1974)
A linear algorithm for testing equivalence of finite automata (1971)
Lazy Least Fixed Points in ML