Back to Direct Style II: First-Class Continuations (1996)

by Olivier Danvy , Julia L. Lawall
Venue:IN PROCEEDINGS OF THE 1992 ACM CONFERENCE ON LISP AND FUNCTIONAL PROGRAMMING
Citations:51 - 16 self

Documents Related by Co-Citation

161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
150 The theory and practice of first-class prompts – M Felleisen - 1988
105 Danvy and Andrzej Filinski. Representing control: A study of the CPS transformation – Olivier - 1992
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
269 The Essence of Compiling with Continuations – Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen - 1993
625 Compiling With Continuations – A W Appel - 1992
81 Representing control: a study of the CPS transformation – Olivier Danvy, Andrzej Filinski - 1992
157 Revised report on the algorithmic language Scheme – W Clinger, J Rees - 1991
730 Notions of Computation and Monads – Eugenio Moggi - 1991
93 Rabbit: A compiler for Scheme – Guy L Steele Jr - 1978
31 A scheme for a higher-level semantic algebra – William Clinger, Daniel P Friedman, Mitchell Wand - 1985
56 Danvy and Andrzej Filinski. Abstracting control – Olivier - 1990
49 Back to Direct Style – Olivier Danvy - 1994
68 Continuation Semantics in Typed Lambda-Calculi – Albert R. Meyer, Mitchell Wand - 1985
94 Abstracting Control – Olivier Danvy, Andrzej Filinski - 1990
32 Reasoning with Continuations II: Full Abstraction for Models of Control – Dorai Sitaram, Matthias Felleisen - 1990
58 Abstract continuations: A mathematical semantics for handling full functional jumps – M Felleisen, M Wand, D P Friedman, B F Duba - 1988
130 Representing Monads – Andrzej Filinski - 1994