Skip to content
Register Sign in Wishlist

Pearls of Functional Algorithm Design


  • Date Published: September 2010
  • availability: Available
  • format: Hardback
  • isbn: 9780521513388

£ 49.99

Add to cart Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • 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.

    • Demonstrates how results in algorithm design can be calculated using well-established mathematical principles, theorems and laws
    • Contains brand new pearls
    • Includes a brief index to guide the reader
    Read more

    Reviews & endorsements

    '… 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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: September 2010
    • format: Hardback
    • isbn: 9780521513388
    • length: 290 pages
    • dimensions: 246 x 175 x 18 mm
    • weight: 0.73kg
    • contains: 20 b/w illus.
    • availability: Available
  • Table of Contents

    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

  • Author

    Richard Bird, University of Oxford
    Richard Bird is Professor of Computer Science at Oxford University Computing Laboratory.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.