AbstractWe prove the following completeness theorem: If the fixed point operation over a category is defined by initiality, then the equations satisfied by the fixed point operation are exactly those of iteration theories. Thus, in such categories, the equational axioms of iteration theories provide a sound and complete axiomatization of the equational properties of the fixed point operation
AbstractIterative monads of Calvin Elgot were introduced to treat the semantics of recursive equatio...
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra ...
AbstractThis paper is concerned with the equational logic of definitions whose semantics is given in...
We prove the following completeness theorem: If the fixed point operation over a category is defined...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operato...
AbstractThe (in)equational properties of iteration, i.e., least (pre-)fixed point solutions over cpo...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
We associate an identity with every finite automaton and show that a set of equations consiting of s...
AbstractIteration theories provide a sound and complete axiomatization of the equational properties ...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
All known structures involving a constructively obtainable fixed point (or it-eration) operation sat...
The (in)equational properties of the least fixed point operation on(omega-)continuous functions on (...
AbstractIterative monads of Calvin Elgot were introduced to treat the semantics of recursive equatio...
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra ...
AbstractThis paper is concerned with the equational logic of definitions whose semantics is given in...
We prove the following completeness theorem: If the fixed point operation over a category is defined...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operato...
AbstractThe (in)equational properties of iteration, i.e., least (pre-)fixed point solutions over cpo...
“In the setting of algebraic theories enriched with an external fixed-point operation, the no-tion o...
We associate an identity with every finite automaton and show that a set of equations consiting of s...
AbstractIteration theories provide a sound and complete axiomatization of the equational properties ...
AbstractWe show that three fixed point structures equipped with (sequential) composition, a sum oper...
AbstractThe concept of iteration theory of Bloom and Ésik summarizes all equational properties that ...
AbstractThe equational class generated by rational algebraic theories was characterized in Esik, Com...
All known structures involving a constructively obtainable fixed point (or it-eration) operation sat...
The (in)equational properties of the least fixed point operation on(omega-)continuous functions on (...
AbstractIterative monads of Calvin Elgot were introduced to treat the semantics of recursive equatio...
We develop a typed equational system that subsumes both iteration theories and typed Kleene algebra ...
AbstractThis paper is concerned with the equational logic of definitions whose semantics is given in...