#### Filter Results:

#### Publication Year

1991

1996

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Partial evaluation of a program p with respect to partial input data s produces a residual program r. If the program r is subsequently run a number of times on values rl~, there is a potentiti overall gain in efficiency since the static computations are performed only once, namely when the residual program r-is generated. In a fully lazy language, a partial… (More)

One of the remaining problems on the path towards fully automatic partial evaluation is ensuring termination of the specialization phase. In [10] we gave a termination analysis which could be applied to partial evaluation of first-order strict languages, using a new result about inductive arguments (loosely: if whenever something grows, something gets… (More)

- ‹
- 1
- ›