Strong Normalization of Proof Nets Modulo Structural Congruences
This paper proposes a notion of reduction for the proof nets of Linear Logic modulo an equivalence relation on the contraction links, that essentially amounts to consider the contraction as an associative commutative binary operator that can float freely in and out of proof net boxes. The need for such a system comes, on one side, from the desire to make proof nets an even more parallel syntax for Linear Logic, and on the other side from the application of proof nets to l-calculus with or without explicit substitutions, which needs a notion of reduction more flexible than those present in the literature. The main result of the paper is that this relaxed notion of rewriting is still strongly normalizing.
KeywordsProof Nets Linear Logic Strong Normalization
Unable to display preview. Download preview PDF.
- A. Asperti, V. Danos, C. Laneve, and L. Regnier. Paths in the lambda-calculus: three years of communications without understanding. In Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science (LICS), pages 426–436, Paris, France, 1994.Google Scholar
- V. Danos. Une Application de la Logique Linéaire à l’ Ètude des Processus de Normalisation (principalement du λ-calcul). PhD Thesis, Université Paris 7, Paris, June 1990.Google Scholar
- 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, 1995. Proceedings of the Workshop on Linear Logic, Ithaca, New York, June 1993.Google Scholar
- R. Di Cosmo and D. Kesner. Strong normalization of explicit substitutions via cut elimination in proof nets. In Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS), pages 35–46, Warsaw, Poland, 1997. Full Paper available as http://www.dmi.ens.fr/~dicosmo/Pub/esll.ps.gz.
- S. Guerrini. Correctness of multiplicative proof nets is linear. In Proceedings, Fourteenth Annual IEEE Symposium on Logic in Computer Science (LICS), Trento, Italy, 1999.Google Scholar
- J.-B. Joinet. Ètude de la normalisation du calcul des séquents classique à travers la logique linéaire. PhD Thesis, Université Paris 7, Paris, 1993.Google Scholar