{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:31:30Z","timestamp":1725492690748},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433637"},{"type":"electronic","value":"9783540459279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45927-8_7","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T09:39:04Z","timestamp":1192786744000},"page":"83-97","source":"Crossref","is-referenced-by-count":13,"title":["An Accumulative Parallel Skeleton for All"],"prefix":"10.1007","author":[{"given":"Zhenjiang","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideya","family":"Iwasaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masato","family":"Takeichi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"R. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, pages 5\u201342. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-87374-4_1"},{"issue":"11","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/12.42122","volume":"38","author":"G. E. Blelloch","year":"1989","unstructured":"Guy E. Blelloch. Scans as primitive operations. IEEE Trans. on Computers, 38(11):1526\u20131538, November 1989.","journal-title":"IEEE Trans. on Computers"},{"key":"7_CR3","unstructured":"G. E. Blelloch. Prefix sums and their applications. Technical Report CMUCS-90-190, Carnegie-Mellon Univ., 1990."},{"key":"7_CR4","unstructured":"G.E. Blelloch. NESL: a nested data parallel language. Technical Report CMU-CS-92-103, School of Computer Science, Carnegie-Mellon University, January 1992."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"O. Chitil. Type inference builds short cut to deforestation. In Proceedings of 1999 ACM SIGPLAN International Conference on Functional Programming, pages 249\u2013260. ACM Press, 1999.","DOI":"10.1145\/317765.317907"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"M. Cole. Parallel programming with list homomorphisms. Parallel Processing Letters, 5(2), 1995.","DOI":"10.1142\/S0129626495000175"},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1017\/S0956796800001908","volume":"6","author":"J. Gibbons","year":"1996","unstructured":"J. Gibbons. The third homomorphism theorem. Journal of Functional Programming, 6(4):657\u2013665, 1996.","journal-title":"Journal of Functional Programming"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"A. Gill, J. Launchbury, and S. Peyton Jones. A short cut to deforestation. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 223\u2013232, Copenhagen, June 1993.","DOI":"10.1145\/165180.165214"},{"key":"7_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BFb0024729","volume-title":"Systematic efficient parallelization of scan and other list homomorphisms","author":"S. Gorlatch","year":"1996","unstructured":"S. Gorlatch. Systematic efficient parallelization of scan and other list homomorphisms. In Annual European Conference on Parallel Processing, LNCS 1124, pages 401\u2013408, LIP, ENS Lyon, France, August 1996. Springer-Verlag."},{"key":"7_CR10","unstructured":"Z. Hu, H. Iwasaki, and M. Takeichi. An accumulative parallel skeleton for all. Technical Report METR 01-05, University of Tokyo, September 2001. Available from http:\/\/www.ipl.t.u-tokyo.ac.jp\/ ~ hu\/pub\/metr01-05.ps.gz ."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Z. Hu, H. Iwasaki, M. Takeichi, and A. Takano. Tupling calculation eliminates multiple data traversals. In ACM SIGPLAN International Conference on Functional Programming, pages 164\u2013175, Amsterdam, The Netherlands, June 1997. ACM Press.","DOI":"10.1145\/258948.258964"},{"issue":"12","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1145\/7902.7903","volume":"29","author":"W.D. Hills","year":"1986","unstructured":"W.D. Hills and Jr. G. L. Steele. Data parallel algorithms. Communications of the ACM, 29(12):1170\u20131183, 1986.","journal-title":"Communications of the ACM"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Z. Hu, M. Takeichi, and W.N. Chin. Parallelization in calculational forms. In 25th ACM Symposium on Principles of Programming Languages, pages 316\u2013328, San Diego, California, USA, January 1998.","DOI":"10.1145\/268946.268972"},{"key":"7_CR14","unstructured":"Z. Hu, M. Takeichi, and H. Iwasaki. Diffusion: Calculating efficient parallel programs. In 1999 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 85\u201394, San Antonio, Texas, January 1999. BRICS Notes Series NS-99-1."},{"key":"7_CR15","unstructured":"S. Peyton Jones and J. Hughes, editors. Haskell 98: A Non-strict, Purely Functional Language. Available online: http:\/\/www.haskell.org , February 1999."},{"key":"7_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/BFb0097892","volume-title":"On the distributed implementation of aggregate data structures by program transformation","author":"G. Keller","year":"1999","unstructured":"G. Keller and M. M. T. Chakravarty. On the distributed implementation of aggregate data structures by program transformation. In J. Rolim et al., editor, 4th International Workshop on High-Level Parallel Programming Models and Supportive Environments (LNCS 1586), pages 108\u2013122, Berlin, Germany, 1999. Springer-Verlag."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"J. Launchbury and T. Sheard. Warm fusion: Deriving build-catas from recursive definitions. In Proc. Conference on Functional Programming Languages and Computer Architecture, pages 314\u2013323, La Jolla, California, June 1995.","DOI":"10.1145\/224164.224223"},{"key":"7_CR18","unstructured":"Christian Lengauer Sergei Gorlatch, Christoph Wedler. Optimization rules for programming with collective operations. In Mikhail Atallah, editor, IPPS\/SPDP\u201999. 13th Int. Parallel Processing Symp. & 10th Symp. on Parallel and Distributed Processing, pages 492\u2013499, 1999."},{"issue":"12","key":"7_CR19","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/2.62092","volume":"23","author":"D.B. Skillicorn","year":"1990","unstructured":"D.B. Skillicorn. Architecture-independent parallel computation. IEEE Computer, 23(12):38\u201351, December 1990.","journal-title":"IEEE Computer"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45927-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T21:29:00Z","timestamp":1556918940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45927-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433637","9783540459279"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45927-8_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}