Left-to-right tree pattern matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 488 LNCS, Issue , 1991, Pages 323-334

  Gräf, Albert ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN MATCHING;

KNUTH-BENDIX COMPLETION; LINEAR PATTERNS; MATCHING AUTOMATONS; NON LINEAR; NOVEL CONCEPT; PATTERN SET; TREE-PATTERN MATCHING; VARIABLE BINDING;

FORESTRY;

EID: 26544474481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-53904-2_107     Document Type: Conference Paper

References (12)

1. Augustsson, Lennart: Compiling pattern matching. Proc. Functional Programming Languages and Architectures ’85. Berlin (etc.): Springer, 1985, pp. 369-381. (Lecture Notes in Computer Science 201).
2. Birkhoff, G.: Lattice theory. New York: American Mathematical Society, 1948.
3. Christian, Jim: Fast Knuth-Bendix completion: summary. Proc. Rewriting Techniques and Applications ’89. Berlin (etc.): Springer, 1989, pp. 551-555. (Lecture Notes in Computer Science 355).
4. Gécseg, Ferenc; Magnus Steinby: Tree automata. Budapest: Akadémia Kiadó, 1984.
5. Gräf, Albert: Efficient pattern matching for term rewriting. Johannes Gutenberg-Universität Mainz, 1990. (Technical Report 3/90).
6. Hemerik, C.; J.P. Katoen: Bottom-up tree acceptors. Science of Computer Programming, 13, 1989, pp. 51-72.
7. Hoffmann, C.M.; M.J. O’Donnell: Pattern matching in trees. Journal of the ACM, 29, 1, 1982, pp. 68-95.
8. Knuth, D.E.; P.B. Bendix: Simple word problems in universal algebras. Proc. of the Conference on Computational Problems in Abstract Algebra 1967. Oxford: Pergamon Press, 1970, pp. 263-298.
9. Laville, A.: Implementation of lazy pattern matching algorithms. Proc. European Symposium on Programming ’88. Berlin (etc.): Springer, 1988, pp. 298-316. (Lecture Notes in Computer Science 300).
10. Peyton Jones, Simon L.: The implementation of functional programming languages. Englewood Cliffs, N.J. (etc.): Prentice Hall, 1987. (International Series in Computer Science).
11. Schnoebelen, Ph.: Refined compilation of pattern matching for functional languages. Science of Computer Programming, 11, 1988, pp. 133-159.
12. Toyama, Yoshihito: Fast Knuth-Bendix completion with a term rewriting system compiler. Information Processing Letters, 32, 1989, pp. 325-328.