{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:05:10Z","timestamp":1725483910378},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-45034-3_42","type":"book-chapter","created":{"date-parts":[[2007,5,20]],"date-time":"2007-05-20T08:38:50Z","timestamp":1179650330000},"page":"416-425","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Pattern Matching for Non-strongly Sequential Term Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Nedjah","sequence":"first","affiliation":[]},{"given":"Luiza de Macedo","family":"Mourelle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"A. Augustsson, A Compiler for lazy ML, Proc. Conference on Lisp and Functional Programming, ACM, pp. 218\u2013227, 1984.","DOI":"10.1145\/800055.802038"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF00881866","volume":"10","author":"J. Christian","year":"1993","unstructured":"J. Christian, Flatterms, Discrimination nets and fast term rewriting, Journal of Automated Reasoning, vol. 10, pp. 95\u2013113, 1993.","journal-title":"Journal of Automated Reasoning"},{"key":"42_CR3","volume-title":"Rule-based programming with OPS5","author":"D. Cooper","year":"1988","unstructured":"D. Cooper and N. Wogrin, Rule-based programming with OPS5, Morgan Kaufmann, San Francisco, 1988."},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud, Rewrite systems, Handbook of Theoretical Computer Science, vol. 2, chap. 6, Elsevier Science, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"42_CR5","unstructured":"A.J. Field and P.G. Harrison, Functional programming, International Computer Science Series, 1988."},{"key":"42_CR6","unstructured":"J.A Goguen and T. Winkler, Introducing OBJ3, Technical report SRI-CSL-88-9, Computer Science Laboratory, SRI International, 1998."},{"key":"42_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-53904-2_107","volume-title":"Proc. Conference on Rewriting Techniques and Applications","author":"A. Gr\u00e4f","year":"1991","unstructured":"A. Gr\u00e4f, Left-to-right tree pattern matching, Proc. Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 488, pp. 323\u2013334, 1991."},{"issue":"1","key":"42_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C.M. Hoffman","year":"1982","unstructured":"C.M. Hoffman and M.J. O\u2019Donnell, Pattern matching in trees, Journal of ACM, vol. 29, no 1, pp. 68\u201395, 1982.","journal-title":"Journal of ACM"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"P. Hudak and al., Report on the programming language Haskell: a Non-Strict, Purely Functional Language, Sigplan Notices, Section S, May 1992.","DOI":"10.1145\/130697.130699"},{"key":"42_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0747-7171(08)80109-5","volume":"11","author":"A. Laville","year":"1991","unstructured":"A. Laville, Comparison of priority rules in pattern matching and term rewriting, Journal of Symbolic Computation, no 11, pp. 321\u2013347, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"42_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BFb0027016","volume-title":"Proc. Conference on Algebraic and Logic Programming","author":"N. Nedjah","year":"1997","unstructured":"N. Nedjah, C.D. Walter and S.E. Eldridge, Optimal left-to-right pattern matching automata, Proc. Conference on Algebraic and Logic Programming, Southampton, UK, Lecture Notes in Computer Science, M. Hanus, J. Heering and K. Meinke Eds., Springer-Verlag, vol. 1298, pp. 273\u2013285, 1997."},{"key":"42_CR12","unstructured":"N. Nedjah, Postponing redex contractions in equational programs, Proc. Symposium on Functional and Logic Programming, Kyoto, Japan, M. Sato and Y. Toyama Eds., World Scientific, pp. 40\u201360, 1998."},{"issue":"9","key":"42_CR13","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1002\/(SICI)1097-024X(19990725)29:9<793::AID-SPE254>3.0.CO;2-M","volume":"29","author":"N. Nedjah","year":"1999","unstructured":"N. Nedjah, C.D. Walter and S.E. Eldridge, Efficient automata-driven pattern matching for equational programs, Software-Practice and Experience, vol. 29, no 9, pp. 793\u2013813, John Wiley, 1999.","journal-title":"Software-Practice and Experience"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"N. Nedjah and L.M. Mourelle, Dynamic deterministic pattern matching, Proc. Computing: the Australasian Theory Symposium, Canberra, Australia, D.A. Wolfram Ed., Electronic Notes in Theretical Computer Science, Elsevier Science, vol. 31, 2000.","DOI":"10.1016\/S1571-0661(05)80335-4"},{"key":"42_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1007\/3-540-45517-5_97","volume-title":"Proc. International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems","author":"N. Nedjah","year":"2001","unstructured":"N. Nedjah and L.M. Mourelle, Improving time, space and termination in term rewriting-based programming, Proc. International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, Budapest, Hungary, Lecture Notes in Computer Science, L. Monostori, J. V\u00e1ncsa and A. M. Ali Eds., Springer-Verlag, vol. 2070, pp. 880\u2013890, June 2001."},{"key":"42_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1007\/3-540-48035-8_74","volume-title":"Proc. International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems","author":"N. Nedjah","year":"2002","unstructured":"N. Nedjah and L.M. Mourelle, Optimal Adaptive Pattern-Matching, Proc. International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, Cairn, Australia, Lecture Notes in Computer Science, T. Hendtlass and A. M. Ali Eds., Springer-Verlag, vol. 2358, pp. 768\u2013779, June 2002."},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"M.J. O\u2019Donnell, Equational logic as programming language, MIT Press, 1985.","DOI":"10.1007\/3-540-15648-8_20"},{"issue":"5","key":"42_CR18","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1137\/S0097539793246252","volume":"24","author":"R.C. Sekar","year":"1995","unstructured":"R.C. Sekar, R. Ramesh and I.V. Ramakrishnan, Adaptive pattern matching, SIAM Journal, vol. 24, no 5, pp. 1207\u20131234, 1995.","journal-title":"SIAM Journal"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"D.A. Turner, Miranda: a Non strict functional language with polymorphic Types, Proc. Conference on Lisp and Functional Languages, ACM, pp. 1\u201316, 1985.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"42_CR20","unstructured":"P. Wadler, Efficient compilation of pattern matching, In \u201cThe Implementation of Functional Programming Languages\u201d, S. L. Peyton-Jones, Prentice-Hall International, pp. 78\u2013103, 1987."}],"container-title":["Lecture Notes in Computer Science","Developments in Applied Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45034-3_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:02Z","timestamp":1605647282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45034-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540404552"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45034-3_42","relation":{},"subject":[]}}