A small final coalgebra theorem

Theoretical Computer Science

Volumn 233, Issue 1-2, 2000, Pages 129-145

  Kawahara, Yasuo ^a   Mori, Masao ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001519115     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00302-2     Document Type: Article

References (11)

1. J. Adámek, V. Koubek, On the greatest fixed point of a set functor, Theoret. Comput. Sci. 150 (1) (1995) 57-75.
2. P. Aczel, Non-well-founded sets, CSLI Lecture Notes No. 14, Stanford University, 1988.
3. P. Aczel, N. Mendler, A final coalgebra theorem, Lecture Notes in Computer Science, vol. 389, Springer, Berlin, 1989, pp. 357-365.
4. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114 (3) (1993) 299-315.
5. Y. Kawahara, Y. Mizoguchi, Relational structures and their partial morphisms in the view of single pushout rewriting, Lecture Notes in Computer Science, vol. 776, Springer, Berlin, 1994, pp. 218-233.
6. S. Mac Lane, Categories for the Working Mathematicians, Springer, Berlin, 1971.
7. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
8. J.C. Raoult, On graph rewritings, Theoret. Comput. Sci. 32 (1984) 1-24.
9. J.J.M.M. Rutten, D. Turi, On the foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders, Lecture Notes in Computer Science, vol. 666, Springer, Berlin, 1992, pp. 477-530.
10. J.J.M.M. Rutten, D. Turi, Initial algebra and final coalgebra semantics for concurrency, In: J.W. de Bakker, W.-P. de Roever, G. Rosenberg, (Eds.), Lecture Notes in Computer Science, vol. 803, Springer, Berlin, 1994.
11. J.J.M.M. Rutten, A calculus of transition systems (towards universal coalgebra), CSLI Lecture Notes No. 53, 1995.