a; a; Computer Science Department, University of Minho
SVM HeaderParse 0.2
SVM HeaderParse 0.1
Recursive schemes over inductive data structures have been recognized as categorytheoretic 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.