000			02034nam a22003137a 4500
001			sulb-eb0015545
003			BD-SySUS
005			20160405134437.0
008			100506s2010||||enk o ||1 0|eng|d
020			_a9780511763199 (ebook)
020			_z9780521513388 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA76.62 _b.B57 2010
082	0	0	_a006.3/1 _222
100	1		_aBird, Richard, _eauthor.
245	1	0	_aPearls of Functional Algorithm Design / _cRichard Bird.
264		1	_aCambridge : _bCambridge University Press, _c2010.
300			_a1 online resource (290 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 04 Apr 2016).
520			_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.
650		0	_aFunctional programming (Computer science)
650		0	_aComputer algorithms
776	0	8	_iPrint version: _z9780521513388
856	4	0	_uhttp://dx.doi.org/10.1017/CBO9780511763199
942			_2Dewey Decimal Classification _ceBooks
999			_c37389 _d37389