Universal coalgebra: A theory of systems

Theoretical Computer Science

Volumn 249, Issue 1, 2000, Pages 3-80

  Rutten, J J M M ^a  

^a CWI   (Netherlands)

Author keywords

Algebra; Bisimulation; Coalgebra; Coinduction; Congruence; Covariety; Dynamical system; Homomorphism; Induction; Transition system; Universal algebra; Universal coalgebra; Variety

Indexed keywords

EID: 0001986854     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00056-6     Document Type: Article

References (91)

1. S. Abramsky, A domain equation for bisimulation, Inform and Comput. 92 (2) (1991) 161-218.
2. P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes, Vol. 14, Center for the Study of Languages and Information, Stanford, 1988.
3. P. Aczel, Final universes of processes, in: S. Brookes, M. Main, A. Melton, M. Mislove, D. Schmidt (Eds.), Proc. 9th Internat. Conf. on Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, Vol. 802, Springer, Berlin, 1994, pp. 1-28.
4. P. Aczel, N. Mendler, A final coalgebra theorem, in: D.H. Pitt, D.E. Ryeheard, P. Dybjer, A.M. Pitts, A. Poigne (Eds.), Proc. Category Theory and Computer Science, Lectures Notes in Computer Science, Springer, Berlin, 1989, pp. 357-365.
5. M.A. Arbib, E.G. Manes, Machines in a category, J. Pure Appl. Algebra 19 (1980) 9-20.
6. M.A. Arbib, E.G. Manes, Parametrized data types do not need highly constrained parameters, Inform. and Control 52 (2) (1982) 139-158.
7. P. America, J.J.M.M. Rutten, Solving reflexive domain equations in a category of complete metric spaces, J. Comput. System Sci. 39 (3) (1989) 343-375.
8. J.W. de Bakker, E. de Vink, Control Flow Semantics, Foundations of Computing Series, The MIT Press, Cambridge, MA, 1996.
9. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114 (2) (1993) 299-315. Some additions and corrections were published in Theoret. Comput. Sci. 124 (1994) 189 -192.
10. M. Barr, Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci. 114 (2) (1993) 299-315. Some additions and corrections were published in Theoret. Comput. Sci. 124 (1994) 189 -192.
11. M. Barr, Additions and corrections to "terminal coalgebras in well-founded set theory", Theoret. Comput. Sci. 124 (1) (1994) 189-192.
12. J. Barwise, L.S. Moss, Vicious Circles, On the Mathematics of Non-wellfounded Phenomena, CSLI Lecture Notes, Vol. 60, Center for the Study of Language and Information, Stanford, 1996.
13. M.-P. Béal, D. Perrin, Symbolic dynamics and finite automata, Report IGM 96-18, Université de Marne-la-vallée, 1996.
14. F. Borceux, Handbook of Categorical Algebra 1: Basic Category Theory, Encyclopedia of Mathematics and its Applications, Vol. 50, Cambridge University Press, Cambridge, 1994.
15. F. van Breugel, Terminal metric spaces of finitely branching and image finite linear processes, Theoret. Comput. Sci. 202 (1-2) (1998) 223-230.
16. C. Cirstea, Coalgebra semantics for hidden algebra: parameterised objects and inheritance, Proc. 12th Workshop on Algebraic Development Techniques, Springer, Berlin, 1998.
17. P.M. Cohn, Universal Algebra, Mathematics and its Applications, Vol. 6, D. Reidel Publishing Company, Dordrecht, 1981.
18. A. Corradini, A complete calculus for equational deduction in coalgebraic specification, Report SEN-R9723, CWI, Amsterdam, 1997.
19. B. Csákány, Completeness in coalgebras, Acta Sci. Math. 48 (1985) 75-84.
20. R.C. Davis, Universal coalgebra and categories of transition systems, Math. Systems Theory 4 (1) (1970) 91-95.
21. R.L. Devaney, An Introduction to Chaotic Dynamical Systems, The Benjamin/Cummings Publishing Company, Menlopark, CA, 1986.
22. E.P. de Vink, J.J.M.M. Rutten, Bisimulation for probabilistic transition systems: a coalgebraic approach, in: P. Degano, R. Gorrieri, A. Marchetti-Spaccamela (Eds.), Proc. ICALP'97, Lecture Notes in Computer Science, Vol. 1256, 1997, pp. 460-470. Theoret. Comput. Sci., to appear.
23. E.P. de Vink, J.J.M.M. Rutten, Bisimulation for probabilistic transition systems: a coalgebraic approach, in: P. Degano, R. Gorrieri, A. Marchetti-Spaccamela (Eds.), Proc. ICALP'97, Lecture Notes in Computer Science, Vol. 1256, 1997, pp. 460-470. Theoret. Comput. Sci., to appear.
24. M.P. Fiore, A coinduction principle for recursive data types based on bisimulation, Inform. and Comput. 127 (2) (1996) 186-198.
25. M. Forti, F. Honsell, M. Lenisa, Processes and hyperuniverses, in: I. Privara (Ed.), Proc. 19th Internat. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 841, Springer, Berlin, 1994, pp. 352-363.
26. J.A. Goguen, J.W. Thatcher, E.G. Wagner, An initial algebra approach to the specification, correctness and implementation of abstract data types, in: R. Yeh (Ed.), Current Trends in Programming Methodology, Prentice-Hall, Englewood Cliffs, NJ, 1978, pp. 80-149.
27. R. Goldblatt, Logics of time and computation, CSLI Lecture Notes, Vol. 7, Center for the study of Language and Information, Standard, 1987.
28. J.F. Groote, F. Vaandrager, Structured operational semantics and bisimulation as a congruence, Inform. and Comput. 100 (2) (1992) 202-260.
29. H.P. Gumm, T. Schröder, Covarieties and complete covarieties, in: B. Jacobs, L. Moss, H. Reichel, J.J.M.M. Rutten (Eds.), Proc. 1st Internat. Workshop on Coalgebraic Methods in Computer Science (CMCS '98), Electronic Notes in Theoretical Computer Science, Vol. 11, Elsevier Science B.V, Amsterdam, 1998.
30. T. Hagino, A categorical programming language, Ph.D. Thesis, University of Edinburgh, Edinburgh, 1987.
31. M. Hennessy, G.D. Plotkin, Full abstraction for a simple parallel programming language, in: J. Becvar (Ed.), Proc. 8th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 74, Springer, Berlin, 1979, pp. 108-120.
32. U. Hensel, M. Huisman, B. Jacobs, H. Tews, Reasoning about classes in object-oriented languages: logical models and tools, in: Ch. Hankin (Ed.), Proc. European Symp. on Programming, Lecture Notes in Computer Science, Vol. 1381, Springer, Berlin, 1998, pp. 105-121.
33. C. Hermida, B. Jacobs, Structural induction and coinduction in a fibrational setting, Inform. and Comput. (1998) to appear.
34. F. Honsell, M. Lenisa, Final semantics for untyped λ-calculus, in: M. Dezani-Ciancaglini, G. Plotkin (Eds.), Proc. 2nd Conf. on Typed Lambda Calculus and Applications, Lecture Notes in Computer Science, Vol. 902, Springer, Berlin, 1995, pp. 249-265.
35. B. Jacobs, Mongruences and cofree coalgebras, in: V.S. Alagar, M. Nivat (Eds.), Algebraic Methods and Software Technology, Lecture Notes in Computer Science, Vol. 936, Springer, Berlin, 1995, pp. 245-260.
36. B. Jacobs, Behaviour-refinement of object-oriented specifications with coinductive correctness proofs, Report CSI-R9618, Computing Science Institute, University of Nijmegen, 1996. Also in the Proc. TAPSOFT'97.
37. B. Jacobs, Behaviour-refinement of object-oriented specifications with coinductive correctness proofs, Report CSI-R9618, Computing Science Institute, University of Nijmegen, 1996. Also in the Proc. TAPSOFT'97.
38. B. Jacobs, Inheritance and cofree constructions, in: P. Cointe (Ed.), European Conference on Object-Oriented Programming, Lecture Notes in Computer Science, Vol. 1098, Springer, Berlin, 1996, pp. 210-231.
39. B. Jacobs, Object and classes, co-algebraically, in: B. Freitag, C.B. Jones, C. Lengauer, H.-J. Schek (Eds.), Object-Orientation with Parallelism and Persistence, Kluwer Academic Publishers, Dordrecht, 1996.
40. B. Jacobs, Coalgebraic reasoning about classes in object-oriented languages, in: B. Jacobs, L. Moss, H. Reichel, J.J.M.M. Rutten (Eds.), Proc. 1st Internat. Workshop on Coalgebraic Methods in Computer Science (CMCS) '98), Electronic Notes in Theoretical Computer Science, Vol. 11, Elsevier Science B.V, Amsterdam, 1998.
41. B. Jacobs, L. Moss, H. Reichel, J.J.M.M. Rutten (Eds.), Proc. 1st Internat. Workshop on Coalgebraic Methods in Computer Science (CMCS) '98), Electronic Notes in Theoretical Computer Science, Vol. 11, Elsevier Science B.V., Amsterdam, 1998. Available at URL: www.elsevier.nl/locate/entcs.
42. B. Jacobs, J. Rutten, A tutorial on (co)algebras and (co)induction, Bull. EATCS 62 (1997) 222-259.
43. B. Jacobs, J.J.M.M. Rutten (Eds.), Proc. 2nd Internat. Workshop on Coalgebraic Methods in Computer Science (CMCS '99), Electronic Notes in Theoretical Computer Science, Vol. 19, Elsevier Science B.V., Amsterdam, 1999. Available at URL: www.elsevier.nl/locate/entcs.
44. A. Joyal, M. Nielsen, G. Winskel, Bisimulation from open maps, Inform. and Comput. 127 (2) (1996) 164-185.
45. Y. Kawahara, M. Mori, A small final coalgebra theorem, Theoret. Comput. Sci. (1998) to appear.
46. R.M. Keller, Formal verification of parallel programs, Comm. ACM 19 (7) (1976) 371-384.
47. R.E. Kent, The metric closure powerspace construction, in: M. Main, A. Melton, M. Mislove, D. Schmidt (Eds.), Proc. 3rd Workshop on Mathematical Foundations of Programming Language Semantics, Lecture Notes in Computer Science, Vol. 298, Springer, New Orleans, 1988, pp. 173-199.
48. A. Kurz, Specifying coalgebras with modal logic, in: B. Jacobs, L. Moss, H. Reichel, J.J.M.M. Rutten (Eds.), Proc. 1st Internat. Workshop on Coalgebraic Methods in Computer Science (CMCS) '98), Electronic Notes in Theoretical Computer Science, Vol. 11, Elsevier Science B.V., Amsterdam, 1998.
49. K.G. Larsen, A. Skou, Bisimulation through probabilistic testing, Inform. Comput. 94 (1991) 1-28.
50. D.J. Lehmann, M.B. Smyth, Algebraic specification of data types: a synthetic approach, Math. Systems Theory 14 (1981) 97-139.
51. M. Lenisa, Final semantics for a higher-order concurrent language, in: H. Kirchner (Ed.), Proc. CAPP'96, Lecture Notes in Computer Science, Vol. 1059, Springer, Berlin, 1996, pp. 102-118.
52. M. Lenisa, Themes in final semantics, Ph.D. Thesis, University of Udine, Udine, Italy, 1998.
53. S. Mac Lane, in: Categories for the Working Mathematician, Graduate Texts in Mathematics, Vol. 95, Springer, New York, 1971.
54. E.G. Manes, Algebraic Theories, Graduate Texts in Mathematics, Vol. 26, Springer, Berlin, 1976.
55. E.G. Manes, M.A. Arbib, Algebraic Approaches to Program Semantics, Texts and Monographs in Computer Science, Springer, Berlin, 1986.
56. M. Marvan, On covarieties of coalgebras, Arch. Math. (Brno) 21 (1) (1985) 51-64.
57. K. Meinke, J.V. Tucker, Universal algebra, in: S. Abramsky, Dov.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. 1, Oxford University Press, Oxford, 1992, pp. 189-411.
58. R. Milner, Processes: a mathematical model of computing agents, in: H.E. Rose, J.C. Shepherdson (Eds.), Logic Colloquium '73, Studies in Logic, Vol. 80, North-Holland, Amsterdam, 1975, pp. 157-173.
59. R. Milner, in: A calculus of Communicating Systems, Lecture Notes in Computer Science, Vol. 92, Springer, Berlin, 1980.
60. R. Milner, M. Tofte, Co-induction in relational semantics, Theoret. Comput. Sci. 87 (1991) 209-220.
61. L.S. Moss, Coalgebraic logic, Ann. Pure Appl. Logic (1998) to appear.
62. L.S. Moss, N. Danner, On the foundations of corecursion, Logic J. IGPL 1997 (231-257).
63. D.M.R. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Proc. 5th GI Conf., Lecture Notes in Computer Science, Vol. 104, Springer, Berlin, 1981, pp. 15-32.
64. L.C. Paulson, Mechanizing coinduction and corecursion in higher-order logic, J. Logic Comput. 7 (1997) 175-204.
65. D. Pavlovic̀, Guarded induction on final coalgebras, in: B. Jacobs, L. Moss, H. Reichel, J.J.M.M. Rutten (Eds.), Proc. 1st Internat. Workshop on Coalgebraic Methods in Computer Science (CMCS) '98), Electronic Notes in Theoretical Computer Science, Vol. 11, Elsevier Science B.V., Amsterdam, 1998.
66. A.M. Pitts, A co-induction principle for recursively defined domains, Theoret. Comput. Sci. 124 (2) (1994) 195-219.
67. A.M. Pitts, Relational properties of domains, Inform. and Comput. 127 (2) (1996) 66-90.
68. G.D. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Aarhus University, Aarhus, September 1981.
69. R. Pöschel, M. Rößiger, A general Galois theory for cofunctions and corelations, Report MATH-AL-11-1997, Technische Universität Dresden, Dresden, 1997.
70. J. Power, H. Watanabe, An axiomatics for categories of coalgebras, in: B. Jacobs, L. Moss, H. Reichel, J.J.M.M. Rutten (Eds.), Proc. 1st Internat. Workshop on Coalgebraic Methods in Computer Science (CMCS) '98), Electronic Notes in Theoretical Computer Science, Vol. 11, Elsevier Science B.V., Amsterdam, 1998.
71. H. Reichel, An approach to object semantics based on terminal coalgebras, Math. Struct. Comput. Sci. 5 (1995) 129-152.
72. M. Rößiger, From modal logic to terminal coalgebras, Report MATH-AL-3-1998, Technische Universität Dresden, Dresden, 1998.
73. J.J.M.M. Rutten, Processes as terms: non-well-founded models for bisimulation, Math. Struct. Comput. Sci. 2 (3) (1992) 257-275.
74. J.J.M.M. Rutten, A calculus of transition systems (towards universal coalgebra), in: A. Ponse, M. de Rijke, Y. Venema (Eds.), Modal Logic and Process Algebra, a Bisimulation Perspective, CSLI Lecture Notes, Vol. 53, Stanford, CSLI Publications, 1995, pp. 231-256. FTP-available at ftp.cwi.nl as pub/CWIreports/AP/CS-R9503.ps.Z.
75. J.J.M.M. Rutten, Universal coalgebra: a theory of systems, Report CS-R9652, CWI, 1996. FTP-available at ftp.cwi.nl as pub/CWIreports/AP/CS-R9652.ps.Z.
76. J.J.M.M. Rutten, Automata and coinduction (an exercise in coalgebra), Report SEN-R9803, CWI, 1998. FTP-available at ftp.cwi.nl as pub/CWIreports/SEN/SEN-R9803.ps.Z. Also in the Proc. CONCUR '98, Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, 1998, pp. 194-218.
77. J.J.M.M. Rutten, Automata and coinduction (an exercise in coalgebra), Report SEN-R9803, CWI, 1998. FTP-available at ftp.cwi.nl as pub/CWIreports/SEN/SEN-R9803.ps.Z. Also in the Proc. CONCUR '98, Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, 1998, pp. 194-218.
78. J.J.M.M. Rutten, Relators and metric Bisimulations, in: B. Jacobs, L. Moss, H. Reichel, J.J.M.M. Rutten (Eds.), Proc. 1st Internat. Workshop on Coalgebraic Methods in Computer Science (CMCS) '98), Electronic Notes in Theoretical Computer Science, Vol. 11, Elsevier Science B.V., Amsterdam, 1998.
79. J.J.M.M. Rutten, D. Turi, On the foundations of final semantics: non-standard sets, metric spaces, partial orders, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), Proc. REX Workshop on Semantics, Lecture Notes in Computer Science, Vol. 666, Springer, Berlin, 1993, pp. 477-530.
80. 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. Rozenberg (Eds.), Proc. REX School/ Symp. 'A decade of concurrency', Lecture Notes in Computer Science, Vol. 803, Springer, Berlin, 1994, pp. 530-582. FTP-available at ftp.cwi.nl as pub/CWIreports/AP/CS-R9409.ps.Z.
81. G. Schmidt, T. Ströhlein, Relations and Graphs, Discrete Mathematics for Computer Scientists, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, New York, 1993.
82. M.B. Smyth, G.D. Plotkin, The category-theoretic solution of recursive domain equations, SIAM J. Comput. 11 (4) (1982) 761-783.
83. Z. Székely, Maximal clones of co-operations, Acta Sci. Math. 53 (1989) 43-50.
84. A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-309.
85. D. Turi, Functorial operational semantics and its denotational dual, Ph.D. Thesis, Vrije Universiteit, Amsterdam, 1996.
86. D. Turi, Categorical modelling of structural operational rules: case studies, in: E. Moggi, G. Rosolini (Eds.), Proc. 7th CTCS Conf., Lecture Notes in Computer Science, Vol. 1290, Springer, Berlin, 1997, pp. 127-146.
87. D. Turi, G.D. Plotkin, Towards a mathematical operational semantics, Proc. 12th LICS Conf., IEEE Computer Society Press, Silverspring, MD, 1997, pp. 280-291.
88. R. van Glabbeek, The meaning of negative premises in transition system specifications II, Report STAN-CS-TN-95-16, Department of Computer Science, Stanford University, 1996. Extended abstract in: F. Meyer auf der Heide, B. Monien (Eds.), Automata, Languages and Programming, Proc. 23th International Colloquium, ICALP '96, Paderborn, Germany, July 1996, Lecture Notes in Computer Science, Vol. 1099, Springer, Berlin, 1996, pp. 502-513.
89. R. van Glabbeek, The meaning of negative premises in transition system specifications II, Report STAN-CS-TN-95-16, Department of Computer Science, Stanford University, 1996. Extended abstract in: F. Meyer auf der Heide, B. Monien (Eds.), Automata, Languages and Programming, Proc. 23th International Colloquium, ICALP '96, Paderborn, Germany, July 1996, Lecture Notes in Computer Science, Vol. 1099, Springer, Berlin, 1996, pp. 502-513.
90. R.J. van Glabbeek, S.A. Smolka, B. Steffen, Reactive, generative, and stratified models of probabilistic processes, Inform. and Comput. 121 (1995) 59-80.
91. G. Winskel, M. Nielsen, Models for concurrency, in: S. Abramsky, Dov M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. 4, Oxford Science Publications, Oxford, 1995, pp. 1-148.