{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:23:25Z","timestamp":1743135805244,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030185053"},{"type":"electronic","value":"9783030185060"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-18506-0_1","type":"book-chapter","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T08:03:19Z","timestamp":1556006599000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Colocation of Potential Parallelism in a Distributed Adaptive Run-Time System for Parallel Haskell"],"prefix":"10.1007","author":[{"given":"Evgenij","family":"Belikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Wolfgang","family":"Loidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greg","family":"Michaelson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"issue":"8","key":"1_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J Backus","year":"1978","unstructured":"Backus, J.: Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. CACM 21(8), 613\u2013641 (1978)","journal-title":"CACM"},{"key":"1_CR2","unstructured":"Belikov, E.: Language run-time systems: an overview. In: Proceedings of Imperial College Computing Student Workshop, OpenAccess Series in Informatics (OASIcs), vol. 49, pp. 3\u201312. Leibniz-Zentrum fuer Informatik (2015)"},{"key":"1_CR3","unstructured":"Belikov, E., Deligiannis, P., Totoo, P., Aljabri, M., Loidl, H.-W.: A survey of high-level parallel programming models. Technical report HW-MACS-TR-0103, Department of Computer Science, Heriot-Watt University, December 2013"},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0167-8191(89)90127-0","volume":"9","author":"D Bevan","year":"1989","unstructured":"Bevan, D.: An efficient reference counting solution to the distributed garbage collection problem. Parallel Comput. 9(2), 179\u2013192 (1989)","journal-title":"Parallel Comput."},{"issue":"8","key":"1_CR5","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/209937.209958","volume":"30","author":"Robert D. Blumofe","year":"1995","unstructured":"Blumofe, R., Joerg, C., Kuszmaul, B., Leiserson, C., Randall, K., Zhou, Y.: Cilk: an efficient multithreaded runtime system. In: Proceedings of the Symposium on Principles and Practice of Parallel Programming (PPoPP 1995), pp. 207\u2013216 (1995)","journal-title":"ACM SIGPLAN Notices"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Burton, F.W., Sleep, M.R.: Executing functional programs on a virtual tree of processors. In: Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, pp. 187\u2013194. ACM (1981)","DOI":"10.1145\/800223.806778"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Charles, P., et al.: X10: an object-oriented approach to non-uniform cluster computing. In: ACM SIGPLAN Notices, vol. 40, pp. 519\u2013538. ACM (2005)","DOI":"10.1145\/1103845.1094852"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Chase, D., Lev, Y.: Dynamic circular work-stealing deque. In: Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 21\u201328 (2005)","DOI":"10.1145\/1073970.1073974"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1090\/S0002-9947-1936-1501858-0","volume":"39","author":"A Church","year":"1936","unstructured":"Church, A., Rosser, J.B.: Some properties of conversion. Trans. Am. Math. Soc. 39(3), 472\u2013482 (1936)","journal-title":"Trans. Am. Math. Soc."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Fluet, M., Rainey, M., Reppy, J., Shaw, A., Xiao, Y.: Manticore: a heterogeneous parallel language. In: Proceedings of the 2007 Workshop on Declarative Aspects of Multicore Programming, pp. 37\u201344. ACM (2007)","DOI":"10.1145\/1248648.1248656"},{"key":"1_CR11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5712.001.0001","volume-title":"PVM: Parallel Virtual Machine: A User\u2019s Guide and Tutorial for Networked Parallel Computing","author":"A Geist","year":"1994","unstructured":"Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., Sunderam, V.: PVM: Parallel Virtual Machine: A User\u2019s Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge (1994)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1007\/978-0-387-09766-4_46","volume-title":"Encyclopedia of Parallel Computing","author":"K Hammond","year":"2011","unstructured":"Hammond, K.: Glasgow parallel Haskell (GpH). In: Padua, D. (ed.) Encyclopedia of Parallel Computing, pp. 768\u2013779. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-0-387-09766-4_46"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-21338-0_17","volume-title":"Reliable Software Technologies - Ada-Europe 2011","author":"K Hammond","year":"2011","unstructured":"Hammond, K.: Why parallel functional programming matters: panel statement. In: Romanovsky, A., Vardanega, T. (eds.) Ada-Europe 2011. LNCS, vol. 6652, pp. 201\u2013205. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-21338-0_17"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1093\/nsr\/nwv042","volume":"2","author":"Z Hu","year":"2015","unstructured":"Hu, Z., Hughes, J., Wang, M.: How functional programming mattered. Natl. Sci. Rev. 2(3), 349\u2013370 (2015)","journal-title":"Natl. Sci. Rev."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Hudak, P., Hughes, J., Peyton Jones, S., Wadler, P.: A history of Haskell: being lazy with class. In: Proceedings of the Third ACM SIGPLAN Conference on History of Programming Languages, pp. 1\u201312. ACM (2007)","DOI":"10.1145\/1238844.1238856"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1093\/comjnl\/32.2.98","volume":"32","author":"J Hughes","year":"1989","unstructured":"Hughes, J.: Why functional programming matters. Comp. J. 32(2), 98\u2013107 (1989)","journal-title":"Comp. J."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Janjic, V., Hammond, K.: Granularity-aware work-stealing for computationally-uniform grids. In: 2010 10th IEEE\/ACM International Conference on Cluster, Cloud and Grid Computing (CCGrid), pp. 123\u2013134. IEEE (2010)","DOI":"10.1109\/CCGRID.2010.49"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/74818.74825","volume":"24","author":"DA Kranz","year":"1989","unstructured":"Kranz, D.A., Halstead Jr., R.H., Mohr, E.: Mul-T: a high-performance parallel Lisp. ACM SIGPLAN Not. 24, 81\u201390 (1989)","journal-title":"ACM SIGPLAN Not."},{"issue":"04","key":"1_CR19","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1142\/S0129626401000737","volume":"11","author":"H-W Loidl","year":"2001","unstructured":"Loidl, H.-W., Trinder, P., Butz, C.: Tuning task granularity and data locality of data parallel GpH programs. Parallel Process. Lett. 11(04), 471\u2013486 (2001)","journal-title":"Parallel Process. Lett."},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1017\/S0956796805005526","volume":"15","author":"R Loogen","year":"2005","unstructured":"Loogen, R., Ortega-Mall\u00e9n, Y., Pe\u00f1a-Mar\u00ed, R.: Parallel functional programming in Eden. J. Funct. Program. 15(3), 431\u2013475 (2005)","journal-title":"J. Funct. Program."},{"key":"1_CR21","volume-title":"Parallel and Concurrent Programming in Haskell: Techniques for Multicore and Multithreaded Programming","author":"S Marlow","year":"2013","unstructured":"Marlow, S.: Parallel and Concurrent Programming in Haskell: Techniques for Multicore and Multithreaded Programming. O\u2019Reilly, Sebastopol (2013)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Marlow, S., Maier, P., Loidl, H.-W., Aswad, M., Trinder, P.: Seq no more: better strategies for parallel Haskell. In: Proceedings of the 3rd ACM Symposium on Haskell, pp. 91\u2013102 (2010)","DOI":"10.1145\/2088456.1863535"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1145\/1631687.1596563","volume":"44","author":"S Marlow","year":"2009","unstructured":"Marlow, S., Peyton Jones, S.L., Singh, S.: Runtime support for multicore Haskell. ACM SIGPLAN Not. 44, 65\u201378 (2009)","journal-title":"ACM SIGPLAN Not."},{"key":"1_CR24","unstructured":"Marlow, S.: (Eds.) Haskell 2010 language report 2010. \n                    http:\/\/www.haskell.org\/onlinereport\/haskell2010"},{"issue":"3","key":"1_CR25","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/71.86103","volume":"2","author":"E Mohr","year":"1991","unstructured":"Mohr, E., Kranz, D., Halstead Jr., R., et al.: Lazy task creation: a technique for increasing the granularity of parallel programs. IEEE Trans. Parallel Distrib. Syst. 2(3), 264\u2013280 (1991)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-1-4471-3215-8_17","volume-title":"Functional Programming, Glasgow 1992","author":"W Partain","year":"1993","unstructured":"Partain, W.: The NoFib benchmark suite of Haskell programs. In: Launchbury, J., Sansom, P. (eds.) Functional Programming, Glasgow 1992, pp. 195\u2013202. Springer, Heidelberg (1993). \n                    https:\/\/doi.org\/10.1007\/978-1-4471-3215-8_17"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1093\/comjnl\/32.2.175","volume":"32","author":"SL Peyton Jones","year":"1989","unstructured":"Peyton Jones, S.L.: Parallel implementations of functional programming languages. Comput. J. 32(2), 175\u2013186 (1989)","journal-title":"Comput. J."},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3540512845_40","volume-title":"PARLE \u201989 Parallel Architectures and Languages Europe","author":"SLP Jones","year":"1989","unstructured":"Jones, S.L.P., Clack, C., Salkild, J.: High-performance parallel graph reduction. In: Odijk, E., Rem, M., Syre, J.-C. (eds.) PARLE 1989. LNCS, vol. 365, pp. 193\u2013206. Springer, Heidelberg (1989). \n                    https:\/\/doi.org\/10.1007\/3540512845_40"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Totoo, P., Loidl, H.-W.: Lazy data-oriented evaluation strategies. In: Proceedings of 3rd ACM Workshop on Functional High-Performance Computing, pp. 63\u201374 (2014)","DOI":"10.1145\/2636228.2636234"},{"issue":"1","key":"1_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1017\/S0956796897002967","volume":"8","author":"P Trinder","year":"1998","unstructured":"Trinder, P., Hammond, K., Loidl, H.-W., Peyton Jones, S.L.: Algorithm + strategy = parallelism. J. Funct. Program. 8(1), 23\u201360 (1998)","journal-title":"J. Funct. Program."},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Trinder, P., Hammond, K., Mattson Jr., J., Partridge, A., Peyton Jones, S.: GUM: a portable parallel implementation of Haskell. In: Proceedings of PLDI, pp. 79\u201388 (1996)","DOI":"10.1145\/249069.231392"},{"issue":"2","key":"1_CR32","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10766-016-0484-8","volume":"46","author":"J Yang","year":"2018","unstructured":"Yang, J., He, Q.: Scheduling parallel computations by work stealing: a survey. Int. J. Parallel Prog. 46(2), 173\u2013197 (2018)","journal-title":"Int. J. Parallel Prog."}],"container-title":["Lecture Notes in Computer Science","Trends in Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18506-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:35:30Z","timestamp":1558348530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-18506-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030185053","9783030185060"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18506-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TFP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Trends in Functional Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gothenburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tfp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cse.chalmers.se\/~myreen\/tfp2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"13","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2,4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}