Polytypic recursion patterns

Polytypic recursion patterns (preprint)
L. S. Barbosa, J. B. Barros, and J. J. Almeida. In Paulo Borba, editor, SBLP'00, Proc. 4th Brazilian Symposium on Programming Languages, Recife, May, 2000.

Abstract

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.