<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Luis Soares Barbosa</style></author><author><style face="normal" font="default" size="100%">José Bernardo Barros</style></author><author><style face="normal" font="default" size="100%">José João Almeida</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Polytipic recursion patterns</style></title><secondary-title><style face="normal" font="default" size="100%">5º Simpósio Brasileiro de Linguagens de Programação - SBLP</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">ETCS</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May</style></date></pub-dates></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/jbb/files/barsblp.pdf</style></url></related-urls></urls><pub-location><style face="normal" font="default" size="100%">Recife, Brazil</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Recursive schemes over inductive data structures have been recognized as category-theoretic universals, yielding a handful of equational laws for program construction and transformation. This paper introduces the implementation of such recursion patterns as type parametric, or polytypic, functionals in the CAMILA prototyping language. Several examples are discussed.&lt;/p&gt;
</style></abstract></record></records></xml>