Corecursive Algebras: A Study of General Structured Corecursion
Motivated by issues in designing practical total functional programming languages, we are interested in structured recursive equations that uniquely describe a function not because of the properties of the coalgebra marshalling the recursive call arguments but thanks to the algebra assembling their results. Dualizing the known notions of recursive and wellfounded coalgebras, we call an algebra of a functor corecursive, if from any coalgebra of the same functor there is a unique map to this algebra, and antifounded, if it admits a bisimilarity principle. Differently from recursiveness and wellfoundedness, which are equivalent conditions under mild assumptions, corecursiveness and antifoundedness turn out to be generally inequivalent.
Unable to display preview. Download preview PDF.
- 5.Cockett, R., Fukushima, T.: About Charity. Yellow series report 92/480/18, Dept. of Comput. Sci., Univ. of Calgary (1992)Google Scholar
- 6.Coquand, T.: Infinite objects in type theory. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol. 806, pp. 62–78. Springer, Heidelberg (1994)Google Scholar
- 10.Giménez, E.: Codifying guarded definitions with recursion schemes. In: Smith, J., Dybjer, P., Nordström, B. (eds.) TYPES 1994. LNCS, vol. 996, pp. 39–59. Springer, Heidelberg (1995)Google Scholar
- 15.Taylor, P.: Towards a unified treatment of induction, I: The general recursion theorem. Unpublished draft 35 pp (1996); // A short version (1996) of 5 pp was distributed at Gödel 1996 Brno (August 1996), http://www.monad.me.uk/ordinals/
- 17.Turner, D.A.: Total functional programming. J. of Univ. Comput. Sci. 10(7), 751–768 (2004)Google Scholar