{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T07:17:48Z","timestamp":1767165468468,"version":"build-2238731810"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02n03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2000,6]]},"abstract":"<jats:p>We propose the higher-order functional style for the parallel programming of algorithms. The functional language [Formula: see text], a subset of the language Haskell, facilitates the clean integration of skeletons into a functional program. Skeletons are predefined programming schemata with an efficient parallel implementation. We report on our compiler, which translates [Formula: see text] programs into C+MPI, especially on the design decisions we made. Two small examples, the n queens problem and Karatsuba's polynomial multiplication, are presented to demonstrate the programming comfort and the speedup one can obtain.<\/jats:p>","DOI":"10.1142\/s0129626400000238","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T07:04:45Z","timestamp":1027753485000},"page":"239-250","source":"Crossref","is-referenced-by-count":30,"title":["$\\mathcal{HDC}$: A HIGHER-ORDER LANGUAGE FOR DIVIDE-AND-CONQUER"],"prefix":"10.1142","volume":"10","author":[{"given":"CHRISTOPH A.","family":"HERRMANN","sequence":"first","affiliation":[{"name":"Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, D-94030 Passau, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHRISTIAN","family":"LENGAUER","sequence":"additional","affiliation":[{"name":"Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, D-94030 Passau, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(89)90011-7"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4330070305"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1145\/258949.258953"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1145\/135226.135231"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(83)90013-8"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1145\/277652.277725"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796899003287"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796897002967"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626400000238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T14:44:42Z","timestamp":1565102682000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626400000238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":8,"aliases":["10.1016\/s0129-6264(00)00023-8"],"journal-issue":{"issue":"02n03","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2000,6]]}},"alternative-id":["10.1142\/S0129626400000238"],"URL":"https:\/\/doi.org\/10.1142\/s0129626400000238","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}