A Monadic Framework for Delimited Continuations

by R. Kent Dybvig , Simon Peyton Jones , Amr Sabry
Venue:UNDER CONSIDERATION FOR PUBLICATION IN J. FUNCTIONAL PROGRAMMING
Citations:14 - 2 self

Documents Related by Co-Citation

61 A Generalization of Exceptions and Control in ML-like Languages – Carl A. Gunter, Didier Rémy, Jon G. Riecke - 1995
150 The theory and practice of first-class prompts – M Felleisen - 1988
31 Delimited Dynamic Binding – Oleg Kiselyov, Chung-chieh Shan , Amr Sabry - 2006
130 Representing Monads – Andrzej Filinski - 1994
94 Abstracting Control – Olivier Danvy, Andrzej Filinski - 1990
16 How to remove a dynamic prompt: static and dynamic delimited continuation operators are equally expressible – O Kiselyov - 2005
24 Shift to control – Chung chieh Shan - 2004
18 Handling Control – Dorai Sitaram - 1993
31 Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums, in: POPL’04 – V Balat, R Di Cosmo, M Fiore - 2004
24 A type-theoretic foundation of continuations and prompts – Zena M Ariola, Hugo Herbelin, Amr Sabry - 2004
66 A Functional Abstraction of Typed Contexts – Olivier Danvy, Andrzej Filinski - 1989
9 An Implementation of Transparent Migration on Standard Scheme – Eijiro Sumii - 2000
16 Continuations from generalized stack inspection – Greg Pettyjohn, John Clements, Joe Marshall, Shriram Krishnamurthi, Matthias Felleisen - 2005
11 A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations – Dariusz Biernacki, Olivier Danvy, Kevin Millikin - 2006
23 Constraining control – Daniel P Friedman, Christopher T Haynes - 1985
34 Modeling Web Interactions – Paul Graunke, Robert Bruce Findler, Shriram Krishnamurthi, Matthias Felleisen - 2003
9 The Second Futamura Projection for Type-Directed Partial Evaluation – Bernd Grobauer, Zhe Yang - 1999
20 Combinators for program generation – Peter Thiemann - 1999
207 Type-directed partial evaluation – Olivier Danvy - 1996