Lambda terms for natural deduction, sequent calculus and cut elimination

  title={Lambda terms for natural deduction, sequent calculus and cut elimination},
  author={HENK P. Barendregt and Silvia Ghilezan},
  journal={J. Funct. Program.},
It is well known that there is an isomorphism between natural deduction derivations and typed lambda terms. Moreover, normalising these terms corresponds to eliminating cuts in the equivalent sequent calculus derivations. Several papers have been written on this topic. The correspondence between sequent calculus derivations and natural deduction derivations is, however, not a one-one map, which causes some syntactic technicalities. The correspondence is best explained by two extensionally… Expand
Curry-Howard for Sequent Calculus at Last!
This paper tries to remove what seems to be the remaining stumbling blocks in the way to a full understanding of the Curry-Howard isomorphism for sequent calculus, namely the questions: What doExpand
Conservative extensions of the lambda-calculus for the computational interpretation of sequent calculus
This thesis offers a study of the Curry-Howard correspondence for a certain fragment (the canonical fragment) of sequent calculus based on an investigation of the relationship between cut eliminationExpand
This paper revisits the results of Barendregt and Ghilezan (3) and generalizes them for classical logic. Instead of �-calculus, we use here �µ-calculus as the basic term cal- culus. We consider twoExpand
Characterising Strongly Normalising Intuitionistic Sequent Terms
This paper's sequent term calculus integrates smoothly the λ-terms with generalised application or explicit substitution, and strong normalisability of these terms as sequent terms characterises their typeability in certain "natural" typing systems with intersection types. Expand
Curry-Howard Term Calculi for Gentzen-Style Classical Logics
This thesis believes this is the first time a general notion of cut-elimination for classical sequent calculus has been encoded into a calculus based on a Gentzen-style presentation of classical natural deduction. Expand
Computation with classical sequents
This paper presents the syntax and reduction rules for $\X$ and shows how elaborate calculi can be embedded, such as the λ-calculus, Bloo and Rose's calculus of explicit substitutions λx, Parigot's λμ and Curien and Herbelin's $\lmmt$. Expand
On Zucker’s isomorphism for LJ and its extension to Pure Type Systems
It is shown how the sequent calculus LJ can be embedded into a simple extension of the λ-calculus by generalized applications, called ΛJ. The reduction rules of cut elimination and normalization canExpand
Nested Deduction in Logical Foundations for Computation
This thesis investigates the use of deep inference formalisms as basis for a computational interpretation of proof systems, following the two main approaches: proofs-as-programs andExpand
Cut Elimination in a Class of Sequent Calculi for Pure Type Systems
It is proved that Cut Elimination holds in two important families of normalizing systems, including, in particular, three systems in the Barendregt's λ-cube: λ →, λ2, and λ ω . Expand
Sequent Calculus and Equational Programming
It is shown here that the equational approach corresponds to the use of a focused presentation of a type theory expressed as a sequent calculus, and a typed functional language is presented that relates to the syntax and internal language of Agda. Expand


A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure
A λ-calculus for which applicative terms have no longer the form (...((u u1) u2)... un) but the form [u [u1;...;un], for which [u 1;... ;un] is a list of terms is considered. Expand
The typed λ-calculus is not elementary recursive
  • R. Statman
  • Computer Science
  • 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
It is shown that in general this question cannot be answered by a Turing machine in elementary time, and the computational complexity of related questions concerning the typed λ-calculus (for example, the question of whether a given type contains a closed term). Expand
Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi
This paper has attempted to cover the basic material on natural deduction, sequent calculus, and typed λ-calculus, but also to provide an introduction to Girard's linear logic, one of the most exciting developments in logic these past six years. Expand
A general method for proving the normalization theorem for first and second order typed λ-calculi
In this paper we describe a method for proving the normalization property for a large variety of typed lambda calculi of first and second order, which is based on a proof of equivalence of twoExpand
Intersection and Union Types: Syntax and Semantics
Type assignment systems with intersection and union types are introduced. Although the subject reduction property with respect to s-reduction does not hold for a natural deduction-like system, weExpand
Permutability of Proofs in Intuitionistic Sequent Calculi
It is proved, using a folklore theorem, that two derivations in a cut-free sequent calculus for intuitionistic propositional logic are inter-permutable iff they determine the same natural deduction. Expand
Bounds for cut elimination in intuitionistic propositional logic
This article shall construct a (different) cut free deduction J(d) for the case of intuitionistic propositional logic and derive considerably sharper upper bounds for l(J(d)), and use the methods developed for this purpose in order to set up an effective decision method. Expand
Strong Normalisation of Cut-Elimination in Classical Logic
In this paper a strongly normalizing cut-elimination procedure is presented for classical logic and it is suggested that the symmetric reducibility candidates developed by Barbanera and Berardi should be adapted. Expand
Marginalia on Sequent Calculi
The paper discusses the relationship between normal natural deductions and cutfree proofs in Gentzen (sequent) calculi in the absence of term labeling. For Gentzen calculi this is the usual version;Expand
Termination of Permutative Conversions in Intuitionistic Gentzen Calculi
It is shown that permutative conversions terminate for the cut-free intuitionistic Gentzen (i.e. sequent) calculus; this proves a conjecture by Dyckhoff and Pinto. The main technical tool is a termExpand