{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:50Z","timestamp":1750307210266,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,23]],"date-time":"2012-01-23T00:00:00Z","timestamp":1327276800000},"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":[[2012,1,23]]},"DOI":"10.1145\/2103746.2103770","type":"proceedings-article","created":{"date-parts":[[2012,1,24]],"date-time":"2012-01-24T16:47:19Z","timestamp":1327423639000},"page":"121-130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Functional programs as compressed data"],"prefix":"10.1145","author":[{"given":"Naoki","family":"Kobayashi","sequence":"first","affiliation":[{"name":"Tohoku University, Sendai, Japan"}]},{"given":"Kazutaka","family":"Matsuda","sequence":"additional","affiliation":[{"name":"Tohoku University, Sendai, Japan"}]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[{"name":"Tohoku University, Sendai, Japan"}]}],"member":"320","published-online":{"date-parts":[[2012,1,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273659"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.40"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2008.01.004"},{"key":"e_1_3_2_1_4_1","unstructured":"H. Comon M. Dauchet R. Gilleron C. Loding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata 2007. release October 12th 2007.  H. Comon M. Dauchet R. Gilleron C. Loding F. Jacquemard D. Lugiez S. Tison and M. Tommasi. Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata 2007. release October 12th 2007."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/4838"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02915449"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.34"},{"volume-title":"Springer-Verlag","year":"2004","author":"Hutter M.","key":"e_1_3_2_1_9_1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.3115\/992133.992174"},{"issue":"2","key":"e_1_3_2_1_11_1","first-page":"129","article-title":"An efficient pattern matching algorithm for strings with short description","volume":"4","author":"Karpinski M.","year":"1997","journal-title":"Nordic Journal on Computing"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00426-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646794.704852"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1599410.1599415"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480933"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987171.1987193"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"N. Kobayashi K. Matsuda and A. Shonohara. Functional programs as compressed data. An extended version available from the first author's web page 2012.  N. Kobayashi K. Matsuda and A. Shonohara. Functional programs as compressed data. An extended version available from the first author's web page 2012.","DOI":"10.1145\/2103746.2103770"},{"first-page":"296","volume-title":"Proc. Data Compression Conference '99 (DCC'99)","author":"Larsson N. J.","key":"e_1_3_2_1_18_1"},{"volume-title":"Handbook of Theoretical Computer Science","year":"1990","author":"Li M.","key":"e_1_3_2_1_19_1"},{"volume-title":"Springer-Verlag","year":"2009","author":"Li M.","key":"e_1_3_2_1_20_1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2011.42"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24727-2_26"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.016"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/40.2_and_3.103"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.38"},{"key":"e_1_3_2_1_26_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"ESA'94","author":"Plandowski W.","year":"1994"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00777-6"},{"key":"e_1_3_2_1_28_1","series-title":"LNCS","first-page":"15","volume-title":"ICALP'04","author":"Rytter W.","year":"2004"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2004.08.016"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008109312730"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90007-0"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"C. Stirling. Decidability of higher-order matching. Logical Methods in Computer Science 5(3) 2009.  C. Stirling. Decidability of higher-order matching. Logical Methods in Computer Science 5(3) 2009.","DOI":"10.2168\/LMCS-5(3:2)2009"},{"key":"e_1_3_2_1_34_1","series-title":"Dagstuhl Seminar Proceedings","volume-title":"Kolmogorov Complexity and Applications","author":"Tromp J.","year":"2006"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12032-9_24"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00073-6"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863548"}],"event":{"name":"POPL '12: The 39th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Philadelphia Pennsylvania USA","acronym":"POPL '12"},"container-title":["Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103746.2103770","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2103746.2103770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:35Z","timestamp":1750241195000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2103746.2103770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,23]]},"references-count":36,"alternative-id":["10.1145\/2103746.2103770","10.1145\/2103746"],"URL":"https:\/\/doi.org\/10.1145\/2103746.2103770","relation":{},"subject":[],"published":{"date-parts":[[2012,1,23]]},"assertion":[{"value":"2012-01-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}