Abstract Machines for Open Call-by-Value - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Science of Computer Programming Année : 2019

Abstract Machines for Open Call-by-Value

Résumé

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 (possibly) open terms, on top of which Grégoire and Leroy designed one of the abstract machines of Coq. This paper provides a theory of abstract machines for the fireball calculus, the simplest presentation of 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 labeling of environments and a technical optimization. We introduce a machine that is simple and efficient: it does not use labels and it implements the fireball calculus within a bilinear overhead. Moreover, we provide a new fine understanding of how different optimizations impact on the complexity of the overhead, and evidence that the time cost model we work with is minimal.
Fichier principal
Vignette du fichier
1-s2.0-S016764231830042X-main.pdf (963.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02415780 , version 1 (17-12-2019)

Identifiants

Citer

Beniamino Accattoli, Giulio Guerrieri. Abstract Machines for Open Call-by-Value. Science of Computer Programming, 2019, 184, ⟨10.1016/j.scico.2019.03.002⟩. ⟨hal-02415780⟩
84 Consultations
164 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More