Double categories: A modular model of multiplicative linear logic

Mathematical Structures in Computer Science

Volumn 12, Issue 4, 2002, Pages 449-479

  Melliès, Paul André ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 27244449277     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129501003498     Document Type: Article

References (32)

1. Abramsky, S. and Mellies, P.-A. (1999) Concurrent games and full completeness. Proceedings LICS’99, Trento.
2. Barr, M. (1991) *-Autonomous Categories and Linear Logic. Mathematical Structures in Computer Science.
3. Bierman, G. M. (1995) What is a categorical model of Intuitionistic Linear Logic? Proceedings TLCA’95, Edinburgh.
4. Blute, R. (1993) Linear logic, coherence and dinaturality. Theoretical Computer Science 115 3–41.
5. Bruni, R. and Montanari, U. (1999) Cartesian Closed Double Categories, their Lambda-Notation, and the Pi-Calculus. Proc. 14th Symposium on Logic in Computer Science, Trento, IEEE Computer Society 246–265.
6. Cockett, J. R. B. and Seely, R. A. G. (1997) Weakly distributive categories. Journal of Pure and Applied Algebra 114 133–173.
7. Danos, V. and Regnier, L. (1989) The structure of multiplicatives. Archive for Mathematical Logic 28 181–203.
8. Fleury, A. and Retore, C. (1994) The mix rule. Mathematical Structures in Computer Science 4 (2) 273–285.
9. Gadducci, F. and Montanan U. (1996) Tiles, rewriting rules and CCS. In: Meseguer, J. (ed.) Rewriting logic and applications. Electronic Notes in Computer Science 4.
10. Ghani, N. (1995) Adjoint Rewriting, Ph. D. thesis, University of Edinburgh.
11. Girard, J.-Y. (1987a) Linear Logic. Theoretical Computer Science 50 1–102.
12. Girard, J.-Y. (1987b) Multiplicatives. Rencontri del Seminario Matematico dell'Universita e Policlinico di Torino (special issue on Logic and Computer Science) 11–133.
13. Gonthier, G., Levy, J.-J. and Mellies, R-A. (1992) An abstract standardisation theorem. Proceedings LICS’92, Santa Cruz.
14. Huet, G. and Levy, J.-J. (1979) Call by Need Computations in Non-Ambiguous Linear Term Rewriting Systems. Rapport de recherche INRIA 359.
15. Jacobs, B. (1991) Categorical type theory. Proefschrift aan de Katholieke Universiteit Nijmegen.
16. Jay, C. B. (1992) Modelling reduction in confluent categories. Applications of categories to Computer Science. London Mathematical Society Lecture Note Series 177, Cambridge University Press.
17. Klop, J.W. (1992) Term Rewriting Systems. In: Abramsky, S., Gabbay, D. and Maibaum, T. (eds.) Handbook of Logic in Computer Science 1, Oxford University Press.
18. Kelly, G. M. and La Plaza, M. (1980) Coherence for compact closed categories. J. Pure and Applied Algebra 19 193–213.
19. Kelly, G. M. and Mac Lane, S. (1971) Coherence in closed categories. J. Pure and Applied Algebra 1 97–140.
20. Lafont, Y. (1995) From proof-nets to interaction nets. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Notes 222, Cambridge University Press 1–42
21. Lambek, J. (1969) Deductive systems and categories II. Springer-Verlag Lecture Notes in Mathematics 87.
22. Lambek, J. and Scott, P. J. (1986) Introduction to higher order categorical logic, Cambridge studies in Advanced mathematics 7.
23. Levy, J.-J. (1978) Reductions correctes et optimales dans le 2-calcul, These de Doctorat d’Etat, Universite Paris VII.
24. Loader, R. (1994) Linear Logic, Totality and Full Completeness. Proceedings LICS’94.
25. Mac Lane, S. (1971) Categories for the working mathematician, Springer Verlag.
26. Mellies, P.-A. (1994) Non mobile models of mobility (manuscript).
27. Mellies, P.-A. (1996) Description abstraite des systemes de reecriture, These de l'Universite Paris VII, December.
28. Mellies, P.-A. and Bourgeois-Gironde, S. (1997) Three approaches to congruence, Wittgenstein collo-quium, Kirchberg am Wechsel.
29. Power, A. J. (1989) An abstract formulation for rewrite systems. Category Theory and Computer Science. Springer-Verlag Lecture Notes in Computer Science 389.
30. Rydeheard, D. E. and Stell, J. G. (1987) Foundations of equational deduction: A categorical treat-ment of equational proofs and unification algorithms. Category Theory and Computer Science. Springer-Verlag Lecture Notes in Computer Science 283.
31. Seely, R.A.G. (1987) Modelling computations: a 2-categorical framework. Proceedings LICS’87.
32. Seely, R. A. G. (1989) Linear logic, *-autonomous categories and cofree algebras. Conference on Categories in Computer Science and Logic. AMS Contemporary Mathematics 92 371–382.