On coalgebra based on classes
DOI10.1016/j.tcs.2003.12.022zbMath1047.18005arXivcs/0306118OpenAlexW2071463650MaRDI QIDQ1434346
Jiří Velebil, Stefan Milius, Jiří Adámek
Publication date: 4 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0306118
terminal coalgebraiterative algebracategory of classesiterative monadcofree \(F\)-coalgebrafree \(F\)-algebraset-based endofunctor
Applications of universal algebra in computer science (08A70) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Categories of sets, characterizations (18B05)
Related Items (7)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categorical constructions of free algebras, colimits, and completions of partial algebras
- Additions and corrections to ``Terminal coalgebras in well-founded set theory
- Infinite trees and completely iterative theories: A coalgebraic view
- Universal coalgebra: A theory of systems
- On tree coalgebras and coalgebra presentations
- Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors
- A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
- Accessible Categories: The Foundations of Categorical Model Theory
- On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
- On varieties and covarieties in a category
- Coalgebras of bounded type
- A final coalgebra theorem
- On the structure of categories of coalgebras
- Parametric corecursion
This page was built for publication: On coalgebra based on classes