Asynchronous games 4: A fully complete model of propositional linear logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 386-395

  Melliès, Paul André ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS GAMES; DENOTATIONAL MODELS; LINEAR LOGIC;

GAME THEORY; LINEAR ALGEBRA; MATHEMATICAL MODELS;

FORMAL LOGIC;

EID: 26844437288     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2005.6     Document Type: Conference Paper

References (36)

1. S. Abramsky. Axioms for definability and full completeness. In Essays in Honour of Robin Milner, pages 55-75. MIT Press, 1999.
2. S. Abramsky, K. Honda, and G. McCusker. Fully abstract game semantics for general reference. In 13th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 1998.
3. S. Abramsky and R. Jagadeesan. Games and full completeness for multiplicative linear logic. Journal of Symbolic Logic, 59(2):543-574, 1994. Conference version appeared in FSTTCS '92.
4. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Information and Computation, 163(2):409-470, 2000.
5. S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions, 1997.
6. S. Abramsky and G. McCusker. Game semantics. In Computational logic. Springer Verlag, 1999.
7. S. Abramsky and P.-A. Melliès. Concurrent games and full completeness. In Logic in Computer Science 99, pages 431-442, Trento, July 1999. IEEE Computer Society Press.
8. P. Baillot, V. Danos, T. Ehrhard, and L. Regnier. Believe it or not, AJM's games model is a model of classical linear logic. In Logic in Computer Science, LiCS'97, pages 68-75, 1997.
9. G. Berry and P.-L. Curien. Sequential algorithms on concrete data structures. Theoretical Computer Science, 20:265-321, 1982.
10. A. Blass. A games semantics for linear logic. Annals of Pure and Applied Logic, 56:183-220, 1992.
11. P.-L. Curien. On the symmetry of sequentiality. In Proceedings of Mathematical Foundations of Programming Semantics (MFPS'93), number 802 in LNCS. Springer Verlag, 1993.
12. J.-Y. Girard. Geometry of interaction I: interpretation of system F. In Logic Colloquium 88, pages 221-260, Amsterdam, July 1989. North Holland.
13. J.-Y. Girard. A new constructive logic: Classical logic. Mathematical Structures in Computer Science, 1(3):255-296, 1991.
14. E. Goubault. Geometry and concurrency: A user's guide. Mathematical Structures in Computer Science, 10(4), Aug. 2000.
15. M. Hyland. Game semantics. In Semantics and logics of computation, Publications of the Newton Institute. Cambridge University Press, 1997.
16. M. Hyland and L. Ong. Fair games and full completeness for multiplicative linear logic without the mix rule. Manuscript, 1992.
17. M. Hyland and L. Ong. On full abstraction for PCF: I, II and III. Information and Computation, 163(2):285-408, Dec. 2000.
18. M. Hyland and A. Schalk. Abstract games for linear logic. In Categorical Techniques and Computer Science 99, volume 29 of Electronic Notes in Theoretical Computer Science, 1999.
19. M. Hyland and A. Schalk. Games on graphs and sequentially realizable functionals. In Logic in Computer Science 02, pages 257-264, Kopenhavn, July 2002. IEEE Computer Society Press.
20. P. Hyvernat. Synchronous games, deadlocks and linear logic. Submitted manuscript, Jan. 2005.
21. B. Jacobs. Semantics of weakening and contraction. Ann. Pure Appl. Logic, 69(1):73-106, 1994.
22. A. Joyal. Remarques sur la théorie des jeux à deux personnes. Gazette des Sciences Mathématiques du Québec, 1(4):46-52, 1977.
23. F. Lamarche. Sequentiality, games and linear logic. Manuscript, 1992.
24. O. Laurent. Polarized games (extended abstract). In Proceedings of the seventeenth annual symposium on Logic In Computer Science, pages 265-274, Copenhagen, July 2002. IEEE Computer Society Press.
25. G. McCusker. Games and full abstraction for a functional metalanguage with recursive types. Phd thesis, Imperial College, University of London, 1996. Published in Springer-Verlag's Distinguished Dissertations in Computer Science series, 1998.
26. P.-A. Melliès. Asynchronous games 1: a group-theoretic formulation of uniformity. Available at http://www.pps.jussieu.fr/~mellies/papers.html, 2003.
27. P.-A. Melliès. Categorical models of linear logic revisited. Prépublication électronique PPS//03/09//n°22 (pp), Laboratoire Preuves, Programmes et Systèmes, Mar. 2003. To appear in Theoretical Computer Science.
28. P.-A. Melliès. Asynchronous games 2: the true concurrency of innocence. In P. Gardner and N. Yoshida, editors, Proceedings of the 15th International Conference on Concurrency Theory (CONCUR 2004), number 3170 in LNCS. Springer Verlag, 2004.
29. P.-A. Melliès. Asynchronous games 2: the true concurrency of innocence (journal version). 44 pages. Available at http://www.pps.jussieu.fr/ ~mellies/papers.html, 2004.
30. P.-A. Melliès. Asynchronous games 3: an innocent model of linear logic. In L. Birkedal, editor, Category Theory in Computer Science, CTCS 2004, volume 122 of Electronic Notes in Theoretical Computer Science, 2005.
31. H. Nickau. Hereditarily sequential functionals. In A. Nerode and Y. V. Matiyasevich, editors, Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at St. Petersburg, volume 813 of Lecture Notes in Computer Science, pages 253-264. Springer Verlag, 1994.
32. E. W. S. P. Panangaden, V. Shanbhogue. Stability and sequentiality in data flow networks. In A. Nerode and Y. V. Matiyasevich, editors, International Conference on Automates, Languages and Programming, volume 443 of Lecture Notes in Computer Science, pages 253-264. Springer Verlag, 1990.
33. U. Reddy. Global state considered unnecessary: Introduction to object-based semantics. In Algol-like Languages, volume 2 of Progress in Theoretical Computer Science, pages 227-295. Birkhauser, 1997.
34. R. Seely. Linear logic, *-autonomous categories and cofree coalgebras. In Applications of categories in logic and computer science, number 92. Contemporary Mathematics, 1989.
35. P. Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science, 11(2):207-260, 2001.
36. G. Winskel and M. Nielsen. Models for concurrency. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science. Oxford University Press, 1995.