Proof nets and explicit substitutions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1784 LNCS, Issue , 2000, Pages 63-81

  Di Cosmo, Roberto ^a   Kesner, Delia ^b   Polonovski, Emmanuel ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTATION THEORY; SET THEORY;

COMPLEX MECHANISMS; CUT ELIMINATION; DE-BRUIJN INDICES; EQUIVALENCE RELATIONS; EXPLICIT SUBSTITUTIONS; LAMBDA-CALCULI; SIMULATION TECHNIQUE; STRONG NORMALIZATION;

CALCULATIONS;

EID: 24944468386     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46432-8_5     Document Type: Conference Paper

References (19)

1. M. Abadi, L. Cardelli, P. L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 4(1): 375-416, 1991.
2. S. Abramsky and R. Jagadeesan. New foundations for the geometry of interaction. In Proc. of LICS, pages 211-222, 1992. (Pubitemid 23562010)
3. R. Bloo. Preservation of Termination for Explicit Substitution. PhD thesis, Eindhoven University of Technology, 1997.
4. R. Bloo and K. Rose. Preservation of strong normalization in named lambda calculi with explicit substitution and garbage collection. In Computing Science in the Netherlands, pages 62-72. Netherlands Computer Science Research Foundation, 1995.
5. V. Danos. La logique linéaire appliquée à l'étude de divers processus de normalisation (et principalement du λ-calcul). PhD thesis, Université de Paris VII, 1990. Thèse de doctorat de mathématiques.
6. V. Danos, J.-B. Joinet, and H. Schellinx. Sequent calculi for second order logic. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic. Cambridge University Press, 1995.
7. V. Danos and L. Regnier. Proof-nets and the Hilbert space. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 307-328. Cambridge University Press, London Mathematical Society Lecture Notes, 1995.
8. l-calculus. In Proceedigs of WESTAPP, pages 2-13, Trento, Italy, 1999.
9. R. Di Cosmo and S. Guerrini. Strong normalization of proof nets modulo structural congruences. In P. Narendran and M. Rusinowitch, editors, Proc of RTA, volume 1631 of LNCS, pages 75-89, Trento, Italy, 1999. Springer Verlag.
10. R. Di Cosmo and D. Kesner. Strong normalization of explicit substitutions via cut elimination in proof nets. In Proc of LICS, pages 35-46, Warsaw, Poland, 1997.
11. R. Di Cosmo, D. Kesner, and E. Polonovski. Proof nets and explicit substitutions. Technical report, LRI, Université Paris-Sud, 2000. Available as ftp://ftp.lri.fr/LRI/articles/kesner/es-pn.ps.gz.
12. M. C. Ferreira, D. Kesner, and L. Puel. Lambda-calculi with explicit substitutions preserving strong normalization. Applicable Algebra in Engineering Communication and Computing, 9(4): 333-371, 1999.
13. J.-Y. Girard. Linear logic. Theoretical C om puter Science, 50(1): 1-101, 1987.
14. J.-Y. Girard. Geometry of interaction I: interpretation of system F. In R. Ferro, C. Bonotto, S. Valentini, and A. Zanardo, editors, Logic colloquium 1988, pages 221-260. North Holland, 1989.
15. G. Gonthier, M. Abadi, and J.-J. Lévy. The geometry of optimal lambda reduction. In Proc. of POPL, pages 15-26, Albuquerque, New Mexico, 1992. ACM Press.
16. B. Guillaume. Un calcul de substitution avec Étiquettes. PhD thesis, Université de Savoie, 1999.
17. J. Lamping. An algorithm for optimal lambda calculus reduction. In Proc. of POPL, pages 16-30, San Francisco, California, 1990. ACM Press. (Pubitemid 20681738)
18. P.-A. Melliès. Typed λ-calculi with explicit substitutions may not terminate. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proc of TLCA, volume 902 of LNCS, April 1995.
19. K. Rose. Explicit cyclic substitutions. In Rusinowitch and Rémy, editors, Proc. of CTRS, number 656 in LNCS, pages 36-50, 1992.