Name
Abstract | ||
|---|---|---|
A partial evaluator, given a program and a known "static" part of its input data, outputs a residual program in which computations depending only on the static data have been precomputed (3). The ideal is a "black box" which discovers and performs nontrivial static compu- tations whenever possible, and never fails to terminate. Practical partial evaluators fall short of this goal: they sometimes loop (typical of func- tional programing partial evaluation), or terminate but are excessively conservative (typical in partial deduction1). This paper presents ecient algorithms (being implemented) for binding-time analysis for o-line spe- cialisers. They ensure that the specialiser performs many nontrivial static computations, and are at the same time guaranteed to terminate. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1007/3-540-62064-8_23 | Ershov Memorial Conference |
Keywords | Field | DocType |
ensure termination,off-line partial evaluation,bta algorithms,partial evaluation | Black box (phreaking),Residual,Off line,Static data,Functional programming,Partial evaluation,Computer science,Algorithm,Data-flow analysis,Computation | Conference |
ISBN | Citations | PageRank |
3-540-62064-8 | 20 | 0.92 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Arne J. Glenstrup | 1 | 49 | 5.32 |
| Neil D. Jones | 2 | 2634 | 558.61 |