Abstract:
The main concern of this paper is the design of a noetherian and confluent normalization for LK 2 (that is, classical second order predicate logic presented as a sequent calculus). The method we present is powerful: since it allows us to recover as fragments formalisms as seemingly different as Girard's LC and Parigot's ¯, FD ([10, 12, 29, 33]), delineates other viable systems as well, and gives means to extend the Krivine/Leivant paradigm of `programming-with-proofs' ([24, 25]) to classical logic; it is painless: since we reduce strong normalization and confluence to the same properties for linear logic (for non-additive proof nets, to be precise) using appropriate embeddings (so-called decorations); it is unifying: it organizes known solutions in a simple pattern that makes apparent the how and why of their making. A comparison of our method to that of embedding LK into LJ (intuitionistic sequent calculus) brings to the fore the latter's defects for these `deconstructive purposes'...
Citations
|
469
|
Linear logic
– Girard
- 1987
|
|
394
|
Untersuchungen über das Logische Schliessen
– Gentzen
- 1935
|
|
353
|
The formulas-as-types notion of construction
– Howard
|
|
209
|
Lambda-mu-calculus: an algorithmic interpretation of classical natural deduction
– Parigot
- 1992
|
|
174
|
A formulae-as-types notion of control
– Griffin
- 1990
|
|
122
|
Call-by-name, call-by-value and the lambda calculus
– Plotkin
- 1975
|
|
104
|
A new constructive logic: Classical logic
– Girard
- 1991
|
|
75
|
Lambda-calcul Types et mod eles
– Krivine
- 1990
|
|
58
|
Proof theory: Some applications of cut-elimination
– Schwichtenberg
- 1978
|
|
40
|
Strong normalization for second order classical natural deduction
– Parigot
- 1993
|
|
38
|
A Symmetric Lambda Calculus for `Classical' Program Extraction
– Barbanera, Berardi
- 1996
|
|
36
|
Classical proofs as programs
– Parigot
- 1993
|
|
35
|
Recursive programming with proofs
– Parigot
- 1992
|
|
34
|
Tutorial on linear logic
– Troelstra
- 1993
|
|
30
|
H.: LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of classical implication
– Danos, Joinet, et al.
- 1995
|
|
29
|
An evaluation semantics for classical proofs
– Murthy
- 1991
|
|
29
|
The Noble Art of Linear Decorating
– Schellinx
- 1994
|
|
27
|
Lambda calculus, types and models
– Krivine
- 1993
|
|
27
|
Classical logic, storage operators and second-order lambda calculus
– Krivine
- 1994
|
|
23
|
Reasoning about functional programs and complexity classes associated to type disciplines
– Leivant
- 1983
|
|
22
|
Séquents qu’on calcule : de l’interprétation du calcul des séquents comme calcul de λ-termes et comme calcul de stratégies gagnantes, Thèse d’université, Université Paris 7
– Herbelin
- 1995
|
|
22
|
A computational analysis of Girard's translation and LC
– Murthy
- 1992
|
|
22
|
Calcul et r'eseaux. Th`ese de Doctorat, Universit'e de Paris 7
– Regnier
- 1992
|
|
19
|
La Logique Lin'eaire Appliqu'ee `a l"etude de Divers Processus de Normalisation (Principalement du -Calcul
– Danos
- 1990
|
|
13
|
On the interpretation of non-finitist proofs
– Kreisel
- 1951
|
|
12
|
The structure of exponentials: uncovering the dynamics of linear logic proofs
– Danos, Joinet, et al.
- 1993
|
|
10
|
Etude de la normalisation du calcul des s'equents classique `a travers la logique lin'eaire
– Joinet
- 1993
|
|
10
|
Free Deduction: an analysis of computation in classical logic
– Parigot
- 1991
|
|
10
|
Proof search strategies in linear logic. Programming Methodology Group 70
– Tammet
- 1993
|
|
6
|
A general storage theorem for integers in call-by-name λ-calculus
– Krivine
- 1994
|
|
2
|
On the linear decoration of intuitionistic derivations. Archive for Mathematical Logic
– Danos, Joinet, et al.
- 1995
|
|
2
|
Cut elimination for the unified logic
– Vauzeilles
- 1993
|
|
2
|
A new constructive logic: classical logic. Mathemathical Structures in Computer Science, 1(3):255--296. All papers in the bibliography (co)signed by the authors are electronically available on WWW at http://www.logique.jussieu.fr/www.hars/djs.html
– Girard
- 1991
|
|
1
|
Mod`ele coh'erent des r'eseaux de preuves. Archive for Mathematical Logic
– Duquesne, Wiele
- 1994
|
|
1
|
Das Fegefeuer Theorem (De Purgatorio). Eschatologische Axiomatik zum transorbitalen Sundenmanagement
– Heesterbeek, Schellinx
- 1992
|
|
1
|
Keeping inconsistencies local
– orwein, K
- 1992
|
|
1
|
Strong normalization for all-style LK tq
– Joinet, Schellinx, et al.
- 1996
|
|
1
|
Strong normalization for Free Deduction and related formalizations of classical second order logic. Manuscript
– Joinet, Schellinx, et al.
|
|
1
|
Mixed logic and storage operators. Pr'epublication de l'Universit'e de Chamb'ery
– Nour
- 1995
|
|
1
|
Validity and normalizability of proofs in first and second order classical and intuitionistic logic
– Prawitz
- 1981
|
|
