{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:34Z","timestamp":1772164054803,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"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,9,25]]},"DOI":"10.1145\/2500365.2500601","type":"proceedings-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T09:13:17Z","timestamp":1380100397000},"page":"37-48","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Exploiting vector instructions with generalized stream fusion"],"prefix":"10.1145","author":[{"given":"Geoffrey","family":"Mainland","sequence":"first","affiliation":[{"name":"Microsoft Research Ltd, Cambridge, England UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Leshchinskiy","sequence":"additional","affiliation":[{"name":"Self, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Peyton Jones","sequence":"additional","affiliation":[{"name":"Microsoft Research Ltd, Cambridge, England UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1038"},{"key":"e_1_3_2_1_2_1","volume-title":"statistics: A library of statistical types, data, and functions, aug","author":"O'Sullivan Bryan","year":"2012","unstructured":"2012)}bryan_osullivan_statistics:_2012 Bryan O'Sullivan . statistics: A library of statistical types, data, and functions, aug 2012 . URL http:\/\/hackage.haskell.org\/package\/statistics. 2012)}bryan_osullivan_statistics:_2012Bryan O'Sullivan. statistics: A library of statistical types, data, and functions, aug 2012. URL http:\/\/hackage.haskell.org\/package\/statistics."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040306"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1248648.1248652"},{"key":"e_1_3_2_1_5_1","volume-title":"StatisticalMethods: collection of useful statistical methods., aug","author":"zu Siederdissen Christian H\u00f6ner","year":"2011","unstructured":"011)}christian_honer_zu_siederdissen_statisticalmethods:_2011 Christian H\u00f6ner zu Siederdissen . StatisticalMethods: collection of useful statistical methods., aug 2011 . URL http:\/\/hackage.haskell.org\/package\/StatisticalMethods. 011)}christian_honer_zu_siederdissen_statisticalmethods:_2011Christian H\u00f6ner zu Siederdissen. StatisticalMethods: collection of useful statistical methods., aug 2011. URL http:\/\/hackage.haskell.org\/package\/StatisticalMethods."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291199"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/165180.165214"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1356052.1356053"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377603.1377607"},{"key":"e_1_3_2_1_11_1","volume-title":"Eigen v3","author":"Guennebaud G.","year":"2010","unstructured":"guennebaud_eigen_2010 G. Guennebaud , B. Jacob , and others. Eigen v3 , 2010 . URL http:\/\/eigen.tuxfamily.org. guennebaud_eigen_2010G. Guennebaud, B. Jacob, and others. Eigen v3, 2010. URL http:\/\/eigen.tuxfamily.org."},{"key":"e_1_3_2_1_12_1","first-page":"25","volume-title":"Extending higher-order deforestation: transforming programs to eliminate even more trees","author":"Hamilton G. W.","year":"2001","unstructured":"G. W. Hamilton . Extending higher-order deforestation: transforming programs to eliminate even more trees . In K. Hammond and S. Curtis, editors, phProceedings of the Third Scottish Functional Programming Workshop, page 25 -- 36 , Exeter, UK, UK , aug 2001 . G. W. Hamilton. Extending higher-order deforestation: transforming programs to eliminate even more trees. In K. Hammond and S. Curtis, editors, phProceedings of the Third Scottish Functional Programming Workshop, page 25--36, Exeter, UK, UK, aug 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7"},{"key":"e_1_3_2_1_14_1","volume-title":"Boost basic linear algebra - 1.53.0","author":"Walter Joerg","year":"2010","unstructured":"t al.(2010) Joerg Walter , Mathias Koch , Gunter Winkler , and David Bellot}joerg_walter_boost_2010 Joerg Walter , Mathias Koch , Gunter Winkler , and David Bellot . Boost basic linear algebra - 1.53.0 , 2010 . URL http:\/\/www.boost.org\/doc\/libs\/1_53_0\/libs\/numeric\/ublas\/doc\/index.htm. t al.(2010)Joerg Walter, Mathias Koch, Gunter Winkler, and David Bellot}joerg_walter_boost_2010Joerg Walter, Mathias Koch, Gunter Winkler, and David Bellot. Boost basic linear algebra - 1.53.0, 2010. URL http:\/\/www.boost.org\/doc\/libs\/1_53_0\/libs\/numeric\/ublas\/doc\/index.htm."},{"key":"e_1_3_2_1_15_1","first-page":"47","volume-title":"SAIG'01","author":"Johann P.","year":"2001","unstructured":"P. Johann . Short cut fusion: proved and improved. In phProceedings of the 2nd international conference on Semantics, applications, and implementation of program generation , SAIG'01 , page 47 -- 71 , Berlin, Heidelberg , 2001 . P. Johann. Short cut fusion: proved and improved. In phProceedings of the 2nd international conference on Semantics, applications, and implementation of program generation, SAIG'01, page 47--71, Berlin, Heidelberg, 2001."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/363707.363723"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863582"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01018827"},{"key":"e_1_3_2_1_19_1","volume-title":"vector: Efficient arrays, oct","author":"Leshchinskiy R.","year":"2012","unstructured":"R. Leshchinskiy . vector: Efficient arrays, oct 2012 . URL http:\/\/hackage.haskell.org\/package\/vector. R. Leshchinskiy. vector: Efficient arrays, oct 2012. URL http:\/\/hackage.haskell.org\/package\/vector."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034675.2034684"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364506.2364511"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796806005995"},{"key":"e_1_3_2_1_23_1","volume-title":"Deforestation for higher-order functions. In phProceedings of the 1992 Glasgow Workshop on Functional Programming, page 154--165","author":"Marlow S.","year":"1993","unstructured":"S. Marlow and P. Wadler . Deforestation for higher-order functions. In phProceedings of the 1992 Glasgow Workshop on Functional Programming, page 154--165 , London, UK , UK , 1993 . S. Marlow and P. Wadler. Deforestation for higher-order functions. In phProceedings of the 1992 Glasgow Workshop on Functional Programming, page 154--165, London, UK, UK, 1993."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291200"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89330-1_10"},{"key":"e_1_3_2_1_26_1","first-page":"636","volume-title":"Unboxed values as first class citizens in a non-strict functional language. In phProceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture","author":"Peyton Jones S. L.","year":"1991","unstructured":"S. L. Peyton Jones and J. Launchbury . Unboxed values as first class citizens in a non-strict functional language. In phProceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture , pages 636 -- 666 , 1991 . S. L. Peyton Jones and J. Launchbury. Unboxed values as first class citizens in a non-strict functional language. In phProceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, pages 636--666, 1991."},{"key":"e_1_3_2_1_27_1","volume-title":"C--: a portable assembly language that supports garbage collection. In phInternational Conference on Principles and Practice of Declarative Programming, sep","author":"Peyton Jones S. L.","year":"1999","unstructured":"S. L. Peyton Jones , N. Ramsey , and F. Reig . C--: a portable assembly language that supports garbage collection. In phInternational Conference on Principles and Practice of Declarative Programming, sep 1999 . S. L. Peyton Jones, N. Ramsey, and F. Reig. C--: a portable assembly language that supports garbage collection. In phInternational Conference on Principles and Practice of Declarative Programming, sep 1999."},{"key":"e_1_3_2_1_28_1","volume-title":"Playing by the rules: rewriting as a practical optimisation technique. In phProceedings of the 2001 ACM SIGPLAN Workshop on Haskell","author":"Peyton Jones S. L.","year":"2001","unstructured":"S. L. Peyton Jones , T. Hoare , and A. Tolmach . Playing by the rules: rewriting as a practical optimisation technique. In phProceedings of the 2001 ACM SIGPLAN Workshop on Haskell , 2001 . S. L. Peyton Jones, T. Hoare, and A. Tolmach. Playing by the rules: rewriting as a practical optimisation technique. In phProceedings of the 2001 ACM SIGPLAN Workshop on Haskell, 2001."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/581478.581491"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/224164.224221"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863523.1863538"},{"key":"e_1_3_2_1_32_1","unstructured":"T. Veldhuizen. Expression templates. phC  T. Veldhuizen. Expression templates. phC"},{"key":"e_1_3_2_1_33_1","volume-title":"26--31, jun","year":"1995","unstructured":"Report, 7 (5) : 26--31, jun 1995 . Report, 7 (5): 26--31, jun 1995."},{"key":"e_1_3_2_1_34_1","unstructured":"T. L. Veldhuizen. Arrays in Blitz  T. L. Veldhuizen. Arrays in Blitz"},{"key":"e_1_3_2_1_35_1","first-page":"223","volume-title":"phComputing in Object-Oriented Parallel Environments, number 1505 in Lecture Notes in Computer Science","year":"1998","unstructured":". In D. Caromel, R. R. Oldehoeft, and M. Tholburn, editors, phComputing in Object-Oriented Parallel Environments, number 1505 in Lecture Notes in Computer Science , pages 223 -- 230 . jan 1998 . . In D. Caromel, R. R. Oldehoeft, and M. Tholburn, editors, phComputing in Object-Oriented Parallel Environments, number 1505 in Lecture Notes in Computer Science, pages 223--230. jan 1998."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90147-A"}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","location":"Boston Massachusetts USA","acronym":"ICFP'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Northeastern University"]},"container-title":["Proceedings of the 18th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500601","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2500365.2500601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:34:32Z","timestamp":1750217672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500601"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,25]]},"references-count":35,"alternative-id":["10.1145\/2500365.2500601","10.1145\/2500365"],"URL":"https:\/\/doi.org\/10.1145\/2500365.2500601","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544174.2500601","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,9,25]]},"assertion":[{"value":"2013-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}