Pierce, Benjamin C.

Types and programming languages / Benjamin C. Pierce. - Cambridge, Mass. : MIT Press, 2002. - xxi, 623 p. : ill. ; 24 cm.

Includes bibliographical references (p. [567]-603) and index.

Introduction -- Mathematical preliminaries -- Untyped systems -- Untyped arithmetic expressions -- An ML implementation of arithmetic expressions -- The untyped Lambda-calculus -- Nameless representation of terms -- An ML implementation of the Lambda-calculus -- Simple types -- Typed arithmetic expressions -- Simply typed Lambda-calculus -- An ML implementation of simple types -- Simple extensions -- Normalization -- References -- Exceptions - Subtyping -- Subtyping -- Metatheory of subtyping -- An ML implementation of subtyping -- Case study : imperative objects -- Case study : featherweight Java -- Recursive types -- Recursive types -- Metatheory of recursive types -- Polymorphism -- Type reconstruction -- Universal types -- Existential types -- An ML implementation of system F -- Bounded quantification -- Case study : imperative objects, redux -- Metatheory of bounded quantification -- Higher-order systems -- Type operators and kinding -- Higher-order polymorphism -- Higher-order subtyping. 1. 2. [pt]. 1. 3. 4. 5. 6. 7. [pt]. 2. 8. 9. 10. 11. 12. 13. 14. [pt]. 3. 15. 16. 17. 18. 19. [pt]. 4. 20. 21. [pt.]. 5. 22. 23. 24. 25. 26. 27. 28. [pt]. 6. 29. 30. 31.

0262162091 (hc. : alk. paper) 9780262162098 (hc. : alk. paper)

2001044428


Programming languages (Electronic computers)

QA76.7 / .P54 2002

005.13