Formal Aspects of Polyvariant Specialization

Henning Korsholm Rohde

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.

Full Text:

PDF


DOI: http://dx.doi.org/10.7146/brics.v12i34.21901
This website uses cookies to allow us to see how the site is used. The cookies cannot identify you or any content at your own computer.
OK


ISSN: 0909-0878 

Hosted by the State and University Library and Aarhus University Library