A Monadic Framework for Delimited Continuations
| dc.contributor.author | Dybvig, Kent; Peyton Jones, Simon; Sabry, Amr | |
| dc.date.accessioned | 2025-11-12T20:52:43Z | |
| dc.date.available | 2025-11-12T20:52:43Z | |
| dc.date.issued | 2005-06 | |
| dc.description.abstract | Delimited continuations are more expressive than traditional abortive continuations and they apparently seem to require a framework beyond traditional continuation-passing style (CPS). We show that this is not the case: standard CPS is sufficient to explain the common control operators for delimited continuations. We demonstrate this fact and present an implementation as a Scheme library. We then investigate a typed account of delimited continuations that makes explicit where control effects can occur. This results in a monadic framework for typed and encapsulated delimited continuations which we design and implement as a Haskell library. | |
| dc.identifier.uri | https://hdl.handle.net/2022/34463 | |
| dc.relation.ispartofseries | Indiana University Computer Science Technical Reports; TR615 | |
| dc.rights | This work is protected by copyright unless stated otherwise. | |
| dc.rights.uri | ||
| dc.title | A Monadic Framework for Delimited Continuations |
Files
Original bundle
1 - 1 of 1
Collections
Can’t use the file because of accessibility barriers? Contact us