{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:08Z","timestamp":1750219988158,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"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":[[2022,11,29]]},"DOI":"10.1145\/3564719.3568698","type":"proceedings-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T21:20:14Z","timestamp":1669929614000},"page":"33-44","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Deep Fusion for Efficient Nested Recursive Computations"],"prefix":"10.1145","author":[{"given":"Amir","family":"Shaikhha","sequence":"first","affiliation":[{"name":"University of Edinburgh, UK"}]}],"member":"320","published-online":{"date-parts":[[2022,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"ACM Haskell Symposium. ACM","author":"Anker Johan","year":"2013","unstructured":"Johan Anker and Josef Svenningsson. 2013. An EDSL approach to high performance Haskell programming. In ACM Haskell Symposium. ACM, New York, NY, USA. 1\u201312."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24276-2_8"},{"volume-title":"Logic of programming and calculi of discrete design","author":"Bird Richard S","key":"e_1_3_2_1_3_1","unstructured":"Richard S Bird. 1987. An introduction to the theory of lists. In Logic of programming and calculi of discrete design. Springer, 5\u201342."},{"key":"e_1_3_2_1_4_1","unstructured":"Fr\u00e9d\u00e9ric Bour Basile Cl\u00e9ment and Gabriel Scherer. 2021. Tail Modulo Cons. arXiv preprint arXiv:2102.09823."},{"volume-title":"Naturally embedded query languages","author":"Breazu-Tannen Val","key":"e_1_3_2_1_5_1","unstructured":"Val Breazu-Tannen, Peter Buneman, and Limsoon Wong. 1992. Naturally embedded query languages. Springer."},{"volume-title":"Logical and computational aspects of programming with sets\/bags\/lists","author":"Breazu-Tannen Val","key":"e_1_3_2_1_6_1","unstructured":"Val Breazu-Tannen and Ramesh Subrahmanyam. 1991. Logical and computational aspects of programming with sets\/bags\/lists. Springer."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00024-Q"},{"key":"e_1_3_2_1_8_1","volume-title":"Functional Programming, Glasgow","author":"Bunkenburg Alexander","year":"1993","unstructured":"Alexander Bunkenburg. 1994. The boom hierarchy. In Functional Programming, Glasgow 1993. Springer, 1\u20138."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103736.2103740"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Duncan Coutts Roman Leshchinskiy and Don Stewart. 2007. Stream Fusion. From Lists to Streams to Nothing at All. In ICFP \u201907.","DOI":"10.1145\/1291151.1291199"},{"volume-title":"Optimizing almost-tail-recursive prolog programs","author":"Debray Saumya K.","key":"e_1_3_2_1_11_1","unstructured":"Saumya K. Debray. 1985. Optimizing almost-tail-recursive prolog programs. In Functional Programming Languages and Computer Architecture, Jean-Pierre Jouannaud (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg. 204\u2013219. isbn:978-3-540-39677-2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2543728.2543736"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796817000193"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/377674.377676"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-006-0018-x"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008705026446"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062354"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/242224.242477"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the","author":"Iverson Kenneth E","year":"1962","unstructured":"Kenneth E Iverson. 1962. A Programming Language. In Proceedings of the May 1-3, 1962, spring joint computer conference. 345\u2013351."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1561\/2500000038"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009880"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1523"},{"key":"e_1_3_2_1_24_1","volume-title":"Algorithmics: Towards programming as a mathematical activity.","author":"Meertens LGLT","year":"1986","unstructured":"LGLT Meertens. 1986. Algorithmics: Towards programming as a mathematical activity."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142552"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002940"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3475726.3475728"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3136040.3136043"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. ACM Program. Lang., 2, POPL","author":"Parreaux Lionel","year":"2017","unstructured":"Lionel Parreaux, Antoine Voizard, Amir Shaikhha, and Christoph E. Koch. 2017. Unifying Analytic and Statically-typed Quasiquotes. Proc. ACM Program. Lang., 2, POPL (2017), Article 13, Dec., 33 pages. issn:2475-1421"},{"key":"e_1_3_2_1_30_1","unstructured":"Tore Risch. 1973. REMREC a program for automatic recursion removal in LISP. Univ.."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/49346.49347"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796818000102"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3122948.3122949"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341701"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ECOOP.2022.33"},{"key":"e_1_3_2_1_36_1","volume-title":"OOPSLA1","author":"Shaikhha Amir","year":"2022","unstructured":"Amir Shaikhha, Mathieu Huot, Jaclyn Smith, and Dan Olteanu. 2022. Functional collection programming with semi-ring dictionaries. PACMPL, 6, OOPSLA1 (2022), 1\u201333."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915244"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3486609.3487203"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/581478.581491"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2636228.2636231"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224221"},{"key":"e_1_3_2_1_42_1","volume-title":"Proc. of the 3rd DBPL workshop (DBPL3). Morgan Kaufmann Publishers Inc.","author":"Trinder Phil","year":"1992","unstructured":"Phil Trinder. 1992. Comprehensions, a Query Notation for DBPLs. In Proc. of the 3rd DBPL workshop (DBPL3). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. 55\u201368. isbn:1-55860-242-9"},{"key":"e_1_3_2_1_43_1","volume-title":"Deforestation: Transforming programs to eliminate trees. In ESOP\u201988. 344\u2013358.","author":"Wadler Philip","year":"1988","unstructured":"Philip Wadler. 1988. Deforestation: Transforming programs to eliminate trees. In ESOP\u201988. 344\u2013358."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91592"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341700"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003585"},{"volume-title":"Resilient Distributed Datasets: A Fault-tolerant Abstraction for In-memory Cluster Computing. NSDI\u201912","author":"Zaharia Matei","key":"e_1_3_2_1_47_1","unstructured":"Matei Zaharia, Mosharaf Chowdhury, Tathagata Das, Ankur Dave, Justin Ma, Murphy McCauley, Michael J. Franklin, Scott Shenker, and Ion Stoica. 2012. Resilient Distributed Datasets: A Fault-tolerant Abstraction for In-memory Cluster Computing. NSDI\u201912. USENIX Association, 1 pages."}],"event":{"name":"GPCE '22: 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Auckland New Zealand","acronym":"GPCE '22"},"container-title":["Proceedings of the 21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564719.3568698","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564719.3568698","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:30Z","timestamp":1750182570000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564719.3568698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,29]]},"references-count":47,"alternative-id":["10.1145\/3564719.3568698","10.1145\/3564719"],"URL":"https:\/\/doi.org\/10.1145\/3564719.3568698","relation":{},"subject":[],"published":{"date-parts":[[2022,11,29]]},"assertion":[{"value":"2022-12-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}