Sciweavers

Share
ERSHOV
1999
Springer

On Perfect Supercompilation

10 years 8 months ago
On Perfect Supercompilation
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that handles constraints on terms, thereby ensuring perfect information propagation. We illustrate this by transforming a na¨ıvely specialised string matcher into an optimal one. The presented algorithm is guaranteed to terminate by means of generalisation steps.
Jens P. Secher, Morten Heine Sørensen
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where ERSHOV
Authors Jens P. Secher, Morten Heine Sørensen
Comments (0)
books