{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T02:46:11Z","timestamp":1767926771075,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"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":4825,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0167-6423(99)00022-2","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:12:04Z","timestamp":1036098724000},"page":"37-65","source":"Crossref","is-referenced-by-count":21,"title":["Generic downwards accumulations"],"prefix":"10.1016","volume":"37","author":[{"given":"Jeremy","family":"Gibbons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0167-6423(99)00022-2_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0956796800001556","article-title":"Generic functional programming with types and relations","volume":"6","author":"Bird","year":"1996","journal-title":"J. Funct. Programm."},{"key":"10.1016\/S0167-6423(99)00022-2_BIB2","doi-asserted-by":"crossref","unstructured":"R.S. Bird, The promotion and accumulation strategies in transformational programming, ACM Trans. Programm. Languages Systems 6 (4) (1994) 487\u2013504, see also [3].","DOI":"10.1145\/1780.1781"},{"issue":"3","key":"10.1016\/S0167-6423(99)00022-2_BIB3","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/3550149","article-title":"Addendum to the promotion and accumulation strategies in transformational programming","volume":"7","author":"Bird","year":"1985","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0167-6423(99)00022-2_BIB4","doi-asserted-by":"crossref","unstructured":"R.S. Bird, An introduction to the theory of lists, in: M. Broy (Ed.), Logic of Programming and Calculi of Discrete Design, Springer, Berlin, 1987, pp. 3\u201342. Also available as Technical Monograph PRG-56, from the Programming Research Group, Oxford University.","DOI":"10.1007\/978-3-642-87374-4_1"},{"issue":"2","key":"10.1016\/S0167-6423(99)00022-2_BIB5","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0167-6423(89)90036-1","article-title":"Formal derivation of a pattern matching algorithm","volume":"12","author":"Bird","year":"1989","journal-title":"Sci. Comput. Programm."},{"key":"10.1016\/S0167-6423(99)00022-2_BIB6","unstructured":"M.M. Fokkinga, E. Meijer, Program calculation properties of continuous algebras, Technical Report CS-R9104, CWI, Amsterdam, January 1991."},{"key":"10.1016\/S0167-6423(99)00022-2_BIB7","unstructured":"J. Gibbons, Algebras for Tree Algorithms, D. Phil. Thesis, Programming Research Group, Oxford University, 1991. Available as Technical Monograph PRG-94."},{"key":"10.1016\/S0167-6423(99)00022-2_BIB8","doi-asserted-by":"crossref","unstructured":"J. Gibbons, Upwards and downwards accumulations on trees, in: R.S. Bird, C.C. Morgan, J.C.P. Woodcock (Eds.), Lecture Notes in Computer Science 669: Mathematics of Program Construction, Springer, Berlin, 1993, pp. 122\u2013138. A revised version appears in the Proceedings of the Massey Functional Programming Workshop, 1992.","DOI":"10.1007\/3-540-56625-2_11"},{"issue":"3","key":"10.1016\/S0167-6423(99)00022-2_BIB9","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1017\/S0956796800001842","article-title":"Deriving tidy drawings of trees","volume":"6","author":"Gibbons","year":"1996","journal-title":"J. Funct. Programm."},{"key":"10.1016\/S0167-6423(99)00022-2_BIB10","series-title":"Lecture Notes in Computer Science 1422","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0054292","article-title":"Polytypic downwards accumulations","author":"Gibbons","year":"1998"},{"key":"10.1016\/S0167-6423(99)00022-2_BIB11","doi-asserted-by":"crossref","unstructured":"J. Gibbons, G. Jones, The under-appreciated unfold, in Proceedings of the Third ACM SIGPLAN International Conference on Functional Programming, Baltimore, Maryland, September 1998, pp. 273\u2013279.","DOI":"10.1145\/289423.289455"},{"key":"10.1016\/S0167-6423(99)00022-2_BIB12","unstructured":"P. Hoogendijk, A generic theory of datatypes, Ph.D. Thesis, TU Eindhoven, 1997."},{"key":"10.1016\/S0167-6423(99)00022-2_BIB13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/BFb0026992","article-title":"When do datatypes commute?","author":"Hoogendijk","year":"1997"},{"key":"10.1016\/S0167-6423(99)00022-2_BIB14","doi-asserted-by":"crossref","unstructured":"P. Jansson, J. Jeuring, PolyP \u2014 polytypic programming language extension, in Conference Record of POPL\u201997: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997, pp. 470\u2013482.","DOI":"10.1145\/263699.263763"},{"issue":"4","key":"10.1016\/S0167-6423(99)00022-2_BIB15","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."},{"issue":"3","key":"10.1016\/S0167-6423(99)00022-2_BIB16","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1093\/comjnl\/34.3.254","article-title":"A query language for retrieving information from hierarchical text structures","volume":"34","author":"MacLeod","year":"1991","journal-title":"Comput. J."},{"key":"10.1016\/S0167-6423(99)00022-2_BIB17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0167-6423(90)90023-7","article-title":"Data structures and program transformation","volume":"14","author":"Malcolm","year":"1990","journal-title":"Sci. Comput. Programm."},{"key":"10.1016\/S0167-6423(99)00022-2_BIB18","unstructured":"L. Meertens, First steps towards the theory of rose trees, CWI, Amsterdam; IFIP Working Group 2.1 working paper 592 ROM-25, 1988."},{"issue":"5","key":"10.1016\/S0167-6423(99)00022-2_BIB19","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01211391","article-title":"Paramorphisms","volume":"4","author":"Meertens","year":"1992","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0167-6423(99)00022-2_BIB20","unstructured":"J. Peterson, K. Hammond, L. Augustsson, B. Boutel, W. Burton, J. Fasel, A.D. Gordon, J. Hughes, P. Hudak, T. Johnsson, M. Jones, E. Meijer, S. Peyton Jones, A. Reid, P. Wadler, The Haskell 1.4 report. http:\/\/www.haskell.org\/report\/, April 1997."},{"issue":"2","key":"10.1016\/S0167-6423(99)00022-2_BIB21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","article-title":"Tidier drawings of trees","volume":"7","author":"Reingold","year":"1981","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"10.1016\/S0167-6423(99)00022-2_BIB22","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/322017.322028","article-title":"Semantics of the domain of flow diagrams","volume":"24","author":"Reynolds","year":"1977","journal-title":"J ACM"},{"key":"10.1016\/S0167-6423(99)00022-2_BIB23","doi-asserted-by":"crossref","unstructured":"D. Skillicorn, Foundations of parallel programming, Number six in International Series on Parallel Computation, Cambridge University Press, Cambridge, 1994.","DOI":"10.1017\/CBO9780511526626"},{"key":"10.1016\/S0167-6423(99)00022-2_BIB24","doi-asserted-by":"crossref","unstructured":"P. Wadler, Theorems for free! in: Functional Programming Languages and Computer Architecture, ACM, 1989, pp. 347\u2013359.","DOI":"10.1145\/99370.99404"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642399000222?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642399000222?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T05:21:26Z","timestamp":1681363286000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642399000222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":24,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0167642399000222"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(99)00022-2","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}