Formal Aspects of Polyvariant Specialization
AbstractWe 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.
How to Cite
Rohde, H. K. (2005). Formal Aspects of Polyvariant Specialization. BRICS Report Series, 12(34). https://doi.org/10.7146/brics.v12i34.21901
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.