1. JiříAdámek & JiříRosicky (1994): Locally presentable and accessible categories 189. Cambridge University Press, doi:10.1017/CBO9780511600579.
  2. Romain Beauxis & Samuel Mimram (2011): A Non-Standard Semantics for Kahn Networks in Continuous Time. In: Computer Science Logic (CSL'11)-25th International Workshop/20th Annual Conference of the EACSL 12, pp. 35–50, doi:10.4230/LIPIcs.CSL.2011.35.
  3. Jean Bénabou (1967): Introduction to bicategories. In: Reports of the Midwest Category Seminar. Springer, pp. 1–77, doi:10.1007/BFb0074299.
  4. Albert Burroni (1993): Higher-dimensional word problems with applications to equational logic. Theoretical computer science 115(1), pp. 43–62, doi:10.1016/0304-3975(93)90054-W.
  5. Marcelo Fiore & Marco Devesas Campos (2013): The algebra of directed acyclic graphs. In: Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky. Springer, pp. 37–51, doi:10.1007/978-3-642-38164-5_4.
  6. Martin Hyland & John Power (2000): Symmetric monoidal sketches. In: Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming. ACM, pp. 280–288, doi:10.1145/351268.351299.
  7. André Joyal & Ross Street (1991): The geometry of tensor calculus, I. Advances in Mathematics 88(1), pp. 55–112, doi:10.1016/0001-8708(91)90003-P.
  8. Stephen Lack (2004): Composing PROPs. Theory and Applications of Categories 13(9), pp. 147–163.
  9. Yves Lafont (2003): Towards an algebraic theory of boolean circuits. Journal of Pure and Applied Algebra 184(2), pp. 257–310, doi:10.1016/S0022-4049(03)00069-0.
  10. Saunders MacLane (1965): Categorical algebra. Bulletin of the American Mathematical Society 71(1), pp. 40–106, doi:10.1090/S0002-9904-1965-11234-4.
  11. Saunders MacLane (1998): Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer, doi:10.1007/978-1-4757-4721-8.
  12. Paul-André Melliès & Samuel Mimram (2007): Asynchronous games: innocence without alternation. In: CONCUR 2007–Concurrency Theory. Springer, pp. 395–411, doi:10.1007/978-3-540-74407-8_27.
  13. Samuel Mimram (2008): Sémantique des jeux asynchrones et réécriture 2-dimensionnelle. Université Paris Diderot – Paris VII.
  14. Samuel Mimram (2011): The structure of first-order causality. Mathematical Structures in Computer Science 21(01), pp. 65–110, doi:10.1017/S0960129510000459.
  15. Samuel Mimram (2014): Towards 3-Dimensional Rewriting Theory. Logical Methods in Computer Science 10(2), pp. 1–47, doi:10.2168/LMCS-10(2:1)2014.
  16. Ieke Moerdijk & Bertrand Toën (2010): Dendroidal sets. In: Simplicial Methods for Operads and Algebraic Geometry. Springer, pp. 23–39, doi:10.1007/978-3-0348-0052-5_4.
  17. Teimuraz Pirashvili (2002): On the PROP corresponding to bialgebras. Cahiers de Topologie et Géométrie Différentielle Catégoriques 43(3), pp. 221–239.
  18. John Power (1991): An n-categorical pasting theorem. In: Category theory. Springer, pp. 326–358, doi:10.1007/BFb0084230.
  19. Ross Street (1976): Limits indexed by category-valued 2-functors. Journal of Pure and Applied Algebra 8(2), pp. 149–181, doi:10.1016/0022-4049(76)90013-X.
  20. Edward Szpilrajn (1930): Sur l'extension de l'ordre partiel. Fundamenta mathematicae 16(1), pp. 386–389.
  21. Axel Thue (1914): Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln. Skrifter utg. av Videnskapsselsk. i Kristiania. 1. Matem.-naturv. Klasse.
  22. Glynn Winskel & Mogens Nielsen (1995): Models for concurrency. In: Handbook of logic in computer science (vol. 4). Oxford University Press, pp. 1–148.

Comments and questions to:
For website issues: