48 citations · 142 across the 34 of their papers we have counts for
4 papers · 1 filter
The Maximal MAM, a Reasonable Implementation of the Maximal Strategy
Beniamino Accattoli
This note is about a reasonable abstract machine, called Maximal MAM, implementing the maximal strategy of the lambda-calculus, that is, the strategy that always produces a longest…
Encoding Turing Machines into the Deterministic Lambda-Calculus
Ugo Dal Lago, Beniamino Accattoli
This note is about encoding Turing machines into the lambda-calculus.
Implementing Open Call-by-Value (Extended Version)
Beniamino Accattoli, Giulio Guerrieri
The 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 proof assist…
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…