{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:10:58Z","timestamp":1778253058389,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540676683","type":"print"},{"value":"9783540450993","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-45099-3_19","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T04:05:17Z","timestamp":1294977917000},"page":"360-376","source":"Crossref","is-referenced-by-count":2,"title":["Flattening Is an Improvement"],"prefix":"10.1007","author":[{"given":"James","family":"Riely","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Prins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"Vector Models for Data-Parallel Computing","author":"G.E. Blelloch","year":"1990","unstructured":"Blelloch, G.E.: Vector Models for Data-Parallel Computing. MIT Press, Cambridge (1990)"},{"key":"19_CR2","unstructured":"Blelloch, G.E.: NESL: A nested data-parallel language (version 3.0). Technical report, Carnegie-Mellon University, Department of Computer Science (1994)"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E.: Programming parallel algorithms. Communications of the ACM\u00a039(3) (1996)","DOI":"10.1145\/227234.227246"},{"key":"19_CR4","first-page":"84","volume-title":"Proceedings of the ACM Symposium on Parallel Algorithms and Architectures","author":"G.E. Blelloch","year":"1995","unstructured":"Blelloch, G.E., Gibbons, P.B., Matias, Y., Zagha, M.: Accounting for memory bank conetention and delay in high-bandwidth multiprocessors. In: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, Santa Barbara, CA, pp. 84\u201394. ACM Press, New York (1995)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Blelloch, G.E., Greiner, J.: A provable time and space efficient implementation of NESL. In: International Conference on Functional Programming (1996)","DOI":"10.1145\/232627.232650"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1006\/jpdc.1994.1038","volume":"21","author":"G.E. Blelloch","year":"1994","unstructured":"Blelloch, G.E., Hardwick, J.C., Sipelstein, J., Zagha, M., Chatterjee, S.: Implementation of a portable nested data-parallel language. Journal of Parallel and Distributed Computing\u00a021(1), 4\u201314 (1994)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0743-7315(90)90087-6","volume":"8","author":"G.E. Blelloch","year":"1990","unstructured":"Blelloch, G.E., Sabot, G.W.: Compiling collection-oriented languages onto massively parallel computers. Journal of Parallel and Distributed Computing\u00a08, 119\u2013134 (1990)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R.P. Brent","year":"1974","unstructured":"Brent, R.P.: The parallel evaluation of generic arithmetic expressions. Journal of the ACM\u00a021(2), 201\u2013206 (1974)","journal-title":"Journal of the ACM"},{"issue":"4","key":"19_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF03356752","volume":"24","author":"D. Engelhardt","year":"1996","unstructured":"Engelhardt, D., Wendelborn, A.: A partitioning-independent paradigm for nested data parallelism. International Journal of Parallel Programming\u00a024(4), 291\u2013317 (1996)","journal-title":"International Journal of Parallel Programming"},{"key":"19_CR10","first-page":"715","volume":"22","author":"P.L. Garcia","year":"1998","unstructured":"Garcia, P.L., Hermenegildo, M., Debray, S.K.: A methodology for granularity based control of parallelism in logic programs. J. of Symbolic Computation\u00a022, 715\u2013734 (1998)","journal-title":"J. of Symbolic Computation"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Ghuloum, A.M., Fisher, A.L.: Flattening and parallelizing irregular, recurrent loop nests. In: Proceedings of the Symposium on Principles and Practice of Parallel Programming, Santa Barbara, July 1995, pp. 58\u201367 (1995)","DOI":"10.1145\/209936.209944"},{"key":"19_CR12","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"The Third International Workshop on Higher Order Operational Techniques in Semantics","author":"J. Gustavsson","year":"1999","unstructured":"Gustavsson, J., Sands, D.: A foundation for space-safe transformations of call-by-need programs. In: Gordon, A.D., Pitts, A.M. (eds.) The Third International Workshop on Higher Order Operational Techniques in Semantics. Electronic Notes in Theoretical Computer Science, vol.\u00a026, Elsevier, Amsterdam (1999)"},{"issue":"2\/3","key":"19_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0096-0551(96)00011-2","volume":"22","author":"M. Hermenegildo","year":"1996","unstructured":"Hermenegildo, M., Carro, M.: Relating data-parallelism and (and-)parallelism in logic programs. The Computer Languages Journal\u00a022(2\/3), 143\u2013163 (1996)","journal-title":"The Computer Languages Journal"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Hudak, P., Peyton Jones, S., Wadler, P.: Report on the programming language Haskell version 1.2. ACM SIGPLAN notices, 27(5) (May 1992)","DOI":"10.1145\/130697.130699"},{"key":"19_CR15","unstructured":"C. Jay. The FISh language definition. http:\/\/www-staff.socs.uts.edu.au\/~cbj\/ Publications\/fishdef.ps.gz, 1998."},{"key":"19_CR16","unstructured":"Jay, C.: Costing parallel programs as a function of shapes. Science of Computer Programming (1999)"},{"key":"19_CR17","unstructured":"Keller, G.: Transformation-Based Implementation of Nested Data-Parallelism for Distributed Memory Machines. PhD thesis, TU Berlin (1999)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Launchbury, J., Sheard, T.: Warm fusion: deriving build-catas from recursive definitions. In: Proceedings of the Conference on Functional Programming Languages and Computer Architecture, La Jolla, CA, June 1995, pp. 314\u2013323 (1995)","DOI":"10.1145\/224164.224223"},{"key":"19_CR19","first-page":"43","volume-title":"Conference Record of the ACM Symposium on Principles of Programming Languages","author":"A.K. Moran","year":"1999","unstructured":"Moran, A.K., Sands, D.: Improvement in a lazy context: An operational theory for call-by- need. In: Conference Record of the ACM Symposium on Principles of Programming Languages, San Antonio, pp. 43\u201356. ACM Press, New York (1999)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Palmer, D.W.: Efficient Execution of Nested Data Parallel Programs. PhD thesis, University of North Carolina (1996)","DOI":"10.1007\/BFb0014210"},{"key":"19_CR21","unstructured":"Palmer, D.W., Prins, J.F., Westfold, S.: Work-efficient nested data-parallelism. In: Frontiers 1995 (1995)"},{"key":"19_CR22","volume-title":"International Parallel Processing Symposium","author":"E. Pontelli","year":"1996","unstructured":"Pontelli, E., Gupta, G.: Nested parallel call optimization. In: International Parallel Processing Symposium, IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"19_CR23","unstructured":"Prins, J., Ballabio, M., Boverat, M., Hodous, M., Maric, D.: Fast primitives for irregular computations on the nec sx-4. Crosscuts\u00a06(4) (1997)"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Prins, J.F., Palmer, D.W.: Transforming high-level data-parallel programs into vector operations. In: Proceedings of the Symposium on Principles and Practice of Parallel Programming, San Diego, May 1993. ACM SIGPLAN Notices, vol.\u00a028(7), pp. 119\u2013128 (1993)","DOI":"10.1145\/173284.155345"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, V., Sherson, I., Subramanian, R.: Efficient techniques for fast nested barrier synchronization. In: ACM Symposium on Parallel Algorithms and Architectures (1995)","DOI":"10.1145\/215399.215436"},{"key":"19_CR26","volume-title":"North American Conference on Logic Programming","author":"B. Ramkumar","year":"1989","unstructured":"Ramkumar, B., Kale, L.: Compiled execution of the reduced-or process model on multiprocessors. In: North American Conference on Logic Programming, MIT Press, Cambridge (1989)"},{"key":"19_CR27","unstructured":"Riely, J.: Applications of Abstraction for Concurrent Programs. PhD thesis, University of North Carolina at Chapel Hill (1999)"},{"key":"19_CR28","unstructured":"Riely, J., Prins, J., Iyer, S.: Provably correct vectorization of nested-parallel programs. In: Programming Models for Massively Parallel Computers (MPPM 1995), Berlin (December 1995)"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Sands, D.: Proving the correctness of recursion-based automatic program transformations. Theoretical Computer Science\u00a0167(10) (October 1996)","DOI":"10.1016\/0304-3975(96)00074-6"},{"issue":"2","key":"19_CR30","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/227699.227716","volume":"18","author":"D. Sands","year":"1996","unstructured":"Sands, D.: Total correctness by local improvement in the transformation of functional programs. ACM Transactions on Programming Languages and Systems\u00a018(2), 175\u2013234 (1996)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"19_CR31","unstructured":"Skillicorn, D.B., Cai, W.: A cost calculus for parallel functional programming, Queens University Department of Computer Science TR-93-348 (1994)"},{"key":"19_CR32","first-page":"279","volume-title":"Proceedings of the ACM Conference on LISP and Functional Programming","author":"G.L. Steele","year":"1986","unstructured":"Steele, G.L., Hillis, W.D.: Connection machine Lisp: Fine-grained parallel symbolic processing. In: Proceedings of the ACM Conference on LISP and Functional Programming, Cambridge, MA, pp. 279\u2013297. ACM Press, New York (1986)"},{"key":"19_CR33","unstructured":"Suciu, D.: Parallel Programming Languages for Collections. PhD thesis, University of Pennsylvania (1995)"},{"key":"19_CR34","volume-title":"Proceedings of the ACM Symposium on Parallel Algorithms and Architectures","author":"D. Suciu","year":"1994","unstructured":"Suciu, D., Tannen, V.: Efficient compilation of high-level data parallel algorithms. In: Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, ACM Press, New York (1994)"},{"key":"19_CR35","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.: Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science\u00a073, 231\u2013248 (1990)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45099-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:22:08Z","timestamp":1778250128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-45099-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676683","9783540450993"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45099-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}