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

Inductive characterizations of the sets of terms, the subset of strongly normalizing terms and
normal forms are studied in order to reprove weak and strong normalization for the simply …

Multi types–aka non-idempotent intersection types–have been used. to obtain quantitative
bounds on higher-order programs, as pioneered by de Carvalho. Notably, they bound at the …

Rewriting is a general and expressive way of specifying concurrent systems, where
concurrent transitions are axiomatized by rewrite rules. Narrowing is a complete symbolic …

We present a typing system with non-idempotent intersection types, typing a term syntax
covering three different calculi: the pure λ-calculus, the calculus with explicit substitutions λ …

Multi types—aka non-idempotent intersection types—have been used to obtain quantitative
bounds on higher-order programs, as pioneered by de Carvalho. Notably, they bound at the …

This thesis is on termination of computer programs. By termination we mean that the task
given to a computer is processed in a certain amount of time, as opposed to taking infinitely …

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 …

We prove that type systems are able to capture exact measures related to dynamic
properties of functional programs with control operators, which allow implementing intricate …

In the first part of this paper, we define two resource aware typing systems for the λµ-calculus
based on non-idempotent intersection and union types. The non-idempotent approach …