On coalgebra based on classes

Theoretical Computer Science

Volumn 316, Issue 1-3, 2004, Pages 3-23

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

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

^b CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Category of classes; Iterative monad; Set based endofunctor; Terminal coalgebra

Indexed keywords

ALGEBRA; FUNCTIONS; ITERATIVE METHODS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

CATEGORY OF CLASSES; ITERATIVE MONAD; SET-BASED ENDOFUNCTORS; TERMINAL COALGEBRA;

COMPUTER SCIENCE;

EID: 17044443133     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.12.022     Document Type: Conference Paper

References (24)

1. Aczel P. Non-Well-Founded Sets. CSLI Lecture Notes. Vol. 14:1988;Stanford University, Stanford, CA.
2. Aczel P., Adámek J., Milius S., Velebil J. Infinite trees and completely iterative theories. a coalgebraic view Theoret. Comput. Sci. 300:2003;1-45.
3. Aczel P., Mendler N. A final coalgebra theorem. Pitt D.H., Rydebeard D.E., Dyjber P., Pitts A.M., Poigné A. Category Theory and Computer Science. Lecture Notes in Computer Science. Vol. 389:1989;357-365 Springer, Berlin.
4. Adámek J. Free algebras and automata realization in the language of categories. Comment. Math. Univ. Carolin. 15:1974;589-602.
5. J. Adámek, On a description of terminal coalgebras and iterative theories, Electron. Notes Theoret. Comput. Sci. 82 (1) (2003).
6. Adámek J., Milius S., Velebil J. Final coalgebras and a solution theorem for arbitrary endofunctors. Electron. Notes Theoret. Comput. Sci. 65.1:2002.
7. Adámek J., Porst H.-E. On varieties and covarieties in a category. Math. Structures Comput. Sci. 13:2003;201-232.
8. Adámek J., Porst H.-E. On tree coalgebras and coalgebra presentations. Theoret. Comput. Sci. 311:2004;257-283.
9. Adámek J., Trnková V. Automata and Algebras in a Category. 1990;Kluwer Publishing Company, Dordrecht.
10. Barr M. Terminal coalgebras in well-founded set theory. Theoret. Comput. Sci. 124:1994;182-192.
11. Barwise J., Moss L. Vicious Circles. CSLI Lecture Notes. Vol. 60:1996;Stanford University, Stanford, CA.
12. Gumm H.P., Schröder T. Coalgebras of bounded type. Math. Structures Comput. Sci. 12:2002;565-578.
13. Johnstone P., Power J., Tsujishita T., Watanabe H., Worell J. On the structure of categories of coalgebras. Theoret. Comput. Sci. 260:2001;87-117.
14. Kelly G.M. A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on. Bull. Austral. Math. Soc. 22:1980;1-83.
15. Koubek V. Set functors II - contravariant case. Comment. Math. Univ. Carolin. 14:1973;47-59.
16. Koubek V., Reiterman J. Categorical constructions of free algebras, colimits and completions of partial algebras. J. Pure Appl. Algebra. 14:1979;195-231.
17. F.E.J. Linton, Coequalizers in categories of algebras, in: Lecture Notes in Mathematics, Vol. 80, Springer, Berlin, 1969, pp. 75-90.
18. M. Makkai, R. Paré, Accessible categories: the foundations of categorical model theory, Contemporary Mathematics, American Mahemal Society, Providence, 1989.
19. Moss L. Parametric corecursion. Theoret. Comput. Sci. 260(1-2):2001;139-163.
20. Rutten J.J.M.M. Universal coalgebra. a theory of systems Theoret. Comput. Sci. 249(1):2000;3-80.
21. Rutten J.J.M.M., Turi D. On the foundations of final coalgebra semantics. non-well-founded sets, partial orders, metric spaces Math. Structures Comput. Sci. 8:1998;481-540.
22. Sierpiński W. Sur une decomposition d'ensembles. Monatsh. Math. Phys. 35:1928;239-242.
23. Tarski A. Sur la décomposition des ensembles en sous-ensembles prèsque disjoint. Fund. Math. 14:1929;205-215.
24. J. Worrell, On coalgebras and final semantics, Ph.D. Thesis, Oxford University Computing Laboratory, 2000.