Abstract and concrete categories
Abstract and concrete categories
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
Automata and Coinduction (An Exercise in Coalgebra)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
On final coalgebras of continuous functors
Theoretical Computer Science - Category theory and computer science
Towards a Mathematical Operational Semantics
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
Coinductive counting with weighted automata
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
On the final sequence of a finitary set functor
Theoretical Computer Science
Complete iterativity for algebras with effects
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A Note on Expressive Coalgebraic Logics for Finitary Set Functors
Journal of Logic and Computation
| Hi-index | 0.00 |
We extend Barr's well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor.