000			02878nam a2200229Ia 4500
003			NULRC
005			20250520102711.0
008			250520s9999 xx 000 0 und d
020			_a9780262162098
040			_cNULRC
050			_aQA 76.7 .P54 2002
100			_aPierce, Benjamin C. _eauthor
245		0	_aTypes and programming languages / _cBenjamin C. Pierce
260			_aCambridge, Massachusetts : _bMIT Press, _cc2002
300			_axxi, 623 pages : _billustrations ; _c24 cm.
365			_bUSD126.07
504			_aIncludes bibliographical references and index.
505			_aIntroduction -- Mathematical Preliminaries -- I Untyped Systems -- An ML Implementation of Arithmetic Expressions -- The Untyped Lambda-Calculus -- Nameless Representation of Terms -- An ML Implementation of the Lambda-Calculus -- Types Arithmetic Expressions -- Simply Typed Lambda-Calculus -- An ML Implementation of Simple Types -- Simple Extensions -- Normalization -- References -- Exceptions -- Subtyping -- Metatheory of Subtyping -- An ML Implementation of Subtyping -- Case Study: Imperative Objects -- Case Study: Featherweight Java -- Case Study: Featherweight Java -- Recursive Types -- Metatheory of Recursive Types -- Polymorphism -- Universal Types -- Existential Types -- An ML Implementation of System F -- Bounded Quantification -- Case Study: Imperative Objects, Redux -- Higher-Order Systems -- Type Operators and Kinding -- Higher-Order Polymorphism -- Higher-Order Subtyping -- Case Study: Purely Functional Objects.
520			_aA type system is a syntactic method for automatically checking the absence of certain erroneous behaviors by classifying program phrases according to the kinds of values they compute. The study of type systems--and of programming languages from a type-theoretic perspective -- -has important applications in software engineering, language design, high-performance compilers, and security. This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material. The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages.
650			_aPROGRAMMINGLANGUAGES
942			_2lcc _cBK
999			_c13343 _d13343