{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:19:01Z","timestamp":1725484741292},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004004"},{"type":"electronic","value":"9783540363903"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36390-4_19","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T23:45:05Z","timestamp":1180223105000},"page":"221-233","source":"Crossref","is-referenced-by-count":0,"title":["Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Nedjah","sequence":"first","affiliation":[]},{"given":"Luiza","family":"de Macedo Mourelle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Augustsson, A Compiler for Lazy ML, Proceedings ACM Conference on Lisp and Functional Programming, ACM, pp. 218\u2013227, 1984.","DOI":"10.1145\/800055.802038"},{"key":"19_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":"19_CR3","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.P. Jouannaud, Rewrite Systems, Handbook of Theoretical Computer Science, vol. 2, chap. 6, Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"19_CR4","unstructured":"A.J. Field and P.G. Harrison, Functional Programming, International Computer Science Series, 1988."},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-53904-2_107","volume-title":"Proceedings Conference on Rewriting Techniques and Applications","author":"Gr\u00e4f","year":"1991","unstructured":"Gr\u00e4f, Left-to-Right Tree Pattern-Matching, Proceedings Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science, vol. 488, pp. 323\u2013334, 1991."},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C.M. Hoffman","year":"1982","unstructured":"CM. Hoffman and M.J. O\u2019Donnell, Pattern-Matching in Trees, Journal of ACM, 29(1):68\u201395, 1982.","journal-title":"Journal of ACM"},{"key":"19_CR7","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":"19_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0747-7171(08)80109-5","volume":"11","author":"Laville","year":"1991","unstructured":"Laville, Comparison of Priority Rules in Pattern Matching and Term Rewriting, Journal of Symbolic Computation, 11:321\u2013347, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"19_CR9","unstructured":"N. Nedjah, Pattern-Matching Automata for Efficient Evaluation in Equational Programming, Ph.D. Thesis, University of Manchester-Institute of Science and Technology, Manchester, UK, (Abstract and Contents in the Bulletin of the European Association of Computer Science, vol. 60, November 1997.)"},{"key":"19_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BFb0027016","volume-title":"Proceedings of the Sixth International 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, Proceedings of the Sixth International Conference on Algebraic and Logic Programming, Southampton, UK, Lecture Notes in Computer Science, M. Hanus, J. Heering and K. Meinke Editors, Springer-Verlag, vol. 1298, pp. 273\u2013285, 1997."},{"issue":"9","key":"19_CR11","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, CD. Walter and S.E. Eldridge, Efficient Automata-Driven Pattern-Matching for Equational programs, Software-Practice and Experience, 29(9):793\u2013813, John Wiley, 1999.","journal-title":"Software-Practice and Experience"},{"key":"19_CR12","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, Springer-Verlag, vol. 2070, pp. 880\u2013890, June 2001."},{"key":"19_CR13","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":"6","key":"19_CR14","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, 24(6): 1207\u20131234, 1995.","journal-title":"SIAM Journal"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"D.A. Turner, Miranda: a Non Strict Functional Language with Polymorphic Types, Proceedings of Conference on Lisp and Functional Languages, ACM press, pp. 1\u201316, 1985.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"19_CR16","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","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36390-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:02:17Z","timestamp":1556449337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36390-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540004004","9783540363903"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-36390-4_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}