{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:24:13Z","timestamp":1770294253531,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T00:00:00Z","timestamp":1504742400000},"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":[[2017,9,7]]},"DOI":"10.1145\/3122948.3122949","type":"proceedings-article","created":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T12:52:29Z","timestamp":1504097549000},"page":"12-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Destination-passing style for efficient memory management"],"prefix":"10.1145","author":[{"given":"Amir","family":"Shaikhha","sequence":"first","affiliation":[{"name":"EPFL, Switzerland"}]},{"given":"Andrew","family":"Fitzgibbon","sequence":"additional","affiliation":[{"name":"Microsoft, UK"}]},{"given":"Simon","family":"Peyton Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research, UK"}]},{"given":"Dimitrios","family":"Vytiniotis","sequence":"additional","affiliation":[{"name":"Microsoft Research, UK"}]}],"member":"320","published-online":{"date-parts":[[2017,9,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2503778.2503789"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/142137.142162"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237771"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254079"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103736.2103740"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291199"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/173262.155113"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693024_2"},{"key":"e_1_3_2_1_9_1","volume-title":"Unwinding stylized recursions into iterations. Comput. Sci. Dep","author":"Friedman D","year":"1975","unstructured":"D Friedman and S Wise . 1975. Unwinding stylized recursions into iterations. Comput. Sci. Dep ., Indiana University , Bloomington, IN , Tech. Rep 19 ( 1975 ). D Friedman and S Wise. 1975. Unwinding stylized recursions into iterations. Comput. Sci. Dep., Indiana University, Bloomington, IN, Tech. Rep 19 (1975)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-006-0018-x"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/543552.512563"},{"key":"e_1_3_2_1_13_1","volume-title":"URl: http:\/\/eigen. tuxfamily. org","author":"Guennebaud Ga\u00ebl","year":"2010","unstructured":"Ga\u00ebl Guennebaud , Benoit Jacob , and others. 2010. Eigen. URl: http:\/\/eigen. tuxfamily. org ( 2010 ). Ga\u00ebl Guennebaud, Benoit Jacob, and others. 2010. Eigen. URl: http:\/\/eigen. tuxfamily. org (2010)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/543552.512547"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2636228.2636238"},{"key":"e_1_3_2_1_16_1","volume-title":"Oancea","author":"Henriksen Troels","year":"2014","unstructured":"Troels Henriksen and Cosmin E . Oancea . 2014 . Bounds Checking : An Instance of Hybrid Analysis (ARRAY \u201914). ACM, NY, USA. Troels Henriksen and Cosmin E. Oancea. 2014. Bounds Checking: An Instance of Hybrid Analysis (ARRAY \u201914). ACM, NY, USA."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062354"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604148"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460833.1460872"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050037"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543134.1411288"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268953"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389449.1389468"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11999-6_10"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840306"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462176"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2581122.2544155"},{"key":"e_1_3_2_1_30_1","unstructured":"Filip Srajer Zuzana Kukelova and Andrew Fitzgibbon. 2016. A Benchmark of Selected Algorithmic Differentiation Tools on Some Problems in Machine Learning and Computer Vision. (2016).  Filip Srajer Zuzana Kukelova and Andrew Fitzgibbon. 2016. A Benchmark of Selected Algorithmic Differentiation Tools on Some Problems in Machine Learning and Computer Vision. (2016)."},{"key":"e_1_3_2_1_31_1","unstructured":"Arvind Sujeeth HyoukJoong Lee Kevin Brown Tiark Rompf Hassan Chafi Michael Wu Anand Atreya Martin Odersky and Kunle Olukotun. 2011. OptiML: An Implicitly Parallel Domain-Specific Language for Machine Learning (ICML \u201911). 609\u2013616.   Arvind Sujeeth HyoukJoong Lee Kevin Brown Tiark Rompf Hassan Chafi Michael Wu Anand Atreya Martin Odersky and Kunle Olukotun. 2011. OptiML: An Implicitly Parallel Domain-Specific Language for Machine Learning (ICML \u201911). 609\u2013616."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/583852.581491"},{"key":"e_1_3_2_1_33_1","volume-title":"Defunctionalizing Push Arrays (FHPC \u201914). ACM","author":"Svensson Bo Joel","unstructured":"Bo Joel Svensson and Josef Svenningsson . 2014. Defunctionalizing Push Arrays (FHPC \u201914). ACM , NY , USA , 43\u201352. Bo Joel Svensson and Josef Svenningsson. 2014. Defunctionalizing Push Arrays (FHPC \u201914). ACM, NY, USA, 43\u201352."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159876.1159884"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.88"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:LISP.0000029446.78563.a4"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.2613"},{"key":"e_1_3_2_1_38_1","volume-title":"Inter. workshop on vision algorithms. Springer, 298\u2013372","author":"Triggs Bill","year":"1999","unstructured":"Bill Triggs , Philip F McLauchlan , Richard I Hartley , and Andrew W Fitzgibbon . 1999 . Bundle adjustment\u2014a modern synthesis . In Inter. workshop on vision algorithms. Springer, 298\u2013372 . Bill Triggs, Philip F McLauchlan, Richard I Hartley, and Andrew W Fitzgibbon. 1999. Bundle adjustment\u2014a modern synthesis. In Inter. workshop on vision algorithms. Springer, 298\u2013372."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/800055.802020"},{"key":"e_1_3_2_1_41_1","volume-title":"Deforestation: Transforming programs to eliminate trees. In ESOP\u201988","author":"Wadler Philip","year":"1988","unstructured":"Philip Wadler . 1988 . Deforestation: Transforming programs to eliminate trees. In ESOP\u201988 . Springer , 344\u2013358. Philip Wadler. 1988. Deforestation: Transforming programs to eliminate trees. In ESOP\u201988. Springer, 344\u2013358."},{"key":"e_1_3_2_1_42_1","volume-title":"IFIP TC","volume":"2","author":"Wadler Philip","year":"1990","unstructured":"Philip Wadler . 1990 . Linear types can change the world . In IFIP TC , Vol. 2 . Citeseer, 347\u2013359. Philip Wadler. 1990. Linear types can change the world. In IFIP TC, Vol. 2. Citeseer, 347\u2013359."},{"key":"e_1_3_2_1_43_1","volume-title":"Inter. Workshop on Types in Compilation. Springer, 177\u2013206","author":"Walker David","year":"2000","unstructured":"David Walker and Greg Morrisett . 2000 . Alias types for recursive data structures . In Inter. Workshop on Types in Compilation. Springer, 177\u2013206 . David Walker and Greg Morrisett. 2000. Alias types for recursive data structures. In Inter. Workshop on Types in Compilation. Springer, 177\u2013206."}],"event":{"name":"ICFP '17: ACM SIGPLAN International Conference on Functional Programming","location":"Oxford UK","acronym":"ICFP '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 6th ACM SIGPLAN International Workshop on Functional High-Performance Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3122948.3122949","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3122948.3122949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:04Z","timestamp":1750212664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3122948.3122949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,7]]},"references-count":40,"alternative-id":["10.1145\/3122948.3122949","10.1145\/3122948"],"URL":"https:\/\/doi.org\/10.1145\/3122948.3122949","relation":{},"subject":[],"published":{"date-parts":[[2017,9,7]]},"assertion":[{"value":"2017-09-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}