AbstractIterative algebras are defined by the property that every guarded system of recursive equations has a unique solution. We prove that they have a much stronger property: every system of recursive equations has a unique strict solution. And we characterize those systems that have a unique solution in every iterative algebra
A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, i...
A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, i...
This paper investigates the computability of recurrence equations. We first recall the results estab...
Abstract. Iterative theories introduced by Calvin Elgot formalize potentially infinite computations ...
Parametrized iterativity of an algebra means the existence of unique solutions of all finitary recur...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
Abstract. Iterative monads, introduced by Calvin Elgot in the 1970’s, are those ideal monads in whic...
An algebra is said to be iterative if every nontrivial finite system of fixed-point equations has un...
AbstractIterative monads of Calvin Elgot were introduced to treat the semantics of recursive equatio...
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...
Abstract. For ideal monads in Set (e. g. the finite list monad, the finite bag monad etc.) we have r...
Abstract. Completely iterative algebras (cias) are those algebras in which recur-sive equations have...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractA widely accepted method to specify (possibly infinite) behaviour is to define it as the sol...
A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, i...
A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, i...
This paper investigates the computability of recurrence equations. We first recall the results estab...
Abstract. Iterative theories introduced by Calvin Elgot formalize potentially infinite computations ...
Parametrized iterativity of an algebra means the existence of unique solutions of all finitary recur...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
Abstract. Iterative monads, introduced by Calvin Elgot in the 1970’s, are those ideal monads in whic...
An algebra is said to be iterative if every nontrivial finite system of fixed-point equations has un...
AbstractIterative monads of Calvin Elgot were introduced to treat the semantics of recursive equatio...
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...
Abstract. For ideal monads in Set (e. g. the finite list monad, the finite bag monad etc.) we have r...
Abstract. Completely iterative algebras (cias) are those algebras in which recur-sive equations have...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractA widely accepted method to specify (possibly infinite) behaviour is to define it as the sol...
A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, i...
A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, i...
This paper investigates the computability of recurrence equations. We first recall the results estab...
DOI
Add to ORKG