02082nam a22003258a 4500001001600000003000700016005001700023006001900040007001500059008004100074020002600115020002900141040002400170050002400194082001600218100002800234245008100262264005200343300005900395336002600454337002600480338003600506500007300542520094600615650004601561650002401607776003501631856007101666999001901737CR9780511763199UkCbUP20180107143411.0m|||||o||d||||||||cr||||||||||||100506s2010||||enk     s     ||1 0|eng|d  a9780511763199 (ebook)  z9780521513388 (hardback)  aUkCbUPcUkCbUPerda00aQA76.62 b.B57 201000a006.3/12221 aBird, Richard,eauthor.10aPearls of Functional Algorithm Design / [electronic resource]cRichard Bird. 1aCambridge :bCambridge University Press,c2010.  a1 online resource (290 pages) :bdigital, PDF file(s).  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  aTitle from publisher's bibliographic system (viewed on 09 Oct 2015).  aRichard 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. 0aFunctional programming (Computer science) 0aComputer algorithms08iPrint version: z978052151338840uhttp://dx.doi.org/10.1017/CBO9780511763199zCambridge Books Online  c236441d236441