The Complexity of Abstract Machines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

The Complexity of Abstract Machines


The λ-calculus is a peculiar computational model whose definition does not come with a notion of machine. Unsurprisingly, implementations of the λ-calculus have been studied for decades. Abstract machines are implementations schemas for fixed evaluation strategies that are a compromise between theory and practice: they are concrete enough to provide a notion of machine and abstract enough to avoid the many intricacies of actual implementations. There is an extensive literature about abstract machines for the λ-calculus, and yet—quite mysteriously—the efficiency of these machines with respect to the strategy that they implement has almost never been studied. This paper provides an unusual introduction to abstract machines, based on the complexity of their overhead with respect to the length of the implemented strategies. It is conceived to be a tutorial, focusing on the case study of implementing the weak head (call-by-name) strategy, and yet it is an original re-elaboration of known results. Moreover, some of the observations contained here never appeared in print before.
Fichier principal
Vignette du fichier
Accattoli - The Complexity of Abstract Machines.pdf (213.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01425560 , version 1 (03-01-2017)



Beniamino Accattoli. The Complexity of Abstract Machines. Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2016), Jun 2016, Porto, Portugal. pp.1 - 15, ⟨10.4204/EPTCS.235.1⟩. ⟨hal-01425560⟩
125 View
82 Download



Gmail Facebook Twitter LinkedIn More