|
235
|
The Essence of Compiling with Continuations
– Cormac Flanagan, Amr Sabry, Bruce F. Duba, Matthias Felleisen
- 1993
|
|
595
|
Compiling with Continuations
– Andrew Appel
- 1992
|
|
267
|
Control-Flow Analysis of Higher-Order Languages
– Olin Shivers
- 1991
|
|
150
|
Reasoning about Programs in Continuation-Passing Style
– Amr Sabry Sabry, Matthias Felleisen
|
|
119
|
Rabbit: A compiler for Scheme
– Guy L Steele
- 1978
|
|
79
|
A Generic Account of Continuation-Passing Styles
– John Hatcliff, Olivier Danvy
- 1994
|
|
94
|
Set Based Program Analysis
– N Heintze
- 1992
|
|
190
|
ORBIT: An optimizing compiler for Scheme
– D KRANZ, R KELSEY, J REES, P HUDAK, J PHILBIN, N ADAMS
- 1986
|
|
219
|
Call-by-name, call-by-value, and the -calculus
– G D Plotkin
- 1975
|
|
58
|
For a Better Support of Static Data Flow
– Charles Consel, Olivier Danvy
|
|
651
|
Notions of Computation and Monads
– Eugenio Moggi
- 1991
|
|
33
|
A denotational framework for data flow analysis
– F Nielson
- 1982
|
|
36
|
Specifying the Correctness of Binding-time Analysis
– M Wand
- 1993
|
|
1637
|
Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
– P Cousot, R Cousot
- 1977
|
|
174
|
Call-by-name, call-by-value and the λ-calculus
– G Plotkin
- 1976
|
|
101
|
Danvy and Andrzej Filinski. Representing control, a study of the CPS transformation
– Olivier
- 1992
|
|
34
|
Correctness of procedure representations in higherorder assembly language
– Mitchell Wand
- 1991
|
|
21
|
An equational framework for the flow analysis of higher order functional programs
– D Strfanescu, Y Zhou
- 1994
|
|
12
|
Abstract analysis and optimization of Scheme
– A E Ayers
- 1993
|
