References

  1. John C. Baez, Brandon Coya & Franciscus Rebro (2018): Props in network theory. Theory and Applications of Categories 33(25), pp. 727–783. Available at http://www.tac.mta.ca/tac/volumes/33/25/33-25abs.html.
  2. John C. Baez & Jade Master (2020): Open Petri nets. Math. Struct. Comput. Sci. 30(3), pp. 314–341, doi:10.1017/S0960129520000043.
  3. Filippo Bonchi, Joshua Holland, Robin Piedeleu, PawełSobociński & Fabio Zanasi (2019): Diagrammatic Algebra: From Linear to Concurrent Systems. Proc. ACM Program. Lang. 3(POPL), doi:10.1145/3290338.
  4. Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski & Fabio Zanasi (2019): Graphical Affine Algebra. In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019. IEEE, pp. 1–12, doi:10.1109/LICS.2019.8785877.
  5. Filippo Bonchi, Pawe\IeCł Sobociński & Fabio Zanasi (2017): Interacting Hopf algebras. Journal of Pure and Applied Algebra 221(1), pp. 144–184, doi:10.1016/j.jpaa.2016.06.002.
  6. Titouan Carette, Dominic Horsman & Simon Perdrix (2019): SZX-calculus: Scalable Graphical Quantum Reasoning. In: MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Leibniz International Proceedings in Informatics (LIPIcs) 138, Aachen, Germany, pp. 55:1–55:15, doi:10.4230/LIPIcs.MFCS.2019.55. Available at https://hal.archives-ouvertes.fr/hal-02400070.
  7. Titouan Carette & Simon Perdrix (2020): Colored props for large scale graphical reasoning. CoRR abs/2007.03564. ArXiv:2007.03564.
  8. Edmund M. Clarke, David E. Long & Kenneth L. McMillan (1989): Compositional Model Checking. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), Pacific Grove, California, USA, June 5-8, 1989. IEEE Computer Society, pp. 353–362, doi:10.1109/LICS.1989.39190.
  9. Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic & Pawel Parys (2019): Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. In: Timothy M. Chan: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. SIAM, pp. 2333–2349, doi:10.1137/1.9781611975482.142.
  10. Marcelo P. Fiore & Marco Devesas Campos (2013): The Algebra of Directed Acyclic Graphs. In: Bob Coecke, Luke Ong & Prakash Panangaden: Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky - Essays Dedicated to Samson Abramsky on the Occasion of His 60th Birthday, Lecture Notes in Computer Science 7860. Springer, pp. 37–51, doi:10.1007/978-3-642-38164-5_4.
  11. Yael Frégier, Martin Markl & Donald Yau (2008): The L_-deformation complex of diagrams of algebras. New York J. Math. 15, pp. 353392.
  12. Soichiro Fujii, Shin-ya Katsumata & Paul-André Melliès (2016): Towards a Formal Theory of Graded Monads. In: Bart Jacobs & Christof Löding: Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, Lecture Notes in Computer Science 9634. Springer, pp. 513–530, doi:10.1007/978-3-662-49630-5_30.
  13. Neil Ghani, Jules Hedges, Viktor Winschel & Philipp Zahn (2018): Compositional Game Theory. In: Anuj Dawar & Erich Grädel: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018. ACM, pp. 472–481, doi:10.1145/3209108.3209165.
  14. Charles Grellois (2016): Semantics of linear logic and higher-order model-checking. (Sémantique de la logique linéaire et "model-checking" d'ordre supérieur). Paris Diderot University, France. Available at https://tel.archives-ouvertes.fr/tel-01311150.
  15. Charles Grellois & Paul-André Melliès (2015): Finitary Semantics of Linear Logic and Higher-Order Model-Checking. In: Giuseppe F. Italiano, Giovanni Pighizzini & Donald Sannella: Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I, Lecture Notes in Computer Science 9234. Springer, pp. 256–268, doi:10.1007/978-3-662-48057-1_20.
  16. Philip Hackney & Marcy Robertson (2012): On the Category of Props. Applied Categorical Structures 23, doi:10.1007/s10485-014-9369-4.
  17. Masahito Hasegawa (1997): Recursion from Cyclic Sharing: Traced Monoidal Categories and Models of Cyclic Lambda Calculi. In: Philippe de Groote: Typed Lambda Calculi and Applications, Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997, Proceedings, Lecture Notes in Computer Science 1210. Springer, pp. 196–213, doi:10.1007/3-540-62688-3_37.
  18. Masahito Hasegawa & Shin-ya Katsumata (2010): A note on the biadjunction between 2-categories of traced monoidal categories and tortile monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society 148(1), pp. 107109, doi:10.1017/S0305004109002606.
  19. Ichiro Hasuo (2014): Generic Weakest Precondition Semantics from Monads Enriched with Order. In: Marcello M. Bonsangue: Coalgebraic Methods in Computer Science - 12th IFIP WG 1.3 International Workshop, CMCS 2014, Colocated with ETAPS 2014, Grenoble, France, April 5-6, 2014, Revised Selected Papers, Lecture Notes in Computer Science 8446. Springer, pp. 10–32, doi:10.1007/978-3-662-44124-4_2.
  20. André Joyal & Ross Street (1993): Braided Tensor Categories. Advances in Mathematics 102(1), pp. 20–78, doi:10.1006/aima.1993.1055. Available at https://www.sciencedirect.com/science/article/pii/S0001870883710558.
  21. André Joyal, Ross Street & Dominic Verity (1996): Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society 119(3), pp. 447468, doi:10.1017/S0305004100074338.
  22. Shin-ya Katsumata (2010): Categorical Descriptional Composition. In: Kazunori Ueda: Programming Languages and Systems - 8th Asian Symposium, APLAS 2010, Shanghai, China, November 28 - December 1, 2010. Proceedings, Lecture Notes in Computer Science 6461. Springer, pp. 222–238, doi:10.1007/978-3-642-17164-2_16.
  23. Shin-ya Katsumata (2014): Parametric effect monads and semantics of effect systems. In: Suresh Jagannathan & Peter Sewell: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, San Diego, CA, USA, January 20-21, 2014. ACM, pp. 633–646, doi:10.1145/2535838.2535846.
  24. Aleks Kissinger (2014): Abstract Tensor Systems as Monoidal Categories. In: Claudia Casadio, Bob Coecke, Michael Moortgat & Philip Scott: Categories and Types in Logic, Language, and Physics - Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday, Lecture Notes in Computer Science 8222. Springer, pp. 235–252, doi:10.1007/978-3-642-54789-8_13.
  25. Bartek Klin (2011): Bialgebras for structural operational semantics: An introduction. Theor. Comput. Sci. 412(38), pp. 5043–5069, doi:10.1016/j.tcs.2011.03.023.
  26. Marta Z. Kwiatkowska, Gethin Norman, David Parker & Hongyang Qu (2013): Compositional probabilistic verification through multi-objective model checking. Inf. Comput. 232, pp. 38–65, doi:10.1016/j.ic.2013.10.001.
  27. Elena Di Lavore, Jules Hedges & PawełSobociński (2021): Compositional Modelling of Network Games. In: Christel Baier & Jean Goubault-Larrecq: 29th EACSL Annual Conference on Computer Science Logic (CSL 2021), Leibniz International Proceedings in Informatics (LIPIcs) 183. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp. 30:1–30:24, doi:10.4230/LIPIcs.CSL.2021.30.
  28. Saunders MacLane (1965): Categorical algebra. Bulletin of the American Mathematical Society 71(1), pp. 40–106, doi:10.1090/S0002-9904-1965-11234-4.
  29. Roger Penrose (1971): Applications of negative dimensional tensors. Combinatorial mathematics and its applications 1, pp. 221–244.
  30. Robin Piedeleu & Fabio Zanasi (2021): A String Diagrammatic Axiomatisation of Finite-State Automata. In: Stefan Kiefer & Christine Tasson: Foundations of Software Science and Computation Structures - 24th International Conference, FOSSACS 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings, Lecture Notes in Computer Science 12650. Springer, pp. 469–489, doi:10.1007/978-3-030-71995-1_24.
  31. Peter Selinger (2011): A Survey of Graphical Languages for Monoidal Categories. In: Bob Coecke: New Structures for Physics. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 289–355, doi:10.1007/978-3-642-12821-9_4.
  32. Takeshi Tsukada & C.-H. Luke Ong (2014): Compositional higher-order model checking via ω-regular games over Böhm trees. In: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014. ACM, pp. 78:1–78:10, doi:10.1145/2603088.2603133.
  33. Daniele Turi & Gordon D. Plotkin (1997): Towards a Mathematical Operational Semantics. In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997. IEEE Computer Society, pp. 280–291, doi:10.1109/LICS.1997.614955.
  34. Thomas Wilke (2001): Alternating tree automata, parity games, and modal μ-calculus. Bulletin of the Belgian Mathematical Society - Simon Stevin 8(2), pp. 359 – 391, doi:10.36045/bbms/1102714178.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org