On obtaining the Boyer–Moore string-matching algorithm by partial evaluation

Olivier Danvy، نويسنده , , Henning Korsholm Rohde، نويسنده ,

دوهفته نامه با شماره پیاپی سال 2006

5

158

162

Program specification , Design of algorithms , Programcorrectness , Partial Evaluation , Binding-time improvement , Boyer–Moorestring-matching algorithm , Horspool string-matching algorithm , Bounded static variation , analysis of algorithms , programming languages , Algorithms , data structures , functional programming , Theory of computation , Software design and implementation , Program derivation

Information Processing Letters

2006

Information Processing Letters

130290