Show simple item record

dc.contributor.authorJeannin, Jean-Baptiste
dc.contributor.authorKozen, Dexter
dc.contributor.authorSilva, Alexandra
dc.date.accessioned2012-12-31T10:19:45Z
dc.date.available2012-12-31T10:19:45Z
dc.date.issued2012-12-31
dc.identifier.urihttps://hdl.handle.net/1813/30798
dc.description.abstractWe 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.en_US
dc.language.isoen_USen_US
dc.subjectcoalgebraic typesen_US
dc.subjectfunctional programmingen_US
dc.subjectrecursionen_US
dc.titleCoCaml: Programming with Coinductive Typesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics