A calculus is a language equipped with some reduction rules. All the calculi we consider in this book share the same language, which is the language of λ-calculus, while they differ each other in… Expand

The notion of solvability in the call-by-value λ -calculus is defined and completely characterized, both from an operational and a logical point of view.Expand

We introduce the value-substitution lambda-calculus, a simple calculus borrowing ideas from Herbelin and Zimmerman's call-by-value λ CBV calculus and from Accattoli and Kesner's substitution calculus λ sub .Expand

The aim of this paper is to study the notion of separability in the call-by-value setting.Separability is the key notion used in the Bohm Theorem, proving that syntactically different s?-normal forms… Expand

I. Syntax.- 1. The Parametric ?-Calculus.- 2. The Call-by-Name ?-Calculus.- 3. The Call-by-Value ?-Calculus.- 4. Further Reading.- II. Operational Semantics.- 5. Parametric Operational Semantics.- 6.… Expand

A λ-calculus is defined, which is parametric with respect to a set V of input values and subsumes all the different Φ-calculi given in the literature, under which it enjoys the standardization property.Expand

We present the reversible primitive recursive functions (RPRF), a class of reversible (endo-)functions over natural numbers which allows to capture interesting extensional aspects of reversible computation in a formalism quite close to that of classical primitive recursion functions.Expand