Types and Programming Languages

Benjamin C. Pierce

624 pages, parution le 30/09/2002

Ajouter à une liste

Expédié sous 24h

Livraison à partir de 0,01€ dès 35€ d'achats
Pour une livraison en France métropolitaine

Retrait à la librairie - Paris 5e

Disponible dès le 11/11

QUANTITÉ

Résumé

A type system is a syntactic method for automatically checking the absence of certain erroneous behaviors b y 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.

Contents

1 Introduction
2 Mathematical Preliminaries

I Untyped Systems

3 Untyped Arithmetic Expressions
4 An ML Implementation of Arithmetic Expressions
5 The Untyped Lambda-Calculus
6 Nameless Representation of Terms
7 An ML Implementation of the Lambda-Calculus

II Simple Types

8 Typed Arithmetic Expressions
9 Simply Typed Lambda-Calculus
10 An ML Implementation of Simple Types
11 Simple Extensions
12 Normalization
13 References
14 Exceptions

III Subtyping

15 Subtyping
16 Metatheory of Subtyping
17 An ML Implementation of Subtyping
18 Case Study: Imperative Objects
19 Case Study: Featherweight Java

IV Recursive Types

20 Recursive Types
21 Metatheory of Recursive Types

V Polymorphism

22 Type Reconstruction
23 Universal Types
24 Existential Types
25 An ML Implementation of System F
26 Bounded Quantification
27 Case Study: Imperative Objects, Redux
28 Metatheory of Bounded Quantification

VI Higher-Order Systems

29 Type Operators and Kinding
30 Higher-Order Polymorphism
31 Higher-Order Subtyping
32 Case Study: Purely Functional Objects

L'auteur - Benjamin C. Pierce

Benjamin-C Pierce is Associate Professor of Computer and Information Science at the University of Pennsylvania.

Caractéristiques techniques

	PAPIER
Éditeur(s)	The MIT Press
Auteur(s)	Benjamin C. Pierce
Parution	30/09/2002
Nb. de pages	624
Format	21 x 23,5
Couverture	Broché
Poids	1550g
Intérieur	Noir et Blanc
EAN13	9780262162098
ISBN13	978-0-262-16209-8