@article{Biernacki_Danvy_Millikin_2005, title={A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations (Preliminary Version)}, volume={12}, url={https://tidsskrift.dk/brics/article/view/21871}, DOI={10.7146/brics.v12i5.21871}, abstractNote={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.’<br /> <br /> 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.}, number={5}, journal={BRICS Report Series}, author={Biernacki, Dariusz and Danvy, Olivier and Millikin, Kevin}, year={2005}, month={Feb.} }