{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:30:09Z","timestamp":1725672609300},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1145\/91556.91670","type":"proceedings-article","created":{"date-parts":[[2004,2,3]],"date-time":"2004-02-03T16:51:37Z","timestamp":1075827097000},"page":"273-281","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Compiling pattern matching by term decomposition"],"prefix":"10.1145","author":[{"given":"Laurence","family":"Puel","sequence":"first","affiliation":[{"name":"LIENS URA CNRS 1327, Ecole Normale Sup\u00e9rieure, 45 rue d'Ulm, 75005 Paris FRANCE"}]},{"given":"Ascander","family":"Suarez","sequence":"additional","affiliation":[{"name":"Digital Equipment Corporation, Paris Research Laboratory, 85 Av Victor Hugo, 92563 Rueil Malmaison, FRANCE"}]}],"member":"320","published-online":{"date-parts":[[1990,5]]},"reference":[{"volume-title":"Proc, 3rd International Colloquium on Programming","year":"1978","key":"e_1_3_2_1_1_2","unstructured":"G, Berry. S6quentialit6 de l'6valuation formelle des lambdaexpressions . In Proc, 3rd International Colloquium on Programming , Paris , March 1978 . Dunod. G, Berry. S6quentialit6 de l'6valuation formelle des lambdaexpressions. In Proc, 3rd International Colloquium on Programming, Paris, March 1978. Dunod."},{"key":"e_1_3_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/800087.802799"},{"volume-title":"The definition of Standard ML version 2. LFCS Report Series 88-62","author":"Hatter R.","key":"e_1_3_2_1_3_2","unstructured":"R. Hatter , R. Milner , and M. Torte . The definition of Standard ML version 2. LFCS Report Series 88-62 , University of EAinb~ , Department of Computer science, The King's Buildings, Edinburgh EH9 3TZ, Scotland, 1988. R. Hatter, R. Milner, and M. Torte. The definition of Standard ML version 2. LFCS Report Series 88-62, University of EAinb~, Department of Computer science, The King's Buildings, Edinburgh EH9 3TZ, Scotland, 1988."},{"key":"e_1_3_2_1_4_2","volume-title":"FRANCE","author":"Huet G.","year":"1979","unstructured":"G. Huet and J.-J. L,6vy. Call by need computations in non ambiguous linear term rewriting systems. Rapport IRIA Laboria 359, IN, Domaine de Voluceau, Rocquencoun BP105, 78153 Le Chesnay Cedex . FRANCE , 1979 . G. Huet and J.-J. L,6vy. Call by need computations in non ambiguous linear term rewriting systems. Rapport IRIA Laboria 359, IN, Domaine de Voluceau, Rocquencoun BP105, 78153 Le Chesnay Cedex. FRANCE, 1979."},{"key":"e_1_3_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"e_1_3_2_1_6_2","volume-title":"UnJversit6 Paris 7","author":"Laville A.","year":"1988","unstructured":"A. Laville . Evaluation paresseuse des filtrages avec prioritt~. Application au Langage ML. Th~se , UnJversit6 Paris 7 , 1988 . A. Laville. Evaluation paresseuse des filtrages avec prioritt~. Application au Langage ML. Th~se, UnJversit6 Paris 7, 1988."},{"key":"e_1_3_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.5555\/645387.651564"},{"key":"e_1_3_2_1_8_2","volume-title":"Universit6 Paris 7","author":"Puel L.","year":"1987","unstructured":"L. Puel . Bons prt~ordres sur les arbres associt~s ti des ensembles in~vitables et preuves de terminaison de systbmes de rt~criture. Thise d'Etat , Universit6 Paris 7 , 1987 . L. Puel. Bons prt~ordres sur les arbres associt~s ti des ensembles in~vitables et preuves de terminaison de systbmes de rt~criture. Thise d'Etat, Universit6 Paris 7, 1987."},{"key":"e_1_3_2_1_9_2","first-page":"371","volume-title":"RTA","author":"Puel L.","year":"1989","unstructured":"L. Puel . Embedding with patterns and associated recursive path ordering. In N. Dershowitz, editor , RTA , pages 371 - 387 . ~ture Notes in Computer Science 355, April 1989 . L. Puel. Embedding with patterns and associated recursive path ordering. In N. Dershowitz, editor, RTA, pages 371-387. ~ture Notes in Computer Science 355, April 1989."},{"key":"e_1_3_2_1_10_2","volume-title":"FRANCE","author":"Weis P.","year":"1989","unstructured":"P. Weis The CAML reference manual. Available through iNRIA, Domaine de Voluceau, Rocquencourt BP105, 78153 Le Chesnay Cedex . FRANCE , January 1989 . P. Weis et al. The CAML reference manual. Available through iNRIA, Domaine de Voluceau, Rocquencourt BP105, 78153 Le Chesnay Cedex. FRANCE, January 1989."}],"event":{"name":"LFP90: ACM Conference on Lisp and Functional Programming","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation","INRIA Institut Natl de Recherche en Info et en Automatique"],"location":"Nice France","acronym":"LFP90"},"container-title":["Proceedings of the 1990 ACM conference on LISP and functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/91556.91670","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T23:24:06Z","timestamp":1673306646000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/91556.91670"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":10,"alternative-id":["10.1145\/91556.91670","10.1145\/91556"],"URL":"https:\/\/doi.org\/10.1145\/91556.91670","relation":{},"subject":[],"published":{"date-parts":[[1990,5]]},"assertion":[{"value":"1990-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}