We introduce a call-by-name lambda-calculus λJ with generalized applications which
integrates a notion of distant reduction that allows to unblock β-redexes without resorting to …

In the context of intuitionistic sequent calculus,“naturality” means permutation-freeness (the
terminology is essentially due to Mints). We study naturality in the context of the lambda …

In the context of intuitionistic implicational logic, we achieve a perfect correspondence
(technically an isomorphism) between sequent calculus and natural deduction, based on …

Multiary sequent terms were originally introduced as a tool for proving termination of
permutative conversions in cut-free sequent calculus. This work develops the language of …

At the heart of the connections between Proof Theory and Type Theory, the Curry-Howard
correspondence provides proof-terms with computational features and equational theories …

The lambda-calculus is a mathematical model of functional programming languages, with an
emphasis on function application. Variants of the calculus are of interest to model specific …

This paper gives a comprehensive and coherent view on permutability in the intuitionistic
sequent calculus with cuts. Specifically we show that, once permutability is packaged into …

We introduce a call-by-name lambda-calculus lambdaJ with generalized applications which
integrates a notion of distant reduction that allows to unblock beta-redexes without resorting …

In the context of intuitionistic sequent calculus, naturality means permutation-freeness (the
terminology is essentially due to Mints). We study naturality in the context of the lambda …

In the context of intuitionistic sequent calculus,“naturality” means permutation-freeness (the
terminology is essentially due to Mints). We study naturality in the context of the lambda …