Skip to main content
Conference Record of the Annual ACM Symposium on Principles of Programming Languages2008, Pages 383-39435th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'08; San Francisco, CA; United States; 7 January 2008 through 12 January 2008; Code 92387

An approach to call-by-name delimited continuations(Conference Paper)(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 Boehm'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. © 2008 ACM.

Author keywords

boehm separabilityclassical logicdelimited controlobservational completeness

Indexed keywords

Engineering uncontrolled termsboehm separabilityCall-by-nameClassical logicComparative studiesobservational completenessOperational semanticsShift-andUniform framework
Engineering controlled terms:BiomineralizationComputer programming languagesSemanticsTheorem proving
Engineering main heading:Calculations
  • ISSN: 07308566
  • ISBN: 978-159593689-9
  • CODEN: CRLAD
  • Source Type: Conference Proceeding
  • Original language: English
  • DOI: 10.1145/1328438.1328484
  • Document Type: Conference Paper
  • Sponsors: ACM SIGPLAN

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

Cited by 15 documents

Ostermann, K. , Binder, D. , Skupin, I.
Introduction and elimination, left and right
(2022) Proceedings of the ACM on Programming Languages
Pédrot, P.-M.
Russian Constructivism in a Prefascist Theory
(2020) ACM International Conference Proceeding Series
Miquey, É.
A classical sequent calculus with dependent types
(2019) ACM Transactions on Programming Languages and Systems
View details of all 15 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: