This work presents an extension with cuts of Schwichtenberg's multiary sequent calculus. We identify a set of permutative conversions on it, prove their termination and confluence and establish the permutability theorem. We present our sequent calculus as the typing system of the {\em generalised multiary $\lambda$-calculus} lambda-Jm, a new calculus introduced in this work. Lambda-Jm corresponds to an extension of $\lambda$-calculus with a notion of {\em generalised multiary application}, which may be seen as a function applied to a list of arguments and then explicitly substituted in another term. Proof-theoretically the corresponding typing rule encompasses, in a modular way, generalised eliminations of von Plato and Herbelin's head cuts...
. We describe a sequent calculus MJ, based on work of Herbelin, of which the cutfree derivations are...
The intuitionistic fragment of the call-by-name version of Curien andHerbelin's \lambda\_mu\_{\~mu}-...
International audienceDisplay calculi are generalised sequent calculi which enjoy a `canonical' cut ...
This work presents an extension with cuts of Schwichtenberg's multiary sequent calculus. We identify...
Multiary sequent terms were originally introduced as a tool for proving termination of permutative ...
We prove a folklore theorem, that two derivations in a cut-free sequent calculus for intuitionistic ...
In a previous work we introduced the {\em generalised multiary $\lambda$-calculus} lambda-Jm, an ex...
AbstractWe prove a folklore theorem, that two derivations in a cut-free sequent calculus for intuiti...
AbstractIt is shown that permutative conversions terminate for the cut-free intuitionistic Gentzen (...
This paper gives a comprehensive and coherent view on permutability in the intuitionistic sequent ca...
In the context of intuitionistic implicational logic, we achieve a perfect correspondence (technical...
In the context of intuitionistic sequent calculus, “naturality” means permutation-freeness (the term...
This paper gives a comprehensive and coherent view on permutability in the intuitionistic sequent ca...
International audienceWe apply an idea originated in the theory of programming languages - monadic m...
Many important results in proof theory for sequent calculus (cut-elimination, completeness and other...
. We describe a sequent calculus MJ, based on work of Herbelin, of which the cutfree derivations are...
The intuitionistic fragment of the call-by-name version of Curien andHerbelin's \lambda\_mu\_{\~mu}-...
International audienceDisplay calculi are generalised sequent calculi which enjoy a `canonical' cut ...
This work presents an extension with cuts of Schwichtenberg's multiary sequent calculus. We identify...
Multiary sequent terms were originally introduced as a tool for proving termination of permutative ...
We prove a folklore theorem, that two derivations in a cut-free sequent calculus for intuitionistic ...
In a previous work we introduced the {\em generalised multiary $\lambda$-calculus} lambda-Jm, an ex...
AbstractWe prove a folklore theorem, that two derivations in a cut-free sequent calculus for intuiti...
AbstractIt is shown that permutative conversions terminate for the cut-free intuitionistic Gentzen (...
This paper gives a comprehensive and coherent view on permutability in the intuitionistic sequent ca...
In the context of intuitionistic implicational logic, we achieve a perfect correspondence (technical...
In the context of intuitionistic sequent calculus, “naturality” means permutation-freeness (the term...
This paper gives a comprehensive and coherent view on permutability in the intuitionistic sequent ca...
International audienceWe apply an idea originated in the theory of programming languages - monadic m...
Many important results in proof theory for sequent calculus (cut-elimination, completeness and other...
. We describe a sequent calculus MJ, based on work of Herbelin, of which the cutfree derivations are...
The intuitionistic fragment of the call-by-name version of Curien andHerbelin's \lambda\_mu\_{\~mu}-...
International audienceDisplay calculi are generalised sequent calculi which enjoy a `canonical' cut ...