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.

• Type: Conference
• Year: 1999
• Where: ERSHOV
• Authors: Jens P. Secher, Morten Heine Sørensen
• Keywords: ERSHOV 1999, Perfect Information Propagation, Positive Supercompilation, Theoretical Computer Science, Unfold Rules