Record Details

A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations (Preliminary Version)

BRICS Report Series

View Archive Info
 
 
Field Value
 
Title A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations (Preliminary Version)
 
Creator Biernacki, Dariusz
Danvy, Olivier
Millikin, Kevin
 
Description We present a new abstract machine that accounts for dynamic delimited continuations. We prove the correctness of this new abstract machine with respect to a definitional abstract machine. Unlike this definitional abstract machine, the new abstract machine is in defunctionalized form, which makes it possible to state the corresponding higher-order evaluator. This evaluator is in continuation+state passing style, and threads a trail of delimited continuations and a meta-continuation. Since this style accounts for dynamic delimited continuations, we refer to it as `dynamic continuation-passing style.' We illustrate that the new machine is more efficient than the definitional one, and we show that the notion of computation induced by the corresponding evaluator takes the form of a monad.
 
Publisher Aarhus University
 
Contributor —
 
Date 2005-02-11
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
—
 
Format application/pdf
 
Identifier https://tidsskrift.dk/brics/article/view/21871
10.7146/brics.v12i5.21871
 
Source BRICS Report Series; No 5 (2005): RS-5 A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations (Preliminary Version)
BRICS Report Series; No 5 (2005): RS-5 A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations (Preliminary Version)
1601-5355
0909-0878
 
Language eng
 
Relation https://tidsskrift.dk/brics/article/view/21871/19298
 
Rights Copyright (c) 2015 BRICS Report Series