+612 9045 4394
 
CHECKOUT
Pearls of Functional Algorithm Design - Richard Bird

Pearls of Functional Algorithm Design

Hardcover

Published: 16th September 2010
Ships: 15 business days
15 business days
RRP $147.99
$110.25
26%
OFF
or 4 easy payments of $27.56 with Learn more

Richard Bird takes a radically new approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression and string matching. Each pearl starts with the statement of the problem expressed using the functional programming language Haskell, a powerful yet succinct language for capturing algorithmic ideas clearly and simply. The novel aspect of the book is that each solution is calculated from an initial formulation of the problem in Haskell by appealing to the laws of functional programming. Pearls of Functional Algorithm Design will appeal to the aspiring functional programmer, students and teachers interested in the principles of algorithm design, and anyone seeking to master the techniques of reasoning about programs in an equational style.

'... 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.' Computing Reviews
'... an excellent guide into this method of algorithm development.' Journal of Functional Programming
"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

Prefacep. ix
The smallest free numberp. 1
A surpassing problemp. 7
Improving on saddleback searchp. 12
A selection problemp. 21
Sorting pairwise sumsp. 27
Making a centuryp. 33
Building a tree with minimum heightp. 41
Unravelling greedy algorithmsp. 50
Finding celebritiesp. 56
Removing duplicatesp. 64
Not the maximum segment sump. 73
Ranking suffixesp. 79
The Burrows-Wheeler transformp. 91
The last tailp. 102
All the common prefixesp. 112
The Boyer-Moore algorithmp. 117
The Knuth-Morris-Pratt algorithmp. 127
Planning solves the Rush Hour problemp. 136
A simple Sudoku solverp. 147
The Countdown problemp. 156
Hylomorphisms and nexusesp. 168
Three ways of computing determinantsp. 180
Inside the convex hullp. 188
Rational arithmetic codingp. 198
Integer arithmetic codingp. 208
The Schorr-Waite algorithmp. 221
Orderly insertionp. 231
Loopless functional algorithmsp. 242
The Johnson-Trotter algorithmp. 251
Spider spinning for dummiesp. 258
Indexp. 275
Table of Contents provided by Ingram. All Rights Reserved.

ISBN: 9780521513388
ISBN-10: 0521513383
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 290
Published: 16th September 2010
Publisher: Cambridge University Press
Country of Publication: GB
Dimensions (cm): 24.6 x 17.5  x 1.8
Weight (kg): 0.73