Reasoning about Programs in Continuation-Passing Style (0)

by Amr Sabry Sabry , Matthias Felleisen
Venue:Lisp and Symbolic Computation
Citations:161 - 13 self

Documents Related by Co-Citation

300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
625 Compiling With Continuations – A W Appel - 1992
538 A Syntactic Approach to Type Soundness – Andrew K. Wright, Matthias Felleisen - 1992
730 Notions of Computation and Monads – Eugenio Moggi - 1991
255 The Revised Report on the Syntactic Theories of Sequential Control and State – Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb - 1992
269 The Essence of Compiling with Continuations – Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen - 1993
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
101 Lambda-Calculus Schemata – Michael J. Fischer - 1993
87 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
116 A syntactic theory of sequential control – M Felleisen, D P Friedman, E Kohlbecker, B Duba - 1987
51 Back to Direct Style II: First-Class Continuations – Olivier Danvy, Julia L. Lawall - 1996
81 Representing control: a study of the CPS transformation – Olivier Danvy, Andrzej Filinski - 1992
1312 Monads for functional programming – Philip Wadler - 1995
439 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
49 Polymorphic Type Inference and Assignment – Xavier Leroy, Pierre Weis, Inria Rocquencourt - 1991
240 A Formulae-as-Types Notion of Control – Timothy G. Griffin - 1990
456 Comprehending Monads – Philip Wadler - 1992
110 Type inference for polymorphic references – M Tofte - 1990