CPS Transformation after Strictness Analysis (1993)

by Olivier Danvy , John Hatcliff , Cv Ffi S
Venue:ACM Letters on Programming Languages and Systems
Citations:26 - 10 self

Documents Related by Co-Citation

220 Call-by-name, call-by-value, and the #-calculus – G Plotkin - 1975
87 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
91 Abstract Interpretation and Optimising Transformations for Applicative Programs – A MYCROFT - 1981
730 Notions of Computation and Monads – Eugenio Moggi - 1991
161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
37 Specifying the correctness of binding-time analysis – Michell Wand - 1993
105 Danvy and Andrzej Filinski. Representing control: A study of the CPS transformation – Olivier - 1992
70 S.: Strictness analysis for higher-order functions – G L Burn, C L Hankin, Abramsky - 1986
57 Strictness Analysis: a New Perspective Based on Type Inference – T M Kuo, P Mishra - 1989
15 Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis – Geoffrey Burn, Daniel Le M'etayer - 1992
268 The Essence of Compiling with Continuations – Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen - 1993
30 Strictness Analysis of Lazy Functional Programs – F Damiani, P Giannini Benton, P N - 1992
46 On the relation between direct and continuation semantics – J C Reynolds - 1974
620 Compiling with Continuations – Andrew W Appel - 1992
436 Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
45 and Hanne Riis Nielson. Two-Level Functional Languages, volume 34 of Cambridge Tracts – Flemming Nielson - 1992
44 Strictness Analysis in Logical Form – Thomas P. Jensen - 1991
5 Context information for lazy code generation – H R Nielson, F Nielson - 1990
105 Unboxed values as first class citizens in a non-strict functional language – Simon L Peyton Jones, John Launchbury - 1991