An experiment in partial evaluation: the generation of a compiler generator
Proc. of the first international conference on Rewriting techniques and applications
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Partial evaluation of pattern matching in strings
Information Processing Letters
On the expected sublinearity of the Boyer-Moore algorithm
SIAM Journal on Computing
A very fast substring search algorithm
Communications of the ACM
Application of metasystem transition to function inversion and transformation
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Deriving a functional Knuth-Morris-Pratt algorithm by transformation
Journal of Information Processing
Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
Partial evaluation of pattern matching in constraint logic programming languages
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Automatic autoprojection of recursive equations with global variable and abstract data types
Science of Computer Programming
Correctness and efficiency of pattern matching algorithms
Information and Computation
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Tutorial notes on partial evaluation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
A general approach for run-time specialization and its application to C
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Specialization of lazy functional logic programs
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Journal of the ACM (JACM)
Lambda-dropping: transforming recursive equations into programs with block structure
Theoretical Computer Science - Partial evaluation and semantics-based program manipulation
A fast string searching algorithm
Communications of the ACM
Improving programs by the introduction of recursion
Communications of the ACM
A Discipline of Programming
Automatic generation of efficient string matching algorithms by generalized partial computation
ASIA-PEPM '02 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation
Partial Evaluation and Mixed Computation: Proceedings of the IFIP TC2 Workshop, Gammel Avernaes, Denmark, 18-24 Oct., 1987
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Program transformation system based on generalized partial computation
New Generation Computing - Partial evaluation and program transformation
Revised Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
Combining Program and Data Specialization
Higher-Order and Symbolic Computation
Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree
WSA '93 Proceedings of the Third International Workshop on Static Analysis
Partial evaluation of pattern matching in strings, revisited
Nordic Journal of Computing
Development reuse and the logic program derivation of two string-matching algorithms
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Handbook of Exact String Matching Algorithms
Handbook of Exact String Matching Algorithms
Fast partial evaluation of pattern matching in strings
Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Fast partial evaluation of pattern matching in strings
ACM Transactions on Programming Languages and Systems (TOPLAS)
On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
Information Processing Letters
An investigation of Jones optimality and BTI-universal specializers
Higher-Order and Symbolic Computation
A taxonomy of some right-to-left string-matching algorithms
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
| Hi-index | 0.00 |
We consider a naive, quadratic string matcher testing whether a pattern occurs in a text; we equip it with a cache mediating its access to the text; and we abstract the traversal policy of the pattern, the cache, and the text. We then specialize this abstracted program with respect to a pattern, using the off-the-shelf partial evaluator Similix.Instantiating the abstracted program with a left-to-right traversal policy yields the linear-time behavior of Knuth, Morris and Pratt's string matcher. Instantiating it with a right-to-left policy yields the linear-time behavior of Boyer and Moore's string matcher.