The formal systems that are nowadays called λ-calculus and combinatory logic were both
invented in the 1920s, and their aim was to describe the most basic properties of function …

This thesis contains a study of the proof theory of classical logic and addresses the problem
of giving a computational interpretation to classical proofs. This interpretation aims to …

Many different systems with explicit substitutions have been proposed to implement a large
class of higher-order languages. Motivations and challenges that guided the development of …

Calculi with explicit substitutions (ES) are widely used in different areas of computer science.
Complex systems with ES were developed these last 15 years to capture the good …

We present a simple term calculus with an explicit control of erasure and duplication of
substitutions, enjoying a sound and complete correspondence with the intuitionistic fragment …

The formal systems that are nowadays called λ-calculus and combinatory logic were both
invented in the 1920s, and their aim was to describe the most basic properties of function …

In this paper, we show the correspondence existing between normalization in calculi with
explicit substitution and cut elimination in sequent calculus for linear logic, via proof nets …

We present a new system of intersection types for a composition-free calculus of explicit
substitutions with a rule for garbage collection, and show that it characterizes those terms …

There are many people that have played an important r^ ole during the research for and the
writing of this thesis. I would like to mention, in no particular order: my friends Marcel and …

is an untyped continuation-style formal language with a typed subset that provides a Curry–
Howard isomorphism for a sequent calculus for implicative classical logic. can also be …