A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations

A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations by Dariusz Biernacki, Olivier Danvy, Kevin Millikin. 2006.
Compared to static delimited continuations, and despite recent implementation advances, the topic of dynamic delimited continuations still remains largely unexplored. We believe that the spectrum of compatible computational artifacts presented here — abstract machine, evaluator, computational monad, and dynamic continuation-passing style — puts one in a better position to assess them.

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

Popularization

Given that Kevin used to post on LtU, I hope he will help us to appreciate this and related papers.

For example, why dynamic delimited continuations are important, the history and motivation of SECD machine, the benefits of Reynold's defunctionalization, etc.

PS: A Rational Deconstruction of Landin’s J Operator looks relevant to the discussion.