AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary monad) R is defined by means of solving all finitary flat systems of recursive equations over H. This generalizes the result of Elgot and his coauthors, describing a free iterative theory of a polynomial endofunctor H as the theory R of all rational infinite trees. We present a coalgebraic proof that R is a free iterative theory on H for every finitary endofunctor H, which is substantially simpler than the previous proof by Elgot et al., as well as our previous proof. This result holds for more general categories than Set
AbstractIterative algebras, as studied by Nelson and Tiuryn, are generalized to algebras whose itera...
AbstractThis paper establishes the relationship between regular trees, equationally defined trees, a...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary ...
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-ti...
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...
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 ...
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...
AbstractThe algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ide...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractB. Courcelle studied algebraic trees as precisely the solutions of all recursive program sch...
Abstract. For ideal monads in Set (e. g. the finite list monad, the finite bag monad etc.) we have r...
AbstractIterative algebras, as studied by Nelson and Tiuryn, are generalized to algebras whose itera...
AbstractThis paper establishes the relationship between regular trees, equationally defined trees, a...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary ...
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-ti...
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...
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 ...
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...
AbstractThe algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ide...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractB. Courcelle studied algebraic trees as precisely the solutions of all recursive program sch...
Abstract. For ideal monads in Set (e. g. the finite list monad, the finite bag monad etc.) we have r...
AbstractIterative algebras, as studied by Nelson and Tiuryn, are generalized to algebras whose itera...
AbstractThis paper establishes the relationship between regular trees, equationally defined trees, a...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...