14 citations · 23 across the 9 of their papers we have counts for
6 papers
The Theory of Call-by-Value Solvability (long version)
Beniamino Accattoli, Giulio Guerrieri
The denotational semantics of the untyped lambda-calculus is a well developed field built around the concept of solvable terms, which are elegantly characterized in many different…
The Complexity of Abstract Machines
Beniamino Accattoli
The lambda-calculus is a peculiar computational model whose definition does not come with a notion of machine. Unsurprisingly, implementations of the lambda-calculus have been stud…
Open Call-by-Value (Extended Version)
Beniamino Accattoli, Giulio Guerrieri
The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proo…
Distilling Abstract Machines (Long Version)
Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza
It is well-known that many environment-based abstract machines can be seen as strategies in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear…
Beta Reduction is Invariant, Indeed (Long Version)
Beniamino Accattoli, Ugo Dal Lago
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is -calculus a reasonable machine?…
On the Invariance of the Unitary Cost Model for Head Reduction (Long Version)
Beniamino Accattoli, Ugo Dal Lago
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a con…