menu

Types and Programming Languages
by Benjamin C. Pierce




Overview -
A comprehensive introduction to type systems and programming languages.

A 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.

  Read Full Product Description
 
local_shippingFor Delivery
In Stock.
This item is Non-Returnable.
FREE Shipping for Club Members help
 
storeBuy Online Pickup At Store
search store by zipcode

 
 
New & Used Marketplace 15 copies from $49.46
 
Download

Format: EPUB What's this?
This item is available only to U.S. billing addresses.
 
 
 

More About Types and Programming Languages by Benjamin C. Pierce

 
 
 

Overview

A comprehensive introduction to type systems and programming languages.

A 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.



This item is Non-Returnable.

 

Details

  • ISBN-13: 9780262162098
  • ISBN-10: 0262162091
  • Publisher: MIT Press
  • Publish Date: January 2002
  • Page Count: 648
  • Reading Level: Ages 18-UP
  • Dimensions: 9.4 x 8.12 x 1.42 inches
  • Shipping Weight: 2.8 pounds

Series: Mit Press

Related Categories

 

BAM Customer Reviews