TY  - BOOK
AU  - Pierce,Benjamin C.
TI  - Types and programming languages
SN  - 0262162091 (hc. : alk. paper)
AV  - QA76.7 .P54 2002
U1  - 005.13 22
PY  - 2002///
CY  - Cambridge, Mass.
PB  - MIT Press
KW  - Programming languages (Electronic computers)
N1  - Includes bibliographical references (p. [567]-603) and index; 1; Introduction --; 2; Mathematical preliminaries --; [pt]. 1; 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 --; [pt]. 2; 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 -; [pt]. 3; Subtyping --; 15; Subtyping --; 16; Metatheory of subtyping --; 17; An ML implementation of subtyping --; 18; Case study : imperative objects --; 19; Case study : featherweight Java --; [pt]. 4; Recursive types --; 20; Recursive types --; 21; Metatheory of recursive types --; [pt.]. 5; 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 --; [pt]. 6; Higher-order systems --; 29; Type operators and kinding --; 30; Higher-order polymorphism --; 31; Higher-order subtyping
ER  -