Abstract. 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 can be precisely correlated, if explicit substitutions are added to ΛJ. The resulting system ΛJ ✷ is proved strongly normalizing, thus showing strong normalization for Gentzen’s cut elimination steps. This refines previous results by Zucker, Pottinger and Herbelin on the isomorphism between natural deduction and sequent calculus. The concept of generalized applications extends to Pure Type Systems, so that in particular sequent calculus analogues for all systems of the λ-cube arise. Cut elimination and strong β-normalization are shown to b...
Pure type systems are an elegant formalism allowing to specify in a very easy way a large number of ...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
International audienceWe study isomorphisms of types in the system of simply-typed λ-calculus with i...
It is shown how the sequent calculus LJ can be embedded into a simple extension of the -calculus by...
Abstract. A proof theoretical analysis suggests that the process of cut elimination in a sequent cal...
A proof theoretical analysis suggests that the process of cut elimination in a sequent calculus corr...
We define an equivalent variant $LK_{sp}$ of the Gentzen sequent calculus $LK$. In $LK_{sp}$ weakeni...
When defined with general elimination/application rules, natural deduction and $\lambda$-calculus b...
Date of Acceptance: 01/2015We present a proof (of the main parts of which there is a formal version,...
AbstractThis paper present a new sequent calculus for Pure Type Systems (PTS). The calculus proposed...
AbstractWe present a typed pattern calculus with explicit pattern matching and explicit substitution...
Cut-free proofs in Herbelin's sequent calculus are in 1-1 correspondence with normal natural deducti...
Abstract. In this paper a strongly normalising cut-elimination procedure is presented for classical ...
AbstractWe study isomorphisms of types in the system of simply-typed λ-calculus with inductive types...
AbstractWe present a typed calculus λξ isomorphic to the implicational fragment of the classical seq...
Pure type systems are an elegant formalism allowing to specify in a very easy way a large number of ...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
International audienceWe study isomorphisms of types in the system of simply-typed λ-calculus with i...
It is shown how the sequent calculus LJ can be embedded into a simple extension of the -calculus by...
Abstract. A proof theoretical analysis suggests that the process of cut elimination in a sequent cal...
A proof theoretical analysis suggests that the process of cut elimination in a sequent calculus corr...
We define an equivalent variant $LK_{sp}$ of the Gentzen sequent calculus $LK$. In $LK_{sp}$ weakeni...
When defined with general elimination/application rules, natural deduction and $\lambda$-calculus b...
Date of Acceptance: 01/2015We present a proof (of the main parts of which there is a formal version,...
AbstractThis paper present a new sequent calculus for Pure Type Systems (PTS). The calculus proposed...
AbstractWe present a typed pattern calculus with explicit pattern matching and explicit substitution...
Cut-free proofs in Herbelin's sequent calculus are in 1-1 correspondence with normal natural deducti...
Abstract. In this paper a strongly normalising cut-elimination procedure is presented for classical ...
AbstractWe study isomorphisms of types in the system of simply-typed λ-calculus with inductive types...
AbstractWe present a typed calculus λξ isomorphic to the implicational fragment of the classical seq...
Pure type systems are an elegant formalism allowing to specify in a very easy way a large number of ...
Abstract. In a previous paper [4], we introduced a non-deterministic λ-calculus (λ-LK) whose type sy...
International audienceWe study isomorphisms of types in the system of simply-typed λ-calculus with i...