References

  1. Emmanuel Beffara (2005): Logique, réalisabilité et concurrence. Université Paris 7.
  2. Marcello M. Bonsangue, Jan J. M. M. Rutten & Alexandra Silva (2009): A Kleene Theorem for Polynomial Coalgebras. In: Luca de Alfaro: FOSSACS, Lecture Notes in Computer Science 5504. Springer, pp. 122–136, doi:10.1007/978-3-642-00596-1_10.
  3. 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.
  4. 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.
  5. Aurelio Carboni & Peter Johnstone (2004): Corrigenda for 'Connected limits, familial representability and Artin glueing'. Mathematical Structures in Computer Science 14(1), pp. 185–187, doi:10.1017/S0960129503004080.
  6. Rocco De Nicola & Matthew Hennessy (1984): Testing Equivalences for Processes. Theor. Comput. Sci. 34, pp. 83–133, doi:10.1016/0304-3975(84)90113-0.
  7. Olivier Delande & Dale Miller (2008): A Neutral Approach to Proof and Refutation in MALL. In: Proc. LICS, pp. 498–508, doi:10.1109/LICS.2008.35.
  8. H. Ehrig, H.-J. Kreowski, Ugo Montanari & Grzegorz Rozenberg (1999): Handbook of Graph Grammars and Computing by Graph Transformation, Volume 3: Concurrency, Parallelism and Distribution. World Scientific.
  9. Marcelo P. Fiore (2008): Second-Order and Dependently-Sorted Abstract Syntax. In: Proc. LICS, pp. 57–68, doi:10.1109/LICS.2008.38.
  10. Fabio Gadducci, Reiko Heckel & Mercè Llabrés (1999): A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting. Electronic Notes in Theoretical Computer Science 29, doi:10.1016/S1571-0661(05)80309-3.
  11. Fabio Gadducci & Ugo Montanari (2000): The tile model. In: Gordon D. Plotkin, Colin Stirling & Mads Tofte: Proof, Language, and Interaction. The MIT Press, pp. 133–166.
  12. Jean-Yves Girard (2001): Locus Solum: From the rules of logic to the logic of rules. Mathematical Structures in Computer Science 11(3), pp. 301–506, doi:10.1007/3-540-44802-0_3.
  13. Rob J. van Glabbeek (1990): The Linear Time-Branching Time Spectrum (Extended Abstract). In: Jos C. M. Baeten & Jan Willem Klop: CONCUR, Lecture Notes in Computer Science 458. Springer, pp. 278–297, doi:10.1007/BFb0039066.
  14. Yves Guiraud & Philippe Malbos (2009): Higher-dimensional categories with finite derivation type. Theory and Applications of Categories 22(18), pp. 420–278.
  15. André Hirschowitz, Michel Hirschowitz & Tom Hirschowitz (2009): Contraction-free Proofs and Finitary Games for Linear Logic. Electronic Notes in Theoretical Computer Science 249, pp. 287–305, doi:10.1016/j.entcs.2009.07.095.
  16. André Hirschowitz & Marco Maggesi (2007): Modules over Monads and Linearity. In: Daniel Leivant & Ruy J. G. B. de Queiroz: WoLLIC, Lecture Notes in Computer Science 4576. Springer, pp. 218–237, doi:10.1007/3-540-44802-0_3.
  17. André Hirschowitz & Marco Maggesi (2010): Modules over monads and initial semantics. Information and Computation 208(5), pp. 545–564, doi:10.1016/j.ic.2009.07.003.
  18. Tom Hirschowitz: Cartesian closed 2-categories and permutation equivalence in higher-order rewriting. Available at http://hal.archives-ouvertes.fr/hal-00540205/en/.
  19. Martin Hyland (1997): Semantics and Logics of Computation, chapter Game Semantics. Cambridge University Press, doi:10.1017/CBO9780511526619.005.
  20. Bart Jacobs (1999): Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics 141. North Holland, Amsterdam.
  21. Ole H. Jensen & Robin Milner (2004): Bigraphs and mobile processes (revised). Technical Report TR580. University of Cambridge. Available at http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-580.pdf.
  22. André Joyal, Mogens Nielsen & Glynn Winskel (1993): Bisimulation and open maps. In: LICS. IEEE Computer Society, pp. 418–427, doi:10.1109/LICS.1993.287566.
  23. Stefano Kasangian & Anna Labella (1999): Observational trees as models for concurrency. Mathematical Structures in Computer Science 9(6), pp. 687–718, doi:10.1017/S0960129599002935.
  24. Joachim Kock (2011): Polynomial Functors and Trees. International Mathematics Research Notices 2011(3), pp. 609–673, doi:10.1093/imrn/rnq068.
  25. Jean-Louis Krivine (2003): Dependent choice, `quote' and the clock. Theor. Comput. Sci. 308(1-3), pp. 259–276, doi:10.1016/S0304-3975(02)00776-4.
  26. Joachim Lambek (1968): A fixpoint theorem for complete categories. Mathematische Zeitschrift 103, pp. 151–161, doi:10.1007/BF01110627.
  27. Saunders Mac Lane (1998): Categories for the Working Mathematician, 2nd edition, Graduate Texts in Mathematics 5. Springer.
  28. Saunders MacLane & Ieke Moerdijk (1992): Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Universitext. Springer.
  29. Paul-André Melliès (2004): Asynchronous games 2: the true concurrency of innocence. In: Proc. CONCUR '04, LNCS 3170. Springer Verlag, pp. 448–465, doi:10.1016/j.tcs.2006.01.016.
  30. Robin Milner (1980): A Calculus of Communicating Systems. LNCS 92. Springer, doi:10.1007/3-540-10235-3.
  31. Tobias Nipkow (1991): Higher-Order Critical Pairs. In: LICS. IEEE Computer Society, pp. 342–349, doi:10.1109/LICS.1991.151658.
  32. Gordon D. Plotkin (1981): A structural approach to operational semantics. DAIMI Report FN-19. Computer Science Department, Aarhus University.
  33. Julian Rathke & Pawel Sobocinski (2008): Deconstructing behavioural theories of mobility. In: IFIP TCS, IFIP 273. Springer, pp. 507–520, doi:10.1007/978-0-387-09680-3_34.
  34. Vladimiro Sassone & Pawel Sobociński (2003): Deriving Bisimulation Congruences Using 2-categories. Nordic Journal of Computing 10(2).
  35. Peter Sewell (1998): From Rewrite to Bisimulation Congruences. In: Davide Sangiorgi & Robert de Simone: CONCUR, Lecture Notes in Computer Science 1466. Springer, pp. 269–284, doi:10.1007/BFb0055611.
  36. Daniele Turi & Gordon D. Plotkin (1997): Towards a Mathematical Operational Semantics. In: LICS, pp. 280–291, doi:10.1109/LICS.1997.614955.
  37. Angelo Vistoli (2007): Notes on Grothendieck topologies, fibered categories and descent theory. Available at http://arxiv.org/abs/math/0412512.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org