{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:20:00Z","timestamp":1743063600721,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662468227"},{"type":"electronic","value":"9783662468234"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-46823-4_5","type":"book-chapter","created":{"date-parts":[[2015,4,18]],"date-time":"2015-04-18T01:40:54Z","timestamp":1429321254000},"page":"59-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automatically Partitioning Data to Facilitate the Parallelization of Functional Programs"],"prefix":"10.1007","author":[{"given":"Michael","family":"Dever","sequence":"first","affiliation":[]},{"given":"G. W.","family":"Hamilton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,19]]},"reference":[{"issue":"11","key":"5_CR1","doi-asserted-by":"publisher","first-page":"1526","DOI":"10.1109\/12.42122","volume":"38","author":"GE Blelloch","year":"1989","unstructured":"Blelloch, G.E.: Scans as primitive operations. IEEE Trans. Comput. 38(11), 1526\u20131538 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-45099-3_5","volume-title":"Static Analysis","author":"W-N Chin","year":"2000","unstructured":"Chin, W.-N., Khoo, S.-C., Hu, Z., Takeichi, M.: Deriving parallel codes via invariants. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 75\u201394. Springer, Heidelberg (2000)"},{"key":"5_CR3","unstructured":"Chin, W.N., Takano, A., Hu, Z., Chin, W., Takano, A., Hu, Z.: Parallelization via context preservation. In: IEEE International Conference on Computer Languages, IEEE CS Press, pp. 153\u2013162 (1998)"},{"issue":"4","key":"5_CR4","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1017\/S0956796800001908","volume":"6","author":"J Gibbons","year":"1996","unstructured":"Gibbons, J.: The third homomorphism theorem. J. Funct. Program. 6(4), 657\u2013665 (1996). Earlier version appeared in Jay, C.B., (ed.), Computing: The Australian Theory Seminar, Sydney, pp. 62\u201369, December 1994","journal-title":"J. Funct. Program."},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BFb0024729","volume-title":"Euro-Par\u201996 - Parallel Processing","author":"S Gorlatch","year":"1996","unstructured":"Gorlatch, S.: Systematic efficient parallelization of scan and other list homomorphisms. In: Fraigniaud, P., Mignotte, A., Robert, Y., Boug\u00e9, L. (eds.) Euro-Par 1996. LNCS, vol. 1124, pp. 401\u2013408. Springer, Heidelberg (1996)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-61756-6_91","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"S Gorlatch","year":"1996","unstructured":"Gorlatch, S.: Systematic extraction and implementation of divide-and-conquer parallelism. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol. 1140, pp. 274\u2013288. Springer, Heidelberg (1996)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Hamilton, G., Jones, N.: Distillation and labelled transition systems. In: Proceedings of the ACM Workshop on Partial Evaluation and Program Manipulation, pp. 15\u201324, January 2012","DOI":"10.1145\/2103746.2103753"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/256167.256201","volume":"19","author":"Z Hu","year":"1997","unstructured":"Hu, Z., Iwasaki, H., Takechi, M.: Formal derivation of efficient parallel programs by construction of list homomorphisms. ACM Trans. Program. Lang. Syst. 19(3), 444\u2013461 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Hu, Z., Takeichi, M., Chin, W.-N.: Parallelization in calculational forms. In: Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL 1998, pp. 316\u2013328, ACM, New York (1998)","DOI":"10.1145\/268946.268972"},{"key":"5_CR10","unstructured":"Hu, Z., Takeichi, M., Iwasaki, H.: Diffusion: calculating efficient parallel programs. In: 1999 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pp. 85\u201394(1999)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/11877028_5","volume-title":"Generative and Transformational Techniques in Software Engineering","author":"Z Hu","year":"2006","unstructured":"Hu, Z., Yokoyama, T., Takeichi, M.: Program optimizations and transformations in calculation form. In: L\u00e4mmel, R., Saraiva, J., Visser, J. (eds.) GTTSE 2005. LNCS, vol. 4143, pp. 144\u2013168. Springer, Heidelberg (2006)"},{"issue":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0956796897002864","volume":"7","author":"G Huet","year":"1997","unstructured":"Huet, G.: The zipper. J. Funct. Program. 7(5), 549\u2013554 (1997)","journal-title":"J. Funct. Program."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/B:IJPP.0000038069.80050.74","volume":"32","author":"H Iwasaki","year":"2004","unstructured":"Iwasaki, H., Hu, Z.: A new parallel skeleton for general accumulative computations. Int. J. Parallel Prog. 32, 389\u2013414 (2004)","journal-title":"Int. J. Parallel Prog."},{"issue":"5","key":"5_CR14","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01211391","volume":"4","author":"L Meertens","year":"1992","unstructured":"Meertens, L.: Paramorphisms. Formal Aspects Comput. 4(5), 413\u2013424 (1992)","journal-title":"Formal Aspects Comput."},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Morihata, A., Matsuzaki, K., Hu, Z., Takeichi, M.: The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer. In: Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of programming languages, POPL 1909, pp. 177\u2013185. ACM, New York (2009)","DOI":"10.1145\/1480881.1480905"},{"key":"5_CR16","series-title":"Cambridge International Series on Parallel Computation","volume-title":"Foundations of Parallel Programming","author":"D Skillicorn","year":"2005","unstructured":"Skillicorn, D.: Foundations of Parallel Programming. Cambridge International Series on Parallel Computation. Cambridge University Press, Cambridge (2005)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1109\/2.62092","volume":"23","author":"DB Skillicorn","year":"1990","unstructured":"Skillicorn, D.B.: Architecture-independent parallel computation. Computer 23, 38\u201350 (1990)","journal-title":"Computer"},{"key":"5_CR18","series-title":"NATO ASI Series F","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-58049-9_9","volume-title":"Software for Parallel Computation","author":"DB Skillicorn","year":"1993","unstructured":"Skillicorn, D.B.: The bird-meertens formalism as a parallel model. In: Kowalik, J.S., Grandinetti, L. (eds.) Software for Parallel Computation. NATO ASI Series F, vol. 106, pp. 120\u2013133. Springer, Heidelberg (1993)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Teo, Y.M., Chin, W.-N., Tan, S.H.: Deriving efficient parallel programs for complex recurrences. In: Proceedings of the Second International Symposium on Parallel symbolic computation, PASCO 1997, pp. 101\u2013110. ACM, New York (1997)","DOI":"10.1145\/266670.266697"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46823-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:40:20Z","timestamp":1676940020000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-46823-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662468227","9783662468234"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46823-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"19 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}