{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:41Z","timestamp":1725663701934},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544449"},{"type":"electronic","value":"9783540383628"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54444-5_91","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:51:09Z","timestamp":1330192269000},"page":"99-110","source":"Crossref","is-referenced-by-count":2,"title":["FRATS: A parallel reduction strategy for shared memory"],"prefix":"10.1007","author":[{"given":"K. G.","family":"Langendoen","sequence":"first","affiliation":[]},{"given":"W. G.","family":"Vree","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"L. Augustsson and T. Johnsson, \u201cParallel Graph Reduction with the < v, G>-machine\u201d, Proc. Functional Programming Languages and Computer Architecture 1989, pp 202\u2013213.","DOI":"10.1145\/99370.99386"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"L. George, \u201cAn Abstract Machine for Parallel Graph Reduction\u201d, Proc. Functional Programming Languages and Computer Architecture 1989, pp 214\u2013229.","DOI":"10.1145\/99370.99387"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"B. Goldberg, \u201cBuckwheat: Graph Reduction on a Shared Memory Multiprocessor\u201d, Proc. ACM Conf. on LISP and Functional Progr. 1988, pp 40\u201351.","DOI":"10.1145\/62678.62683"},{"issue":"3","key":"9_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/spe.4380180305","volume":"18","author":"P.H. Hartel","year":"1988","unstructured":"P.H. Hartel and A.H. Veen, \u201cStatistics on graph reduction of SASL programs\u201d, Software practice and experience, Vol 18, no 3, pp 239\u2013253, 1988.","journal-title":"Software practice and experience"},{"key":"9_CR5","unstructured":"P.H. Hartel, M.H.M. Smid, L. Torenvliet, and W.G. Vree, \u201cA parallel functional implementation of range queries\u201d, Computing Science in the Netherlands, pp 173\u2013189, 1989, eds. P.M.G Apers, D. Bosman, and J. van Leeuwen."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"L.O.H. Hertzberger and W.G. Vree. \u201cA Coarse Grain Parallel Architecture for Functional Languages\u201d, PARLE '89; Parallel Architectures and Languages Europe, Vol I, pp 269\u2013285, Springer-Verlag LNCS 365, 1989.","DOI":"10.1007\/3540512845_45"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"R.J.M. Hughes \u201cSuper combinators \u2014 A new implementation method for applicative languages\u201d, ACM Symp. on Lisp and functional programming, pp 1\u201310, 1982.","DOI":"10.1145\/800068.802129"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"R. Loogen, H. Kuchen, K. Indermark, and W. Damm, \u201cDistributed Implementation of Programmed Graph Reduction\u201d, PARLE '89; Parallel Architectures and Languages Europe, Vol I, pp 136\u2013157, Springer-Verlag LNCS 365, 1989.","DOI":"10.1007\/3540512845_37"},{"key":"9_CR9","unstructured":"H. Kingdon, D.R. Lester, and G.L. Burn, \u201cA Highly Distributed Graph Reducer for a Transputer Network\u201d, Tech. Rep. 123, CEG Hirst Research Centre, 1989."},{"issue":"1","key":"9_CR10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D.A. Turner","year":"1979","unstructured":"D.A. Turner, \u201cA new implementation technique for applicative languages\u201d, Software practice and experience, Vol 9, no 1, pp 31\u201349, 1979.","journal-title":"Software practice and experience"},{"key":"9_CR11","first-page":"135","volume":"452","author":"W.G. Vree","year":"1990","unstructured":"W.G. Vree, \u201cImplementation of Parallel Graph Reduction by Explicit Annotation and Program Transformation\u201d, Mathematical Foundations of Computer Science 1990, LNCS 452, pp 135\u2013151.","journal-title":"LNCS"}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54444-5_91.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:54:41Z","timestamp":1605628481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54444-5_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544449","9783540383628"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-54444-5_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}