Article ID Journal Published Year Pages File Type
423824 Electronic Notes in Theoretical Computer Science 2006 23 Pages PDF
Abstract

Iterative algebras, i. e., algebras A in which flat recursive equations e have unique solutions e†, are generalized to Elgot algebras, where a choice e↦e† of solutions of all such equations e is specified. This specification satisfies two simple and well motivated axioms: functoriality (stating that solutions are “uniform”) and compositionality (stating how to perform simultaneous recursion). These two axioms stem canonically from Elgot's iterative theories: We prove that the category of Elgot algebras is the Eilenberg–Moore category of the free iterative monad.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics