• Publications
  • Influence
λ Δ -Models
TLDR
To study the operational behaviour of λ-terms, we will use the denotational (mathematical) approach. Expand
  • 801
  • 60
  • PDF
The Parametric λ-Calculus
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 inExpand
  • 15
  • 8
Call-by-value Solvability
TLDR
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
  • 48
  • 4
  • PDF
The Parametric Lambda Calculus
TLDR
We present a list of functions that can be used to evaluate the discriminability of a set of functions. Expand
  • 38
  • 4
  • PDF
Call-by-Value Solvability, Revisited
TLDR
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
  • 33
  • 3
Call-by-Value Separability and Computability
  • Luca Paolini
  • Mathematics, Computer Science
  • ICTCS
  • 4 October 2001
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 formsExpand
  • 16
  • 3
The Parametric Lambda-Calculus: a Metamodel for Computation
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
  • 36
  • 2
  • PDF
Parametric parameter passing Lambda-calculus
TLDR
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
  • 18
  • 2
On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions
TLDR
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
  • 12
  • 2
Lazy Strong Normalization
TLDR
This paper presents a logical characterization of lazy strongly @b-normalizing terms using intersection types. Expand
  • 10
  • 2
  • PDF