CDN$ 87.99
In Stock.
Ships from and sold by Gift-wrap available.
Pearls of Functional Algo... has been added to your Cart
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 3 images

Pearls of Functional Algorithm Design Hardcover – Aug 3 2015

See all 2 formats and editions Hide other formats and editions
Amazon Price
New from Used from
Kindle Edition
"Please retry"
"Please retry"
CDN$ 87.99
CDN$ 62.90 CDN$ 80.60

Back to University 2016
Save on College Prep Essentials on Shop now
click to open popover

Special Offers and Product Promotions

Frequently Bought Together

  • Pearls of Functional Algorithm Design
  • +
  • Purely Functional Data Structures
Total price: CDN$ 126.13
Buy the selected items together

No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Product Details

  • Hardcover: 290 pages
  • Publisher: Cambridge University Press (Nov. 1 2010)
  • Language: English
  • ISBN-10: 0521513383
  • ISBN-13: 978-0521513388
  • Product Dimensions: 17.4 x 1.7 x 24.7 cm
  • Shipping Weight: 739 g
  • Average Customer Review: Be the first to review this item
  • Amazon Bestsellers Rank: #80,601 in Books (See Top 100 in Books)
  •  Would you like to update product info, give feedback on images, or tell us about a lower price?

  • See Complete Table of Contents

Product Description


"Though the writing is crisp, and the explanations lucid, this is not an easy book to read. The difficulty lies in the density of ideas presented. The rewards of persevering are definitely worth it, though. In fact, once immersed, I started to ponder where this material would lead to: which algorithms could be even further generalized, what would many of these algorithms look like if implemented in Coq or Agda, and so forth. This is the effect that all good books have on me: well-presented and well-motivated material strives to become a stepping stone to further discovery. Any serious computer scientist would benefit from reading and properly understanding this book.
Jacques Carette, Computing Reviews

Book Description

Richard Bird takes a radical approach to algorithm design, namely, design by calculation. This unique collection of 30 programming problems draws from various sources including games and puzzles, sorting, and problems in data compression.

See all Product Description

What Other Items Do Customers Buy After Viewing This Item?

Customer Reviews

There are no customer reviews yet on
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on (beta) 4.3 out of 5 stars 10 reviews
83 of 84 people found the following review helpful
2.0 out of 5 stars A Warning on the Kindle Edition Feb. 1 2013
By Amazon Customer - Published on
Format: Kindle Edition Verified Purchase
While this appears to be an excellent text, the author uses a number of mathematical symbols which are not rendered correctly in the Kindle edition. They are sometimes rendered with a question mark or a rectangular box. This can make the derivations difficult to follow. Since this book is also somewhat expensive for a Kindle edition, if you can afford it, you should probably go for the paper version (assuming the paper version is typeset correctly).
31 of 33 people found the following review helpful
5.0 out of 5 stars A book for someone who wants to think Nov. 25 2010
By John Wagner - Published on
Format: Hardcover Verified Purchase
Bird has written a fine book, the functional analogue to Bentley's fine pieces. If there is one thing that's common to the functional attitude in program design, it's an emphasis on proof and logical consistency. Bird goes into detail and carefully shows why algorithms perform, and what their costs must be in terms of time and space complexity.
One quibble: the reader, to follow the arguments, will want to write the short code selections for himself, to check Bird's arguments; he'll find himself having to define a number of Unicode mathematical operators, like
U-2209, for example. But this isn't hard to do, in Haskell.
Each chapter is well-written, to the point, and closely argued. In showing the beauty of Haskell in a clear way, or showing the beauty of concrete maths in a clear way, Bird has done well.
12 of 12 people found the following review helpful
5.0 out of 5 stars Good learning but I would have liked more themes to hold it together Aug. 19 2012
By Litsios James - Published on
Format: Hardcover
Each chapter presents a problem, a simple approach to a solution, and then shows how that simple approach can be brought all the way to implementation, using a functional programming style. There are a few things happening in this book. The author's goal to teach you to believe in the morphing properties of functional programming. In effect, he is saying: do not optimize early, express and implement your algorithm sequentially, and you will see that the implementation can be changed (refactored) to meet performance and memory usage needs. To support this mission the book presents and implements a hodgepodge of algorithms, I say hodgepodge because they do not share a common theme. Finally, the book stays within a "first order of complexity" domain: the algorithms stay focused on the problem they are solving, there are no "higher order abstractions" (e.g. monads, arrows).

The lack of algorithmic or higher order theme of this book did bug me. And I would have been tempted to count this against it. Yet not long after having read much of this book, I was working with a list that I knew would no scale, hesitating to refactor it, I was happy leave it unchanged, feeling confident that I would be able to deal with it later. Part of that confidence was supported by the knowledge that that type of transformation is what this book does successfully, chapter after chapter.
9 of 10 people found the following review helpful
5.0 out of 5 stars Required reading for any computing scientist Oct. 16 2011
By Dr. Bruce Watson - Published on
Format: Hardcover Verified Purchase
I love this book. Just like Jon Bentley's Pearls books, this rather thin book is quite literally a pearl of programming wisdom. Although it's angled to the functional paradigm (Haskell, which is a pleasure as well), it makes for provocative reading given that other languages like C++ and various scripting languages are increasingly including functional programming facilities. This belongs on every computer scientist's (and software engineer's) bookshelf.
3 of 3 people found the following review helpful
5.0 out of 5 stars Was worth calling it the "Pearls" May 24 2015
By Rakesh - Published on
Format: Hardcover Verified Purchase
I was one of those people who had learned the fundamentals of algorithms from the Programming Pearls (2nd edition) by Bentley. I have to say that since that text, many has written books about programming and algorithms in general and not one had the stuff to call it "pearl". I think this one came close to achieving the similar goal as the original one, but in the domain of functional programming. For those of you who have not read the original pearls, these books are almost like a collection of publication papers, but very well explained and throughly put into a programming environment. Another most important feature of this book (and the original pearls) is that each chapter is about a single problem that has a unique characteristic in algorithms. While most other algorithms books are organized by data structure types, these ones are focused in the category of problems. I have to say that this is the most intuitive form for people interested in algorithms.

Haskell is a perfect choice of language. However, I don't think this book is just for Haskell programmers. Some of most intriguing problems are covered in very good structure. My favorites are the coverage of saddleback search, last tail, raking suffixes and nexuses. All others topics are really well done, but these were the topics that I had hard time googling for a good explanation. Great work.