Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Pearls of Functional Algorithm Design by Richard Bird (2010, Hardcover)
W
warriorssalesgroup (1572)
99.4% positive feedback
Price:
$68.24
Free shipping
Returns:
30 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
- Buy It NowPearls of Functional Algorithm Design
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherCambridge University Press
ISBN-100521513383
ISBN-139780521513388
eBay Product ID (ePID)84602067
Product Key Features
Number of Pages290 Pages
LanguageEnglish
Publication NamePearls of Functional Algorithm Design
Publication Year2010
SubjectProgramming Languages / General, Algebra / General
TypeTextbook
AuthorRichard Bird
Subject AreaMathematics, Computers
FormatHardcover
Dimensions
Item Height0.7 in
Item Weight25.8 Oz
Item Length9.7 in
Item Width6.9 in
Additional Product Features
Intended AudienceScholarly & Professional
LCCN2010-022871
Dewey Edition22
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|9780521513388|, '… 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
IllustratedYes
Dewey Decimal005.1
Table Of ContentPreface; 1. The smallest free number; 2. A surpassing problem; 3. Improving on saddleback search; 4. A selection problem; 5. Sorting pairwise sums; 6. Making a century; 7. Building a tree with minimum height; 8. Unravelling greedy algorithms; 9. Finding celebrities; 10. Removing duplicates; 11. Not the maximum segment sum; 12. Ranking suffixes; 13. The Burrows-Wheeler transform; 14. The last tail; 15. All the common prefixes; 16. The Boyer-Moore algorithm; 17. The Knuth-Morris-Pratt algorithm; 18. Planning solves the rush hour problem; 19. A simple Sudoku solver; 20. The countdown problem; 21. Hylomorphisms and nexuses; 22. Three ways of computing determinants; 23. Inside the convex hull; 24. Rational arithmetic coding; 25. Integer arithmetic coding; 26. The Schorr-Waite algorithm; 27. Orderly insertion; 28. Loopless functional algorithms; 29. The Johnson-Trotter algorithm; 30. Spider spinning for dummies; Index.
SynopsisRichard 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., Richard Bird takes a radical 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., 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.
LC Classification NumberQA76.62 .B57 2010
All listings for this product
Be the first to write a review
