Syntax vs. semantics: A polarized approach

Theoretical Computer Science

Volumn 343, Issue 1-2, 2005, Pages 177-206

  Laurent, Olivier ^a  

^a CNRS   (France)

Author keywords

Full and faithful completeness; Game semantics; Linear logic; Polarization; Proof nets

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; EQUIVALENCE CLASSES; GAME THEORY; LOGIC PROGRAMMING; SEMANTICS;

FULL AND FAITHFUL COMPLETENESS; GAME SEMANTICS; LINEAR LOGIC; PROOF-NETS;

SYNTACTICS;

EID: 25444461110     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.05.012     Document Type: Article

References (30)

1. S. Abramsky, and R. Jagadeesan Games and full completeness for multiplicative linear logic J. Symbolic Logic 59 2 1994 543 574
2. S. Abramsky, R. Jagadeesan, and P. Malacaria Full abstraction for PCF Information and Comput. 163 2 2000 409 470
3. S. Abramsky, P.-A. Melliès, Concurrent games and full completeness, in: Proc. of the Fourteenth Annu. Symp. on Logic in Computer Science [16], pp. 431-442.
4. S. Abramsky, and G. McCusker Full abstraction for idealized algol with passive expressions Theoret. Comput. Sci. 227 1999 3 42
5. R. Blute, and P. Scott Linear Lauchli semantics Ann. Pure Appl. Logic 77 1996 101 142
6. H. Devarajan, D. Hughes, G. Plotkin, V. Pratt, Full completeness of the multiplicative linear logic of Chu spaces, in: Proc. of the Fourteenth Annu. Symp. on Logic in Computer Science [16], pp. 234-243.
7. J.-Y. Girard Linear logic Theoret. Comput. Sci. 50 1987 1 102
8. J.-Y. Girard A new constructive logic: classical logic Math. Struct. Comput. Sci. 1 3 1991 255 296
9. J.-Y. Girard Proof-nets: the parallel syntax for proof-theory A. Ursini P. Agliano Logic and Algebra Lecture Notes in Pure and Applied Mathematics, Vol. 180 1996 Marcel Dekker New York 97 124
10. J.-Y. Girard, On the meaning of logical rules I: syntax vs. semantics, in: U. Berger, H. Schwichtenberg (Eds.), Computational Logic, Springer, 1999, pp. 215-272, NATO series F 165.
11. J.-Y. Girard Locus solum: From the rules of logic to the logic of rules Math. Struct. Comput. Sci. 11 3 2001 301 506
12. R. Harmer, Games and full abstraction for nondeterministic languages, Ph.D. Thesis, Imperial College and University of London, 1999.
13. D. Hughes, R. van Glabbeek, Proof nets for unit-free multiplicative- additive linear logic, in: Proc. of the Eighteenth Annu. Symp. on Logic in Computer Science, IEEE, IEEE Computer Society Press, Ottawa, 2003, pp. 1-10.
14. M. Hyland, L. Ong, Fair games and full completeness for multiplicative linear logic without the mix-rule, preprint (1993).
15. M. Hyland, and L. Ong On full abstraction for PCF Inform. and Comput. 163 2 2000 285 408
16. IEEE, Proc. of the Fourteenth Annual Symp. on Logic in Computer Science, IEEE Computer Society Press, Trento, 1999.
17. J.-L. Krivine Dependent choice, 'quote' and the clock Theoret. Comput. Sci. 308 2003 259 276
18. J. Laird, Full abstraction for functional languages with control, in: Proc. of the Twelfth Annu. Symp. on Logic in Computer Science, IEEE, IEEE Computer Society Press, Warsaw, 1997, pp. 58-67.
19. F. Lamarche, Games semantics for full propositional linear logic, in: Proc. of the Tenth Annu. Symp. on Logic in Computer Science, IEEE, IEEE Computer Society Press, 1995, pp. 464-473.
20. O. Laurent, Étude de la polarisation en logique, Thèse de doctorat, Université Aix-Marseille II, March 2002.
21. O. Laurent Polarized games Ann. Pure Appl. Logic 130 1-3 2004 79 123
22. O. Laurent, Classical isomorphisms of types, Math. Struct. Comput. Sci. to appear.
23. O. Laurent, M. Quatrini, L. Tortora de Falco, Polarized and focalized linear and classical proofs, Ann. Pure Appl. Logic 134 (2-3) (2005) 217-264.
24. O. Laurent, and L. Tortora de Falco Slicing polarized additive normalization T. Ehrhard J.-Y. Girard P. Ruet P. Scott Linear Logic in Computer Science London Mathematical Society Lecture Note Series, Vol. 316 2004 Cambridge University Press Cambridge
25. R. Loader, Linear logic, totality and full completeness, in: Proc. of the Ninth Annu. Symp. on Logic in Computer Science, IEEE, IEEE Computer Society Press, 1994, pp. 292-298.
26. A. Murawski, On semantic and type-theoretic aspects of polynomial-time computability, Ph.D. Thesis, University of Oxford, 2001.
27. H. Nickau, Hereditarily sequential functionals, in: A. Nerode, Y. Matiyasevich (Eds.), Logical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 813, Springer, 1994, pp. 253-264.
28. L. Regnier, Lambda-calcul et réseaux, Thèse de doctorat, Université Paris VII, 1992.
29. P. Selinger Control categories and duality: on the categorical semantics of the lambda-mu calculus Math. Struct. Comput. Sci. 11 2 2001 207 260
30. L. Tortora de Falco Obsessional experiments for linear logic proof-nets Math. Struct. Comput. Sci. 13 6 2003 799 855