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 …

Whether the number of β-steps in the λ-calculus can be taken as a reasonable time cost
model (that is, polynomially related to the one of Turing machines) is a delicate problem …

This paper studies the strength of embedding Call-by-Name (dCBN) and Call-by-Value
(dCBV) into a unifying framework called the Bang Calculus (dBANG). These embeddings …

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 …

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 …

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 …

We present a call-by-need strategy for computing strong normal forms of open terms
(reduction is admitted inside the body of abstractions and substitutions, and the terms may …

To better understand Barendregt's genericity for the untyped call-by-value λ-calculus, we
start by first revisiting it in call-by-name, adopting a lighter statement and establishing a …

Extending the λ-calculus with a construct for sharing, such as let expressions, enables a
special representation of terms: iterated applications are decomposed by introducing …