LATEST DISCOUNTS & SALES: PROMOTIONS

Close Notification

Your cart does not contain any items

Pearls of Functional Algorithm Design

Richard Bird (University of Oxford)

$109.95

Paperback

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

QTY:

English
Cambridge University Press
16 September 2010
Richard Bird takes a radical 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.

By:  
Imprint:   Cambridge University Press
Country of Publication:   United Kingdom
Dimensions:   Height: 246mm,  Width: 175mm,  Spine: 18mm
Weight:   730g
ISBN:   9780521513388
ISBN 10:   0521513383
Pages:   290
Publication Date:  
Audience:   Professional and scholarly ,  Undergraduate
Format:   Paperback
Publisher's Status:   Active

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

Reviews for Pearls of Functional Algorithm Design

'... 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.' Computing Reviews '... an excellent guide into this method of algorithm development.' Journal of Functional Programming 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


See Also