Skip to content
Register Sign in Wishlist
Algorithm Design with Haskell

Algorithm Design with Haskell

c.$64.95 ( )

  • Publication planned for: September 2020
  • availability: Not yet published - available from September 2020
  • format: Hardback
  • isbn: 9781108491617

c.$ 64.95 ( )

Pre-order Add to wishlist

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • This book is devoted to five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. These principles are presented using Haskell, a purely functional language, leading to simpler explanations and shorter programs than would be obtained with imperative languages. Carefully selected examples, both new and standard, reveal the commonalities and highlight the differences between algorithms. The algorithm developments use equational reasoning where applicable, clarifying the applicability conditions and correctness arguments. Every chapter concludes with exercises (nearly 300 in total), each with complete answers, allowing the reader to consolidate their understanding and apply the techniques to a range of problems. The book serves students (both undergraduate and postgraduate), researchers, teachers, and professionals who want to know more about what goes into a good algorithm and how such algorithms can be expressed in purely functional terms.

    • Emphasises the deep structure of algorithms, giving both new and standard examples, and illuminates commonalities and differences between apparently unrelated algorithms
    • Contains nearly 300 exercises with complete answers, making the book suitable for use in the classroom or for self-study
    • All the algorithms are implemented in Haskell, making this an ideal follow-on from Bird's Thinking Functionally with Haskell
    Read more

    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

    • Publication planned for: September 2020
    • format: Hardback
    • isbn: 9781108491617
    • dimensions: 247 x 174 mm
    • contains: 28 b/w illus. 290 exercises
    • availability: Not yet published - available from September 2020
  • Table of Contents

    Part I. Basics:
    1. Functional programming
    2. Timing
    3. Useful data structures
    Part II. Divide and conquer:
    4. Binary search
    5. Sorting
    6. Selection
    Part III. Greedy algorithms:
    7. Greedy algorithms on lists
    8. Greedy algorithms on trees
    9. Greedy algorithms on graphs
    Part IV. Thinning algorithms:
    10. Introduction to thinning
    11. Segments and subsequences
    12. Partitions
    Part V. Dynamic programming:
    13. Efficient recursions
    14. Optimum bracketing
    Part VI. Exhaustive search:
    15. Ways of searching
    16. Heuristic search

  • Authors

    Richard S. Bird, University of Oxford
    Richard S. Bird is the author of a number of well-received books on Haskell, including Thinking Functionally with Haskell (Cambridge, 2015) and Pearls of Functional Algorithm Design (Cambridge, 2010). He retired in 2008 and is now an Emeritus Professor at the University of Oxford.

    Jeremy Gibbons, University of Oxford
    Jeremy Gibbons is Professor of Computing at the University of Oxford, where he teaches on the part-time professional Master's programme in software engineering. He is joint Editor-in-Chief of the Journal of Functional Programming, past Chair of IFIP Working Group 2.1 on Algorithmic Languages and Calculi, and past Vice-Chair of ACM SIGPLAN.

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.