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.

• Type: Conference
• Year: 2009
• Where: SBMF
• Authors: Venanzio Capretta, Tarmo Uustalu, Varmo Vene
• Keywords: Formal Methods, Recursive Call Arguments, SBMF 2009, Structured Recursive Equations, Total Functional Programming