Pearls of functional algorithm design
Author(s)
Bibliographic Information
Pearls of functional algorithm design
Cambridge University Press, c2010
Available at 14 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes index
Description and Table of Contents
Description
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.
Table of Contents
- Preface
- 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.
by "Nielsen BookData"