{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:17Z","timestamp":1761611297171},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539049"},{"type":"electronic","value":"9783540463832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53904-2_107","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:15:43Z","timestamp":1330208143000},"page":"323-334","source":"Crossref","is-referenced-by-count":22,"title":["Left-to-right tree pattern matching"],"prefix":"10.1007","author":[{"given":"Albert","family":"Gr\u00e4f","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Augustsson, Lennart: Compiling pattern matching. Proc. Functional Programming Languages and Architectures '85. Berlin (etc.): Springer, 1985, pp. 369\u2013381. (Lecture Notes in Computer Science 201).","key":"27_CR1","DOI":"10.1007\/3-540-15975-4_48"},{"key":"27_CR2","volume-title":"Lattice theory","author":"G. Birkhoff","year":"1948","unstructured":"Birkhoff, G.: Lattice theory. New York: American Mathematical Society, 1948."},{"doi-asserted-by":"crossref","unstructured":"Christian, Jim: Fast Knuth-Bendix completion: summary. Proc. Rewriting Techniques and Applications '89. Berlin (etc.): Springer, 1989, pp. 551\u2013555. (Lecture Notes in Computer Science 355).","key":"27_CR3","DOI":"10.1007\/3-540-51081-8_136"},{"unstructured":"G\u00e9cseg, Ferenc; Magnus Steinby: Tree automata. Budapest: Akad\u00e9mia Kiad\u00f3, 1984.","key":"27_CR4"},{"unstructured":"Gr\u00e4f, Albert: Efficient pattern matching for term rewriting. Johannes Gutenberg-Universit\u00e4t Mainz, 1990. (Technical Report 3\/90).","key":"27_CR5"},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0167-6423(89)90015-4","volume":"13","author":"C. Hemerik","year":"1989","unstructured":"Hemerik, C.; J.P. Katoen: Bottom-up tree acceptors. Science of Computer Programming, 13, 1989, pp. 51\u201372.","journal-title":"Science of Computer Programming"},{"issue":"1","key":"27_CR7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C.M. Hoffmann","year":"1982","unstructured":"Hoffmann, C.M.; M.J. O'Donnell: Pattern matching in trees. Journal of the ACM, 29, 1, 1982, pp. 68\u201395.","journal-title":"Journal of the ACM"},{"key":"27_CR8","first-page":"263","volume-title":"Proc. of the Conference on Computational Problems in Abstract Algebra 1967","author":"D.E. Knuth","year":"1970","unstructured":"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\u2013298."},{"doi-asserted-by":"crossref","unstructured":"Laville, A.: Implementation of lazy pattern matching algorithms. Proc. European Symposium on Programming '88. Berlin (etc.): Springer, 1988, pp. 298\u2013316. (Lecture Notes in Computer Science 300).","key":"27_CR9","DOI":"10.1007\/3-540-19027-9_20"},{"unstructured":"Peyton Jones, Simon L.: The implementation of functional programming languages. Englewood Cliffs, N.J. (etc.): Prentice Hall, 1987. (International Series in Computer Science).","key":"27_CR10"},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6423(88)90002-0","volume":"11","author":"P. Schnoebelen","year":"1988","unstructured":"Schnoebelen, Ph.: Refined compilation of pattern matching for functional languages. Science of Computer Programming, 11, 1988, pp. 133\u2013159.","journal-title":"Science of Computer Programming"},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0020-0190(89)90026-4","volume":"32","author":"Y. Toyama","year":"1989","unstructured":"Toyama, Yoshihito: Fast Knuth-Bendix completion with a term rewriting system compiler. Information Processing Letters, 32, 1989, pp. 325\u2013328.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53904-2_107.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:51:09Z","timestamp":1605646269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53904-2_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539049","9783540463832"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-53904-2_107","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}