From
Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
AbeBooks Seller since March 25, 2015
In. Seller Inventory # ria9781108491617_new
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.
About the Authors:
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.
Title: Algorithm Design with Haskell
Publisher: Cambridge University Press
Publication Date: 2020
Binding: Hardcover
Condition: New
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar2317530285630
Seller: Greener Books, London, United Kingdom
Hardcover. Condition: Used; Very Good. **SHIPPED FROM UK** We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence! Greener Books. Seller Inventory # 5030075
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 41142572-n
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9781108491617
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 450 pages. 9.75x6.75x1.25 inches. In Stock. This item is printed on demand. Seller Inventory # __1108491618
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 41142572
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 41142572-n
Quantity: Over 20 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 931. Seller Inventory # C9781108491617
Quantity: Over 20 available
Seller: CitiRetail, Stevenage, United Kingdom
Hardcover. Condition: new. Hardcover. 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. This book presents the five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. It serves students, teachers, researchers, 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9781108491617
Quantity: 1 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book presents the five main principles of algorithm design: divide and conquer, greedy algorithms, thinning, dynamic programming, and exhaustive search. It serves students, teachers, researchers, and professionals who want to know more about what goes . Seller Inventory # 367980933
Quantity: Over 20 available