Formal Aspects of Polyvariant Specialization

Henning Korsholm Rohde
2005 BRICS Report Series  
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.
doi:10.7146/brics.v12i34.21901 fatcat:g4afvhwttnbuhfg2ghoy2cw4am