{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:49Z","timestamp":1772163949089,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T00:00:00Z","timestamp":1221868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,9,20]]},"DOI":"10.1145\/1411204.1411242","type":"proceedings-article","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T09:39:01Z","timestamp":1222162741000},"page":"267-274","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Pattern minimization problems over recursive data types"],"prefix":"10.1145","author":[{"given":"Alexander","family":"Krauss","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t M\u00fcnchen, Garching, Germany"}]}],"member":"320","published-online":{"date-parts":[[2008,9,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/5280.5303"},{"key":"e_1_3_2_2_2_1","volume-title":"Unpublished","author":"Baudinet Marianne","year":"1985","unstructured":"Marianne Baudinet and David MacQueen. Tree pattern matching for ML. URL http:\/\/www.smlnj.org\/compiler-notes\/85-note-baudinet.ps. Unpublished, 1985."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/577427"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_43"},{"key":"e_1_3_2_2_5_1","volume-title":"Technische Universit\u00e4t M\u00fcnchen","author":"Chaieb Amine","year":"2008","unstructured":"Amine Chaieb. Automated methods for formal proofs in simple arithmetics and algebra. D thesis, Technische Universit\u00e4t M\u00fcnchen, Germany, April 2008."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/507635.507641"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/155278"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322230"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/647698.734154"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/167412"},{"key":"e_1_3_2_2_11_1","volume-title":"Logic Design Principles","author":"McCluskey E. J.","year":"1986","unstructured":"E. J. McCluskey. Logic Design Principles. Prentice Hall, 1986."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1956.tb03835.x"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","unstructured":"Tobias Nipkow Lawrence C. Paulson and Markus Wenzel. Isabelle\/HOL - A Proof Assistant for Higher-Order Logic. LNCS 2283. Springer 2002.","DOI":"10.5555\/1791547"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003494"},{"key":"e_1_3_2_2_15_1","volume-title":"Computational Complexity","author":"Papadimitriou Christos H.","year":"1994","unstructured":"Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, New York, 1994."},{"key":"e_1_3_2_2_16_1","volume-title":"Completeness in the polynomial-time hierarchy: Part I: A compendium","author":"Schaefer Markus","year":"2002","unstructured":"Markus Schaefer and Christopher Umans. Completeness in the polynomial-time hierarchy: Part I: A compendium. SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory), 33, 2002."},{"key":"e_1_3_2_2_17_1","volume-title":"Reasoning About Terminating Functional Programs. D thesis","author":"Slind Konrad","year":"1999","unstructured":"Konrad Slind. Reasoning About Terminating Functional Programs. D thesis, Institut f\u00fcr Informatik, TU M\u00fcnchen, 1999."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(92)90033-8"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/520533"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/933043"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855944"},{"key":"e_1_3_2_2_22_1","volume-title":"S. L. Peyton Jones, The Implementation of Functional Programming Languages","author":"Wadler Philip","year":"1987","unstructured":"Philip Wadler. Efficient compilation of pattern-matching. In S. L. Peyton Jones, The Implementation of Functional Programming Languages, chapter 5. Prentice-Hall International, 1987."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","unstructured":"Lyndon While and Tony Field. Optimising parallel pattern-matching by source-level program transformation. In Vladimir Estivill-Castro editor ACSC volume 38 of CRPIT pages 239--248. Australian Computer Society 2005. ISBN 1-920682-20-1.","DOI":"10.5555\/1082161.1082188"}],"event":{"name":"ICFP08: ACM SIGPLAN International Conference on Functional Programming","location":"Victoria BC Canada","acronym":"ICFP08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 13th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411204.1411242","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1411204.1411242","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T16:40:39Z","timestamp":1755189639000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411204.1411242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,20]]},"references-count":23,"alternative-id":["10.1145\/1411204.1411242","10.1145\/1411204"],"URL":"https:\/\/doi.org\/10.1145\/1411204.1411242","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1411203.1411242","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,9,20]]},"assertion":[{"value":"2008-09-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}