{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:47Z","timestamp":1725663407224},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540190271"},{"type":"electronic","value":"9783540389415"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19027-9_20","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:56:18Z","timestamp":1330199778000},"page":"298-316","source":"Crossref","is-referenced-by-count":5,"title":["Implementation of lazy pattern matching algorithms"],"prefix":"10.1007","author":[{"given":"Alain","family":"Laville","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"L. Augustsson \u201cA Compiler for Lazy ML\u201d, A.C.M. Conference on Lisp and Functional Programming, Austin 1984, pp 218\u2013225","DOI":"10.1145\/800055.802038"},{"key":"20_CR2","unstructured":"L. Augustsson \u201cA Pattern Matching Compiler\u201d, Conf. on Functional Programming Languages and Computer Architecture, Nancy, 1985 (LNCS 217)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"R. Burstall D. MacQueen D. Sannella \u201cHOPE: An Experimental Applicative Language\u201d, A.C.M. Conference on Lisp and Functional Programming, Stanford 1980, pp 136\u2013143","DOI":"10.1145\/800087.802799"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"G. Cousineau P.L. Curien M. Mauny \u201cThe Categorical Abstract Machine\u201d, in J.P. Jouannaud ed. Functional Programming Languages and Computer Architecture, L.N.C.S. 201, Springer Verlag 1985","DOI":"10.1007\/3-540-15975-4_29"},{"key":"20_CR5","unstructured":"G. Huet J.J. L\u00e9vy \u201cCall by Need Computations in Non Ambiguous Linear Term Rewriting Systems\u201d, Rapport IRIA Laboria 359, August 1979"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"A. Laville \u201cLazy Pattern Matching in the ML Language\u201d, Proceedings of the 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Pune (India), December 1987, L.N.C.S.","DOI":"10.1007\/3-540-18625-5_64"},{"key":"20_CR7","unstructured":"A. Laville \u201cFiltrage et Evaluation paresseuse\u201d, Th\u00e8se de Doctorat, Universit\u00e9 Paris 7, to appear"},{"key":"20_CR8","unstructured":"M. Mauny \u201cCompilation des Langages Fonctionnels dans les Combinateurs Cat\u00e9goriques, Application au langage ML\u201d, Th\u00e8se de 3\u00e8me cycle, Universit\u00e9 Paris 7, 1985"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"M. Mauny A. Suarez \u201cImplementing Functional Languages in the Categorical Abstract Machine\u201d, A.C.M. Conference on Lisp and Functional Programming, Cambridge 1986, pp 266\u2013278","DOI":"10.1145\/319838.319869"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"R. Milner \u201cA Proposal for Standard ML\u201d, A.C.M. Conference on Lisp and Functional Programming, Austin 1984, pp 184\u2013197","DOI":"10.1145\/800055.802035"},{"key":"20_CR11","first-page":"125","volume":"1","author":"G. Plotkin","year":"1975","unstructured":"G. Plotkin \u201cCall-by-need, Call-by-value and the Lambda Calculus\u201d, T.C.S. Vol 1, pp 125\u2013159, 1975","journal-title":"T.C.S."},{"key":"20_CR12","unstructured":"A. Suarez \u201cUne Impl\u00e9mentation de ML en ML\u201d, Th\u00e8se, Universit\u00e9 Paris 7, to appear"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"D. Turner \u201cMiranda a Non Strict Functional Language with Polymorphic Types\u201d, in J.P. Jouannaud ed. Functional Programming Languages and Computer Architecture, L.N.C.S. 201, Springer Verlag 1985","DOI":"10.1007\/3-540-15975-4_26"},{"key":"20_CR14","unstructured":"P. Wadler, \u201cEfficient Compilation of Pattern Matching\u201d, in S. Peyton Jones The Implementation of Functional Programming Languages, Prentice-Hall Series in Computer Science, 1987"}],"container-title":["Lecture Notes in Computer Science","ESOP '88"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-19027-9_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:16:12Z","timestamp":1605644172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19027-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540190271","9783540389415"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-19027-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}