AbstractFor algebras A whose type is given by an endofunctor, iterativity means that every flat equation morphism in A has a unique solution. In our previous work we proved that every object generates a free iterative algebra, and we provided a coalgebraic construction of those free algebras.Iterativity w.r.t. an endofunctor was generalized by Tarmo Uustalu to iterativity w.r.t. a “base”, i.e., a functor of two variables yielding finitary monads in one variable. In the current paper we introduce iterative algebras in this general setting, and provide again a coalgebraic construction of free iterative algebras
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractEvery endofunctor F of Set has an initial algebra and a final coalgebra, but they are classe...
AbstractA concrete description of terminal coalgebras, T, of all finitary endofunctors of Set is pre...
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, as studied by Nelson and Tiuryn, are generalized to algebras whose itera...
AbstractCompletely iterative monads of Elgot et al. are the monads such that every guarded iterative...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary ...
Abstract. Iterative theories introduced by Calvin Elgot formalize potentially infinite computations ...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
AbstractInfinite trees form a free completely iterative theory over any given signature—this fact, p...
Abstract. Completely iterative algebras (cias) are those algebras in which recur-sive equations have...
AbstractThe algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ide...
AbstractEvery finitary endofunctor H of Set can be represented via a finitary signature Σ and a coll...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractEvery endofunctor F of Set has an initial algebra and a final coalgebra, but they are classe...
AbstractA concrete description of terminal coalgebras, T, of all finitary endofunctors of Set is pre...
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, as studied by Nelson and Tiuryn, are generalized to algebras whose itera...
AbstractCompletely iterative monads of Elgot et al. are the monads such that every guarded iterative...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary ...
Abstract. Iterative theories introduced by Calvin Elgot formalize potentially infinite computations ...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
AbstractInfinite trees form a free completely iterative theory over any given signature—this fact, p...
Abstract. Completely iterative algebras (cias) are those algebras in which recur-sive equations have...
AbstractThe algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ide...
AbstractEvery finitary endofunctor H of Set can be represented via a finitary signature Σ and a coll...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractEvery endofunctor F of Set has an initial algebra and a final coalgebra, but they are classe...
AbstractA concrete description of terminal coalgebras, T, of all finitary endofunctors of Set is pre...