{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:10Z","timestamp":1725663070563},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_58","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:34:37Z","timestamp":1330198477000},"page":"240-251","source":"Crossref","is-referenced-by-count":0,"title":["Controlling reduction partial order in functional parallel programs"],"prefix":"10.1007","author":[{"given":"F. Warren","family":"Burton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"12_CR1","unstructured":"Arvind, Sharing of Computations in Functional Language Implementations, Laboratory for Computer Science, Massachusetts Institute of Technology, July 1984."},{"key":"12_CR2","first-page":"187","volume-title":"Proc. 1981 Conf. Functional Programming Languages and Computer Architecture","author":"F. W. Burton","year":"1981","unstructured":"F. W. Burton and M. R. Sleep, \"Executing functional programs on a virtual tree machine\", Proc. 1981 Conf. Functional Programming Languages and Computer Architecture, Portsmouth, New Hampshire, Oct. 1981, 187\u2013194."},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/2993.357241","volume":"6","author":"F. W. Burton","year":"1984","unstructured":"F. W. Burton, \"Annotations to control parallelism and reduction order in the distributed evaluation of functional programs\", ACM Trans. Prog. Lang and Systems 6, 2 (Apr. 1984), 159\u2013174.","journal-title":"ACM Trans. Prog. Lang and Systems"},{"issue":"3","key":"12_CR4","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/TC.1984.1676425","volume":"C-33","author":"F. W. Burton","year":"1984","unstructured":"F. W. Burton and M. M. Huntbach, \"Virtual tree machines\", IEEE Trans. on Computers C-33, 3 (Mar. 1984), 278\u2013280.","journal-title":"IEEE Trans. on Computers"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1109\/TC.1985.6312218","volume":"C-34","author":"F. W. Burton","year":"1985","unstructured":"F. W. Burton, \"Speculative computation, parallelism, and functional programming\", IEEE Trans. on Computers C-34, 12 (Dec. 1985), 1190\u20131193.","journal-title":"IEEE Trans. on Computers"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"F. W. Burton, \"Storage management in virtual tree machines\", IEEE Trans. on Computers, To appear.","DOI":"10.1109\/12.2169"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"F. W. Burton, \"Functional programming for concurrent and distributed computing\", Comp. J., To appear.","DOI":"10.1093\/comjnl\/30.5.437"},{"key":"12_CR8","unstructured":"F. W. Burton, \"Nondeterminism with referential transparency in functional programming languages\", To appear."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"F. W. Burton, D. Maurer, H. Oberhauser and R. Wilhelm, \"A space efficient optimization of call-by-need\", IEEE Trans. on Software Eng., To appear.","DOI":"10.1109\/TSE.1987.233474"},{"key":"12_CR10","unstructured":"D. P. Friedman and D. S. Wise, \"Cons should not evaluate its arguments\", Third Int. Coll. Automata Languages and Programming, Edinburgh, Scotland, 1976, 257\u2013284."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"P. Henderson and J. M. Morris, \"A lazy evaluator\", Conf. Rec 3th ACM Symp. on Prin. of Prog. Lang., Atlanta, Ga., Jan. 1976, 95\u2013103.","DOI":"10.1145\/800168.811543"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"R. J. M. Hughes, \"Super Combinators: A new implementation method for applicative programs\", Proc. 1982 ACM Symposium on LISP and Functional Programming, Pittsburgh, Penn., Aug. 1982, 1\u201310.","DOI":"10.1145\/800068.802129"},{"key":"12_CR13","unstructured":"R. J. M. Hughes, \"Why functional programming matters\", Programming Methodology Group Memo PMG-40, Dept. of Computer Science, Chambers University of Technology and University of Goteborg, Goteborg, Sweden, 1984."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"J. McCarthy, \"A basic mathematical theory of computation\", in Computer Programming and Formal Systems, P. Braffort and D. Hirschberg (editor), North Holland, Amsterdam, 1963, 33\u201370.","DOI":"10.1016\/S0049-237X(08)72018-4"},{"key":"12_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. A. Turner","year":"1979","unstructured":"D. A. Turner, \"A new implementation technique for applicative languages\", Software-Practice & Experience 9 (1979), 31\u201349.","journal-title":"Software-Practice & Experience"},{"key":"12_CR16","first-page":"29","volume-title":"Mathematical logic and programming languages","author":"D. A. Turner","year":"1985","unstructured":"D. A. Turner, \"Functional programs as executable specifications\", in Mathematical logic and programming languages, C. A. R. Hoare and J. Shepherdson (editor), Prentice Hall, Englewood Cliffs, NJ, 1985, 29\u201354."},{"key":"12_CR17","first-page":"1","volume-title":"Functional Programming Languages and Computer Architecture, vol. 201","author":"D. A. Turner","year":"1985","unstructured":"D. A. Turner, \"Miranda: A non-strict functional language with polymorphic types\", in Functional Programming Languages and Computer Architecture, vol. 201, J. Jouannaud (editor), Springer-Verlag, Berlin-Heidelberg-New York-Tokyo, 1985, 1\u201316."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"P. Wadler, \"Applicative style programming, program transformation, and list operators\", Proc. 1981 Conf. Functional Programming Languages and Computer Architecture, Portsmouth, New Hampshire, Oct. 1981.","DOI":"10.1145\/800223.806759"},{"key":"12_CR19","unstructured":"C. P. Wadsworth, Semantics and Progmatics of the Lambda-Calculus, Oxford University, 1971."}],"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_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:10:26Z","timestamp":1640916626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18420-1_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184201","9783540479635"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-18420-1_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}