{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:31:48Z","timestamp":1725582708911},"publisher-location":"London","reference-count":22,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852335069"},{"type":"electronic","value":"9781447100973"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-1-4471-0097-3_3","type":"book-chapter","created":{"date-parts":[[2011,4,23]],"date-time":"2011-04-23T02:53:31Z","timestamp":1303527211000},"page":"65-94","source":"Crossref","is-referenced-by-count":1,"title":["Transforming Rapid Prototypes to Efficient Parallel Programs"],"prefix":"10.1007","author":[{"given":"Christoph A.","family":"Herrmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Lengauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"G. Ausiello, P. Crescenzi, Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer-Verlag, 1999.","DOI":"10.1007\/978-3-642-58412-1"},{"issue":"3","key":"3_CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/cpe.4330070305","volume":"7","author":"B. Bacci","year":"1995","unstructured":"B. Bacci, M. Danelutto, S. Orlando, S. Pelagatti, and M. Vanneschi. P3L: A structured high level programming language and its structured support. Concurrency: Practice and Experience, 7(3):225\u2013255, 1995","journal-title":"Concurrency: Practice and Experience"},{"key":"3_CR3","unstructured":"H. P. Barendregt. The Lambda Calculus. Studies in Logic 103. North-Holland, 1984."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"J. L. Bentley. Programming pearls. Comm. ACM, 27:865\u2013871, 1984.","DOI":"10.1145\/358234.381162"},{"key":"3_CR5","unstructured":"G. E. Blelloch. Vector Models for Data-Parallel Computing. MIT Press, 1990."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"J. Darlington, A. Field, P. Harrison, P. Kelly, D. Sharp, Q. Wu, and R. L. While. Parallel programming using skeleton functions. In A. Bode, M. Reeve, and G. Wolf, editors, PARLE\u201993: Parallel Architectures and Languages Europe, Lecture Notes in Computer Science 694, pages 146\u2013160. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56891-3_12"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"J. Darlington, Y. Guo, H. W. To, and J. Yang. Parallel skeletons for structured composition. In Proc. 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP\u201995), pages 19\u201328 ACM Press, 1995.","DOI":"10.1145\/209936.209940"},{"issue":"2","key":"3_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"T. Elrad","year":"1982","unstructured":"T. Elrad and N. Francez. Decomposition of distributed programs into communication-closed layers. Science of Computer Programming, 2(2):155\u2013173 1982.","journal-title":"Science of Computer Programming"},{"key":"3_CR9","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. W.H. Freeman & Co., 1979."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"A. Gill J. Launchbury, and S. L. Peyton Jones. A short cut to deforestation. In Proc. Sixth Conf. on Functional Programming Languages and Computer Architecture (FPCA\u201993), pages 223\u2013232. ACM Press, 1993.","DOI":"10.1145\/165180.165214"},{"issue":"1","key":"3_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6423(97)00014-2","volume":"33","author":"S. Gorlatch","year":"1999","unstructured":"S. Gorlatch. Extracting and implementing list homomorphisms in parallel program developement. Science of Comuter Programming, 33(1):1\u201327, 1999.","journal-title":"Science of Comuter Programming"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"S. Gorlatch. Send-recv considered harmful? Myths and truths about parallel programming. In V. Malyshkin, editor, Parallel Computing Technologies (PaCT 2001), Lecture Note in Computer Science 2127, pages 243\u2013257. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-44743-1_24"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"P. Hammarlund and Lisper. On the relation between functional and data parallel programming languages. In Proc. Sixth Conf. on Functional Programming Languages and Computer Architecture (FPCA\u201993), pages 210\u2013222. ACM Press, 1993","DOI":"10.1145\/165180.165211"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"K. Hammond and G. Michaelson. Research Directions in Parallel Functional Programming, chapter 1. Springer-Verlag, 1999","DOI":"10.1007\/978-1-4471-0841-2"},{"key":"3_CR15","unstructured":"C. A. Herrmann, C. Lengauer, R. G\u00fcnz, J. Laitenberger, and C. Schaller. A compiler for HDC. Technical Report MIP-9907, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Univ. Passau, May 1999."},{"issue":"3","key":"3_CR16","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1017\/S0956796899003287","volume":"9","author":"C. A. Herrmann","year":"1999","unstructured":"C. A. Herrmann and C. Lengauer. Parallelization of divide-and-conquer by translation to  nested loops. J. Functional Programming, 9(3):279\u2013310, May 1999.","journal-title":"J. Functional Programming"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"C. A. Herrmann and C. Lengauer. A transformational approach which combines size inference and programm optimization. In W. Taha, editor, Semantics, Applications, and Implementation of Program Generation (SAIG\u201901), Lecture Notes in Computer Science 2196, pages 199\u2013218. Springer-Verlag, 2001.","DOI":"10.1007\/3-540-44806-3_12"},{"issue":"4","key":"3_CR18","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fisher. Parallel prefix computation. J. ACM,, 27(4):831\u2013838, 1980.","journal-title":"J. ACM,"},{"key":"3_CR19","unstructured":"MPI Forum. MPI: A Message-Passing Interface Standard. Univ. of Tennessee at Knoxville, 1995.,"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"A. D. Robinson. Impact of economics on compiler optimization. In Proc. ACM 2001 Java Grande\/ISCOPE Conf., pages 1\u201310. ACM Press, 2001.","DOI":"10.1145\/376656.376751"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"P. W. Trinder, K. Hammond, H.-W. Loidl, and S. L. Peyton Jones. Algorithm + strategy = parallelism. J. Functional Programming, 8(1):23\u201380, Jan. 1998.","DOI":"10.1017\/S0956796897002967"},{"key":"3_CR22","unstructured":"M. Weber, 2000. \n                http:\/\/www.i2.informatik.rwth-aachen.de\n                \n              \/~michaelw\/hmpi.html."}],"container-title":["Patterns and Skeletons for Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0097-3_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T05:36:34Z","timestamp":1605677794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0097-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9781852335069","9781447100973"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0097-3_3","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}