{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:15Z","timestamp":1759638975846},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540566250"},{"type":"electronic","value":"9783540476139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56625-2_11","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:22:43Z","timestamp":1330255363000},"page":"122-138","source":"Crossref","is-referenced-by-count":13,"title":["Upwards and downwards accumulations on trees"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Gibbons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"unstructured":"Selim G. Akl. Design and Analysis of Parallel Algorithms. Prentice-Hall, 1989.","key":"11_CR1"},{"unstructured":"Roland Backhouse. An exploration of the Bird-Meertens formalism. In International Summer School on Constructive Algorithmics, Hollum, Ameland. STOP project, 1989. Also available as Technical Report CS 8810, Department of Computer Science, Groningen University, 1988.","key":"11_CR2"},{"doi-asserted-by":"crossref","unstructured":"Richard S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic of Programming and Calculi of Discrete Design, pages 3\u201342. Springer-Verlag, 1987. Also available as Technical Monograph PRG-56, from the Programming Research Group, Oxford University.","key":"11_CR3","DOI":"10.1007\/978-3-642-87374-4_1"},{"unstructured":"Richard S. Bird. Lectures on constructive functional programming. In Manfred Broy, editor, Constructive Methods in Computer Science. Springer-Verlag, 1988. Also available as Technical Monograph PRG-69, from the Programming Research Group, Oxford University.","key":"11_CR4"},{"doi-asserted-by":"crossref","unstructured":"G. Estrin. Organization of computer systems\u2014the fixed plus variable structure computer. In Proceedings Western Joint Computer Conference, pages 33\u201340, May 1960.","key":"11_CR5","DOI":"10.1145\/1460361.1460365"},{"issue":"4","key":"11_CR6","first-page":"81","volume":"1","author":"M. M. Fokkinga","year":"1990","unstructured":"Maarten M. Fokkinga. Tupling and mutumorphisms. The Squiggolist, 1(4):81\u201382, June 1990.","journal-title":"The Squiggolist"},{"unstructured":"Jeremy Gibbons. Algebras for Tree Algorithms. D. Phil. thesis, Programming Research Group, Oxford University, 1991. Also available as Technical Monograph PRG-94 from the Programming Research Group, Oxford.","key":"11_CR7"},{"key":"11_CR8","volume-title":"PhD thesis","author":"T. Hagino","year":"1987","unstructured":"Tatsuya Hagino. A Categorical Programming Language. PhD thesis, Laboratory for the Foundations of Computer Science, Edinburgh, September 1987."},{"issue":"8","key":"11_CR9","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/TC.1973.5009159","volume":"C-22","author":"P. M. Kogge","year":"1973","unstructured":"Peter M. Kogge and Harold S. Stone. A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Transactions on Computers, C-22(8):786\u2013793, August 1973.","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"11_CR10","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"Richard E. Ladner and Michael J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831\u2013838, October 1980.","journal-title":"Journal of the ACM"},{"unstructured":"Grant Malcolm. Algebraic Data Types and Program Transformation. PhD thesis, Rijksuniversiteit Groningen, September 1990.","key":"11_CR11"},{"unstructured":"Lambert Meertens. Algorithmics: Towards programming as a mathematical activity. In J. W. de Bakker, M. Hazewinkel, and J. K. Lenstra, editors, Proc. CWI Symposium on Mathematics and Computer Science, pages 289\u2013334. North-Holland, 1986.","key":"11_CR12"},{"key":"11_CR13","volume-title":"Technical Report CS-R9005","author":"L. Meertens","year":"1990","unstructured":"Lambert Meertens. Paramorphisms. Technical Report CS-R9005, CWI, Amsterdam, 1990."},{"doi-asserted-by":"crossref","unstructured":"Gary L. Miller and John H. Reif. Parallel tree contraction and its application. In 26th FOCS, pages 478\u2013489, 1985.","key":"11_CR14","DOI":"10.1109\/SFCS.1985.43"},{"unstructured":"John T. O'Donnell. Derivation of fine-grain algorithms. Presentation at IFIP Working Group 2.8 meeting, Rome, 1990.","key":"11_CR15"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56625-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:09Z","timestamp":1605647109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56625-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566250","9783540476139"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-56625-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}