|
6
|
On Typing Delimited Continuations: Three New Solutions to the Printf Problem
– Kenichi Asai
- 2009
|
|
19
|
A Sound and Complete Axiomatization of Delimited Continuations
– Yukiyoshi Kameyama, Masahito Hasegawa
- 2003
|
|
490
|
A Syntactic Approach to Type Soundness
– Andrew K. Wright, Matthias Felleisen
- 1992
|
|
17
|
On the Dynamic Extent of Delimited Continuations
– Dariusz Biernacki, Olivier Danvy
- 2005
|
|
8
|
Polymorphic Delimited Continuations
– Kenichi Asai, Yukiyoshi Kameyama
- 2007
|
|
58
|
A Functional Abstraction of Typed Contexts
– Olivier Danvy, Andrzej Filinski
- 1989
|
|
116
|
Representing Monads
– Andrzej Filinski
- 1994
|
|
79
|
Abstracting Control
– Olivier Danvy, Andrzej Filinski
- 1990
|
|
2
|
Delimited Dynamic Binding, ICFP ’06
– O Kiselyov, chieh Shan, C, A Sabry
- 2006
|
|
1
|
The Theory and Practice of First-Class Prompts, POPL ’88
– M Felleisen
- 1988
|
|
1
|
Abstracting Control, LFP ’90
– O Danvy, A Filinski
- 1990
|
|
1
|
A.: Representing Monads, POPL ’94
– Filinski
- 1994
|
|
1
|
Polymorphic Delimited Continuations, APLAS ’07
– K Asai, Y Kameyama
- 2007
|
|
13
|
An Operational Foundation for Delimited Continuations
– Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
- 2003
|
|
69
|
The Influence of Browsers on Evaluators or, Continuations to Program Web Servers
– Christian Queinnec
- 2000
|
|
13
|
A Simple Proof of a Folklore Theorem about Delimited Control
– Dariusz Biernacki, Olivier Danvy
- 2005
|
|
11
|
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
– Dariusz Biernacki, Olivier Danvy, Kevin Millikin
- 2006
|
|
1
|
Simply Typed Lambda-Calculus with a Typed-Prompt Delimited Control is not Strongly Normalizing
– O Kiselyov
- 2006
|
|
1
|
Demo of Persistent Delimited Continuations in OCaml for Nested Web Transactions
– O Kiselyov
- 2008
|
