Final coalgebras and a solution theorem for arbitrary endofunctors

Electronic Notes in Theoretical Computer Science

Volumn 65, Issue 1, 2002, Pages 1-28

  Adámek, Jiří ^a   Milius, Stefan ^a   Velebil, Jiří ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Completely iterative monad; Final coalgebra; Initial algebra

Indexed keywords

GRAPH THEORY; ITERATIVE METHODS; RECURSIVE FUNCTIONS; SET THEORY;

COMPLETELY ITERATIVE MONAD; ENDOFUNCTORS; FINAL COAGEBRA; INITIAL ALGEBRA;

ALGEBRA;

EID: 18944368439     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80357-8     Document Type: Conference Paper

References (17)

1. P. Aczel, Non - Well-Founded Sets, CSLI Lecture Notes 14, Stanford University, 1988
2. P. Aczel, J. Adámek, S. Milius and J. Velebil, Infinite Trees and Completely Iterative Theories: A Coalgebraic View, accepted in Theoretical Computer Science
3. P. Aczel, J. Adámek and J. Velebil, A Coalgebraic View of Infinite Trees and Iteration, Electronic Notes in Theoretical Computer Science, 44.1 (2001)
4. Aczel P., Mendler N.P. A Final Coalgebra Theorem. Pitt D.H., Rydeheard D.E., Dybjer P., Pitts A.M., Poigné A. Category Theory and Computer Science. 1989;357-365 Springer - Verlag, LNCS 389
5. Adámek J. Free Algebras and Automata Realizations in the Language of Categories. Comment. Math. Univ. Carolinae. 15:1974;589-602
6. J. Adámek, and H.-E. Porst, From Varieties of Algebras to Covarieties of Coalgebras, Electronic Notes in Theoretical Computer Science, 44.1 (2001)
7. J. Adámek, and H.-E. Porst, On Tree Coalgebras and Coalgebra Presentations, submitted.
8. Adámek J., Rosický J. Locally presentable and accessible categories. 1994;Cambridge University Press
9. Artin M., Grothendieck A., Verdier J.L. Théorie des topos et cohomologie étale des schémas. Lecture Notes in Math. Vol. 269:1972;Springer-Verlag, Berlin
10. Barr M. Terminal Coalgebras in Well-Founded Set Theory. Theor. Comp. Science. 124:1994;182-192
11. Gabriel P., Ulmer F. Lokal präsentierbare Kategorien. 1971;Lecture N. Math 221, Springer-Verlag, Berlin
12. Honsell F., Lenisa M. Coalgebraic Coinduction in (Hyper)settheoretic Categories. Electronic Notes in Theoretical Computer Science. 33:2000;135-162
13. Johnstone P., Power J., Tsujishita T., Watanabe H., Worell J. On the Structure of Categories of Coalgebras. Theor. Comp. Science. 260:2001;87-117
14. Moss L. Parametric Corecursion. Theoretical Computer Science. 260:2001;139-163
15. Rutten J.J.M.M. Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249:(1):2000;3-80
16. Rutten J.J.M.M., Turi D. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders metric spaces. Math. Struct. Comp. Science. Vol. 8:1998;481-540
17. J. Worrell, On Coalgebras and Final Semantics, PhD thesis, Oxford Unversity Computing Laboratory, 2000