Pearls of Functional Algorithm Design

Hardcover (Print)
Buy New
Buy New from BN.com
$62.83
Used and New from Other Sellers
Used and New from Other Sellers
from $56.35
Usually ships in 1-2 business days
(Save 17%)
Other sellers (Hardcover)
  • All (12) from $56.35   
  • New (10) from $56.35   
  • Used (2) from $62.82   

Overview

Richard Bird takes a radically new 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.

Read More Show Less

Editorial Reviews

From the Publisher
"Though the writing is crisp, and the explanations lucid, this is not an easy book to read. The difficulty lies in the density of ideas presented. The rewards of persevering are definitely worth it, though. In fact, once immersed, I started to ponder where this material would lead to: which algorithms could be even further generalized, what would many of these algorithms look like if implemented in Coq or Agda, and so forth. This is the effect that all good books have on me: 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.
Jacques Carette, Computing Reviews
Read More Show Less

Product Details

  • ISBN-13: 9780521513388
  • Publisher: Cambridge University Press
  • Publication date: 11/1/2010
  • Pages: 286
  • Sales rank: 507,408
  • Product dimensions: 6.70 (w) x 9.90 (h) x 0.80 (d)

Meet the Author

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

Read More Show Less

Table of Contents

Preface ix

1 The smallest free number 1

2 A surpassing problem 7

3 Improving on saddleback search 12

4 A selection problem 21

5 Sorting pairwise sums 27

6 Making a century 33

7 Building a tree with minimum height 41

8 Unravelling greedy algorithms 50

9 Finding celebrities 56

10 Removing duplicates 64

11 Not the maximum segment sum 73

12 Ranking suffixes 79

13 The Burrows-Wheeler transform 91

14 The last tail 102

15 All the common prefixes 112

16 The Boyer-Moore algorithm 117

17 The Knuth-Morris-Pratt algorithm 127

18 Planning solves the Rush Hour problem 136

19 A simple Sudoku solver 147

20 The Countdown problem 156

21 Hylomorphisms and nexuses 168

22 Three ways of computing determinants 180

23 Inside the convex hull 188

24 Rational arithmetic coding 198

25 Integer arithmetic coding 208

26 The Schorr-Waite algorithm 221

27 Orderly insertion 231

28 Loopless functional algorithms 242

29 The Johnson-Trotter algorithm 251

30 Spider spinning for dummies 258

Index 275

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)