{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:36Z","timestamp":1725663336002},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540506676"},{"type":"electronic","value":"9783540460633"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50667-5_75","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:30:14Z","timestamp":1330183814000},"page":"233-243","source":"Crossref","is-referenced-by-count":4,"title":["Refined compilation of pattern-matching for functional languages"],"prefix":"10.1007","author":[{"given":"Ph.","family":"Schnoebelen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"L. Augustsson. A compiler for Lazy ML. In Proc. ACM Conf. Lisp and Functional Programming, Austin, Texas, August 1984.","DOI":"10.1145\/800055.802038"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"L. Augustsson. Compiling pattern matching. In Functional Programming Languages and Computer Architecture, Nancy, LNCS 201, Springer-Verlag, September 1985.","DOI":"10.1007\/3-540-15975-4_48"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"L. Cardelli. Compiling a functional language. In Proc. ACM Conf. Lisp and Functional Programming, Austin, Texas, August 1984.","DOI":"10.1145\/800055.802037"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"H. Comon. An effective method for handling initial algebras. In Proc. 1st Workshop on Algebraic and Logic Programming, Gaussig, 1988.","DOI":"10.1007\/3-540-50667-5_62"},{"key":"23_CR5","volume-title":"Unification et Disunification: Th\u00e9orie et Applications","author":"H. Comon","year":"1988","unstructured":"H. Comon. Unification et Disunification: Th\u00e9orie et Applications. Th\u00e8se de Doctorat, I.N.P. de Grenoble, France, 1988."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Futatsugi, Goguen, Jouannaud, and Meseguer. Principles of OBJ2. In Proc. ACM Symp. Principles of Programming Languages, 1985.","DOI":"10.1145\/318593.318610"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"G. Huet and D. Oppen. Equations and rewrite rules: a survey. In R. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 349\u2013405, Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"H. Hsiang and M. Rusinowitch. On word problems in equational theories. In Proc. 14th ICALP, LNCS 267, Springer-Verlag, 1987.","DOI":"10.1007\/3-540-18088-5_6"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Ph. Jorrand. Term rewriting as a basis for the design of a functional and parallel programming language. A case study: the language FP2. In Fundamentals of Artificial Intelligence, LNCS 232, Springer-Verlag, 1986.","DOI":"10.1007\/BFb0022684"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"A. Laville. Lazy pattern matching in the ML language. In Proc. 7th Conf. Found. of Software Technology and Theoretical Computer Science, Pune, INDIA, LNCS 287, December 1987.","DOI":"10.1007\/3-540-18625-5_64"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner. A proposal for Standard ML. In Proc. ACM Conf. Lisp and Functional Programming, Austin, Texas, August 1984.","DOI":"10.1145\/800055.802035"},{"key":"23_CR12","unstructured":"S. Peyton-Jones. The Implementation of Functional Programming Languages. Prentice Hall Int., 1987."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Ph. Schnoebelen. Refined Compilation of Pattern-Matching for Functional Languages. Research Report Lifia 71 Imag 715, Univ. Grenoble, April 1988.","DOI":"10.1007\/3-540-50667-5_75"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"S. Thompson. Laws in Miranda. In Proc. ACM Conf. Lisp and Functional Programming, Cambridge, Mass., August 1986.","DOI":"10.1145\/319838.319839"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"D. A. Turner. Miranda: a non-strict functional language with polymorphic types. In Functional Programming Languages and Computer Architecture, Nancy, LNCS 201, Springer-Verlag, September 1985.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"P. Wadler. A critique of Abelson and Sussman or Why calculating is better than scheming. SIGPLAN Notices, 22(3), March 1987.","DOI":"10.1145\/24697.24706"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50667-5_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T06:08:16Z","timestamp":1561356496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50667-5_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540506676","9783540460633"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-50667-5_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}