On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue SEP., 2002, Pages 32-46

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

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Data specialization; Knuth Morris Pratt string matching; Program specialization; Trace semantics

Indexed keywords

ALGORITHMS; AUTOMATIC PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; PATTERN MATCHING; PROGRAM PROCESSORS; SEMANTICS; SOFTWARE ENGINEERING;

DATA SPECIALIZATION; KNUTH-MORRIS-PRATT STRING MATCHING; PROGRAM SPECIALIZATION; TRACE SEMANTICS;

PROGRAM DIAGNOSTICS;

EID: 0036957310     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/568173.568177     Document Type: Conference Paper

References (26)

1. Mads Sig Ager, Olivier Danvy, and Henning Korsholm Rohde. On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation. Technical Report BRICS RS-02-32, Department of Computer Science, University of Aarhus, Aarhus, Denmark, July 2002.
2. Torben Amtoft, Charles Consel, Olivier Danvy, and Karoline Malmkjær. The abstraction and instantiation of string-matching programs. Technical Report BRICS RS-01-12, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, April 2001. To appear in Neil Jones's Festschrift.
3. Guntis J. Barzdins and Mikhail A. Bulyonkov. Mixed computation and translation: Linearisation and decomposition of compilers. Preprint 791, Computing Centre of Siberian Division of USSR Academy of Sciences, Novosibirsk, Siberia, 1988.
4. Anders Bondorf. Similix 5.1 manual. Technical report, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark, May 1993. Included in the Similix 5.1 distribution.
5. Anders Bondorf and Olivier Danvy. Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Computer Programming, 16:151-159, 1991.
6. Christian Charras and Thierry Lecroq. Exact string matching algorithms. http://www-igm.univ-mlv.fr/~lecroq/string/, 1997.
7. Sandrine Chirokoff, Charles Consel, and Renaud Marlet. Combining program and data specialization. Higher-Order and Symbolic Computation, 12(4):309-335, 1999.
8. Charles Consel and Olivier Danvy. Partial evaluation of pattern matching in strings. Information Processing Letters, 30(2):79-86, January 1989.
9. Olivier Danvy and Ulrik P. Schultz. Lambda-dropping: Transforming recursive equations into programs with block structure. Theoretical Computer Science, 248(1-2):243-287, 2000.
10. Yoshihiko Futamura, Zenjiro Konishi, and Robert Glück. Program transformation system based on generalized partial computation. New Generation Computing, 20(1):75-99, 2002.
11. Yoshihiko Futamura and Kenroku Nogi. Generalized partial computation. In Dines Bjørner, Andrei P. Ershov, and Neil D. Jones, editors, Partial Evaluation and Mixed Computation, pages 133-151. North-Holland, 1988.
12. Yoshihiko Futamura, Kenroku Nogi, and Akihiko Takano. Essence of generalized partial computation. Theoretical Computer Science, 90(1):61-79, 1991.
13. Robert Glück and Andrei Klimov. Occam's razor in metacomputation: the notion of a perfect process tree. In Patrick Cousot, Moreno Falaschi, Gilberto Filé, and Antoine Rauzy, editors, Proceedings of the Third International Workshop on Static Analysis WSA '93, number 724 in Lecture Notes in Computer Science, pages 112-123, Padova, Italy, September 1993. Springer-Verlag.
14. Bernd Grobauer and Julia L. Lawall. Partial evaluation of pattern matching in strings, revisited. Nordic Journal of Computing, 8(4):437-462, 2002.
15. Thomas Johnsson. Lambda lifting: Transforming programs to recursive equations. In Jean-Pierre Jouannaud, editor, Functional Programming Languages and Computer Architecture, number 201 in Lecture Notes in Computer Science, pages 190-203, Nancy, France, September 1985. Springer-Verlag.
16. Neil D. Jones, Carsten K. Gomard, and Peter Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall International, London, UK, 1993. Available online at http://www.dina.kv1.dk/~sestoft/pebook/.
17. Richard Kelsey, William Clinger, and Jonathan Rees, editors. Revised report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(1):7-105, 1998.
18. Todd B. Knoblock and Erik Ruf. Data specialization. In Proceedings of the ACM SIGPLAN'96 Conference on Programming Languages Design and Implementation, SIGPLAN Notices, Vol. 31, No. 5, pages 215-225. ACM Press, June 1996.
19. Donald E. Knuth, James H. Morris, and Vaughan R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323-350, 1977.
20. Karoline Malmkjær. Program and data specialization: Principles, applications, and self-application. Master's thesis. DIKU, Computer Science Department, University of Copenhagen, August 1989.
21. Karoline Malmkjær. Abstract Interpretation of Partial-Evaluation Algorithms. PhD thesis, Department of Computing and Information Sciences, Kansas State University, Manhattan, Kansas, March 1993.
22. Torben Æ. Mogensen. Glossary for partial evaluation and related topics. Higher-Order and Symbolic Computation, 13(4):355-368, 2000.
23. Simon Peyton Jones and André Santos. A transformation-based optimiser for Haskell. Science of Computer Programming, 32(1-3):3-47, 1998.
24. Christian Queinnec and Jean-Marie Geffroy. Partial evaluation applied to pattern matching with intelligent backtrack. In Proceedings of the Second International Workshop on Static Analysis WSA '92, volume 81-82 of Bigre Journal, pages 109-117, Bordeaux, France, September 1992. IRISA, Rennes, France.
25. Donald A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In Paul Hudak and Neil D. Jones, editors, Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, SIGPLAN Notices, Vol. 26, No 9, pages 62-71, New Haven, Connecticut, June 1991. ACM Press.
26. Morten Heine Sørensen, Robert Glück, and Neil D. Jones. A positive supercompiler. Journal of Functional Programming, 6(6):811-838, 1996.