We solve the inhabitation problem for a language called λ!, a subsuming paradigm (inspired
by call-by-push-value) being able to encode, among others, call-by-name and call-by-value …

This article explores the use of non-idempotent intersection types in the framework of the λ-
calculus. Different topics are presented in a uniform framework: head normalization, weak …

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 …

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 …

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 …

Starting from an exact correspondence between linear approximations and non-idempotent
intersection types, we develop a general framework for building systems of intersection …

Randomized higher-order computation can be seen as being captured by a λ-calculus
endowed with a single algebraic operation, namely a construct for binary probabilistic …

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 …