Polarized games

Annals of Pure and Applied Logic

Volumn 130, Issue 1-3 SPEC. ISS., 2004, Pages 79-123

  Laurent, Olivier ^a  

^a CNRS   (France)

Author keywords

Control categories; Game semantics; Lambda mu calculus; Linear logic; Polarities

Indexed keywords

EID: 15344341861     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2004.04.006     Document Type: Article

References (36)

1. Abramsky S. Semantics of interaction in: Dybjer P. Pitts A. (Eds.) Semantics and Logics of Computation 1997 1-32 Publications of the Newton Institute, Cambridge University Press
2. Abramsky S. Jagadeesan R. Games and full completeness for multiplicative linear logic Journal of Symbolic Logic 59 2 1994 543-574
3. Abramsky S. McCusker G. Call-by-value games In: Nielsen M. Thomas W. (Eds) Computer Science Logic, Lecture Notes in Computer Science vol. 1414 1997 1-17 European Association for Computer Science Logic, Springer Aarhus, Denmark
4. Abramsky S. McCusker G. Full abstraction for idealized algol with passive expressions Theoretical Computer Science 227 1999 3-42
5. Abramsky S. Melliès P.-A. Concurrent games and full completeness in: Proceedings of the Fourteenth Annual Symposium on Logic in Computer Science, IEEE 1999 431-442 IEEE Computer Society Press Trento
6. Abramsky S. Jagadeesan R. Malacaria P. Full abstraction for PCF Information and Computation 163 2 2000 409-470
7. P. Baillot, V. Danos, T. Ehrhard, L. Regnier, Believe it or not, AJM's games model is a model of classical linear logic, in: Proceedings of the Twelfth Annual Symposium on Logic in Computer Science [24] , pp 68-75
8. Berdine J. O'Hearn P. Reddy U. Thielecke H. Linear continuation-passing Higher-Order and Symbolic Computation 15 2-3 2002 181-208
9. Blass A. A game semantics for linear logic Annals of Pure and Applied Logic 56 1992 183-220
10. P. Boudes, Hypercohérences et jeux, Thèse de doctorat, Université Aix-Marseille II, 2002
11. Curien P.-L. On the symmetry of sequentiality in: Proceedings of Mathematical Foundations of Programming Semantics Lecture Notes in Computer Science vol. 805 1993 29-71 Springer
12. Curien P.-L. Herbelin H. The duality of computation in: Proceedings of the International Conference on Functional Programming ACM SIGPLAN Notices vol. 35(9) 2000 233-243 Association for Computing Machinery, ACM Press
13. V. Danos, La logique linéaire appliquée à l'étude de divers processus de normalisation (principalement du λ-calcul), Thèse de doctorat, Université Paris VII, 1990
14. Danos V. Harmer R. The anatomy of innocence in: Fribourg L. (Ed.) Computer Science Logic Lecture Notes in Computer Science vol. 2142 2001 188-202 Springer
15. Danos V. Joinet J.-B. Schellinx H. LKQ and LKT: Sequent calculi for second order logic based upon dual linear decompositions of classical implication in: Girard J.-Y. Lafont Y. Regnier L. (Eds.) Advances in Linear Logic London Mathematical Society Lecture Note Series vol. 222 1995 211-224 Cambridge University Press
16. Danos V. Joinet J.-B. Schellinx H. A new deconstructive logic: linear logic Journal of Symbolic Logic 62 3 1997 755-807
17. Faggian C. Hyland M. Designs, disputes and strategies in: Radfield J.C. (Ed.) Computer Science Logic Lecture Notes in Computer Science vol. 2471 2002 442-457 Springer Springer Computer Science Logic
18. Girard J.-Y. Linear logic Theoretical Computer Science 50 1987 1-102
19. Girard J.-Y. A new constructive logic: Classical logic Mathematical Structures in Computer Science 1 3 1991 255-296
20. Girard J.-Y. Locus solum: From the rules of logic to the logic of rules Mathematical Structures in Computer Science 11 3 2001 301-506
21. R. Harmer, Games and full abstraction for nondeterministic languages, Ph.D. Thesis, Imperial College and University of London, 1999
22. Honda K. Yoshida N. Game-theoretic analysis of call-by-value computation Theoretical Computer Science 221 1999 393-456
23. Hyland M. Ong L. On full abstraction for PCF Information and Computation 163 2 2000 285-408
24. IEEE, Proceedings of the Twelfth Annual Symposium on Logic in Computer Science 1997 IEEE Computer Society Press Warsaw
25. J. Laird, Full abstraction for functional languages with control, in: Proceedings of the Twelfth Annual Symposium on Logic in Computer Science 24 pp. 58-67
26. Laird J. A game semantics of linearly used continuations in: Gordon A. (Ed.) Foundations of Software Science and Computation Structures Lecture Notes in Computer Science vol. 2620 2003 313-327 Springer
27. Lamarche F. Games semantics for full propositional linear logic in: Proceedings of the Tenth Annual Symposium on Logic in Computer Science IEEE 1995 464-473 IEEE Computer Society Press
28. O. Laurent, Étude de la polarisation en logique, Thèse de doctorat, Université Aix-Marseille II, March, 2002
29. Laurent O. Polarized proof-nets and λμ-calculus Theoretical Computer Science 290 1 2003 161-188
30. Levy P.B. Call-by-push-value Semantics Structures in Computation vol. 2 2003 Kluwer
31. G. McCusker, Games and full abstraction for a functional metalanguage with recursive types, Ph.D. Thesis, Imperial College and University of London, 1996, Published in Springer-Verlag's Distinguished Dissertations in Computer Science Series, 1998
32. P.-A. Melliès, P. Selinger, Polar categories, 2001 (in preparation)
33. t11th 215 Annual ACM Symposium on Principles of Programming Languages 1997 215-227 Association for Computing Machinery, ACM Press
34. Parigot M. λμ-calculus: An algorithmic interpretation of classical natural deduction Proceedings of International Conference on Logic Programming and Automated Reasoning Lecture Notes in Computer Science vol. 624 1992 190-201 Springer
35. Power J. Robinson E. Premonoidal categories and notions of computation Mathematical Structures in Computer Science 7 5 1997 453-468
36. Selinger P. Control categories and duality: On the categorical semantics of the lambda-mu calculus Mathematical Structures in Computer Science 11 2 2001 207-260