{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:40:09Z","timestamp":1736116809475,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0002796","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"650-661","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A monadic calculus for parallel costing of a functional language of arrays"],"prefix":"10.1007","author":[{"given":"C. B.","family":"Jay","sequence":"first","affiliation":[]},{"given":"M. I.","family":"Cole","sequence":"additional","affiliation":[]},{"given":"M.","family":"Sekanina","sequence":"additional","affiliation":[]},{"given":"P.","family":"Steckler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"key":"84_CR1","doi-asserted-by":"crossref","unstructured":"G. E. Blelloch, S. Chatterjee, J. C. Hardwick, J. Sipelstein, and M. Zagha. Implementation of a portable nested data-parallel language. Journal of Parallel and Distributed Computing, 21(1), 1994.","DOI":"10.1006\/jpdc.1994.1038"},{"issue":"6","key":"84_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/232629.232650","volume":"31","author":"Guy E. Blelloch","year":"1996","unstructured":"G.E. Blelloch and J. Greiner. A provable time and space efficient implementation of Nesl. In ACM SIGPLAN '96 International Conference on Functional Programming, pages 213\u2013225, 1996.","journal-title":"ACM SIGPLAN Notices"},{"issue":"3","key":"84_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/227234.227246","volume":"39","author":"G. E. Blelloch","year":"1996","unstructured":"G. E. Blelloch. Programming parallel algorithms. Communications of the ACM, 39(3):85\u201397, 1996.","journal-title":"Communications of the ACM"},{"key":"84_CR4","unstructured":"R. Bird and P. Wadler. Introduction to Functional Programming. International Series in Computer Science. Prentice Hall, 1988."},{"key":"84_CR5","doi-asserted-by":"crossref","unstructured":"D.E. Culler and all. LogP: Towards a realistic model of parallel computation. In Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1993.","DOI":"10.1145\/155332.155333"},{"key":"84_CR6","first-page":"27","volume-title":"Conference Record of the 24th ACM Symposium on Principles of Programming Languages","author":"P. Fradet","year":"1997","unstructured":"P. Fradet and D. Le M\u00e9tayer. Shape types. In Conference Record of the 24th ACM Symposium on Principles of Programming Languages, pages 27\u201339. ACM, New York, 1997."},{"key":"84_CR7","doi-asserted-by":"crossref","unstructured":"P. Flajolet, B. Salvy, and P. Zimmermann. Average case analysis of algorithms. Theoretical Computer Science, 1991.","DOI":"10.1016\/0304-3975(91)90145-R"},{"key":"84_CR8","doi-asserted-by":"crossref","unstructured":"S. Fortune and J. Wyllie. Parallelism in random access machines. In Proceedings 10th STOC. ACM Press, 1978.","DOI":"10.1145\/800133.804339"},{"key":"84_CR9","unstructured":"D.J. Gurr. Semantic frameworks for complexity. PhD thesis, University of Edinburgh, 1991. Available as ECS-LFCS-91-130."},{"issue":"1","key":"84_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/42267.42275","volume":"35","author":"T. Hickey","year":"1988","unstructured":"T. Hickey and J. Cohen. Automating program analysis. Journal of the Association for Computing Machinery, 35(1):185\u2013220, 1988.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"84_CR11","unstructured":"C.B. Jay and M. Sekanina. Shape checking of array programs. In Computing: the Australasian Theory Seminar, Proceedings, 1997, volume 19 of Australian Computer Science Communications, pages 113\u2013121, 1997."},{"key":"84_CR12","unstructured":"C.W. Kessler and H. Seidl. Fork95 Language and Compiler for the SB-PRAM. In 5th Intl. Workshop on Compilers for Parallel Computers, 1995."},{"issue":"2","key":"84_CR13","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/42190.42347","volume":"10","author":"D. M\u00e9tayer Le","year":"1988","unstructured":"D. Le M\u00e9tayer. ACE: An automatic complexity evaluator. ACM Transactions on Programming Languages and Systems, 10(2):248\u2013266, 1988.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"84_CR14","doi-asserted-by":"crossref","unstructured":"E. Moggi. Computational lambda-calculus and monads. In 4th LICS Conf., pages 14\u201323. IEEE, 1989.","DOI":"10.1109\/LICS.1989.39155"},{"key":"84_CR15","doi-asserted-by":"crossref","unstructured":"F. Nielson and H.R. Nielson. Two-level functional languages. CUP, 1992.","DOI":"10.1017\/CBO9780511526572"},{"key":"84_CR16","doi-asserted-by":"crossref","unstructured":"D.B. Skillicorn. Foundations of Parallel Programming. Number 6 in Cambridge Series in Parallel Computation. Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511526626"},{"key":"84_CR17","unstructured":"H.W. To. Optimizing the Parallel Behaviour of Combinations of Program Components. PhD thesis, Dept. of Computing, Imperial College, 1995."},{"issue":"8","key":"84_CR18","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. Valiant","year":"1990","unstructured":"L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103\u2013111, 1990.","journal-title":"Communications of the ACM"},{"key":"84_CR19","first-page":"461","volume":"2","author":"P. Wadler","year":"1992","unstructured":"P. Wadler. Comprehending monads. MSCS, 2:461\u2013493, 1992.","journal-title":"MSCS"},{"issue":"9","key":"84_CR20","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/361002.361016","volume":"18","author":"B. Wegbreit","year":"1975","unstructured":"B. Wegbreit. Mechanical program analysis. Communications of the ACM, 18(9):528\u2013539, 1975.","journal-title":"Communications of the ACM"},{"key":"84_CR21","doi-asserted-by":"crossref","unstructured":"W. Zimmermann and W. L\u00f6we. An approach to machine-independent parallel programming. In Parallel Processing: CONPAR 94 \u2014 VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 277\u2013288. Springer, 1994.","DOI":"10.1007\/3-540-58430-7_25"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T22:02:43Z","timestamp":1736114563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0002796","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}