CoCaml: Programming with Coinductive Types
Jean-Baptiste Jeannin, Dexter C. Kozen, Alexandra Soares da Silva · eCommons (Cornell University) · 2012
We present CoCaml, a functional programming language extending OCaml, which allows us to define functions on coinductive datatypes parameterized by an equation solver. We provide numerous examples that attest to the usefulness of the new programming constructs, including operations on infinite lists, infinitary lambda-terms and p-adic numbers.