Skip to Main content Skip to Navigation
Conference papers

The Useful MAM, a Reasonable Implementation of the Strong $\lambda$-Calculus

Beniamino Accattoli 1, 2
1 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : It has been a long-standing open problem whether the strong λ-calculus is a reasonable computational model, i.e. whether it can be implemented within a polynomial overhead with respect to the number of β-steps on models like Turing machines or RAM. Recently, Accattoli and Dal Lago solved the problem by means of a new form of sharing, called useful sharing, and realised via a calculus with explicit substitutions. This paper presents a new abstract machine for the strong λ-calculus based on useful sharing, the Useful Milner Abstract Machine, and proves that it reasonably implements leftmost-outermost evaluation. It provides both an alternative proof that the λ-calculus is reasonable and an improvement on the technology for implementing strong evaluation.
Document type :
Conference papers
Complete list of metadata
Contributor : Beniamino Accattoli <>
Submitted on : Tuesday, January 3, 2017 - 3:57:57 PM
Last modification on : Friday, April 30, 2021 - 10:02:42 AM
Long-term archiving on: : Tuesday, April 4, 2017 - 2:37:40 PM


Files produced by the author(s)




Beniamino Accattoli. The Useful MAM, a Reasonable Implementation of the Strong $\lambda$-Calculus. 23rd International Workshop on Logic, Language, Information, and Computation (WoLLIC 2016), Aug 2016, Puebla, Mexico. pp.1 - 21, ⟨10.1007/978-3-662-52921-8_1⟩. ⟨hal-01425534⟩



Record views


Files downloads