Algorithm Design with Haskell
This book by Richard Bird and Jeremy Gibbons, published in June 2020 with Cambridge University Press, is a sequel to RSB's introductory textbook on functional programming Thinking Functionally with Haskell.
Here's the publisher's blurb from the back cover:
This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments. Every chapter concludes with exercises (nearly 300 in total), each with complete answers, allowing the reader to consolidate their understanding and apply the techniques to a range of problems. The book serves students (both undergraduate and postgraduate), researchers, teachers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms.The book can be purchased online.
Materials
- There is a list of errata.
- The CUP webpage for the book has some excerpts, including the frontmatter and index.
- JG presented a seminar about the book in the Chalmers FP series in June 2020.
- Barry Moore is working through the book on his Twitch stream, eventually to appear on YouTube
- There will soon be downloadable code from the book.
If you have any queries about the book, please write to adwh@cs.ox.ac.uk.