Affiliations: Dept. of Teleinformatics, Royal Inst. of Technology, Electrum 204, SE-164 40 Kista, Sweden. E-mail: [email protected] | Inst. of Computer Science, Univ. of Tartu, J. Liivi 2, EE-2484 Tartu, Estonia. E-mail: [email protected]
Abstract: In the mainstream categorical approach to typed (total) functional programming, datatypes are modelled as initial algebras and codatatypes as terminal coalgebras. The basic function definition schemes of iteration and coiteration are modelled by constructions known as catamorphisms and anamorphisms. Primitive recursion has been captured by a construction called paramorphisms. We draw attention to the dual construction of apomorphisms, and show on examples that primitive corecursion is a useful function definition scheme. We also put forward and study two novel constructions, viz., histomorphisms and futumorphisms, that capture the powerful schemes of course-of-value iteration and its dual, respectively, and argue that even these are helpful.
Keywords: typed (total) functional programming, category theory, program calculation, (co)data-types, forms of (co)recursion
DOI: 10.3233/INF-1999-10102
Journal: Informatica, vol. 10, no. 1, pp. 5-26, 1999
