menu
{ "item_title" : "Algorithm Design with Haskell", "item_author" : [" Richard Bird", "Jeremy Gibbons "], "item_description" : "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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/1/10/849/161/1108491618_b.jpg", "price_data" : { "retail_price" : "73.00", "online_price" : "73.00", "our_price" : "73.00", "club_price" : "73.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algorithm Design with Haskell|Richard Bird

Algorithm Design with Haskell

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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 item is Non-Returnable

Details

  • ISBN-13: 9781108491617
  • ISBN-10: 1108491618
  • Publisher: Cambridge University Press
  • Publish Date: July 2020
  • Dimensions: 9.8 x 7.6 x 1.1 inches
  • Shipping Weight: 2 pounds
  • Page Count: 450

Related Categories

You May Also Like...

    1

BAM Customer Reviews