Skip to main content
ACM SIGPLAN NoticesVolume 43, Issue 1, January 2008, Pages 383-394

An approach to call-by-name delimited continuations(Article)(Open Access)

  Save all to author list
  • aINRIA Futurs, France
  • bFaculty of Engineering, University of Novi Sad, Serbia

Abstract

We show that a variant of Parigot's λ;μ-calculus, originally due to de Groote and proved to satisfy Böhm's theorem by Saurin, is canonically interpretable as a call-by-name calculus of delimited control. This observation is expressed using Ariola et al's call-by-value calculus of delimited control, an extension of λ;μ-calculus with delimited control known to be equationally equivalent to Danvy and Filinski's calculus with shift and reset. Our main result then is that de Groote and Saurin's variant of λ;μ-calculus is equivalent to a canonical call-by-name variant of Ariola et al's calculus. The rest of the paper is devoted to a comparative study of the call-by-name and call-by-value variants of Ariola et al's calculus, covering in particular the questions of simple typing, operational semantics, and continuation-passing-style semantics. Finally, we discuss the relevance of Ariola et al's calculus as a uniform framework for representing different calculi of delimited continuations, including "lazy" variants such as Sabry's shift and lazy reset calculus. Copyright © 2008 ACM.

Author keywords

Böhm separabilityClassical logicDelimited controlObservational completeness

Indexed keywords

Engineering controlled terms:BiomineralizationSemanticsTemporal logic
Engineering uncontrolled termsCall-by-nameClassical logicComparative studiesContinuation-passing styleMu-calculusObservational completenessOperational semanticsUniform framework
Engineering main heading:Calculations
  • ISSN: 15232867
  • Source Type: Journal
  • Original language: English
  • DOI: 10.1145/1328897.1328484
  • Document Type: Article
  • Publisher: Association for Computing Machinery (ACM)

  Herbelin, H.; INRIA Futurs, France;
© Copyright 2020 Elsevier B.V., All rights reserved.

Cited by 7 documents

Abe, T. , Kimura, D.
Extending a Call-by-Value Calculus Based on Bilateralism with Dynamic Binding
(2023) Journal of Applied Logics
Barenbaum, P. , Freund, T.
Proofs and Refutations for Intuitionistic and Second-Order Logic
(2023) Leibniz International Proceedings in Informatics, LIPIcs
Tanaka, A. , Kameyama, Y.
A call-by-name CPS hierarchy
(2012) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
View details of all 7 citations
{"topic":{"name":"Lambda-calculus; Call by Value; Theory of Computation","id":11482,"uri":"Topic/11482","prominencePercentile":55.13131,"prominencePercentileString":"55.131","overallScholarlyOutput":0},"dig":"631bd6eeca0136a0469ef8edb2aafbed20b81fcc1c5c8566aafdba4bd4f33019"}

SciVal Topic Prominence

Topic:
Prominence percentile: