000			02926nam a22003738i 4500
001			CR9780511809835
003			UkCbUP
005			20200124160247.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			101021s2008||||enk o ||1 0|eng|d
020			_a9780511809835 (ebook)
020			_z9780521898850 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA9.5 _b.H565 2008
082	0	0	_a511.3/5 _222
100	1		_aHindley, J. Roger, _eauthor.
245	1	0	_aLambda-calculus and combinators, an introduction / _cJ. Roger Hindley, Jonathan P. Seldin.
246	3		_aLambda-Calculus & Combinators
250			_aSecond edition.
264		1	_aCambridge : _bCambridge University Press, _c2008.
300			_a1 online resource (xi, 345 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 05 Oct 2015).
505	0		_aPreface; 1. The lambda-calculus; 2. Combinatory logic; 3. The power of lambda and combinations; 4. Representing the computable functions; 5. Undecidability theorem; 6. Formal theories; 7. Extensionality in lambda-calculus; 8. Extensionality in CL; 9. Correspondence between lambda and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in lambda; 13. Generalizations of typing; 14. Models of CL; 15. Models of lambda-calculus; 16. Scott's D and other models; Appendix A1. Bound variables and alpha-conversion; Appendix A2. Confluence proofs; Appendix A3. Strong normalization proofs; Appendix A4. Care of your pet combinator; Appendix A5. Answers to starred exercises; Bibliography; Index.
520			_aCombinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.
650		0	_aLambda calculus.
650		0	_aCombinatory logic.
700	1		_aSeldin, J. P., _eauthor.
776	0	8	_iPrint version: _z9780521898850
856	4	0	_uhttps://doi.org/10.1017/CBO9780511809835
999			_c519129 _d519127