Towards coalgebraic behaviourism

Electronic Notes in Theoretical Computer Science

Volumn 65, Issue 1, 2002, Pages 176-196

  Mašulović, Dragan ^a,b  

^a UNIVERSITY OF NOVI SAD   (Serbia)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Coalgebra; Final coalgebra; Observable behaviour

Indexed keywords

COMPUTATIONAL METHODS; CONFORMAL MAPPING; FORMAL LOGIC; FUNCTIONS; SET THEORY;

COALGEBRA; ENDOFUNCTORS; FINAL COALGEBRA; OBSERVABLE BEHAVIOR;

ALGEBRA;

EID: 18944398556     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80365-7     Document Type: Conference Paper

References (14)

1. Aczel P., Mendler N. A final coalgebra theorem. Pitt D.H., et al. Category theory and computer science. 1989;357-365 Springer Verlag, LNCS Heidelberg
2. Adámek J., Herrlich H., Strecker G.E. Abstract and concrete categories. 1990;Jown Wiley & Sons, New York
3. Adámek J., Koubek V. On the greatest fixed point of a set functor. Theoret. Comput. Sci. 150:1995;57-75
4. Barr M. Algebraically compact functors. J. Pure Appl. Algebra. 82:1992;211-231
5. Gumm Schröder H.P.T. Coalgebraic structure from weak limit preserving functors. Electronic Notes in Theoretical Computer Science. Vol. 33:2000;113-133
6. Moss L.S. Coalgebraic logic. Annals of Pure and Applied Logic. 96:1999;277-317
7. Pattinson D., Semantical principles in the modal logic of coalgebras, Technischer Bericht 0007, Institut für Informatik, LMU München, 2001
8. Paulson L.C. Final coalgebras as greatest fixed points in ZF set theory. Math. Struct. in Comput. Science. 9:1999;545-567
9. Rothe J., A syntactical approach to weak (bi-)simulation for coalgebras, CMCS 2002
10. Rutten J., A note on coinduction and weak bisimilarity for while programs, CWI Technical Report, SEN-R9826, Oct 31, 1998
11. Rutten J. Universal coalgebra: a theory of systems. Theoret. Comput. Sci. 249:2000;3-80
12. Turi D., Rutten J. On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces. Math. Struct. in Comput. Science. 8:1998;481-540
13. Schröder T., Coalgebren und Funktoren, Ph.D. thesis, Marburg, 2001.
14. Worrell J. Terminal sequences for accessible endofunctors. Electronic Notes in Theoretical Computer Science. Vol. 19:1999