|
26
|
CPS Transformation after Strictness Analysis
– Olivier Danvy, John Hatcliff, Cv Ffi S
- 1993
|
|
595
|
Compiling with Continuations
– Andrew Appel
- 1992
|
|
651
|
Notions of Computation and Monads
– Eugenio Moggi
- 1991
|
|
35
|
Compilation of functional languages by program transformation
– P Fradet
- 1991
|
|
91
|
Lambda-Calculus Schemata
– Michael J. Fischer
- 1993
|
|
79
|
A Generic Account of Continuation-Passing Styles
– John Hatcliff, Olivier Danvy
- 1994
|
|
69
|
Strictness analysis for higher-order functions
– Geoffrey L Burn, Chris Hankin, Samson Abramsky
- 1986
|
|
87
|
Abstract Interpretations and Optimising Transformations for Applicative Programs
– A Mycroft
- 1981
|
|
21
|
Thunks—a way of compiling procedure statements with some comments on procedure declarations
– P Z Ingerman
- 1961
|
|
219
|
Call-by-name, call-by-value, and the -calculus
– G D Plotkin
- 1975
|
|
94
|
Unboxed values as first class citizens in a non-strict functional language
– Simon L Peyton Jones, John Launchbury
- 1991
|
|
303
|
Denotational Semantics: A Methodology for Language Development
– D A SCHMIDT
- 1986
|
|
10
|
A categorical understanding of environment machines
– A Asperti
|
|
150
|
Reasoning about Programs in Continuation-Passing Style
– Amr Sabry Sabry, Matthias Felleisen
|
|
1637
|
Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
– P Cousot, R Cousot
- 1977
|
|
64
|
Continuation Semantics in Typed Lambda-Calculi
– Albert R. Meyer, Mitchell Wand
- 1985
|
|
44
|
Back to Direct Style
– Olivier Danvy
- 1994
|
|
13
|
Separating Stages in the Continuation-Passing Style Transformation
– Julia L. Lawall, Olivier Danvy
- 1993
|
|
12
|
Call-by-need and Continuation-passing Style
– Chris Okasaki, Peter Lee, David Tarditi
- 1993
|
