{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T15:36:18Z","timestamp":1778340978706,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642400469","type":"print"},{"value":"9783642400476","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40047-6_46","type":"book-chapter","created":{"date-parts":[[2013,7,20]],"date-time":"2013-07-20T08:18:02Z","timestamp":1374308282000},"page":"446-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Programming with BSP Homomorphisms"],"prefix":"10.1007","author":[{"given":"Joeffrey","family":"Legaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenjiang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Loulergue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kiminori","family":"Matsuzaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Tesson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Bird, R.: An introduction to the theory of lists. In: Broy, M. (ed.) Logic of Programming and Calculi of Discrete Design, pp. 5\u201342. Springer (1987)","DOI":"10.1007\/978-3-642-87374-4_1"},{"key":"46_CR2","unstructured":"Cole, M.: Algorithmic Skeletons: Structured Management of Parallel Computation. MIT Press (1989), http:\/\/homepages.inf.ed.ac.uk\/mic\/Pubs"},{"issue":"2","key":"46_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1142\/S0129626495000175","volume":"5","author":"M. Cole","year":"1995","unstructured":"Cole, M.: Parallel Programming with List Homomorphisms. Parallel Processing Letters\u00a05(2), 191\u2013203 (1995)","journal-title":"Parallel Processing Letters"},{"key":"46_CR4","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/1122971.1122980","volume-title":"PPoPP","author":"S.J. Deitz","year":"2006","unstructured":"Deitz, S.J., Callahan, D., Chamberlain, B.L., Snyder, L.: Global-view abstractions for user-defined reductions and scans. In: PPoPP, pp. 40\u201347. ACM, New York (2006)"},{"key":"46_CR5","doi-asserted-by":"crossref","unstructured":"Gesbert, L., Hu, Z., Loulergue, F., Matsuzaki, K., Tesson, J.: Systematic Development of Correct Bulk Synchronous Parallel Programs. In: International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT), pp. 334\u2013340. IEEE (2010)","DOI":"10.1109\/PDCAT.2010.86"},{"issue":"12","key":"46_CR6","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1002\/spe.1026","volume":"40","author":"H. Gonz\u00e1lez-V\u00e9lez","year":"2010","unstructured":"Gonz\u00e1lez-V\u00e9lez, H., Leyton, M.: A survey of algorithmic skeleton frameworks: high-level structured parallel programming enablers. Software, Practrice & Experience\u00a040(12), 1135\u20131160 (2010)","journal-title":"Software, Practrice & Experience"},{"key":"46_CR7","unstructured":"Gorlatch, S., Bischof, H.: Formal Derivation of Divide-and-Conquer Programs: A Case Study in the Multidimensional FFT\u2019s. In: Mery, D. (ed.) Formal Methods for Parallel Programming: Theory and Applications, pp. 80\u201394 (1997)"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Javed, N., Loulergue, F.: Parallel Programming and Performance Predictability with Orl\u00e9ans Skeleton Library. In: International Conference on High Performance Computing and Simulation (HPCS), pp. 257\u2013263. IEEE (2011)","DOI":"10.1109\/HPCSim.2011.5999832"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Jifeng, H., Miller, Q., Chen, L.: Algebraic laws for BSP programming. In: Boug\u00e9, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds.) Euro-Par 1996, Part II. LNCS, vol.\u00a01124, pp. 359\u2013368. Springer, Heidelberg (1996)","DOI":"10.1007\/BFb0024724"},{"key":"46_CR10","unstructured":"Leroy, X., Doligez, D., Frisch, A., Garrigue, J., R\u00e9my, D., Vouillon, J.: The OCaml System release 4.00.0 (2012), http:\/\/caml.inria.fr"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/978-3-540-45209-6_107","volume-title":"Euro-Par 2003 Parallel Processing","author":"F. Loulergue","year":"2003","unstructured":"Loulergue, F.: Parallel Juxtaposition for Bulk Synchronous Parallel ML. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, pp. 781\u2013788. Springer, Heidelberg (2003)"},{"key":"46_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-16478-1_5","volume-title":"Implementation and Application of Functional Languages","author":"K. Matsuzaki","year":"2010","unstructured":"Matsuzaki, K., Emoto, K.: Implementing Fusion-Equipped Parallel Skeletons by Expression Templates. In: Moraz\u00e1n, M.T., Scholz, S.-B. (eds.) IFL 2009. LNCS, vol.\u00a06041, pp. 72\u201389. Springer, Heidelberg (2010)"},{"key":"46_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-540-45209-6_108","volume-title":"Euro-Par 2003 Parallel Processing","author":"K. Matsuzaki","year":"2003","unstructured":"Matsuzaki, K., Hu, Z., Takeichi, M.: Parallelization with tree skeletons. In: Kosch, H., B\u00f6sz\u00f6rm\u00e9nyi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol.\u00a02790, pp. 789\u2013798. Springer, Heidelberg (2003)"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Morita, K., Morihata, A., Matsuzaki, K., Hu, Z., Takeichi, M.: Automatic Inversion Generates Divide-and-Conquer Parallel Programs. In: Conference on Programming Language Design and Implementation (PLDI), pp. 146\u2013155. ACM Press (2007)","DOI":"10.1145\/1273442.1250752"},{"key":"46_CR15","unstructured":"O\u2019Sullivan, B., Stewart, D., Goerzen, J.: Real World Haskell. O\u2019Reilly (2008)"},{"issue":"1","key":"46_CR16","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s00165-004-0028-7","volume":"16","author":"A. Stewart","year":"2004","unstructured":"Stewart, A., Clint, M., Gabarr\u00f3, J.: Barrier synchronisation: Axiomatisation and relaxation. Formal Aspects of Computing\u00a016(1), 36\u201350 (2004)","journal-title":"Formal Aspects of Computing"},{"key":"46_CR17","unstructured":"Tesson, J.: Environnement pour le d\u00e9veloppement et la preuve de correction syst\u00e9matiques de programmes parall\u00e8les fonctionnels. Ph.D. thesis, LIFO, University of Orl\u00e9ans (November 2011), http:\/\/hal.archives-ouvertes.fr\/tel-00660554\/en\/"},{"key":"46_CR18","unstructured":"The Coq Development Team: The Coq Proof Assistant, http:\/\/coq.inria.fr"},{"key":"46_CR19","unstructured":"The SDPP Development Team: Systematic Development of Parallel Programs, http:\/\/traclifo.univ-orleans.fr\/SDPP"},{"key":"46_CR20","unstructured":"Touati, S.A.A., Worms, J., Briais, S.: The Speedup Test. Tech. Rep. inria-00443839, INRIA Saclay - Ile de France (2010), http:\/\/hal.inria.fr\/inria-00443839"},{"issue":"8","key":"46_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L.G. Valiant","year":"1990","unstructured":"Valiant, L.G.: A bridging model for parallel computation. Comm. of the ACM\u00a033(8), 103 (1990)","journal-title":"Comm. of the ACM"},{"key":"46_CR22","unstructured":"Veldhuizen, T.: Techniques for Scientific C++. Computer science technical report 542, Indiana University (2000)"},{"key":"46_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/3-540-44520-X_91","volume-title":"Euro-Par 2000 Parallel Processing","author":"A. Zavanella","year":"2000","unstructured":"Zavanella, A.: The skel-BSP global optimizer: Enhancing performance portability in parallel programming. In: Bode, A., Ludwig, T., Karl, W.C., Wism\u00fcller, R. (eds.) Euro-Par 2000. LNCS, vol.\u00a01900, pp. 658\u2013667. Springer, Heidelberg (2000)"},{"key":"46_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/11560647_13","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"J. Zhou","year":"2005","unstructured":"Zhou, J., Chen, Y.: Generating C code from LOGS specifications. In: Van Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol.\u00a03722, pp. 195\u2013210. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2013 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40047-6_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T06:19:50Z","timestamp":1688365190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40047-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400469","9783642400476"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40047-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}