Abstracting Control (1990)

Cached

Download Links

by Olivier Danvy , Andrzej Filinski
Venue:In Proceedings of the 1990 ACM Conference on LISP and Functional Programming
Citations:94 - 6 self

Documents Related by Co-Citation

148 The theory and practice of first-class prompts – M Felleisen - 1988
65 A Functional Abstraction of Typed Contexts – Olivier Danvy, Andrzej Filinski - 1989
130 Representing Monads – Andrzej Filinski - 1994
58 Abstract continuations: A mathematical semantics for handling full functional jumps – M Felleisen, M Wand, D P Friedman, B F Duba - 1988
81 Representing control: a study of the CPS transformation – Olivier Danvy, Andrzej Filinski - 1992
26 Control Operators, Hierarchies, and Pseudo-Classical Type Systems: A-Translation at Work – C Murthy - 1992
234 A Formulae-as-Types Notion of Control – Timothy G. Griffin - 1990
116 A syntactic theory of sequential control – Matthias Felleisen, Daniel P Friedman, E Kohlbecker, B F Duba - 1987
61 A Generalization of Exceptions and Control in ML-like Languages – Carl A. Gunter, Didier Rémy, Jon G. Riecke - 1995
299 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
207 Type-directed partial evaluation – Olivier Danvy - 1996
199 Call-by-name, call-by-value and the λ-calculus – G Plotkin - 1975
41 Recycling Continuations – Jonathan Sobel, Daniel P. Friedman - 1998
93 Typing First-Class Continuations in ML – Robert Harper, Bruce F. Duba, David Macqueen - 1992
39 Control delimiters and their hierarchies – Dorai Sitaram, Matthias Felleisen - 1990
440 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
220 Call-by-name, call-by-value, and the #-calculus – G Plotkin - 1975
133 On the Expressive Power of Programming Languages – Matthias Felleisen - 1990
620 Compiling with Continuations – Andrew W Appel - 1992