{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T12:06:21Z","timestamp":1749125181544},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539827"},{"type":"electronic","value":"9783540465638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53982-4_4","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:20:58Z","timestamp":1330190458000},"page":"57-73","source":"Crossref","is-referenced-by-count":6,"title":["Compilation of pattern matching with associative-commutative functions"],"prefix":"10.1007","author":[{"given":"E.","family":"Kounalis","sequence":"first","affiliation":[]},{"given":"D.","family":"Lugiez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"L Augustsson. Compiling pattern matching. In Proceedings of the 2nd Conference on Functional Programming Languages and Computer Architecture, volume 201, Nancy (France), 1985. Springer Verlag, Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-15975-4_48"},{"issue":"1&2","key":"4_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0747-7171(87)80027-5","volume":"3","author":"D. Benanav","year":"1987","unstructured":"D. Benanav, D. Kapur, and P. Narendran. Complexity of matching problems. Journal of Symbolic Computation, 3(1 & 2):203\u2013216, April 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR3","unstructured":"B. Gramlich and J. Denzinger. Efficient ac-matching using constraint propagation. Technical Report SR-88-15, SEKI, Universite' de Kaiserslautern, RFA, 1988."},{"key":"4_CR4","unstructured":"G. Huet and J.J. Levy. Call by need computations in non-ambiguous linear term rewriting systems. Research report 359, INRIA, August 1979."},{"key":"4_CR5","unstructured":"J.P. Jouannaud and E. Kounalis. Proof by induction in equational theories without constructors. In Proceedings 1st Symp. on Logic In Computer Science, pages 358\u2013366, Boston (USA), 1986."},{"key":"4_CR6","unstructured":"D. Kapur, P. Narendran, D.J. Rosenkrantz, and H. Zhang. Sufficient-completeness, quasi-reducibility and their complexity. Technical report, State University of New York at Albany, 1987."},{"key":"4_CR7","unstructured":"E. Kounalis. Testing for inductive-(co)-reducibility in rewrite system. In 15th Colloquium on Trees in Algebra and Programming, volume 431 of Lecture Notes in Computer Science, pages pp175\u2013191. Springer-Verlag, 1990."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"A. Laville. Lazy pattern matching in the ML language. In Proceedings 7th Conf. on Foundations of Software Technology and Theoretical Computer Science, volume 287 of Lecture Notes in Computer Science, pages 400\u2013419. Springer-Verlag, Lecture Notes in Computer Science, December 1987.","DOI":"10.1007\/3-540-18625-5_64"},{"key":"4_CR9","unstructured":"A. Laville. Comparison of priority rules in pattern matching and term rewriting. Technical report, INRIA, 1988."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"P. W. Purdom and C. A. Brown. Fast-many-to-one matching algorithm. In J. P. Jouannaud, editor, Proc. 1st Conf. Rewriting Techniques and Applications, pages 407\u2013416. Springer-Verlag, Lecture Notes in Computer Science, 1985.","DOI":"10.1007\/3-540-15976-2_21"},{"key":"4_CR11","unstructured":"S. Peyton-Jones. The implementation of functional programming languages. Prentice Hall, 1987."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"L. Puel and A. Suarez. Compiling pattern matching by term decomposition. In Proceedings ACM Conference on LISP and Functional Programming, 1990.","DOI":"10.1145\/91556.91670"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6423(88)90002-0","volume":"11","author":"P. Schnoebelen","year":"1988","unstructured":"Ph. Schnoebelen. Refined compilation of pattern matching for functional languages. Science of Computer Programming, 11:133\u2013159, 1988.","journal-title":"Science of Computer Programming"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"R.C. Sekar and I.V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. In 5th Symp. Logic in Computer Science, pages 230\u2013241. IEEE, 1990.","DOI":"10.1109\/LICS.1990.113749"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Ralf Treinen. A new method for undecidability proofs of first order theories. In K. V. Nori and C. E. Veni Madhavan, editors, Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science, pages 48\u201362. Springer Lecture Notes in Computer Science, vol. 472, 1990.","DOI":"10.1007\/3-540-53487-3_34"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53982-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:18:07Z","timestamp":1619558287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53982-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539827","9783540465638"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-53982-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}