{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T21:09:46Z","timestamp":1789938586616,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,29]],"date-time":"2015-08-29T00:00:00Z","timestamp":1440806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"FWF","award":["J3563, P25781-N15"],"award-info":[{"award-number":["J3563, P25781-N15"]}]},{"name":"ANR","award":["14CE250005 ELICA"],"award-info":[{"award-number":["14CE250005 ELICA"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,29]]},"DOI":"10.1145\/2784731.2784753","type":"proceedings-article","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T12:48:13Z","timestamp":1440593293000},"page":"152-164","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Analysing the complexity of functional programs: higher-order meets first-order"],"prefix":"10.1145","author":[{"given":"Martin","family":"Avanzini","sequence":"first","affiliation":[{"name":"University of Bologna, Italy \/ INRIA, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugo","family":"Dal Lago","sequence":"additional","affiliation":[{"name":"University of Bologna, Italy \/ INRIA, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[{"name":"University of Innsbruck, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603105"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of 30th LICS. IEEE","author":"Accattoli B.","year":"2015"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499937.2499943"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00207-8"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.09.003"},{"key":"e_1_3_2_1_6_1","series-title":"LIPIcs","first-page":"48","volume-title":"Proc. of 21st RTA","author":"Avanzini M.","year":"2010"},{"key":"e_1_3_2_1_7_1","volume-title":"Polynomial Path Orders. LMCS, 9(4)","author":"Avanzini M.","year":"2013"},{"key":"e_1_3_2_1_8_1","series-title":"LIPIcs","first-page":"80","volume-title":"Proc. of 24th RTA","author":"Avanzini M.","year":"2013"},{"key":"e_1_3_2_1_9_1","volume-title":"A Combination Framework for Complexity. IC","author":"Avanzini M.","year":"2015"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2784731.2784753"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/280474"},{"key":"e_1_3_2_1_12_1","series-title":"LIPIcs","first-page":"76","volume-title":"Proc. of 26th CSL","author":"Baillot P.","year":"2012"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.08.005"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.10.022"},{"key":"e_1_3_2_1_15_1","volume-title":"Introduction to Functional Programming using Haskell","author":"Bird R.","year":"1998"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796800003877"},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","first-page":"424","volume-title":"Proc. of 4th ICTAC","author":"Bonfante G.","year":"2007"},{"key":"e_1_3_2_1_18_1","volume-title":"Linear Dependent Types and Relative Completeness. LMCS, 8(4)","author":"Dal Lago U.","year":"2012"},{"issue":"3","key":"e_1_3_2_1_19_1","first-page":"1","volume":"8","author":"Dal Lago U.","year":"2012","journal-title":"On Constructor Rewrite Systems and the Lambda Calculus. LMCS"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429090"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328457"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/773184.773202"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-004-6246-0"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11559306_12"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1890028.1890030"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08587-6_13"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/503032.503039"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/2428096.2428097"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2431407"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71070-7_32"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89439-1_45"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-012-9248-3"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.12.030"},{"key":"e_1_3_2_1_34_1","volume-title":"Call-by-Value Termination in the Untyped lambda-Calculus. LMCS, 4(1)","author":"Jones N. D.","year":"2008"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706299.1706327"},{"key":"e_1_3_2_1_36_1","series-title":"LIPIcs","first-page":"202","volume-title":"Proc. of 22nd RTA","author":"Kochems J.","year":"2011"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02348-4_21"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00011-7"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187671.2187672"},{"key":"e_1_3_2_1_40_1","volume-title":"Complexity Analysis of Term Rewrite Systems. CoRR, cs.LO\/0907.5527","author":"Moser G.","year":"2009"},{"key":"e_1_3_2_1_41_1","volume-title":"Principles of Program Analysis","author":"Nielson F.","year":"2005"},{"key":"e_1_3_2_1_42_1","first-page":"438","volume-title":"Proc. of 23rd CADE, LNAI","author":"Noschinski L."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796898003001"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/647166.717856"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/509043"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/554362"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010027404223"},{"key":"e_1_3_2_1_49_1","series-title":"LNCS","first-page":"376","volume-title":"of 3rd ESOP","author":"Sands D.","year":"1990"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_50"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.5555\/2050784.2050803"},{"key":"e_1_3_2_1_52_1","volume-title":"Term Rewriting Systems","year":"2003"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27861-0_6"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1347375.1347389"},{"key":"e_1_3_2_1_55_1","volume-title":"Modular Complexity Analysis for Term Rewriting. LMCS, 10(1:19):1\u201333","author":"Zankl H.","year":"2014"}],"event":{"name":"ICFP'15: 20th ACM SIGPLAN International Conference on Functional Programming","location":"Vancouver BC Canada","acronym":"ICFP'15","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2784731.2784753","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2784731.2784753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:16:48Z","timestamp":1750213008000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2784731.2784753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,29]]},"references-count":55,"alternative-id":["10.1145\/2784731.2784753","10.1145\/2784731"],"URL":"https:\/\/doi.org\/10.1145\/2784731.2784753","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2858949.2784753","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,8,29]]},"assertion":[{"value":"2015-08-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}