{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:19:58Z","timestamp":1725459598306},"publisher-location":"Berlin\/Heidelberg","reference-count":22,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540298495"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32498-4_4","type":"book-chapter","created":{"date-parts":[[2006,4,28]],"date-time":"2006-04-28T11:14:42Z","timestamp":1146222882000},"page":"81-104","source":"Crossref","is-referenced-by-count":0,"title":["Evolutionary Pattern Matching Using Genetic Programming"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Nedjah","sequence":"first","affiliation":[]},{"given":"Luiza de Macedo","family":"Mourelle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"A. Augustsson, A Compiler for Lazy ML, Proc. ACM Conference on Lisp and Functional Programming, ACM, pp. 218\u2013227, 1984.","DOI":"10.1145\/800055.802038"},{"key":"4_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":"4_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":"4_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 Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"4_CR5","unstructured":"A.J. Field and P.G. Harrison, Functional Programming, International Computer Science Series, 1988."},{"key":"4_CR6","unstructured":"J.A Goguen and T. Winkler, Introducing OBJ3, Technical report SRI-CSL-88-9, Computer Science Laboratory, SRI International, 1998."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/3-540-53904-2_107","volume":"488","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.","journal-title":"Proc. Conference on Rewriting Techniques and Applications"},{"issue":"1","key":"4_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, n. 1, pp. 68\u201395, 1982.","journal-title":"Journal of ACM"},{"key":"4_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":"4_CR10","unstructured":"J.R. Koza, Genetic Programming. MIT Press, 1992."},{"key":"4_CR11","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, n. 11, pp. 321\u2013347, 1991.","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR12","unstructured":"J.F. Miller, P. Thompson and T.C. Fogarty, Designing Electronics Circuits Using Evolutionary Algorithms. Arithmetic Circuits: A Case Study, In Genetic Algorithms and Evolution Strategies in Engineering and Computer Science, Quagliarella et al. (eds.), Wiley Publisher, 1997."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BFb0027016","volume":"1298","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, Springer-Verlag, vol. 1298, pp. 273\u2013285, 1997.","journal-title":"Proc. Conference on Algebraic and Logic Programming"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"N. Nedjah, C.D. Walter and S.E. Eldridge, Efficient Automata-Driven Pattern-Matching for Equational programs, Software-Practice and Experience, John Wiley Eds., vol. 29, n. 9, pp. 793\u2013813, 1999.","DOI":"10.1002\/(SICI)1097-024X(19990725)29:9<793::AID-SPE254>3.3.CO;2-D"},{"key":"4_CR15","unstructured":"N. Nedjah and L.M. Mourelle, Implementation of Term Rewriting-Based Programming Languages, Hauppauge, NY, ISBN 1594-5439-09, 2005."},{"volume-title":"Real-World Multi-Objective Systems Engineering","year":"2003","key":"4_CR16","unstructured":"N. Nedjah and L.M. Mourelle (Eds.), Real-World Multi-Objective Systems Engineering, Nova Science Publishers, Hauppauge, NY, ISBN 1590-3364-53, 2003."},{"issue":"2\u20134","key":"4_CR17","first-page":"230","volume":"3","author":"N. Nedjah","year":"2005","unstructured":"N. Nedjah and L.M. Mourelle, More Efficient Left-to-Right Matching for Overlapping Patterns, vol. 3, n. 2\u20134, pp. 230\u2013247, 2005.","journal-title":"More Efficient Left-to-Right Matching for Overlapping Patterns"},{"key":"4_CR18","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"},{"key":"4_CR19","volume-title":"Cours d\u2019\u00e9conomie politique","author":"V. Pareto","year":"1896","unstructured":"V. Pareto, Cours d\u2019\u00e9conomie politique, volume I and II, F. Rouge, Lausanne, 1896."},{"issue":"5","key":"4_CR20","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, n. 5, pp. 1207\u20131234, 1995.","journal-title":"SIAM Journal"},{"key":"4_CR21","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":"4_CR22","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":["Studies in Computational Intelligence","Genetic Systems Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32498-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:55:51Z","timestamp":1619556951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32498-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540298495"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-32498-4_4","relation":{},"subject":[]}}