{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T01:10:07Z","timestamp":1748826607978,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319309354"},{"type":"electronic","value":"9783319309361"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30936-1_13","type":"book-chapter","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T20:27:44Z","timestamp":1459283264000},"page":"234-248","source":"Crossref","is-referenced-by-count":0,"title":["Pointlessness is Better than Listlessness"],"prefix":"10.1007","author":[{"given":"John T.","family":"O\u2019Donnell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cordelia V.","family":"Hall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1561\/1900000028","volume":"3","author":"G Graefe","year":"2010","unstructured":"Graefe, G.: Modern B-tree techniques. Found. Trends Databases 3(4), 203\u2013402 (2010)","journal-title":"Found. Trends Databases"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/978-3-642-54420-0_85","volume-title":"Euro-Par 2013: Parallel Processing Workshops","author":"JT O\u2019Donnell","year":"2014","unstructured":"O\u2019Donnell, J.T., Hall, C., Monro, S.: Active data structures on GPGPUs. In: an Mey, D., et al. (eds.) Euro-Par 2013. LNCS, vol. 8374, pp. 875\u2013884. Springer, Heidelberg (2014)"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1142\/S0129626494000302","volume":"4","author":"J O\u2019Donnell","year":"1994","unstructured":"O\u2019Donnell, J.: A correctness proof of parallel scan. Parallel Process. Lett. 4(3), 329\u2013338 (1994)","journal-title":"Parallel Process. Lett."},{"issue":"P1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2014.12.005","volume":"111","author":"JT O\u2019Donnell","year":"2015","unstructured":"O\u2019Donnell, J.T.: Extensible sparse functional arrays with circuit parallelism. Sci. Comput. Prog. 111(P1), 23\u201350 (2015)","journal-title":"Sci. Comput. Prog."},{"key":"13_CR5","unstructured":"O\u2019Neill, M.E.: A data structure for more efficient runtime support of truly functional arrays. Master\u2019s thesis, Simon Fraser University (1994)"},{"key":"13_CR6","unstructured":"O\u2019Neill, M.E.: Version stamps for functional arrays and determinacy checking: two applications of ordered lists for advanced programming languages. Ph.D. thesis, Simon Fraser University (2000)"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1111\/j.1467-8659.2007.01012.x","volume":"26","author":"JD Owens","year":"2007","unstructured":"Owens, J.D.: A survey of general-purpose computation on graphics hardware. Comput. Graph. Forum 26(1), 80\u2013113 (2007)","journal-title":"Comput. Graph. Forum"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Peyton Jones, S.L., Wadler, P.: Imperative functional programming. In: ACM Symposium on Principles of Programming Languages. ACM, January 1993","DOI":"10.1145\/158511.158524"},{"issue":"3","key":"13_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/24697.24706","volume":"22","author":"P Wadler","year":"1987","unstructured":"Wadler, P.: A critique of Abelson and Sussman or why calculating is better than scheming. SIGPLAN Not. 22(3), 83\u201394 (1987a)","journal-title":"ACM SIGPLAN Notices"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Listlessness is better than laziness: lazy evaluation and garbage collection at compile-time. In: Proceedings of the 1984 ACM Symposium on LISP and Functional Programming, LFP 1984, pp. 45\u201352. ACM, New York (1984)","DOI":"10.1145\/800055.802020"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/3-540-18420-1_64","volume-title":"Graph Reduction","author":"P Wadler","year":"1987","unstructured":"Wadler, P.: A new array operation. In: Fasel, J.H., Keller, R.M. (eds.) Graph Reduction 1986. LNCS, vol. 279, pp. 328\u2013335. Springer, Heidelberg (1987)"},{"issue":"9","key":"13_CR12","first-page":"595","volume":"17","author":"Philip Wadler","year":"1987","unstructured":"Wadler, P.: Fixing some space leaks with a garbage collector. Softw. Pract. Experience 17(9), 595\u2013608 (1987b)","journal-title":"Software: Practice and Experience"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P Wadler","year":"1990","unstructured":"Wadler, P.: Transforming programs to eliminate trees. Theoret. Comput. Sci. 73, 231\u2013248 (1990)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1017\/S0960129500001560","volume":"2","author":"P Wadler","year":"1992","unstructured":"Wadler, P.: Comprehending monads. Math. Struct. Comput. Sci. 2, 461\u2013493 (1992). Cambridge University Press","journal-title":"Math. Struct. Comput. Sci."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Xiao, S., Feng, W.: Inter-block GPU communication via fast barrier synchronization. In: IPDPS, pp. 1\u201312 (2010)","DOI":"10.1109\/IPDPS.2010.5470477"}],"container-title":["Lecture Notes in Computer Science","A List of Successes That Can Change the World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30936-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T00:57:53Z","timestamp":1748825873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30936-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319309354","9783319309361"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30936-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}