{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:23:33Z","timestamp":1743150213641,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645917"},{"type":"electronic","value":"9783540693451"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054292","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:28:32Z","timestamp":1149665312000},"page":"207-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Polytypic downwards accumulations"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Gibbons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"13_CR1","unstructured":"Roland Backhouse, Henk Doornbos, and Paul Hoogendijk. A class of commuting relators. In STOP 1992 Summerschool on Constructive Algorithmics. STOP project, 1992."},{"issue":"1","key":"13_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0956796800001556","volume":"6","author":"R. Bird","year":"1996","unstructured":"Richard Bird, Oege de Moor, and Paul Hoogendijk. Generic functional programming with types and relations. Journal of Functional Programming, 6(1):1\u201328, 1996.","journal-title":"Journal of Functional Programming"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1145\/1780.1781","volume":"6","author":"R. S. Bird","year":"1984","unstructured":"Richard S. Bird. The promotion and accumulation strategies in transformational programming. ACM Transactions on Programming Languages and Systems, 6(4):487\u2013504, October 1984. See also [4].","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"13_CR4","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/3550149","volume":"7","author":"R. S. Bird","year":"1985","unstructured":"Richard S. Bird. Addendum to \u201cThe promotion and accumulation strategies in transformational programming\u201d. ACM Transactions on Programming Languages and Systems, 7(3):490\u2013492, July 1985.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"13_CR5","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":"13_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0167-6423(92)90008-Y","volume":"18","author":"E. A. Boiten","year":"1992","unstructured":"E. A. Boiten. Improving recursive functions by inverting the order of evaluation. Science of Computer Programming, 18:139\u2013179, January 1992. Also in [7].","journal-title":"Science of Computer Programming"},{"key":"13_CR7","unstructured":"Eerke Boiten. Views of Formal Program Development. PhD thesis, Department of Informatics, University of Nijmegen, 1992."},{"key":"13_CR8","unstructured":"Jeremy Gibbons. Algebras for Tree Algorithms. D. Phil. thesis, Programming Research Group, Oxford University, 1991. Available as Technical Monograph PRG-94."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Jeremy Gibbons. Upwards and downwards accumulations on trees. In R. S. Bird, C. C. Morgan, and J. C. P. Woodcock, editors, LNCS 669: Mathematics of Program Construction, pages 122\u2013138. Springer-Verlag, 1993. A revised version appears in the Proceedings of the Massey Functional Programming Workshop, 1992.","DOI":"10.1007\/3-540-56625-2_11"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/S0304-3975(96)00114-4","volume":"169","author":"J. Gibbons","year":"1996","unstructured":"Jeremy Gibbons. Computing downwards accumulations on trees quickly. Theoretical Computer Science, 169(1):67\u201380, 1996. Earlier version appeared in Proceedings of the 16th Australian Computer Science Conference, Brisbane, 1993.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1017\/S0956796800001842","volume":"6","author":"J. Gibbons","year":"1996","unstructured":"Jeremy Gibbons. Deriving tidy drawings of trees. Journal of Functional Programming, 6(3):535\u2013562, 1996. Earlier version appears as Technical Report No. 82, Department of Computer Science, University of Auckland.","journal-title":"Journal of Functional Programming"},{"issue":"4","key":"13_CR12","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1017\/S0956796800001908","volume":"6","author":"J. Gibbons","year":"1996","unstructured":"Jeremy Gibbons. The Third Homomorphism Theorem. Journal of Functional Programming, 6(4):657\u2013665, 1996. Earlier version appeared in C.B. Jay, editor, Computing: The Australian Theory Seminar, Sydney, December 1994, p. 62\u201369.","journal-title":"Journal of Functional Programming"},{"key":"13_CR13","unstructured":"Jeremy Gibbons and Geraint Jones. Against the grain: Linear-time breadth-first tree algorithms. Oxford Brookes University and Oxford University Computing Laboratory, 1998."},{"key":"13_CR14","unstructured":"Paul Hoogendijk. A Generic Theory of Datatypes. PhD thesis, TU Eindhoven, 1997."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Johan Jeuring and Patrick Jansson. Polytypic programming. In John Launchbury, Erik Meijer, and Tim Sheard, editors, LNCS 1129: Advanced Functional Programming. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61628-4_3"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0167-6423(90)90023-7","volume":"14","author":"G. Malcolm","year":"1990","unstructured":"Grant Malcolm. Data structures and program transformation. Science of Computer Programming, 14:255\u2013279, 1990.","journal-title":"Science of Computer Programming"},{"key":"13_CR17","series-title":"Technical Report CS-R9005","first-page":"413","volume-title":"Formal Aspects of Computing, 4","author":"L. Meertens","year":"1992","unstructured":"Lambert Meertens. Paramorphisms. Formal Aspects of Computing, 4(5):413\u2013424, 1992. Also available as Technical Report CS-R9005, CWI, Amsterdam."},{"key":"13_CR18","unstructured":"David B. Skillicorn. Structured parallel computation in structured documents. Journal of Universal Computer Science, 3(1), 1997."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P. Wadler","year":"1990","unstructured":"Philip Wadler. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science, 73:231\u2013248, 1990.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1145\/322169.322183","volume":"27","author":"M. Wand","year":"1980","unstructured":"Mitchell Wand. Continuation-based program transformation strategies. Journal of the ACM, 27(1):164\u2013180, January 1980.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:22:33Z","timestamp":1676676153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645917","9783540693451"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0054292","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}