Extensional quotient coalgebras

[1] P. Aczel, N. Mendler, A final coalgebra theorem, Proceedings category theory and Computer Science (D. H. Pitt et al, ed.), Lecture Notes in Computer Science, 389 (1989), 357–365.10.1007/BFb0018361Search in Google Scholar

[2] J. Adamek, H. Herrlich, G. E. Strecker, Abstract and concrete categories, Wiley-Interscience, 1990.Search in Google Scholar

[3] S. Burris, H. P. Sankappanavar, A course in universal algebra, Graduate Texts in Mathematics, vol. 78, Springer, New York, 1981.10.1007/978-1-4613-8130-3Search in Google Scholar

[4] H. P. Gumm, Elements of the general theory of coalgebras, LUATCS 99, Rand Afrikaans University, Johanesbourg, South Africa, 1999.Search in Google Scholar

[5] I. Hasuo, B. Jacobs, A. Sokolova, Generic trace semantics via coinduction, Logical Methods in Computer Science, 3 (2007), 1–36.10.2168/LMCS-3(4:11)2007Search in Google Scholar

[6] C. Hermida, B. Jacobs, Structural induction and coinduction in a fibrational setting, Information and Computation, 145 (1998), 107–152.10.1006/inco.1998.2725Search in Google Scholar

[7] P. T. Johnstone, Topos Theory, Academy press, London, 1977.Search in Google Scholar

[8] P. Johnstone, J. Power, T. Tsujishita, H. Watanabe, J. Worrell, On the structure of categories of coalgebras, Theoretical Computer Science, 260 (2001), 87–117.10.1016/S0304-3975(00)00124-9Search in Google Scholar

[9] A. Kurz, Limits in categories of coalgebras, Draft, November 16, 1999.Search in Google Scholar

[10] S. Mac Lane, Categories for the working mathematician, Graduate Texts in Mathematics, vol. 5, Springer Verlag, 1971.10.1007/978-1-4612-9839-7Search in Google Scholar

[11] R. Milner, Communication and Concurrency, Prentice Hall, 1989.Search in Google Scholar

[12] P. S. Mulry, Lifting theorems for Kleisli categories, Mathematical Foundations of Programming Semantics (MFPS IX), Lecture Notes in Computer Science, 802 (1994), 304–319.10.1007/3-540-58027-1_15Search in Google Scholar

[13] D. Park, Concurrency and automata on infinite sequences, Proceedings of Theoretical Computer Science: 5th GI Conference, Lecture Notes in Computer Science, 104 (1981), 167–183.10.1007/BFb0017309Open DOISearch in Google Scholar

[14] N. Popescu, L. Popescu, Theory of categories, Editura Academiei Bucuresti, Romania, 1979.10.1007/978-94-009-9550-5Search in Google Scholar

[15] J. J. M. M. Rutten, Universal coalgebra: a theory of systems, Theoretical Computer Science, 249 (2000), 3–80.10.1016/S0304-3975(00)00056-6Search in Google Scholar

[16] S. Staton, Relating coalgebraic notions of bisimulation, Logical Methods in Computer Science, 7 (2011), 1–21.10.2168/LMCS-7(1:13)2011Search in Google Scholar