Thunks (continued) (1992)

Cached

Download Links

by Olivier Danvy , John Hatcliff
Venue:Kansas State University
Citations:8 - 2 self

Documents Related by Co-Citation

67 Continuation Semantics in Typed Lambda-Calculi – Albert R. Meyer, Mitchell Wand - 1985
299 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
81 Representing control: a study of the CPS transformation – Olivier Danvy, Andrzej Filinski - 1992
46 On the relation between direct and continuation semantics – J C Reynolds - 1974
15 Code optimizations for lazy evaluation – Adrienne Bloss, Paul Hudak, Jonathan Young - 1988
26 CPS Transformation after Strictness Analysis – Olivier Danvy, John Hatcliff, Cv Ffi S - 1993
220 Call-by-name, call-by-value, and the #-calculus – G Plotkin - 1975
93 Rabbit: A compiler for Scheme – G L Steele Jr - 1978
22 Thunks: a way of compiling procedure statements with some comments on procedure declarations – P Z Ingerman - 1961
7 Typing rst-class continuations in ML – Bruce Duba, Robert Harper, David MacQueen - 1991
111 Semantics and pragmatics of the lambda calculus – C P Wadsworth - 1971
35 Polymorphic type assignment and CPS conversion – Robert Harper, Mark Lillibridge - 1993
730 Notions of Computation and Monads – Eugenio Moggi - 1991
110 The Discoveries of Continuations – John C. Reynolds - 1993
87 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
15 Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis – Geoffrey Burn, Daniel Le M'etayer - 1992
2 Gri n. Private communication – Timothy - 1992
2 Typing rst-class continuations in ML. Revised and expanded version of [4]. To appear, Journal of Functional Programming – Robert Harper, Bruce Duba, David MacQueen