AbstractA concrete description of terminal coalgebras, T, of all finitary endofunctors of Set is presented: each such a functor is a quotient of the polynomial endofunctor of some finitary signature Σ modulo some “basic” equations. Then T can be described as the algebra of all infinite ∑-labeled trees modulo the congruence obtained by applying the basic equations finitely or infinitely many times (a concept defined below). As a consequence, free iterative theories in the sense of Calvin Elgot are described over all finitary endofunctors of Set: they are the theories of all rational ∑-labeled trees (i.e., trees having only finitely many subtrees) modulo the above congruence
AbstractEvery endofunctor F of Set has an initial algebra and a final coalgebra, but they are classe...
AbstractWe define a modal logic whose models are coalgebras of a polynomial functor. Bisimilarity tu...
. Data types like trees which are finitely branching and of (possibly) infinite depth are described ...
AbstractEvery finitary endofunctor H of Set can be represented via a finitary signature Σ and a coll...
AbstractA concrete description of terminal coalgebras, T, of all finitary endofunctors of Set is pre...
AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary ...
AbstractInfinite trees form a free completely iterative theory over any given signature—this fact, p...
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-ti...
AbstractThe algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ide...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractFor algebras A whose type is given by an endofunctor, iterativity means that every flat equa...
AbstractThis paper shows that, in order to obtain the theorem of Aczel and Mendler on the existence ...
AbstractDana Scott’s model of λ-calculus was based on a limit construction which started from an alg...
For endofunctors of varieties preserving intersections, a new description of the final coalgebra and...
AbstractEvery endofunctor F of Set has an initial algebra and a final coalgebra, but they are classe...
AbstractWe define a modal logic whose models are coalgebras of a polynomial functor. Bisimilarity tu...
. Data types like trees which are finitely branching and of (possibly) infinite depth are described ...
AbstractEvery finitary endofunctor H of Set can be represented via a finitary signature Σ and a coll...
AbstractA concrete description of terminal coalgebras, T, of all finitary endofunctors of Set is pre...
AbstractFor every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary ...
AbstractInfinite trees form a free completely iterative theory over any given signature—this fact, p...
Iterative theories introduced by Calvin Elgot formalize potentially infinite computations as solu-ti...
AbstractThe algebra of infinite trees is, as proved by C. Elgot, completely iterative, i.e., all ide...
Iterative theories, which were introduced by Calvin Elgot, formalise potentially infinite computatio...
AbstractCompletely iterative theories of Calvin Elgot formalize (potentially infinite) computations ...
AbstractFor algebras A whose type is given by an endofunctor, iterativity means that every flat equa...
AbstractThis paper shows that, in order to obtain the theorem of Aczel and Mendler on the existence ...
AbstractDana Scott’s model of λ-calculus was based on a limit construction which started from an alg...
For endofunctors of varieties preserving intersections, a new description of the final coalgebra and...
AbstractEvery endofunctor F of Set has an initial algebra and a final coalgebra, but they are classe...
AbstractWe define a modal logic whose models are coalgebras of a polynomial functor. Bisimilarity tu...
. Data types like trees which are finitely branching and of (possibly) infinite depth are described ...