Fast partial evaluation of pattern matching in strings

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 4, 2006, Pages 696-714

  Ager, Mads Sig ^a   Danvy, Oliver ^a   Rohde, Henning Korsholm ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Memoization; Partial evaluation; String matching

Indexed keywords

BACKTRACKING; MEMOIZATION; PARTIAL EVALUATION; STRING MATCHING;

COMPUTATION THEORY; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; PROBLEM SOLVING;

CHARACTER RECOGNITION;

EID: 33747147128     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1146809.1146812     Document Type: Article

References (41)

1. AGER, M. S., DANVY, O., AND ROHDE, H. K. 2002. On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation. In Proceedings of the ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (W. N. Chin Ed.), 32-46. Extended version available as Tech. rep. BRICS-RS-02-32.
2. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison Wesley, Reading, Mass.
3. ALPUENTE, M., FALASCHI, M., JULIAN, P., AND VIDAL, G. 1997. Specialization of inductively sequential functional logic programs. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, C. Consel, ed. 151-162.
4. AMTOFT, T. 1993. Sharing of computations. Ph.D. thesis, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark. Tech. rep. PB-453.
5. AMTOFT, T., CONSEL, C., DANVY, O., AND MALMKJæR, K. 2002. The abstraction and instantiation of string-matching programs. In The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, T. Æ. Mogensen et al., eds. LNCS vol. 2566, Springer 332-357.
6. BELLMAN, R. 1957. Dynamic Programming. Princeton University Press, Princeton, N. J.
7. BIRD, R. S. 1977. Improving programs by the introduction of recursion. Commun. ACM 20, 11 (Nov.), 856-863.
8. BONDORF, A. AND DANVY, O. 1991. Automatic autoprojection of recursive equations with global variables and abstract data types. Sci. Compu. Program. 16, 151-195.
9. BOYER, R. S. AND MOORE, J. S. 1977. A fast string searching algorithm. Commun. ACM 20, 10, 762-772.
10. BULYONKOV, M. A. 1984. Polyvariant mixed computation for analyzer programs. Acta Informatica 21, 473-484.
11. CHARRAS, C. AND LECROQ, T. 1997. Exact string matching algorithms. http://www-igm.univ-mlv.fr/~lecroq/string/.
12. CHEN, W. AND WARREN, D. S. 1996. Tabled evaluation with delaying for general logic programs. J. ACM 43, 1 (Jan.), 20-74.
13. CHIN, W.-N., ed. 2002. ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation.
14. COLUSSI, L. 1991. Correctness and efficiency of pattern matching algorithms. Inf. Comput. 95, 225-251.
15. CONSEL, C. AND DANVY, O. 1989. Partial evaluation of pattern matching in strings. Inf. Process. Lett. 30, 2 (Jan.), 79-86.
16. CONSEL, C. AND DANVY, O. 1993. Tutorial notes on partial evaluation. In Proceedings of the 20th Annual ACM Symposium on Principles of Programming Languages, S. L. Graham, ed. 493-501.
17. DIJKSTRA, E. W. 1976. A Discipline of Programming. Prentice-Hall, Upper Saddle River, N.J.
18. FUTAMURA, Y., KONISHI, Z., AND GLÜCK, R. 2002a. Automatic generation of efficient string matching algorithms by generalized partial computation. In Proceedings of the ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (W. N. Chin Ed.) 1-8.
19. FUTAMURA, Y., KONISHI, Z., AND GLÜCK, R. 2002b. Program transformation system based on generalized partial computation. New Gen. Comput. 20, 1, 75-99.
20. FUTAMURA, Y. AND NOGI, K. 1988. Generalized partial computation. In Partial Evaluation and Mixed Computation, D. Bjørner et al. eds. North-Holland, Amsterdam, the Netherlands, 133-151.
21. GLÜCK, R. AND JØRGENSEN, J. 1994. Generating optimizing specializers. In Proceedings of the 5th IEEE International Conference on Computer Languages, H. Bal, ed. 183-194.
22. GLÜCK, R. AND KLIMOV, A. 1993. Occam's razor in metacomputation: The notion of a perfect process tree. In Proceedings of the 3th International Workshop on Static Analysis WSA93, P. Cousot et al., eds. LNCS vol. 724 Springer, Berlin, 112-123.
23. GROBAUER, B. AND LAWALL, J. L. 2002. Partial evaluation of pattern matching in strings, revisited. Nordic J. Comput. 8, 4, 437-462.
24. HERNÁNDEZ, M. AND ROSENBLUETH, D. A. 2003. Disjunctive partial deduction of a right-to-left string-matching algorithm. Inf. Process. Lett. 87, 235-241.
25. HERNÁNDEZ, M. AND ROSENBLUETH, D. A. 2001. Development reuse and the logic program derivation of two string-matching algorithms. In Proceedings of the 3rd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'01), H. Søndergaard, ed. 38-48.
26. HOLST, C. K. AND GOMARD, C. K. 1991. Partial evaluation is fuller laziness. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. SIGPLAN Notices (N. Jones and P. Hudak Eds.), vol. 26, 9, 223-233.
27. HUDAK, P. AND JONES, N. D., eds. 1991. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation. SIGPLAN Notices, vol. 26, no 9.
28. JONES, N. D., GOMARD, C. K., AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall, UK. http://www.dina.kvl.dk/ ~sestoft/pebook/.
29. KANEKO, K. AND TAKEICHI, M. 1993. Derivation of a Knuth-Morris-Pratt algorithm by fully lazy partial computation. Adv. Softw. Sci. Technol. 5, 11-24.
30. 5 report on the algorithmic language scheme. Higher-Order Symbol. Comput. 11, 1, 7-105.
31. KNUTH, D. E., MORRIS, J. H., AND PRATT, V. R. 1977. Fast pattern matching in strings. SIAM J. Comput. 6, 2, 323-350.
32. LAFAVE, L. AND GALLAGHER, J. P. 1997. Constraint-Based partial evaluation of rewriting-based functional logic programs. In Proceeding of the 7th International Workshop on Program Synthesis and Transformation, N. E. Fuchs, ed. LNCS vol. 1463. Springer, Berlin, 168-188.
33. MOGENSEN, T. A. 1989. Binding time aspects of partial evaluation. Ph.D. thesis, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark.
34. MOGENSEN, T. A. 2000. Glossary for partial evaluation and related topics. Higher-Order Symbol. Comput. 13, 4, 355-368.
35. QUEINNEC, C. AND GEFFROY, J.-M. 1992. Partial evaluation applied to pattern matching with intelligent backtrack. In Proceedings of the 2nd International Workshop on Static Analysis WSA92. Bigre J. vol. 81-82, 109-117.
36. SAGONAS, K., SWIFT, T., AND WARREN, D. S. 1994. XSB as an efficient deductive database engine. In Proceedings of the ACM SIGMOD International Conference on the Management of Data. 442-453.
37. SECHER, J. P. 2002. Driving-Based program transformation in theory and practice. Ph.D. thesis, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark. DIKU Rapport D-486.
38. SMITH, D. A. 1991. Partial evaluation of pattern matching in constraint logic programming languages. In Proceedings of the ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (N. Jones and P. Hudak Eds.) 62-71.
39. SØRENSEN, M. H. 1994. Turchin's supercompiler revisited. An operational theory of positive information propagation. M.S. thesis, DIKU, Computer Science Department, University of Copenhagen Copenhogen, Denmark. DIKU Rapport 94/17.
40. SØRENSEN, M. H., GLÜCK, R., AND JONES, N. D. 1996. A positive supercompiler. J. Functional Program. 6, 6, 811-838.
41. TAKEICHI, M. AND AKAMA, Y. 1990. Deriving a functional Knuth-Morris-Pratt algorithm. J. Inf. Process. 13, 4, 522-528.