{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:43Z","timestamp":1725664303196},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601173"},{"type":"electronic","value":"9783540494454"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60117-1_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:43:53Z","timestamp":1330278233000},"page":"2-17","source":"Crossref","is-referenced-by-count":4,"title":["Functional Algorithm Design"],"prefix":"10.1007","author":[{"given":"Richard S.","family":"Bird","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"2_CR1","unstructured":"R.C. Backhouse, P.J de Bruin, G. Malcolm, E. Voermans, and J.C.S.P. van der Woude. Relational Catamorphisms. In B. M\u00f6ller, editor Proceedings of the IFIP TC2\/WG2.1 Working Conference on Constructing Programs from Specifications, 287\u2013318, 1991."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0167-6423(89)90036-1","volume":"12","author":"R.S. Bird","year":"1989","unstructured":"R.S. Bird, J. Gibbons, G. Jones. Formal derivation of a pattern matching algorithm. Science of Computer Programming, 12, 93\u2013104, 1989.","journal-title":"Science of Computer Programming"},{"key":"2_CR3","unstructured":"Richard Bird and Philip Wadler. Introduction to Functional Programming Prentice Hall International, 1988."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Richard Bird and Oege de Moor. The Algebra of Programming. To be published by Prentice Hall International, 1996.","DOI":"10.1007\/978-3-642-61455-2_12"},{"key":"2_CR5","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, Mass. USA, 1990."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00264597","volume":"11","author":"J. Darlington","year":"1978","unstructured":"John Darlington. A synthesis of several sorting algorithms. Acta Informatica 11, 1\u201330, 1978.","journal-title":"Acta Informatica"},{"key":"2_CR7","unstructured":"P.J. Freyd and A. \u0160\u010dedrov. Categories, Allegories, volume 39 of Mathematical Library. North-Holland, 1990."},{"key":"2_CR8","first-page":"373","volume-title":"Partial relations for program development","author":"A.M. Haeberer","year":"1991","unstructured":"A.M. Haeberer and P.A.S. Veloso. Partial relations for program development. in B. M\u00f6ller (ed.) Constructing Programs from Specifications. Proc. IFIP TC2\/WG2.1 Conference, Pacific Grove, CA, USA (1991), North-Holland, Amsterdam (1991), 373\u2013397."},{"key":"2_CR9","unstructured":"Paul Hoogendijk and Oege de Moor. Membership of datatypes. Unpublished Draft, 1993."},{"key":"2_CR10","unstructured":"Rob Hoogerwoord. The design of functional programs: a calculational approach. Ph.D thesis, University of Eindhoven 1989."},{"key":"2_CR11","unstructured":"Geraint Jones and Mary Sheeran. Circuit design in Ruby, in J\u00f8rgen Staunstrup (ed.), Formal methods for VLSI design, North-Holland, 1990. pp. 13\u201370."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"David King and John Launchbury. Structuring Depth-First Search Algorithms in Haskell. Proc. ACM Principles of Programming Languages, San Francisco, 1995.","DOI":"10.1145\/199448.199530"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"John Launchbury and Simon Peyton Jones. State in Haskell. University of Glasgow, preprint, 1995.","DOI":"10.1007\/BF01018827"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Grant Malcolm. Homomorphisms and promotability. In J. Snepscheut, editor 1989 Groningen Mathematics of Program Construction Conference. Springer-Verlag LNCS 375, 335\u2013347, 1989.","DOI":"10.1007\/3-540-51305-1_20"},{"key":"2_CR15","volume-title":"Ph.D thesis","author":"G. Malcolm","year":"1990","unstructured":"Grant Malcolm. Algebraic Types and Program Transformation. Ph.D thesis, University of Groningen, The Netherlands, 1990."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Erik Meijer, Maarten Fokkinga, and Ross Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. in John Hughes, (ed.) Proceedings of the 1991 ACM Conference on Functional Programming and Computer Architecture. Springer-Verlag LNCS 523, 1991.","DOI":"10.1007\/3540543961_7"},{"key":"2_CR17","first-page":"373","volume-title":"Relations as a program development language","author":"B. M\u00f6ller","year":"1991","unstructured":"B. M\u00f6ller. Relations as a program development language. in B. M\u00f6ller (ed.) Constructing Programs from Specifications. Proc. IFIP TC2\/WG2.1 Conference, Pacific Grove, CA, USA (1991), North-Holland, Amsterdam (1991), 373\u2013397."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"B. M\u00f6ller. Algebraic calculation of graph and sorting algorithms. In D. Bjorner, M. Broy, I.V. Pottosin (eds) Formal methods in Programming and their Applications. Springer-Verlag LNCS 735, 394\u2013413, 1993.","DOI":"10.1007\/BFb0039722"},{"key":"2_CR19","series-title":"Technical Monograph PRG-98","volume-title":"D.Phil. thesis","author":"O. Moor de","year":"1992","unstructured":"O. de Moor. Categories, relations and dynamic programming. D.Phil. thesis. Technical Monograph PRG-98, Computing Laboratory, Oxford, 1992. Also in Mathematical Structures in Computer Science, vol 4 (1), 1994, 33\u201370."},{"key":"2_CR20","unstructured":"Gunther Schmidt and Thomas Str\u00f6hlein. Relations and Graphs. EATCS Monographs on Theoretical Computer Scince. Springer-Verlag, 1991."},{"issue":"2","key":"2_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. E. Tarjan","year":"1975","unstructured":"Robert E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM. vol 22 (2), 1975, 215\u2013225.","journal-title":"Journal of the ACM"},{"issue":"2","key":"2_CR22","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R. E. Tarjan","year":"1984","unstructured":"Robert E. Tarjan and Jan van Leeuwen. Worst-case analysis of set union algorithms. Journal of the ACM. vol 31 (2), 1984, 245\u2013281.","journal-title":"Journal of the ACM"},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"J.W.J. Williams. Algorithm 232 (heapsort). Communications of the ACM, vol 7, 1964, 347\u2013348.","journal-title":"Communications of the ACM"},{"key":"2_CR24","volume-title":"Ph.D. thesis","author":"P. L. Wadler","year":"1984","unstructured":"Philip L. Wadler Listlessness is better than Laziness. Ph.D. thesis, Carnegie-Mellon University, USA, 1984."}],"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_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:25:31Z","timestamp":1640942731000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60117-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601173","9783540494454"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-60117-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}