Polarized proof-nets and λμ-calculus

Theoretical Computer Science

Volumn 290, Issue 1, 2003, Pages 161-188

  Laurent, Olivier ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SIMULATION; ENCODING (SYMBOLS); SEMANTICS;

POLARIZED PROOF-NETS;

FORMAL LOGIC;

EID: 0037209699     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00297-3     Document Type: Article

References (14)

1. 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.
2. Danos V., Regnier L. Proof-nets and the Hilbert space. Girard J.-Y., Lafont Y., Regnier L. Advances in Linear Logic. London Mathematical Society Lecture Note Series. Vol. 222:1995;307-328 Cambridge University Press, Cambridge.
3. Danos V., Joinet J.-B., Schellinx H. A new deconstructive logic. linear logic J. Symbolic Logic. 62(3):1997;755-807.
4. R. David, W. Py, λμ-calculus and Böhm's theorem, J. Symbolic Logic 66 (1) (2001) 407-413, URL ftp://www.lama.univ-savoie.fr/pub/users/DAVID/bohm.ps.
5. Girard J.-Y. A new constructive logic: classical logic. Math. Struct. Comput. Sci. 1(3):1991;255-296.
6. J.-L. Krivine, Un interpréteur du lambda-calcul, unpublished. URL ftp://ftp.logique.jussieu.fr/pub/distrib/krivine/interprt.pdf.
7. O. Laurent, Logique linéaire polarisée et logiques classiques, Mémoire du magistère M.M.F.A.I., Ecole Normale Supérieure de Paris, September, 1999. URL ftp://iml.univ-mrs.fr/pub/olaurent/mmfai.ps.gz.
8. Laurent O. Polarized proof-nets: proof-nets for LC (extended abstract). Girard J.-Y. Typed Lambda Calculi and Applications '99. Lecture Notes in Computer Science. Vol. 1581:1999;213-227 Springer, Berlin.
9. Parigot M. λμ -calculus an algorithmic interpretation of classical natural deduction Proc. Internat. Conf. on Logic Programming and Automated Deduction. Lecture Notes in Computer Science. Vol. 624:1992;190-201 Springer, Berlin.
10. Parigot M. Classical proofs as programs. Proceedings of Kurt Gödel Colloquium. Lecture Notes in Computer Science. Vol. 713:1993;263-276 Springer, Berlin.
11. Quatrini M., Tortora de Falco L. Polarisation des preuves classiques et renversement. Compte-Rendu de l'Académie des Sciences de Paris. 323:1996;113-116.
12. L. Regnier, Lambda-calcul et réseaux, Thèse de doctorat, Université Paris VII, 1992.
13. Regnier L. Une équivalence sur les lambda-termes. Theoret. Comput. Sci. 126:1994;281-292.
14. P. Selinger, Control categories and duality: on the categorical semantics of the lambda-mu calculus, Math. Struct. Comput. Sci. 11 (2) (2001) 207-260, to appear, URL ftp://ftp.math.lsa.umich.edu/pub/selinger/control.ps.gz.