About translations of classical logic into polarized linear logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2003, Pages 11-20

  Laurent, Olivier ^a   Regnier, Laurent ^b  

^a CNRS   (France)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; COMPUTER SIMULATION; CONSTRAINT THEORY; LINEAR SYSTEMS; SEMANTICS; SYNTACTICS; CALCULATIONS; LOGIC DESIGN; POLARIZATION;

LOGICAL SYSTEMS;

FORMAL LOGIC; LINEAR ALGEBRA;

CALCULUS; CATEGORICAL MODEL; CONTINUATION-PASSING STYLE; CONTROL CATEGORIES; EQUATIONS; INTUITIONISTIC LOGIC; KLEISLI CATEGORY; LINEARITY;

EID: 0041466355     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. A. Barber and G. Plotkin. Dual intuitionistic linear logic. Technical report, LFCS, University of Edinburgh, 1997.
2. J. Berdine, P. O'Hearn, U. Reddy, and H. Thielecke. Linear continuation-passing. Higher-Order and Symbolic Computation, 15, 2002.
3. G. Bierman. On Intuitionistic Linear Logic. PhD thesis, University of Cambridge, Computer Laboratory, 1993. Available as Technical Report 346, August 1994.
4. G. Bierman. What is a categorical model of Linear Logic? In M. Dezzani and G. Plotkin, editors, Proceedings of the Second International Conference on Typed Lambda Calculi and Applications, volume 902 of Lecture Notes in Computer Science. Springer-Verlag, Apr. 1995.
5. th Symposium on Logic in Computer Science, New Brunswick, 1996. IEEE Computer Society Press.
6. V. Danos, J.-B. Joinet, and H. Schellinx. LKQ and LKT: Sequent calculi for second order logic based upon dual linear decompositions of classical implication. In J.-Y. Girard, Y. Laf ont, and L. Régnier, editors, Advances in Linear Logic, volume 222 of London Mathematical Society Lecture Note Series. Cambridge University Press, 1995.
7. V. Danos, J.-B. Joinet, and H. Schellinx. A new deconstructive logic: Linear logic. Journal of Symbolic Logic, 62(3):755-807, 1997.
8. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
9. J.-Y. Girard. A new constructive logic: classical logic. Mathematical Structures in Computer Science, 1(3):225-296, 1991.
10. T. Griffin. A formulae-as-types notion of control. In Proceedings of the 1990 Principles of Programming Languages Conference, pages 47-58. IEEE Computer Society Press, 1990.
11. th Symposium on Logic in Computer Science, pages 387-397, Warsaw, 1997. IEEE Computer Society Press.
12. J.-L. Krivine. Lambda-Calcul : Types et Modèles. Études et Recherches en Informatique. Masson, 1990.
13. J.-L. Krivine. A general storage theorem for integers in call-by-name λ-calculus. Theoretical Computer Science, 129:79-94, 1994.
14. Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157-180, 1988.
15. J. Laird. A game semantics of linearly used continuations. In A. Gordon, editor, Foundations of Software Science and Computation Structures, volume 2620 of Lecture Notes in Computer Science, pages 313-327. Springer-Verlag, 2003.
16. O. Laurent. Étude de la polarisation en logique. Thèse de doctorat, Université Aix-Marseille 2, 2002.
17. O. Laurent. Polarized games (extended abstract). In Proceedings of the seventeenth annual IEEE symposium on Logic In Computer Science, pages 265-274. IEEE Computer Society Press, July 2002.
18. O. Laurent. Polarized proof-nets and λμ-calculus. Theoretical Computer Science, 290(1):161-188, 2003.
19. S. Mac Lane, Categories for the Working Mathematician. Springer-Verlag, 1971.
20. P.-A. Melliès. Categorical models of linear logic revisited. Available at http://www.pps.jussieu.fr/̃mellies/papers/catmodels.ps.gz, 2002.
21. th Symposium on Logic in Computer Science, pages 96-107. IEEE Computer Society Press, 1991.
22. M. Parigot, λμ-calculus: an algorithmic interpretation of classical natural deduction. In Proceedings of Internationnal Conference on Logic Programming and Automated Deduction, volume 624 of Lecture Notes in Computer Science, pages 190-201. Springer-Verlag, 1992.
23. G. Plotkin. Call-by-name, call-by-value and the λ-calculus. Theoretical Computer Science, 1:125-159, 1975.
24. M. Quatrini and L. Tortora de Falco. Polarisation des preuves classiques et renversement. Compte-Rendu à l'Académie des Sciences, 323:113-116, 1996.
25. 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.