Algorithm Design with Haskell

Richard Bird (University of Oxford), Jeremy Gibbons (University of Oxford)

$101.95

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

Cambridge University Press
09 July 2020

Mathematics & Sciences; Algorithms & data structures; Functional programming; Programming & scripting languages: general; Computer science

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.

By: Richard Bird (University of Oxford), Jeremy Gibbons (University of Oxford)
Imprint: Cambridge University Press
Country of Publication: United Kingdom
Dimensions: Height: 252mm, Width: 178mm, Spine: 29mm
Weight: 930g
ISBN: 9781108491617
ISBN 10: 1108491618
Pages: 450
Publication Date: 09 July 2020
Audience: College/higher education , Professional and scholarly , Primary , Undergraduate
Format: Hardback
Publisher's Status: Active

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; Index.

Richard 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 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.

Reviews for Algorithm Design with Haskell

'I strongly suspect that Richard Bird hides a magically productive book writing apparatus in his office. This time around, Bird pulled the machine's levers together with Jeremy Gibbons and out came Algorithm Design with Haskell, a book that is remarkable in many ways ... the authors recast a number of classical problems in terms of thinning, including ones like knapsack which otherwise have been tackled via dynamic programming for ages. These fresh - very confidently and competently presented- takes on established material are true highlights of the text.' Torsten Grust, Journal of Functional Programming