|
Formal Aspects of Polyvariant Specialization
Henning Korsholm Rohde November 2005 |
Abstract:
We present the first formal correctness proof of an offline
polyvariant specialization algorithm for first-order recursive equations. As
a corollary, we show that the specialization algorithm generates a program
implementing the search phase of the Knuth-Morris- Pratt algorithm from an
inefficient but binding-time-improved string matcher
Available as PostScript, PDF, DVI. |