{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:11Z","timestamp":1725663071468},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_51","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:35:19Z","timestamp":1330180519000},"page":"94-113","source":"Crossref","is-referenced-by-count":10,"title":["Alfalfa: Distributed graph reduction on a hypercube multiprocessor"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Hudak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"R.M. Burstall, D.B. MacQueen, and D.T. Sannella. Hope: an experimental applicative language. In The 1980 LISP Conference, pages 136\u2013143, Stanford University, August 1980.","key":"5_CR1","DOI":"10.1145\/800087.802799"},{"doi-asserted-by":"crossref","unstructured":"T. Clarke, P. Gladstone, and Norman A. MacLean. Skim \u2014 the s, k, i reduction machine. In The 1980 LISP Conference, pages 128\u2013135, Stanford University, August 1980.","key":"5_CR2","DOI":"10.1145\/800087.802798"},{"unstructured":"Intel Corporation. iPSC User's Guide \u2014 Preliminary. Technical Report 175455-001, Intel Corporation, July 1985.","key":"5_CR3"},{"doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In 4th ACM Sym. on Prin. of Prog. Lang., pages 238\u2013252, ACM, 1977.","key":"5_CR4","DOI":"10.1145\/512950.512973"},{"doi-asserted-by":"crossref","unstructured":"J. Darlington and M. Reeve. Alice: a multi-processor reduction machine for the parallel evaluation of applicative languages. In Functional Programming Languages and Computer Architecture, pages 65\u201376, ACM, October 1981.","key":"5_CR5","DOI":"10.1145\/800223.806764"},{"unstructured":"P. Hudak. ALFL Reference Manual and Programmer's Guide. Research Report YALEU\/DCS\/RR-322, Second Edition, Yale University, October 1984.","key":"5_CR6"},{"unstructured":"P. Hudak. Collecting interpretations of expressions. Research Report 497, Yale University, Department of Computer Science, 1986. submitted to the Third Workshop on the Mathematical Foundations of Programming Language Semantics.","key":"5_CR7"},{"doi-asserted-by":"crossref","unstructured":"P. Hudak. Object and Task Reclamation in Distributed Applicative Processing Systems. PhD thesis, University of Utah, July 1982.","key":"5_CR8","DOI":"10.1145\/800068.802147"},{"issue":"10","key":"5_CR9","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TC.1985.6312191","volume":"C-34","author":"Paul Hudak","year":"1985","unstructured":"P. Hudak and B. Goldberg. Distributed execution of functional programs using serial combinators. In Proceedings of 1985 Int'l Conf. on Parallel Proc., pages 831\u2013839, August 1985. Also appeared in IEEE Trans. on Computers, Vol C-34, No. 10, October 1985, pp. 881\u2013891.","journal-title":"IEEE Transactions on Computers"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1007\/3-540-15975-4_49","volume-title":"Functional Programming Languages and Computer Architecture","author":"Paul Hudak","year":"1985","unstructured":"P. Hudak and B. Goldberg. Serial combinators: \u201coptimal\u201d grains of parallelism. In Functional Programming Languages and Computer Architecture, pages 382\u2013388, Springer-Verlag LNCS 201, September 1985."},{"unstructured":"T. Johnsson. The G-machine: an abstract machine for graph reduction. Technical Report, PMG, Dept. of Computer Science, Chalmers Univ. of Tech., February 1985.","key":"5_CR11"},{"doi-asserted-by":"crossref","unstructured":"R.B. Kieburtz. The G-machine: a fast, graph-reduction evaluator. Technical Report CS\/E-85-002, Dept. of Computer Science, Oregon Graduate Center, January 1985.","key":"5_CR12","DOI":"10.1007\/3-540-15975-4_50"},{"unstructured":"R. Milner. A proposal for standard ml. In Proc. 1984 ACM Conf. on LISP and Functional Prog., pages 184\u2013197, ACM, August 1984.","key":"5_CR13"},{"unstructured":"A. Mycroft. Abstract Interpretation and Optimizing Transformations for Applicative Programs. PhD thesis, Univ. of Edinburgh, 1981.","key":"5_CR14"},{"unstructured":"D.A. Turner. SASL language manual. Technical Report, University of St. Andrews, 1976.","key":"5_CR15"}],"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_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:14:51Z","timestamp":1605626091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18420-1_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184201","9783540479635"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-18420-1_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}