<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jean-Baptiste Jeannin</style></author><author><style face="normal" font="default" size="100%">Dexter Kozen</style></author><author><style face="normal" font="default" size="100%">Alexandra Silva</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">CoCaml: Programming with Coinductive Types</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">December</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/xana/files/cocaml.pdf</style></url></related-urls></urls><number><style face="normal" font="default" size="100%">1813/30798</style></number><publisher><style face="normal" font="default" size="100%">Cornell University</style></publisher><pub-location><style face="normal" font="default" size="100%">Ithaca, NY</style></pub-location><pages><style face="normal" font="default" size="100%">1-24</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;
</style></abstract></record></records></xml>