Algorithm Design with Haskell

by Richard S. Bird, Jeremy Gibbons

This book is devoted to five main principles of algorithm 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.

Genres: Programming, Technology, Computer Science, Software

450 pages, Hardcover

Published August 13, 2020

About the author

Prof. Richard Simpson Bird is a computer scientist.

There are other authors named Richard Bird:
* Richard Bird — a horticultural expert and gardening author
* Richard Bird — a contemporary author
* Richard Bird — an early 20th-century author

Reviews

[Jonathan Sparling · Rating 5 out of 5]

Note that this is an introduction to algorithm design!

Naively, I hoped the author would shed light on the dark art of Haskell optimization, but no luck: no discussion of unboxing, mutability issues, strictness, profiling, checking core for performance troublespots, etcetc. For any of that, look elsewhere.

But still, 5/5 for first-rate exposition, and fun puzzles in the exercises.