{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:58Z","timestamp":1725663058473},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540184201"},{"type":"electronic","value":"9783540479635"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18420-1_63","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:34:38Z","timestamp":1330198478000},"page":"312-327","source":"Crossref","is-referenced-by-count":8,"title":["Arrays, non-determinism, side-effects, and parallelism: A functional perspective"],"prefix":"10.1007","author":[{"given":"Paul","family":"Hudak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Arvind. Data structures for parallel computing. October 1986.","DOI":"10.1007\/3-540-18420-1_65"},{"key":"17_CR2","unstructured":"B. Goldberg. Multiprocessor Execution of Functional Programs. PhD thesis, Yale University, expected Spring 1987."},{"key":"17_CR3","unstructured":"P. Hudak. ALFL Reference Manual and Programmer's Guide. Research Report YALEU\/DCS\/RR-322, Second Edition, Yale University, October 1984."},{"issue":"8","key":"17_CR4","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/MC.1986.1663309","volume":"19","author":"P. Hudak","year":"1986","unstructured":"P. Hudak. Para-functional programming. Computer, 19(8):60\u201371, August 1986.","journal-title":"Computer"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"P. Hudak. A semantic model of reference counting and its abstraction (detailed summary). In Proc. 1986 ACM Conf. on LISP and Functional Prog., pages 351\u2013363, ACM, August 1986.","DOI":"10.1145\/319838.319876"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"P. Hudak and A. Bloss. The aggregate update problem in functional programming systems. In 12th ACM Sym. on Prin. of Prog. Lang., pages 300\u2013314, ACM, 1985.","DOI":"10.1145\/318593.318660"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"P. Hudak and L. Smith. Para-functional programming: a paradigm for programming multiprocessor systems. In 12th ACM Sym. on Prin. of Prog. Lang., pages 243\u2013254, January 1986.","DOI":"10.1145\/512644.512667"},{"key":"17_CR8","unstructured":"R.M. Keller. FEL programmer's guide. AMPS TR 7, University of Utah, March 1982."},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/357153.357157","volume":"4","author":"J.R. Mcgraw","year":"1982","unstructured":"J.R. Mcgraw. The val language: description and analysis. TOPLAS, 4(1):44\u201382, January 1982.","journal-title":"TOPLAS"},{"key":"17_CR10","unstructured":"A. Mycroft. Abstract Interpretation and Optimizing Transformations for Applicative Programs. PhD thesis, Univ. of Edinburgh, 1981."},{"key":"17_CR11","unstructured":"R.S. Nikhil, K. Pingali, and Arvind. Id Nouveau. Computation Structures Group Memo 265, Massachusetts Institute of Technology, Laboratory for Computer Science, July 1986."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"J.T. O'Donnell. An architecture that efficiently updates associative aggregates in applicative programming language. In Functional Programming Languages and Computer Architecture, pages 164\u2013189, Springer-Verlag LNCS 201, September 1985.","DOI":"10.1007\/3-540-15975-4_36"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/3318.3323","volume":"7","author":"D.A. Schmidt","year":"1985","unstructured":"D.A. Schmidt. Detecting global variables in denotational specifications. ACM Trans. on Prog. Lang. and Systems, 7(2):299\u2013310, 1985.","journal-title":"ACM Trans. on Prog. Lang. and Systems"},{"key":"17_CR14","unstructured":"J. Schwarz. Verifying the safe use of destructive operations in applicative programs. In B. Robinet, editor, Program Transformations \u2014 Proc. of the 3rd Int'l Sym. on Programming, pages 395\u2013411, Dunod Informatique, 1978."},{"key":"17_CR15","unstructured":"Jr. Steele, Guy L. and W. Daniel Hillis. Connection machine lisp: fine-grained parallel symbolic processing. In Proc. 1986 ACM Conference on Lisp and Functional Programming, pages 279\u2013297, ACM SIGPLAN\/SIGACT\/SIGART, Cambridge, Massachusetts, August 1986."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"P. Wadler. A new array operation. In Workshop on Graph Reduction Techniques, Springer-Verlag LNCS, this volume, October 1986.","DOI":"10.1007\/3-540-18420-1_64"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"D.S. Wise. Design for a multiprocessing heap with on-board reference counting. In Functional Programming Languages and Computer Architecture, pages 289\u2013304, Springer-Verlag LNCS 201, September 1985.","DOI":"10.1007\/3-540-15975-4_43"}],"container-title":["Lecture Notes in Computer Science","Graph Reduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18420-1_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:54Z","timestamp":1605644094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18420-1_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184201","9783540479635"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-18420-1_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}