TY - GEN
T1 - Open call-by-value
AU - Accattoli, Beniamino
AU - Guerrieri, Giulio
PY - 2016/10/9
Y1 - 2016/10/9
N2 - The elegant theory of the call-by-value lambda-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, and it is well known that the operational semantics of call-by-value becomes problematic in this case. Here we study the intermediate setting—that we call Open Callby- Value—of weak evaluation with open terms, on top of which Grégoire and Leroy designed the abstract machine of Coq. Various calculi for Open Call-by-Value already exist, each one with its pros and cons. This paper presents a detailed comparative study of the operational semantics of four of them, coming from different areas such as the study of abstract machines, denotational semantics, linear logic proof nets, and sequent calculus. We show that these calculi are all equivalent from a termination point of view, justifying the slogan Open Call-by-Value.
AB - The elegant theory of the call-by-value lambda-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, and it is well known that the operational semantics of call-by-value becomes problematic in this case. Here we study the intermediate setting—that we call Open Callby- Value—of weak evaluation with open terms, on top of which Grégoire and Leroy designed the abstract machine of Coq. Various calculi for Open Call-by-Value already exist, each one with its pros and cons. This paper presents a detailed comparative study of the operational semantics of four of them, coming from different areas such as the study of abstract machines, denotational semantics, linear logic proof nets, and sequent calculus. We show that these calculi are all equivalent from a termination point of view, justifying the slogan Open Call-by-Value.
UR - http://www.scopus.com/inward/record.url?scp=84992458081&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-47958-3_12
DO - 10.1007/978-3-319-47958-3_12
M3 - Chapter in a published conference proceeding
AN - SCOPUS:84992458081
SN - 9783319479576
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 206
EP - 226
BT - Programming Languages and Systems - 14th Asian Symposium, APLAS 2016, Proceedings
A2 - Igarashi, Atsushi
PB - Springer Verlag
T2 - 14th Asian Symposium on Programming Languages and Systems, APLAS 2016
Y2 - 21 November 2016 through 23 November 2016
ER -