Fast partial evaluation of pattern matching in strings

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

Volumn , Issue , 2003, Pages 3-9

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

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Memoization; Partial evaluation; String matching

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; FUNCTIONS;

CODE GENERATION;

PATTERN RECOGNITION;

EID: 0038378088     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Mads Sig Ager, Olivier Danvy, and Henning Korsholm Rohde. On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation. In Chin [8], pages 32-46. Extended version available as the technical report BRICS-RS-02-32.
2. Maria Alpuente, Moreno Falaschi, Pascual Julian, and German Vidai. Specialization of inductively sequential functional logic programs. In Charles Consel, editor, Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 151-162, Amsterdam, The Netherlands, June 1997. ACM Press.
3. Torben Amtoft. Sharing of Computations. PhD thesis, DAIMI, Department of Computer Science, University of Aarhus, 1993. Technical report PB-453.
4. Torben Amtoft, Charles Consel, Olivier Danvy, and Karoline Malmkjær. The abstraction and instantiation of string-matching programs. In Torben Æ. Mogensen, David A. Schmidt, and I. Hal Sudborough, editors, The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, number 2566 in Lecture Notes in Computer Science, pages 332-357. Springer-Verlag, 2002. Extended version available as the technical report BRICS RS-01-12.
5. Richard S. Bird. Improving programs by the introduction of recursion. Communications of the ACM, 20(11):856-863, November 1977.
6. 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.
7. Christian Charras and Thierry Lecroq. Exact string matching algorithms, http://www-igm.univ-mlv.fr/̃lecroq/string/, 1997.
8. Wei-Ngan Chin, editor. ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Aizu, Japan, September 2002. ACM Press.
9. Livio Colussi. Correctness and efficiency of pattern matching algorithms. Information and Computation, 95:225-251, 1991.
10. Charles Consel and Olivier Danvy. Partial evaluation of pattern matching in strings. Information Processing Letters, 30(2):79-86, January 1989.
11. Charles Consel and Olivier Danvy. Tutorial notes on partial evaluation. In Susan L. Graham, editor, Proceedings of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 493-501, Charleston, South Carolina, January 1993. ACM Press.
12. Edsger W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
13. Yoshihiko Futamura, Zenjiro Konishi, and Robert Glück. Automatic generation of efficient string matching algorithms by generalized partial computation. In Chin [8], pages 1-8.
14. Yoshihiko Futamura, Zenjiro Konishi, and Robert Glück. Program transformation system based on generalized partial computation. New Generation Computing, 20(1):75-99, 2002.
15. 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.
16. Robert Glück and Andrei Klimov. Occam's razor in meta-computation: 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.
17. Bernd Grobauer and Julia L. Lawall. Partial evaluation of pattern matching in strings, revisited. Nordic Journal of Computing, 8(4):437-462, 2002.
18. Manuel Hernández and David A. Rosenblueth. Development reuse and the logic program derivation of two string-matching algorithms. In Harald Søndergaard, editor, Proceedings of the Third International Conference on Principles and Practice of Declarative Programming, pages 38-48, Firenze, Italy, September 2001. ACM Press.
19. Carsten K. Holst and Carston K. Gomard. Partial evaluation is fuller laziness. In Hudak and Jones [20], pages 223-233.
20. Paul Hudak and Neil D. Jones, editors. ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, SIGPLAN Notices, Vol. 26, No 9, New Haven, Connecticut, June 1991. ACM Press.
21. 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.kvl.df/̃sestoft/pebook/.
22. Keiichi Kaneko and Masato Takeichi. Derivation of a Knuth-Morris-Pratt algorithm by fully lazy partial computation. Advances in Software Science and Technology, 5:11-24, 1993.
23. 5 report on the algorithmic language Scheme. Higher-Order and Symbolic Computation, 11(1):7-105, 1998
24. Donald E. Knuth, James H. Morris, Vaughan R. Pratt. Fast pattern matching in strings. SIAM Journal of Computing, 6(2):323-350, 1977.
25. Laura Lafave and John P. Gallagher. Constraint-based partial evaluation of rewriting-based functional logic programs. In Norbert E. Fuchs, editor, 7th International Workshop on Program Synthesis and Transformation, number 1463 in Lecture Notes in Computer Science, pages 168-188, Leuven, Belgium, July 1997. Springer-Verlag.
26. Torben Æ, Mogensen. Binding Time Aspects of Partial Evaluation. PhD thesis, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark, March 1989.
27. Torben Æ. Mogensen. Glossary for partial evaluation and related topics. Higher-Order and Symbolic Computation, 13(4):355-368, 2000.
28. Christian Queinnec and Jean-Marie Geffrey. 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.
29. Donald A. Smith. Partial evaluation of pattern matching in constraint logic programming languages. In Hudak and Jones [20], pages 62-71.
30. Morten Heine Sørensen. Turchin's supercompiler revisited. an operational theory of positive information propagation. Master's thesis, DIKU, Computer Science Department, University of Copenhagen, April 1994. DIKU Rapport 94/17.
31. Morten Heine Sørensen, Robert Glück, and Neil Jones. Towards unifying partial evaluation, deforestation, supercompilation, and GPC. In Donald Sannella, editor, Proceedings of the Fifth European Symposium on Programming, number 788 in Lecture Notes in Computer Science, pages 485-500, Edinburgh, Scotland, April 1994. Springer-Verlag.
32. Morten Heine Sørensen, Robert Glück, and Neil D. Jones. A positive supercompiler. Journal of Functional Programming, 6(6):811-838, 1996.
33. Masato Takeichi and Yoji Akama. Deriving a functional Kmith-Morris-Pratt algorithm. Journal of Information Processing, 13(4):522-528, 1990.