This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and
software design and verification, unexpected mathematical beauty. The lambda calculus …

We present a type system that combines, in a controlled way, first-order polymorphism with
intersection types, union types, and subtyping, and prove its safety. We then define a type …

The good properties of Plotkin's call-by-value lambda-calculus crucially rely on the
restriction to weak evaluation and closed terms. Open call-by-value is the more general …

This article is the first part of a two articles series about a calculus with higher-order
polymorphic functions, recursive types with arrow and product type constructors and set …

Intersection types have come a long way since their introduction in the Seventies. They have
been exploited for characterising behaviours of λ-terms and π-calculus processes, building λ …

We present the Delta-calculus, an explicitly typed lambda-calculus with strong pairs,
projections and explicit type coercions. The calculus can be parametrized with different …

This paper provides a characterization of call-by-value solvability using call-by-value multi
types. Our work is based on Accattoli and Paolini's characterization of call-by-value solvable …

We introduce the Delta-framework, LF-Delta, a dependent type theory based on the
Edinburgh Logical Framework LF, extended with the strong proof-functional connectives, ie …

We present a new proof of decidability of higher-order subtyping in the presence of bounded
quantification. The algorithm is formulated as a judgement which operates on beta-eta …

The aim of this thesis is the integration of gradual typing into systems with intersection types.
We focus on two target calculi for this analysis: the λ-calculus and the core object calculus …