Implementing Open Call-by-Value - Fundamentals of Software Engineering Access content directly
Conference Papers Year : 2017

Implementing Open Call-by-Value


The theory of the call-by-value λ-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proof assistants, however, strong evaluation and open terms are required. Open call-by-value is the intermediate setting of weak evaluation with open terms, on top of which Grégoire and Leroy designed the abstract machine of Coq. This paper provides a theory of abstract machines for open call-by-value. The literature contains machines that are either simple but inefficient, as they have an exponential overhead, or efficient but heavy, as they rely on a labelling of environments and a technical optimization. We introduce a machine that is simple and efficient: it does not use labels and it implements open call-by-value within a bilinear overhead. Moreover, we provide a new fine understanding of how different optimizations impact on the complexity of the overhead. This work is part of a wider research effort, the COCA HOLA project
Fichier principal
Vignette du fichier
Accattoli, Guerrieri - Implementing Open CbV.pdf (410.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01675365 , version 1 (04-01-2018)





Beniamino Accattoli, Giulio Guerrieri. Implementing Open Call-by-Value. 7th International Conference on Fundamentals of Software Engineering (FSEN), Apr 2017, Teheran, Iran. pp.1-19, ⟨10.1007/978-3-319-68972-2_1⟩. ⟨hal-01675365⟩
388 View
262 Download



Gmail Facebook X LinkedIn More