AbstractIterative 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
Abstract. Completely iterative algebras (cias) are those algebras in which recur-sive equations have...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractInfinite trees form a free completely iterative theory over any given signature—this fact, p...
If you are not part of the solution, you are part of the problem. Eldridge Cleaver, speech in San Fr...
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-ti...
AbstractIterative monads of Calvin Elgot were introduced to treat the semantics of recursive equatio...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractFor algebras A whose type is given by an endofunctor, iterativity means that every flat equa...
AbstractParametrized iterativity of an algebra means the existence of unique solutions of all finita...
AbstractIterative algebras are defined by the property that every guarded system of recursive equati...
AbstractMonads are used to abstractly model a wide range of computational effects such as nondetermi...
Theoretical models of recursion schemes have been well studied under the names well-founded coalgebr...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary ...
Abstract. Completely iterative algebras (cias) are those algebras in which recur-sive equations have...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractInfinite trees form a free completely iterative theory over any given signature—this fact, p...
If you are not part of the solution, you are part of the problem. Eldridge Cleaver, speech in San Fr...
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-ti...
AbstractIterative monads of Calvin Elgot were introduced to treat the semantics of recursive equatio...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractFor algebras A whose type is given by an endofunctor, iterativity means that every flat equa...
AbstractParametrized iterativity of an algebra means the existence of unique solutions of all finita...
AbstractIterative algebras are defined by the property that every guarded system of recursive equati...
AbstractMonads are used to abstractly model a wide range of computational effects such as nondetermi...
Theoretical models of recursion schemes have been well studied under the names well-founded coalgebr...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary ...
Abstract. Completely iterative algebras (cias) are those algebras in which recur-sive equations have...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractInfinite trees form a free completely iterative theory over any given signature—this fact, p...