References

  1. B. Bloom, S. Istrail & A. Meyer (1995): Bisimulation can't be traced. Journal of the ACM 42, pp. 232–268, doi:10.1145/200836.200876.
  2. Filippo Bonchi, Daniela Petrisan, Damien Pous & Jurriaan Rot (2014): Coinduction up-to in a fibrational setting. In: Proc. 29th Symposium on Logic in Computer Science. ACM, pp. 20:1–20:9, doi:10.1145/2603088.2603149.
  3. Aurelio Carboni & Peter Johnstone (1995): Connected Limits, Familial Representability and Artin Glueing. Mathematical Structures in Computer Science 5(4), pp. 441–459, doi:10.1017/S0960129500001183.
  4. Andrea Corradini, Reiko Heckel & Ugo Montanari (2002): Compositional SOS and beyond: a coalgebraic view of open systems. Theoretical Computer Science 280(1-2), pp. 163–192, doi:10.1016/S0304-3975(01)00025-1.
  5. Marcelo Fiore & Chung-Kil Hur (2009): On the construction of free algebras for equational systems. Theoretical Computer Science 410, pp. 1704–1729, doi:10.1016/j.tcs.2008.12.052.
  6. Marcelo P. Fiore (2000): Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems. In: IFIP TCS, LNCS 1872. Springer, pp. 457–473, doi:10.1007/3-540-44929-9_32.
  7. Marcelo P. Fiore (2008): Second-Order and Dependently-Sorted Abstract Syntax. In: LICS. IEEE, pp. 57–68, doi:10.1109/LICS.2008.38.
  8. Marcelo P. Fiore & Sam Staton (2006): A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics. In: Proc. 21st Symposium on Logic in Computer Science. IEEE, pp. 49–58, doi:10.1109/LICS.2006.7.
  9. Marcelo P. Fiore & Daniele Turi (2001): Semantics of Name and Value Passing. In: Proc. 16th Symposium on Logic in Computer Science. IEEE, pp. 93–104, doi:10.1109/LICS.2001.932486.
  10. Richard H. G. Garner & Tom Hirschowitz (2018): Shapely monads and analytic functors. Journal of Logic and Computation 28(1), pp. 33–83, doi:10.1093/logcom/exx029.
  11. Jan Friso Groote & Frits Vaandrager (1992): Structured Operational Semantics and Bisimulation as a Congruence. Information and Computation 100, pp. 202–260, doi:10.1016/0890-5401(92)90013-6.
  12. Tom Hirschowitz (2019): Familial monads and structural operational semantics. PACMPL 3(POPL), pp. 21:1–21:28, doi:10.1145/3290334.
  13. Mark Hovey (1999): Model Categories. Mathematical Surveys and Monographs, Volume 63, AMS (1999) 63. American Mathematical Society, doi:10.1090/surv/063.
  14. André Joyal, Mogens Nielsen & Glynn Winskel (1993): Bisimulation and open maps. In: Proc. 8th Symposium on Logic in Computer Science. IEEE, pp. 418–427, doi:10.1109/LICS.1993.287566.
  15. Tom Leinster (2014): Basic Category Theory. Cambridge Studies in Advanced Mathematics 143. Cambridge University Press, doi:10.1017/CBO9781107360068.
  16. Saunders Mac Lane (1998): Categories for the Working Mathematician, 2nd edition, Graduate Texts in Mathematics 5. Springer, doi:10.1007/978-1-4757-4721-8.
  17. Saunders Mac Lane & Ieke Moerdijk (1992): Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Universitext. Springer, doi:10.1007/978-1-4612-0927-0.
  18. Robin Milner (1980): A Calculus of Communicating Systems. LNCS 92. Springer, doi:10.1007/3-540-10235-3.
  19. MohammadReza Mousavi, Michel A. Reniers & Jan Friso Groote (2007): SOS Formats and Meta-Theory: 20 Years After. Theoretical Computer Science 373(3), pp. 238–272, doi:10.1016/j.tcs.2006.12.019.
  20. Marco Peressotti (2017): Coalgebraic Semantics of Self-Referential Behaviours. University of Udine, doi:10.13140/rg.2.2.26899.07203.
  21. Gordon D. Plotkin (1981): A Structural Approach to Operational Semantics. DAIMI Report FN-19. Computer Science Department, Aarhus University.
  22. Emily Riehl (2014): Categorical Homotopy Theory. New Mathematical Monographs 24. Cambridge University Press, doi:10.1017/CBO9781107261457.
  23. Davide Sangiorgi & Jan Rutten (2011): Advanced Topics in Bisimulation and Coinduction. Cambridge Tracts in Theoretical Computer Science 52. Cambridge University Press, doi:10.1017/CBO9780511792588.
  24. Sam Staton (2008): General Structural Operational Semantics through Categorical Logic. In: Proc. 23rd Symposium on Logic in Computer Science, pp. 166–177, doi:10.1109/LICS.2008.43.
  25. Daniele Turi & Gordon D. Plotkin (1997): Towards a Mathematical Operational Semantics. In: Proc. 12th Symposium on Logic in Computer Science, pp. 280–291, doi:10.1109/LICS.1997.614955.
  26. Mark Weber (2007): Familial 2-functors and parametric right adjoints. Theory and Applications of Categories 18(22), pp. 665–732.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org