Luca Paolini

Publications
Influence

S. Rocca, Luca Paolini
Computer Science
2004

To study the operational behaviour of λ-terms, we will use the denotational (mathematical) approach. Expand

S. Rocca, Luca Paolini
Mathematics
2004

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

Call-by-value Solvability

Luca Paolini, S. Rocca
Computer Science, Mathematics
RAIRO Theor. Informatics Appl.
1 November 1999

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

The Parametric Lambda Calculus

S. Rocca, Luca Paolini
Computer Science
Texts in Theoretical Computer Science
2004

We present a list of functions that can be used to evaluate the discriminability of a set of functions. Expand

Call-by-Value Solvability, Revisited

Beniamino Accattoli, Luca Paolini
Mathematics, Computer Science
FLOPS
23 May 2012

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

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 forms… Expand

The Parametric Lambda-Calculus: a Metamodel for Computation

S. Rocca, Luca Paolini
Mathematics
2004

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

Parametric parameter passing Lambda-calculus

Luca Paolini, S. Rocca
Computer Science, Mathematics
Inf. Comput.
25 February 2004

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

On a Class of Reversible Primitive Recursive Functions and Its Turing-Complete Extensions

Luca Paolini, M. Piccolo, L. Roversi
Computer Science
New Generation Computing
13 August 2018

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

Lazy Strong Normalization

Luca Paolini, E. Pimentel, S. Rocca
Computer Science, Mathematics
Electron. Notes Theor. Comput. Sci.
1 July 2005

This paper presents a logical characterization of lazy strongly @b-normalizing terms using intersection types. Expand

Recommended Authors