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

DOI10.1016/J.IPL.2006.04.001zbMath1185.68281OpenAlexW2069820880MaRDI QIDQ845710

Olivier Danvy, Henning Korsholm Rohde

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.001

zbMATH Keywords

algorithmsprogram specificationanalysis of algorithmsprogramming languagesdata structuresdesign of algorithmspartial evaluationfunctional programmingtheory of computationsoftware design and implementationprogram correctnessprogram derivationbinding-time improvementbounded static variationBoyer-Moore string-matching algorithmhorspool string-matching algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Theory of programming languages (68N15)

Cites Work

• Unnamed Item
• Unnamed Item
• Disjunctive partial deduction of a right-to-left string-matching algorithm
• A fast string searching algorithm
• Fast Pattern Matching in Strings
• A positive supercompiler

This page was built for publication: On obtaining the Boyer-Moore string-matching algorithm by partial evaluation