Biernacka, Malgorzata and Biernacki, Dariusz and Danvy, Olivier - An Operational Foundation for Delimited Continuations in<br><br> the<br><br><br> CPS<br><br> Hierarchy

lmcs:2269 - Logical Methods in Computer Science, November 8, 2005, Volume 1, Issue 2
An Operational Foundation for Delimited Continuations in<br><br> the<br><br><br> CPS<br><br> Hierarchy

Authors: Biernacka, Malgorzata and Biernacki, Dariusz and Danvy, Olivier

We present an abstract machine and a reduction semantics for the lambda-calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. The abstract machine is derived from an evaluator in continuation-passing style (CPS); the reduction semantics (i.e., a small-step operational semantics with an explicit representation of evaluation contexts) is constructed from the abstract machine; and the control operators are the shift and reset family. We also present new applications of delimited continuations in the CPS hierarchy: finding list prefixes and normalization by evaluation for a hierarchical language of units and products.


Source : oai:arXiv.org:cs/0508048
DOI : 10.2168/LMCS-1(2:5)2005
Volume: Volume 1, Issue 2
Published on: November 8, 2005
Submitted on: April 1, 2005
Keywords: Computer Science - Logic in Computer Science,Computer Science - Programming Languages,D.1.1,F.3.2


Share

Consultation statistics

This page has been seen 67 times.
This article's PDF has been downloaded 57 times.