{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T16:28:26Z","timestamp":1771518506245,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T00:00:00Z","timestamp":1553472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T00:00:00Z","timestamp":1553472000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s11227-019-02820-x","type":"journal-article","created":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T12:02:46Z","timestamp":1553515366000},"page":"5016-5037","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Transforming powerlist-based divide-and-conquer programs for an improved execution model"],"prefix":"10.1007","volume":"76","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9981-0139","authenticated-orcid":false,"given":"Virginia","family":"Niculescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Loulergue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,25]]},"reference":[{"key":"2820_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60117-1_7","volume-title":"Architecture independent massive parallelization of divide-and-conquer algorithms","author":"K Achatz","year":"1995","unstructured":"Achatz K, Schulte W (1995) Architecture independent massive parallelization of divide-and-conquer algorithms. Fakultaet fuer Informatik, Universitaet Ulm, Ulm"},{"key":"2820_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive theorem proving and program development","author":"Y Bertot","year":"2004","unstructured":"Bertot Y, Casteran P (2004) Interactive theorem proving and program development. Springer, Berlin"},{"key":"2820_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-87374-4_1","volume-title":"Logic of programming and calculi of discrete design","author":"R Bird","year":"1987","unstructured":"Bird R (1987) An introduction to the theory of lists. In: Broy M (ed) Logic of programming and calculi of discrete design. Springer, Berlin, pp 5\u201342"},{"key":"2820_CR4","doi-asserted-by":"crossref","unstructured":"Chin W (1992) Safe fusion of functional expressions. In: Proc. Conference on Lisp and Functional Programming, San Francisco, California","DOI":"10.1145\/141471.141494"},{"key":"2820_CR5","doi-asserted-by":"crossref","unstructured":"Chin W (1993) Towards an automated tupling strategy. In: Proc Conference on Partial Evaluation and Program Manipulation. ACM Press, Copenhagen, pp 119\u2013132","DOI":"10.1145\/154630.154643"},{"key":"2820_CR6","volume-title":"Algorithmic skeletons: structured management of parallel computation","author":"M Cole","year":"1989","unstructured":"Cole M (1989) Algorithmic skeletons: structured management of parallel computation. MIT Press, Cambridge"},{"key":"2820_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley JW, Tukey JW (1965) An algorithm for the machine calculation of complex Fourier series. Math Comput 19:297\u2013301","journal-title":"Math Comput"},{"key":"2820_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139173018","volume-title":"The functional approach to programming","author":"G Cousineau","year":"1998","unstructured":"Cousineau G, Mauny M (1998) The functional approach to programming. Cambridge University Press, Cambridge"},{"key":"2820_CR9","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1016\/j.future.2009.05.021","volume":"26","author":"L Gesbert","year":"2010","unstructured":"Gesbert L, Gava F, Loulergue F, Dabrowski F (2010) Bulk synchronous parallel ML with exceptions. Future Gener Comput Syst 26:486\u2013490","journal-title":"Future Gener Comput Syst"},{"key":"2820_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-1-4471-0097-3_2","volume-title":"Patterns and skeletons for parallel and distributed computing","author":"S Gorlatch","year":"2003","unstructured":"Gorlatch S (2003) SAT: a programming methodology with skeletons and collective operations. In: Rabhi FA, Gorlatch S (eds) Patterns and skeletons for parallel and distributed computing. Springer, Berlin, pp 29\u201364"},{"key":"2820_CR11","doi-asserted-by":"crossref","unstructured":"Hu Z, Iwasaki H, Takeichi M (1996) Construction of list homomorphisms by tupling and fusion. In: Penczek W, Szalas A (eds) Mathematical Foundations of Computer Science (Lecture Notes in Computer Science), vol 1113. Springer, Berlin, pp 407\u2013418","DOI":"10.1007\/3-540-61550-4_166"},{"key":"2820_CR12","unstructured":"Kornerup J (1997) Data structures for parallel recursion. In: Ph.D. dissertation, University of Texas"},{"key":"2820_CR13","unstructured":"Loulergue F, Niculescu V, Tesson J (2014) Implementing powerlists with bulk synchronous parallel ML. In: 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC2014), Timisoara, Romania, 22\u201325 Sept. IEEE Computer Society 2014, pp 325\u2013332"},{"key":"2820_CR14","unstructured":"Loulergue F, Niculescu V, Robillard S. (2013) Powerlists in Coq: programming and reasoning. In: First International Symposium on Computing and Networking (CANDAR 2013) Matsuyama, Japan, Dec. 4\u20136, 2013, pp 57\u201365. IEEE Computer Society"},{"issue":"6","key":"2820_CR15","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1145\/197320.197356","volume":"16","author":"J Misra","year":"1994","unstructured":"Misra J (1994) Powerlist: a structure for parallel recursion. ACM Trans Program Lang Syst 16(6):1737\u20131767","journal-title":"ACM Trans Program Lang Syst"},{"key":"2820_CR16","doi-asserted-by":"crossref","unstructured":"Niculescu V (2007) Data-distributions in powerlist theory. In: Jones CB, Liu Z, Woodcock J (eds) Theoretical aspects of computing (ICTAC) (Ser LNCS) vol. 4711. Springer, pp 396\u2013409","DOI":"10.1007\/978-3-540-75292-9_27"},{"issue":"2","key":"2820_CR17","first-page":"159","volume":"14","author":"V Niculescu","year":"2011","unstructured":"Niculescu V (2011) PARES\u2014a model for parallel recursive programs. Rom J Inf Sci Technol 14(2):159\u2013182","journal-title":"Rom J Inf Sci Technol"},{"key":"2820_CR18","doi-asserted-by":"crossref","unstructured":"Niculescu V, Loulergue F, Bufnea D, Sterca A (2017) A java framework for high level parallel programming using powerlists. In: 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) 18\u201320, pp 255\u2013262","DOI":"10.1109\/PDCAT.2017.00049"},{"issue":"8","key":"2820_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"LG Valiant","year":"1990","unstructured":"Valiant LG (1990) A bridging model for parallel computation. Commun ACM 33(8):103\u2013111","journal-title":"Commun ACM"},{"key":"2820_CR20","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 (1990) Deforestation: transforming programs to eliminate trees. Theor Comput Sci 73:231\u2013248","journal-title":"Theor Comput Sci"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02820-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-019-02820-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02820-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T08:30:06Z","timestamp":1591345806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-019-02820-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,25]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["2820"],"URL":"https:\/\/doi.org\/10.1007\/s11227-019-02820-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,25]]},"assertion":[{"value":"25 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}