AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Comput. Linguistics and Comput. Languages XIV (1980), 183–207. Here, this class will be called the class of iteration theories. Also, there is a close connection between Elgot's iterative theories and iteration theories. In this paper we introduce algebras for iteration theories, called iteration algebras. Iteration algebras are natural generalization of regular algebras and they are closely related to iterative algebras as well. It is shown that the absolutely free iteration algebras are the algebras of regular trees
Abstract. Iteration exists extensively in the nature. Iteration of a homeo-morphism generates a dyna...
AbstractIteration theories provide a sound and complete axiomatization of the equational properties ...
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-ti...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
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...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteratio...
We prove the following completeness theorem: If the fixed point operation over a category is defined...
All known structures involving a constructively obtainable fixed point (or it-eration) operation sat...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
Abstract. Iteration exists extensively in the nature. Iteration of a homeo-morphism generates a dyna...
AbstractIteration theories provide a sound and complete axiomatization of the equational properties ...
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-ti...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
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...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteratio...
We prove the following completeness theorem: If the fixed point operation over a category is defined...
All known structures involving a constructively obtainable fixed point (or it-eration) operation sat...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
Abstract. Iteration exists extensively in the nature. Iteration of a homeo-morphism generates a dyna...
AbstractIteration theories provide a sound and complete axiomatization of the equational properties ...
In this paper closure theory is applied in order to obtain a uniform semantical treatment of both pr...