Proving the Correctness of Compiler Optimisations Based on a Global Analysis: A Study of Strictness Analysis (1992)

Cached

Download Links

by Geoffrey Burn , Daniel Le Métayer
Citations:15 - 3 self

Documents Related by Co-Citation

26 CPS Transformation after Strictness Analysis – Olivier Danvy, John Hatcliff, Cv Ffi S - 1993
625 Compiling With Continuations – A W Appel - 1992
730 Notions of Computation and Monads – Eugenio Moggi - 1991
36 Compilation of functional languages by program transformation – P Fradet, D Le Métayer - 1991
101 Lambda-Calculus Schemata – Michael J. Fischer - 1993
87 A Generic Account of Continuation-Passing Styles – John Hatcliff, Olivier Danvy - 1994
70 S.: Strictness analysis for higher-order functions – G L Burn, C L Hankin, Abramsky - 1986
91 Abstract Interpretation and Optimising Transformations for Applicative Programs – A MYCROFT - 1981
22 Thunks: a way of compiling procedure statements with some comments on procedure declarations – P Z Ingerman - 1961
220 Call-by-name, call-by-value and the -calculus – G D Plotkin - 1975
107 Unboxed values as first class citizens in a non-strict functional language – Simon L Peyton Jones, John Launchbury - 1991
325 Denotational Semantics: A Methodology for Language Development – David A Schmidt - 1986
10 A categorical understanding of environment machines – A Asperti
161 Reasoning about Programs in Continuation-Passing Style – Amr Sabry Sabry, Matthias Felleisen
1878 Abstract Interpretation: a Unified Lattice Model for Static – P Cousot, R Cousot
68 Continuation Semantics in Typed Lambda-Calculi – Albert R. Meyer, Mitchell Wand - 1985
49 Back to Direct Style – Olivier Danvy - 1994
13 Separating Stages in the Continuation-Passing Style Transformation – Julia L. Lawall, Olivier Danvy - 1993
17 Call-by-need and Continuation-passing Style – Chris Okasaki, Peter Lee, David Tarditi - 1993