CoCaml: Programming with Coinductive Types

Citation:
Jeannin J-B, Kozen D, Silva A.  2012.  CoCaml: Programming with Coinductive Types. :1-24.

Report Date:

December

Report Number:

1813/30798

Abstract:

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.

Citation Key:

JKS12b
PreviewAttachmentSize
cocaml.pdf432.59 KB