|Title:||An approach to call-by-name delimited continuations||Journal:||Conference Record of the Annual ACM Symposium on Principles of Programming Languages||First page:||383||Last page:||394||Conference:||35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'08; San Francisco, CA; United States; 7 January 2008 through 12 January 2008||Issue Date:||1-Dec-2008||ISBN:||978-1-595-93689-9||DOI:||10.1145/1328438.1328484||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.
|Keywords:||boehm separability | classical logic | delimited control | observational completeness||Publisher:||Association for Computing Machinery|
Show full item record
checked on Mar 20, 2023
checked on Mar 21, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.