The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be
extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi …

We develop an intersection type system for the λ¯ μμ˜ calculus of Curien and Herbelin. This
calculus provides a symmetric computational interpretation of classical sequent style logic …

This paper studies intersection and union type assignment for the calculus λ¯ μμ̃ (Curien
and Herbelin, 2000 [16]), a proof-term syntax for Gentzen's classical sequent calculus, with …

The symmetric λμ-calculus is the λμ-calculus introduced by Parigot in which the reduction
rule μ′, which is the symmetric of μ, is added. We give arithmetical proofs of some strong …

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 …

We present a version of system Fω, called Fωc, in which the layer of type constructors is
essentially the traditional one of Fω, whereas provability of types is classical. The proof-term …

We give arithmetical proofs of the strong normalization of two symmetric $\lambda $-calculi
corresponding to classical logic. The first one is the $\bar {\lambda}\mu\tilde {\mu} $-calculus …

With the eye on defining a type-based semantics, this paper defines intersection and union
type assignment for the sequent calculus 𝒳, a substitution-free language that enjoys the …

We present a judgemental formulation of natural deduction for classical logic, similar in spirit
to Wadler's dual calculus, but founded on the logical judgements A true and A false; proof-by …

The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be
extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi …