Implementing Open Call-by-Value

Beniamino Accattoli (1) , Giulio Guerrieri (2)

1 PARSIFAL - Proof search and reasoning with logic specifications
2 I2M - Institut de Mathématiques de Marseille

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 https://sites.google.com/site/beniaminoaccattoli/coca-hola.

Domaines: Logique en informatique [cs.LO]

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⟩