[Broder02] Andrei Broder. Michael Mitzenmacher. Network applications of Bloom filters: a survey”. Internet Mathematics. 1. 4. 2005. 485-509. A K Peters Ltd..

[Google08] Jeffrey Dean. Sanjay Ghemawat. MapReduce: simplified data processing on large clusters”. Communications of the ACM. 51. 1. January 2008. 107-113. Association for Computing Machinery. 0956-7968.

[Hughes95] John Hughes. The design of a pretty-printing library”. May, 1995. First International Spring School on Advanced Functional Programming Techniques. Bastad, Sweden. .

[Hutton99] Graham Hutton. A tutorial on the universality and expressiveness of fold”. Journal of Functional Programming. 9. 4. July 1999. 355-372. Cambridge University Press. 0956-7968.

[Okasaki99] Copyright © 1999. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press. 0521663504.

[Okasaki96] Copyright © 1996. Chris Okasaki. Purely Functional Data Structures. Carnegie Mellon University. . This is Okasaki's PhD thesis, a less complete precursor to [Okasaki99]..

[Wadler89] Philip Wadler. Theorems for free!”. September, 1989. International Conference on Functional Programming and Computer Architecture. 4. London, England. .

[Wadler98] Philip Wadler. A prettier printer”. March 1998.

Want to stay up to date? Subscribe to the comment feed for this chapter, or the entire book.

Copyright 2007, 2008 Bryan O'Sullivan, Don Stewart, and John Goerzen. This work is licensed under a Creative Commons Attribution-Noncommercial 3.0 License. Icons by Paul Davey aka Mattahan.