Disjunctive partial deduction of a right-to-left string-matching algorithm

Abstract

In spite of its practical importance, the Boyer–Moore string-matching algorithm has hardly been studied in the context of partial evaluation. We show how to derive the search stage of a variant of this algorithm using “disjunctive” partial deduction.