Open call-by-value

Beniamino Accattoli, Giulio Guerrieri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - 14th Asian Symposium, APLAS 2016, Proceedings
Subtitle of host publicationAPLAS 2016
EditorsAtsushi Igarashi
PublisherSpringer Verlag
Pages206-226
Number of pages21
ISBN (Print)9783319479576
DOIs
Publication statusPublished - 9 Oct 2016
Event14th Asian Symposium on Programming Languages and Systems, APLAS 2016 - Hanoi, Viet Nam
Duration: 21 Nov 201623 Nov 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10017 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th Asian Symposium on Programming Languages and Systems, APLAS 2016
CountryViet Nam
CityHanoi
Period21/11/1623/11/16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Accattoli, B., & Guerrieri, G. (2016). Open call-by-value. In A. Igarashi (Ed.), Programming Languages and Systems - 14th Asian Symposium, APLAS 2016, Proceedings: APLAS 2016 (pp. 206-226). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10017 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-47958-3_12

Open call-by-value. / Accattoli, Beniamino; Guerrieri, Giulio.

Programming Languages and Systems - 14th Asian Symposium, APLAS 2016, Proceedings: APLAS 2016. ed. / Atsushi Igarashi. Springer Verlag, 2016. p. 206-226 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10017 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Accattoli, B & Guerrieri, G 2016, Open call-by-value. in A Igarashi (ed.), Programming Languages and Systems - 14th Asian Symposium, APLAS 2016, Proceedings: APLAS 2016. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10017 LNCS, Springer Verlag, pp. 206-226, 14th Asian Symposium on Programming Languages and Systems, APLAS 2016, Hanoi, Viet Nam, 21/11/16. https://doi.org/10.1007/978-3-319-47958-3_12
Accattoli B, Guerrieri G. Open call-by-value. In Igarashi A, editor, Programming Languages and Systems - 14th Asian Symposium, APLAS 2016, Proceedings: APLAS 2016. Springer Verlag. 2016. p. 206-226. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-47958-3_12
Accattoli, Beniamino ; Guerrieri, Giulio. / Open call-by-value. Programming Languages and Systems - 14th Asian Symposium, APLAS 2016, Proceedings: APLAS 2016. editor / Atsushi Igarashi. Springer Verlag, 2016. pp. 206-226 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{df426250cc0740fe9d6307e8e1ca7c15,
title = "Open call-by-value",
abstract = "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{\'e}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.",
author = "Beniamino Accattoli and Giulio Guerrieri",
year = "2016",
month = "10",
day = "9",
doi = "10.1007/978-3-319-47958-3_12",
language = "English",
isbn = "9783319479576",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "206--226",
editor = "Atsushi Igarashi",
booktitle = "Programming Languages and Systems - 14th Asian Symposium, APLAS 2016, Proceedings",

}

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 - Conference contribution

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

ER -