{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:08Z","timestamp":1725663728525},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540566106"},{"type":"electronic","value":"9783540475989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56610-4_85","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:22:00Z","timestamp":1330255320000},"page":"501-518","source":"Crossref","is-referenced-by-count":0,"title":["Optimal solutions to pattern matching problems"],"prefix":"10.1007","author":[{"given":"Laurence","family":"Puel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asc\u00e1nder","family":"Su\u00e1rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"34_CR1","volume-title":"Rapport IRIA Laboria 359","author":"G. Huet","year":"1979","unstructured":"G. Huet and J-J. L\u00e9vy. Call by need computations in non ambiguous linear term rewriting systems. Rapport IRIA Laboria 359, INRIA, Domaine de Voluceau, Rocquencourt BP105, 78153 Le Chesnay Cedex. FRANCE, 1979."},{"key":"34_CR2","unstructured":"G. Huet and J-J. L\u00e9vy. Call by need computations in orthogonal term rewriting systems. In J.L. Lassez and G. Plotkin, editors, Computational Logic. MIT Press, 1991."},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"J.W. Klop and A. Middeldorp. Sequentiality in orthogonal term rewriting systems. J. Symbolic Computation, 12(2), 1991.","DOI":"10.1016\/S0747-7171(08)80124-1"},{"key":"34_CR4","unstructured":"A. Laville. Evaluation paresseuse des filtrages avec priorit\u00e9. Application au Langage ML. PhD thesis, Universit\u00e9 Paris 7, 1988. Th\u00e8se."},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"A. Laville. Implementation of lazy pattern matching algorithms. In H. Ganzinger, editor, ESOP'88, pages 298\u2013316. Lecture Notes in Computer Science 300, March 1988.","DOI":"10.1007\/3-540-19027-9_20"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"G. Plotkin. Call-by-name, call-by-value and the \u03bb-calculus. In TCS, pages 125\u2013159, 1975.","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"L. Puel and A. Su\u00e1rez. Compiling pattern matching by term decomposition. In acm conf. on Lisp and Functional Programming, pages 273\u2013281. acm Press, June 1990.","DOI":"10.1145\/91556.91670"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT'93: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56610-4_85.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:05Z","timestamp":1605647105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56610-4_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566106","9783540475989"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-56610-4_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}