Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-tions of recursive equations. One of the main results of Elgot and his coauthors is a description of a free iterative theory as the theory of all rational trees. Their algebraic proof of this fact is extremely complicated. In our paper we show that by starting with “iterative algebras”, i. e., alge-bras admitting a unique solution of all systems of flat recursive equations, a free iterative theory is obtained as the theory of free iterative algebras. The (coalgebraic) proof we present is dramatically simpler than the original algebraic one. And our result is, nevertheless, much more general: we describe a free iterative theory on any finitary e...
AbstractIterative algebras are defined by the property that every guarded system of recursive equati...
AbstractInfinite trees form a free completely iterative theory over any given signature—this fact, p...
AbstractIterative algebras, as studied by Nelson and Tiuryn, are generalized to algebras whose itera...
Abstract. Iterative theories introduced by Calvin Elgot formalize potentially infinite computations ...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary ...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractFor algebras A whose type is given by an endofunctor, iterativity means that every flat equa...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
AbstractParametrized iterativity of an algebra means the existence of unique solutions of all finita...
AbstractThe algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ide...
AbstractIterative algebras, i. e., algebras A in which flat recursive equations e have unique soluti...
AbstractThis paper establishes the relationship between regular trees, equationally defined trees, a...
AbstractIterative algebras are defined by the property that every guarded system of recursive equati...
AbstractInfinite trees form a free completely iterative theory over any given signature—this fact, p...
AbstractIterative algebras, as studied by Nelson and Tiuryn, are generalized to algebras whose itera...
Abstract. Iterative theories introduced by Calvin Elgot formalize potentially infinite computations ...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary ...
AbstractIterative theories introduced by Calvin Elgot formalize potentially infinite computations as...
AbstractFor algebras A whose type is given by an endofunctor, iterativity means that every flat equa...
In “Monadic Computation and Iterative Algebraic Theories” by Calvin C. Elgot,the notion “iterative t...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
AbstractParametrized iterativity of an algebra means the existence of unique solutions of all finita...
AbstractThe algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ide...
AbstractIterative algebras, i. e., algebras A in which flat recursive equations e have unique soluti...
AbstractThis paper establishes the relationship between regular trees, equationally defined trees, a...
AbstractIterative algebras are defined by the property that every guarded system of recursive equati...
AbstractInfinite trees form a free completely iterative theory over any given signature—this fact, p...
AbstractIterative algebras, as studied by Nelson and Tiuryn, are generalized to algebras whose itera...