302 articles – 345 references  [version française]
HAL: inria-00524949, version 1

See detailed view  BibTeX,EndNote,...
Symposium on Principles of Programming Languages, San Francisco : États-Unis (2008)
An Approach to Call-by-Name Delimited Continuations
Hugo Herbelin 1, Silvia Ghilezan 2
(2008)

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 delim- ited 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.
1:  TYPICAL (INRIA Saclay - Ile de France)
INRIA – CNRS : UMR – Polytechnique - X
2:  Faculty of engineering, University of Novi Sad
University of Novi Sad
Computer Science/Logic in Computer Science
Delimited control – Observational equivalence – Böhm separability – Classical logic
Attached file list to this document: 
PDF
popl-HerGhi08-cbn-delim.pdf(214.1 KB)