论文信息 - Proof Nets for Intuitionistic Linear Logic: Essential Nets

Proof Nets for Intuitionistic Linear Logic: Essential Nets

We present a class of proof nets that are specially designed for Intuitionistic Linear Logic, for which we give a correctness criterion, as well as a cut-elimination procedure. The proof of sequentialization uses a special kind of oriented paths.

François Lamarche | F. Lamarche

[1] Olivier Laurent,et al. Polarized Proof-Nets: Proof-Nets for LC , 1999, TLCA.

[2] François Lamarche. From Proof Nets to Games , 1996, Electron. Notes Theor. Comput. Sci..

[3] Patrick Lincoln,et al. Linear logic , 1992, SIGA.

[4] C. Laneve,et al. Paths in the lambda-calculus , 1994, LICS 1994.

[5] C. Retoré,et al. Réseaux et séquents ordonnés , 1993 .

[6] Yves Lafont,et al. Interaction nets , 1989, POPL '90.

[7] Olivier Laurent. Polarized Proof-Nets and Lambda µ-Calculus , 1999 .

[8] Olivier Laurent,et al. Étude de la polarisation en logique , 2001 .

[9] Jean-Yves Girard,et al. Geometry of Interaction 1: Interpretation of System F , 1989 .

[10] Jean-Yves Girard,et al. A new constructive logic: classic logic , 1991, Mathematical Structures in Computer Science.

[11] Gianluigi Bellin,et al. Subnets of proof-nets in MLL - , 1995 .

[12] Laurent Regnier,et al. Lambda-calcul et reseaux , 1992 .

[13] Christine Leininger,et al. Van de Wiele , 2005 .

[14] Martín Abadi,et al. The geometry of optimal lambda reduction , 1992, POPL '92.

[15] Ian Craig Mackie. The geometry of implementation , 1994 .