{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:52:04Z","timestamp":1770281524516,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540601173","type":"print"},{"value":"9783540494454","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-60117-1_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:43:43Z","timestamp":1330278223000},"page":"282-303","source":"Crossref","is-referenced-by-count":7,"title":["An initial-algebra approach to directed acyclic graphs"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Gibbons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"16_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":"16_CR2","unstructured":"Roland Backhouse, Peter de Bruin, Grant Malcolm, Ed Voermans, and Jaap van der Woude. Relational catamorphisms. In M\u00f6ller [23], pages 287\u2013318."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"R. S. Bird, C. C. Morgan, and J. C. P. Woodcock, editors. LNCS 669: Mathematics of Program Construction. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56625-2"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00264249","volume":"21","author":"R. S. Bird","year":"1984","unstructured":"Richard S. Bird. Using circular programs to eliminate multiple traversals of data. Acta Informatica, 21:239\u2013250, 1984.","journal-title":"Acta Informatica"},{"key":"16_CR5","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.","DOI":"10.1007\/978-3-642-87374-4_1"},{"key":"16_CR6","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":"16_CR7","doi-asserted-by":"crossref","unstructured":"Alex Bunkenburg. The Boom hierarchy. In Kevin Hammond and John T. O'Donnell, editors, 1993 Glasgow Workshop on Functional Programming. Springer, 1993.","DOI":"10.1007\/978-1-4471-3236-3_1"},{"issue":"11","key":"16_CR8","first-page":"1167","volume":"20","author":"F. W. Burton","year":"1990","unstructured":"F. Warren Burton and Hsi-Kai Yang. Manipulating multilinked data structures in a pure functional language. Software\u2014Practice and Experience, 20(11):1167\u20131185, November 1990.","journal-title":"Software\u2014Practice and Experience"},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1990-13204","volume":"XIII","author":"V. E. C\u0103z\u0103nescu","year":"1990","unstructured":"Virgil Emil C\u0103z\u0103nescu and Gheorghe \u015etef\u0103nescu. Towards a new algebraic foundation of flowchart scheme theory. Fundamenta Informaticae, XIII:171\u2013210, 1990.","journal-title":"Fundamenta Informaticae"},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0012-365X(91)90147-T","volume":"90","author":"V. C\u0103z\u0103nescu","year":"1991","unstructured":"Virgil-Emil C\u0103z\u0103nescu and Gheorghe \u015etef\u0103nescu. Classes of finite relations as initial abstract data types I. Discrete Mathematics, 90:233\u2013265, 1991.","journal-title":"Discrete Mathematics"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Bruno Courcelle. Graph rewriting: An algebraic and logic approach. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 5. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"key":"16_CR12","unstructured":"Jeremy Gibbons. Algebras for Tree Algorithms. D. Phil. thesis, Programming Research Group, Oxford University, 1991. Available as Technical Monograph PRG-94."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Jeremy Gibbons. Upwards and downwards accumulations on trees. In Bird et al. [3], pages 122\u2013138. A revised version appears in the Proceedings of the Massey Functional Programming Workshop, 1992.","DOI":"10.1007\/3-540-56625-2_11"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Paul Hoogendijk. Relational programming laws in the Boom hierarchy of types. In Bird et al. [3], pages 163\u2013190.","DOI":"10.1007\/3-540-56625-2_13"},{"key":"16_CR15","volume-title":"Deriving algorithms on binary labelled trees","author":"J. Jeuring","year":"1989","unstructured":"Johan Jeuring. Deriving algorithms on binary labelled trees. CWI, Amsterdam, July 1989."},{"key":"16_CR16","unstructured":"Johan Jeuring. The derivation of hierarchies of algorithms on matrices. In M\u00f6ller [23], pages 9\u201332."},{"key":"16_CR17","unstructured":"Yugo Kashiwagi and David S. Wise. Graph algorithms in a lazy functional programming language. Technical Report 330, Department of Computer Science, Indiana University, April 1991."},{"key":"16_CR18","unstructured":"David J. King and John Launchbury. Lazy depth-first search and linear graph algorithms in Haskell. Department of Computer Science, University of Glasgow, 1993."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Saunders Mac Lane. Categories for the Working Mathematician. Springer-Verlag, 1971.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"16_CR20","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":"16_CR21","volume-title":"IFIP Working Group 2.1 working paper 592 ROM-25","author":"L. Meertens","year":"1988","unstructured":"Lambert Meertens. First steps towards the theory of rose trees. CWI, Amsterdam; IFIP Working Group 2.1 working paper 592 ROM-25, 1988."},{"key":"16_CR22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.3233\/FI-1988-11202","volume":"XI","author":"P. Molitor","year":"1988","unstructured":"Paul Molitor. Free net algebras in VLSI-theory. Fundamenta Informaticae, XI:117\u2013142, 1988.","journal-title":"Fundamenta Informaticae"},{"key":"16_CR23","unstructured":"B. M\u00f6ller, editor. IFIP TC2\/WG2.1 Working Conference on Constructing Programs from Specifications. North-Holland, 1991."},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Bernard M\u00f6ller. Derivation of graph and pointer algorithms. In Bernhard M\u00f6ller, Helmut Partsch, and Steve Schumann, editors, LNCS 755: IFIP TC2\/WG2.1 State-of-the-Art Report on Formal Program Development, pages 123\u2013160. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57499-9_19"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Bernhard M\u00f6ller. Algebraic calculation of graph and sorting algorithms. In Dines Bj\u00f8rner, Manfred Broy, and Igor V. Pottosin, editors, LNCS 735: Formal Methods in Programming and Their Applications, pages 394\u2013413. Springer-Verlag, 1993.","DOI":"10.1007\/BFb0039722"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Bernhard M\u00f6ller and Martin Russling. Shorter paths to graph algorithms. In Bird et al. [3], pages 250\u2013268.","DOI":"10.1007\/3-540-56625-2_17"},{"key":"16_CR27","unstructured":"Bob Paige. Comment at IFIP Working Group 2.1 meeting, Renkum, January 1994."},{"key":"16_CR28","unstructured":"Ross Paterson. Interpretations of term graphs. Draft. Department of Computing, Imperial College, 1994."},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"David B. Skillicorn. Foundations of Parallel Programming. Cambridge University Press, 1994.","DOI":"10.1017\/CBO9780511526626"},{"key":"16_CR30","unstructured":"Chris J. Wright. A theory of arrays for program derivation. Transferral dissertation, Programming Research Group, Oxford University, 1988."}],"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-60117-1_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:25:22Z","timestamp":1640942722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60117-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540601173","9783540494454"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-60117-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}