{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T20:10:46Z","timestamp":1781381446935,"version":"3.54.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6102,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/s0304-3975(96)00114-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:48:18Z","timestamp":1027630098000},"page":"67-80","source":"Crossref","is-referenced-by-count":9,"title":["Computing downwards accumulations on trees quickly"],"prefix":"10.1016","volume":"169","author":[{"given":"Jeremy","family":"Gibbons","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00114-4_BIB1_1","series-title":"International Summer School on Constructive Algorithmics","article-title":"An exploration of the Bird-Meertens formalism","author":"Backhouse","year":"1989"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB1_2","series-title":"Technical Report CS 8810","author":"Backhouse","year":"1988"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB2","first-page":"131","article-title":"Deriving associative operators for language recognition","volume":"43","author":"Barnard","year":"1991","journal-title":"Bull. European Assoc. Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00114-4_BIB3_1","series-title":"Logic of Programming and Calculi of Discrete Design","first-page":"3","article-title":"An introduction to the theory of lists","author":"Bird","year":"1987"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB3_2","unstructured":"Also available as Technical Monograph PRG-56, from the Programming Research Group, Oxford University."},{"key":"10.1016\/S0304-3975(96)00114-4_BIB4_1","series-title":"Constructive Methods in Computer Science","first-page":"151","article-title":"Lectures on constructive functional programming","author":"Bird","year":"1988"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB4_2","unstructured":"Also available as Technical Monograph PRG-69, from the Programming Research Group, Oxford University."},{"key":"10.1016\/S0304-3975(96)00114-4_BIB5_1","article-title":"Algebras for tree algorithms","author":"Gibbons","year":"1991"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB5_2","unstructured":"Available as Technical Monograph PRG-94."},{"key":"10.1016\/S0304-3975(96)00114-4_BIB6_1","series-title":"Mathematics of Program Construction","first-page":"122","article-title":"Upwards and downwards accumulations on trees","volume":"Vol. 669","author":"Gibbons","year":"1993"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB6_2","series-title":"Proc. of the Massey Functional Programming Workshop","author":"Gibbons","year":"1992"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB7_1","doi-asserted-by":"crossref","DOI":"10.1017\/S0956796800001908","article-title":"The third homomorphism theorem","volume":"6","author":"Gibbons","year":"1996","journal-title":"J. Functional Programming"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB7_2","series-title":"Computing: the Australian Theory Seminar","first-page":"62","author":"Gibbons","year":"1994"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(94)00013-1","article-title":"Efficient parallel algorithms for tree accumulations","volume":"23","author":"Gibbons","year":"1994","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB9","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1145\/7902.7903","article-title":"Data parallel algorithms","volume":"29","author":"Hillis","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB10","series-title":"Research Topics in Functional Programming","first-page":"117","article-title":"Compile-time analysis of functional programs","author":"Hughes","year":"1990"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB11","series-title":"Programming Languages and Systems ESOP '94","first-page":"302","article-title":"Shapely types and shape polymorphism","volume":"Vol. 788","author":"Jay","year":"1994"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","article-title":"Semantics of context-free languages","volume":"2","author":"Knuth","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB13","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB14","article-title":"Algebraic data types and program transformation","author":"Malcolm","year":"1990"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB15","series-title":"Proc. CWI Symp. on Mathematics and Computer Science","first-page":"289","article-title":"Algorithmics: Towards programming as a mathematical activity","author":"Meertens","year":"1986"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB16","series-title":"26th IEEE Symp. on the Foundations of Computer Science","first-page":"478","article-title":"Parallel tree contraction and its application","author":"Miller","year":"1985"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB17","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/2.62092","article-title":"Architecture independent parallel computation","volume":"23","author":"Skillicorn","year":"1990","journal-title":"IEEE Comput."},{"key":"10.1016\/S0304-3975(96)00114-4_BIB18","series-title":"Foundations of Parallel Programming","author":"Skillicorn","year":"1994"},{"key":"10.1016\/S0304-3975(96)00114-4_BIB19","article-title":"The complexity of parallel computations","author":"Wyllie","year":"1979"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001144?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596001144?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T14:20:58Z","timestamp":1580826058000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596001144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["S0304397596001144"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00114-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}