LEADER 03715nam 22007092 450 001 9910789313503321 005 20151005020622.0 010 $a1-139-89197-9 010 $a1-107-27172-X 010 $a1-107-27381-1 010 $a1-107-27504-0 010 $a1-107-27707-8 010 $a1-139-03263-1 010 $a1-107-27830-9 010 $a1-299-77274-9 010 $a1-107-47131-1 035 $a(CKB)3460000000128951 035 $a(EBL)1303578 035 $a(OCoLC)854975198 035 $a(SSID)ssj0001036417 035 $a(PQKBManifestationID)11584644 035 $a(PQKBTitleCode)TC0001036417 035 $a(PQKBWorkID)11041985 035 $a(PQKB)10929556 035 $a(UkCbUP)CR9781139032636 035 $a(Au-PeEL)EBL1303578 035 $a(CaPaEBR)ebr10740536 035 $a(CaONFJC)MIL508525 035 $a(MiAaPQ)EBC1303578 035 $a(PPN)261344889 035 $a(EXLCZ)993460000000128951 100 $a20110225d2013|||| uy| 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aLambda calculus with types /$fHenk Barendregt, Wil Dekkers, Richard Statman ; with contributions from Fabio Alessi [and others]$b[electronic resource] 210 1$aCambridge :$cCambridge University Press,$d2013. 215 $a1 online resource (xxii, 833 pages) $cdigital, PDF file(s) 225 1 $aPerspectives in logic 300 $aTitle from publisher's bibliographic system (viewed on 05 Oct 2015). 311 $a0-521-76614-1 311 $a1-107-27224-6 320 $aIncludes bibliographical references and indexes. 327 $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. 330 $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. 410 0$aPerspectives in logic. 606 $aLambda calculus 615 0$aLambda calculus. 676 $a511.35 700 $aBarendregt$b H. P$g(Hendrik Pieter),$044637 702 $aDekkers$b Wil 702 $aStatman$b Richard 702 $aAlessi$b Fabio 712 02$aAssociation for Symbolic Logic, 801 0$bUkCbUP 801 1$bUkCbUP 906 $aBOOK 912 $a9910789313503321 996 $aLambda calculus with types$93747641 997 $aUNINA