000			02981nam a22004098i 4500
001			CR9781139032636
003			UkCbUP
005			20200124160232.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			110225s2013||||enk o ||1 0|eng|d
020			_a9781139032636 (ebook)
020			_z9780521766142 (hardback)
020			_z9781107471313 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aQA9.5 _b.B365 2013
082	0	4	_a511.35 _223
100	1		_aBarendregt, H. P. _q(Hendrik Pieter), _eauthor.
245	1	0	_aLambda calculus with types / _cHenk Barendregt, Wil Dekkers, Richard Statman ; with contributions from Fabio Alessi [and others].
264		1	_aCambridge : _bCambridge University Press, _c2013.
300			_a1 online resource (xxii, 833 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aPerspectives in logic
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505	0		_aIntroduction -- Part 1. Simple types. The simply typed lambda calculus -- Properties -- Tools -- Definability, unification and matching -- Extensions -- Applications -- Part II. Recursive types. The systems -- Properties of recursive types -- Properties of terms with types -- Models -- Applications -- Part III. Intersection types. An example system -- Type assignment systems -- Basic properties of intersection type assignment -- Type and lambda structures -- Filter models -- Advanced properties and applications.
520			_aThis handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types.
650		0	_aLambda calculus.
700	1		_aDekkers, Wil, _eauthor.
700	1		_aStatman, Richard, _eauthor.
700	1		_aAlessi, Fabio, _eauthor.
710	2		_aAssociation for Symbolic Logic, _eissuing body.
776	0	8	_iPrint version: _z9780521766142
830		0	_aPerspectives in logic.
856	4	0	_uhttps://doi.org/10.1017/CBO9781139032636
999			_c517715 _d517713