{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:02:38Z","timestamp":1767927758261,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T00:00:00Z","timestamp":1377648000000},"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":[[2013,8,28]]},"DOI":"10.1145\/2620678.2620679","type":"proceedings-article","created":{"date-parts":[[2014,10,31]],"date-time":"2014-10-31T19:32:56Z","timestamp":1414783976000},"page":"4321-4332","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The Under-Performing Unfold"],"prefix":"10.1145","author":[{"given":"Jennifer","family":"Hackett","sequence":"first","affiliation":[{"name":"University of Nottingham"}]},{"given":"Graham","family":"Hutton","sequence":"additional","affiliation":[{"name":"University of Nottingham"}]},{"given":"Mauro","family":"Jaskelioff","sequence":"additional","affiliation":[{"name":"Universidad Nacional de Rosario, Argentina, CIFASIS--CONICET, Argentina"}]}],"member":"320","published-online":{"date-parts":[[2013,8,28]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"R. Bird and P. Wadler. Introduction to Functional Programming. Prentice Hall International Series in Computer Science. 1988.   R. Bird and P. Wadler. Introduction to Functional Programming. Prentice Hall International Series in Computer Science. 1988."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/317636.317907"},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","volume-title":"TYPES '93","author":"Coquand T.","year":"1993"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291199"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364506.2364508"},{"key":"e_1_3_2_1_6_1","series-title":"London Mathematical Society Lecture Note Series","volume-title":"Applications of Categories in Computer Science","author":"Freyd P. J.","year":"1992"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11783596_12"},{"key":"e_1_3_2_1_8_1","unstructured":"J. Gibbons and G. Hutton. Proof Methods for Corecursive Programs. Fundamenta Informaticae Special Issue on Program Transformation 66(4) April-May 2005.   J. Gibbons and G. Hutton. Proof Methods for Corecursive Programs. Fundamenta Informaticae Special Issue on Program Transformation 66(4) April-May 2005."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/289423.289455"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007175"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_1_12_1","volume-title":"In Glasgow Functional Programming Workshop. Springer","author":"Gordon A. D.","year":"1994"},{"key":"e_1_3_2_1_13_1","volume-title":"University of Edinburgh","author":"Hagino T.","year":"1987"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411232"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796810000122"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"K. E. Iverson. A Programming Language. Wiley 1962.   K. E. Iverson. A Programming Language. Wiley 1962.","DOI":"10.1145\/1460833.1460872"},{"key":"e_1_3_2_1_17_1","volume-title":"Rijksuniversiteit Groningen","author":"Malcolm G.","year":"1990"},{"key":"e_1_3_2_1_18_1","series-title":"Lecture Notes in Computer Science","volume-title":"FPCA '91","author":"Meijer E.","year":"1991"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/292540.292547"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"L. S. Moss and N. Danner. On the Foundations of Corecursion. Logic Journal of the IGPL 1997 5 2","DOI":"10.1093\/jigpal\/5.2.231"},{"key":"e_1_3_2_1_21_1","first-page":"11","author":"Pardo A.","year":"1998","journal-title":"Applications. Electr. Notes Theor. Comput. Sci."},{"key":"e_1_3_2_1_22_1","volume-title":"Cambridge University Press","author":"Jones S. Peyton","year":"2003"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291200"},{"key":"e_1_3_2_1_24_1","author":"Sculthorpe N.","year":"2013","journal-title":"Work It, Wrap It, Fix It, Fold It. Submitted to the Journal of Functional Programming"},{"key":"e_1_3_2_1_25_1","volume-title":"The HERMIT in the Tree: Mechanizing Program Transformations in the GHC Core Language. In Draft Proceedings of Implementation and Application of Functional Languages (IFL '12)","author":"Sculthorpe N.","year":"2012"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224221"},{"key":"e_1_3_2_1_27_1","volume-title":"Canterbury","author":"Turner D. A.","year":"1989"},{"key":"e_1_3_2_1_28_1","series-title":"Lecture Notes in Computer Science","volume-title":"FPLE '95","author":"Turner D. A.","year":"1995"},{"key":"e_1_3_2_1_29_1","unstructured":"T. Uustalu and V. Vene. Primitive (Co)Recursion and Course-of-Value (Co)Iteration Categorically. Informatica Lith. Acad. Sci. 10 (1) 1999.  T. Uustalu and V. Vene. Primitive (Co)Recursion and Course-of-Value (Co)Iteration Categorically. Informatica Lith. Acad. Sci. 10 (1) 1999."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328408.1328412"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90147-A"}],"event":{"name":"IFL '13: The 25th symposium on Implementation and Application of Functional Languages","location":"Nijmegen Netherlands","acronym":"IFL '13"},"container-title":["Proceedings of the 25th symposium on Implementation and Application of Functional Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2620678.2620679","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2620678.2620679","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:56:15Z","timestamp":1750272975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2620678.2620679"}},"subtitle":["A new approach to optimising corecursive programs"],"short-title":[],"issued":{"date-parts":[[2013,8,28]]},"references-count":31,"alternative-id":["10.1145\/2620678.2620679","10.1145\/2620678"],"URL":"https:\/\/doi.org\/10.1145\/2620678.2620679","relation":{},"subject":[],"published":{"date-parts":[[2013,8,28]]},"assertion":[{"value":"2013-08-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}