A monadic framework for subcontinuations (2005)

Cached

Download Links

by R. Kent Dybvig , Simon Peyton Jones , Amr Sabry
Citations:4 - 0 self

Documents Related by Co-Citation

72 Control operators, the SECDmachine, and the λ-calculus – Matthias Felleisen, Daniel P Friedman - 1986
24 Shift to control – Chung chieh Shan - 2004
16 How to remove a dynamic prompt: static and dynamic delimited continuation operators are equally expressible – O Kiselyov - 2005
201 Call-by-name, call-by-value and the λ-calculus – G Plotkin, D - 1975
150 The theory and practice of first-class prompts – M Felleisen - 1988
18 An operational foundation for delimited continuations in the CPS hierarchy – Dariusz Biernacki, Olivier Danvy - 2005
19 On the Dynamic Extent of Delimited Continuations – Dariusz Biernacki, Olivier Danvy - 2005
11 A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations – Dariusz Biernacki, Olivier Danvy, Kevin Millikin - 2006
31 A scheme for a higher-level semantic algebra – William Clinger, Daniel P Friedman, Mitchell Wand - 1985
13 A Simple Proof of a Folklore Theorem about Delimited Control – Dariusz Biernacki, Olivier Danvy - 2005
41 Recycling Continuations – Jonathan Sobel, Daniel P. Friedman - 1998
21 On Evaluation Contexts, Continuations, and the Rest of Computation – Olivier Danvy
58 Abstract continuations: A mathematical semantics for handling full functional jumps – M Felleisen, M Wand, D P Friedman, B F Duba - 1988
61 A Generalization of Exceptions and Control in ML-like Languages – Carl A. Gunter, Didier Rémy, Jon G. Riecke - 1995
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
56 Danvy and Andrzej Filinski. Abstracting control – Olivier - 1990
93 Rabbit: A compiler for Scheme – Guy L Steele Jr - 1978
70 Defunctionalization at Work – Olivier Danvy, Lasse R. Nielsen - 2001
2 A monadic framework for subcontinuations. Available at http://www.cs.indiana.edu/~sabry/research. html – R K Dybvig, S Peyton-Jones, A Sabry - 2005