000			02226nam a22003738i 4500
001			CR9781139171793
003			UkCbUP
005			20200124160223.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			111013s1984||||enk o ||1 0|eng|d
020			_a9781139171793 (ebook)
020			_z9780521263290 (hardback)
020			_z9780521269346 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA76.73.P2 _bR634 1984
082	0	0	_a001.64/2 _219
100	1		_aRohl, J. S. _q(Jeffrey Soden), _d1938- _eauthor.
245	1	0	_aRecursion via Pascal / _cJ.S. Rohl.
264		1	_aCambridge : _bCambridge University Press, _c1984.
300			_a1 online resource (x, 191 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aCambridge computer science texts ; _v19
500			_aTitle from publisher's bibliographic system (viewed on 01 Feb 2016).
520			_aThis book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples.
650		0	_aPascal (Computer program language)
650		0	_aComputer programming.
650		0	_aRecursion theory.
776	0	8	_iPrint version: _z9780521263290
830		0	_aCambridge computer science texts ; _v19.
856	4	0	_uhttps://doi.org/10.1017/CBO9781139171793
999			_c516964 _d516962