Rating:
Author: Richard Bird
ISBN : B009019VUK
New from $13.28
Format: PDF
Posts about Download The Book Free Pearls of Functional Algorithm Design [Kindle Edition] from with Mediafire Link Download LinkRichard 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.Direct download links available for Free Pearls of Functional Algorithm Design [Kindle Edition]
- File Size: 2280 KB
- Print Length: 286 pages
- Simultaneous Device Usage: Up to 4 simultaneous devices, per publisher limits
- Publisher: Cambridge University Press (September 16, 2010)
- Sold by: Amazon Digital Services, Inc.
- Language: English
- ASIN: B009019VUK
- Text-to-Speech: Enabled
X-Ray:
- Lending: Not Enabled
- Amazon Best Sellers Rank: #64,233 Paid in Kindle Store (See Top 100 Paid in Kindle Store)
- #61
in Books > Computers & Technology > Programming > Algorithms
- #61
in Books > Computers & Technology > Programming > Algorithms
Free Pearls of Functional Algorithm Design
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).
By James W. Stelly
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.
By John Wagner