Obsessional experiments for linear logic proof-nets

Mathematical Structures in Computer Science

Volumn 13, Issue 6, 2003, Pages 799-855

  de Falco, Lorenzo Tortora ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85012863342     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129503003967     Document Type: Article

References (22)

1. Barcaglioni, C. (2001) Le dimostrazioni logiche come costruzioni: spazi coerenti ed esperienze, Tesi di laurea in matematica, Universita di Roma Tre.
2. Barreiro, N. and Ehrhard, T. (1997) Anatomy of an extensional collapse. (Private comunication, Available at ftp://iml.univ-mrs.fr/pub/ehrhard/anat.ps.Z.)
3. Berger, U., Eber, M. and Schwichtenberg, H. (1998) Normalization by evaluation. Springer-Verlag Lecture Notes in Computer Science 1546 117–137.
4. Danos, V. (1990) La Logique Lineaire appliquee a l'etude de divers processus de normalisation (principalement du yl-calcul) These de doctorat, Universite Paris VII.
5. Duquesne, E. and Van de Wiele, J. (1994) Mode coherent des reseaux de preuve. Archive for Mathematical Logic 33 133–158.
6. Danos, V. and Joinet, J.-B. (2001) Linear logic and elementary time. Information and Computation (to appear).
7. Danos, V., Joinet, J.-B. and Schellinx, H. (1997) A new deconstructive logic: linear logic. Journal of Symbolic Logic 62 (3) 755–807.
8. Danos, V. and Regnier, L. (1995) Proof-nets and the Hilbert space. In: Girard, J.-Y., Lafont, Y. and Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Note Series 222 307–328.
9. Danvy, O., Rhiger, M. and Rose, K. H. (2001) Normalization by evaluation with typed abstract syntax. J. Funct. Programming 11 (6) 673–680.
10. Girard, J.-Y. (1987) Linear logic. Theoretical Computer Science 50 1–102.
11. Girard, J.Y. (1991) A new constructive logic: classical logic. Mathematical Structures in Computer Science 1 (3) 255–296.
12. Girard, J.Y. (1993) On the unity of logic. Annals of Pure and Applied Logic 59 201–217.
13. Girard, J.Y. (1995) Light linear logic. Information and Computation 143 (2) 175–204.
14. Laurent, O. (1999) Polarized proof-nets: proof-nets for LC (extended abstract). In: Girard, J.Y. (ed.) Typed Lambda Calculi and Applications ’99. Springer-Verlag Lecture Notes in Computer Science 1581 213–227.
15. Laurent, O., Quatrini, M. and Tortora de Falco L. (2000) Polarized and focalized linear and classical proofs. Annals of Pure and Applied Logic (to appear). Laurent, O. and Tortora de Falco, L. (2001) Slicing polarized additive normalization. Quaderno I.A.C.C.N.R. 12. (To appear in Advances in Linear Logic, Cambridge University Press.)
16. Quatrini, M. and Tortora de Falco, L. (1996) Polarisation des preuves classiques et renversement. Compte-Rendu de l'Academie des Sciences de Paris 323 113–116.
17. Regnier, L. (1992) Lambda-Calcul et Reseaux, These de doctorat, Universite Paris VII.
18. Retore, C. (1997) A semantic characterisation of the correctness of a proof net. Mathematical Structures in Computer Science 7 (5) 445–452.
19. Statman, R. (1983) /-definable functionals and /ty conversion. Arch. Math. Logik Grundlagenforsch 23 21–26.
20. Tortora de Falco, L. (1997) Denotational semantics for polarized (but non-constrained) LK by means of the additives. In: 5th Kurt Goedel Colloquium KGC'97 computational logic and proof theory. Springer-Verlag Lecture Notes in Computer Science 1289 290–304.
21. Tortora de Falco, L. (2003) Additives of linear logic and normalization - part I: a (restricted) Church—Rosser property. Theoretical Computer Science 294 (3) 489–524.
22. Tortora de Falco, L. (2000) Reseaux, coherence et experiences obsessionnelles, These de doctorat, Universite Paris VII. (Available at http://www.logique.jussieu.fr/www.tortora.)