The semantics of the untyped (call-by-name) lambda-calculus is a well developed field built
around the concept of solvable terms, which are elegantly characterized in many different …

Abstract Call-by-Push-Value (CBPV) is a programming paradigm subsuming both Call-by-
Name (CBN) and Call-by-Value (CBV) semantics. The essence of this paradigm is captured …

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 …

Accattoli, Dal Lago, and Vanoni have recently proved that the space used by the Space
KAM, a variant of the Krivine abstract machine, is a reasonable space cost model for the λ …

Evaluating higher-order functional programs through abstract machines inspired by the
geometry of the interaction is known to induce space efficiencies, the price being time …

This paper explores how the intersection type theories of call-by-name (CBN) and call-by-
value (CBV) can be unified in a more general framework provided by call-by-push-value …

We show that recent approaches to static analysis based on quantitative typing systems can
be extended to programming languages with global state. More precisely, we define a call …

We study the two Girard's translations of intuitionistic implication into linear logic by
exploiting the bang calculus, a paradigmatic functional language with an explicit box …

A cornerstone of the theory of λ-calculus is that intersection types characterise termination
properties. They are a flexible tool that can be adapted to various notions of termination, and …

This paper shows that the recent approach to quantitative typing systems for programming
languages can be extended to pattern matching features. Indeed, we define two resource …