Beniamino Accattoli

Learn More
A famous result by Milner is that the λ -calculus can be simulated inside the π-calculus. This simulation, however, holds only modulo strong bisimilarity on processes, i.e. there is a slight mismatch between β -reduction and how it is simulated in the π-calculus. The idea is that evaluating a λ -term in the π-calculus is like running an environment-based(More)
Slot and van Emde Boas' weak invariance thesis states that <i>reasonable</i> machines can simulate each other within a polynomially overhead in time. Is &#955;-calculus a reasonable machine? Is there a way to measure the computational complexity of a &#955;-term? This paper presents the first complete positive answer to this long-standing problem. Moreover,(More)
The λ-calculus is a widely accepted computational model of higher-order functional programs, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing λ-terms to their normal form is typically studied by reasoning on concrete implementation algorithms. In this paper, we show that when(More)
In the call-by-value lambda-calculus solvable terms have been characterised by means of call-by-name reductions, which is disappointing and requires complex reasonings. We introduce the valuesubstitution lambda-calculus, a simple calculus borrowing ideas from Herbelin and Zimmerman’s call-by-value λCBV calculus and from Accattoli and Kesner’s substitution(More)
This paper gives a detailed account of the relationship between (a variant of) the call-by-value lambda calculus and linear logic proof nets. The presentation is carefully tuned in order to realize a strong bisimulation between the two systems: every single rewriting step on the calculus maps to a single step on the nets, and viceversa. In this way, we(More)
Strong normalization for linear logic requires elaborated rewriting techniques. In this paper we give a new presentation of MELL proof nets, without any commutative cut-elimination rule. We show how this feature induces a compact and simple proof of strong normalization, via reducibility candidates. It is the first proof of strong normalization for MELL(More)
Inspired by a recent graphical formalism for λ-calculus based on Linear Logic technology, we introduce an untyped structural λ-calculus, called λj, which combines action at a distance with exponential rules decomposing the substitution by means of weakening, contraction and dereliction. Firstly, we prove fundamental properties such as confluence and(More)