Your cart is empty.
  • Home

    Types and programming languages / Benjamin C. Pierce.

    By: Pierce, Benjamin CMaterial type: TextTextPublisher: Cambridge, Mass. : MIT Press, 2002Description: xxi, 623 p. : ill. ; 24 cmISBN: 0262162091 (hc. : alk. paper); 9780262162098 (hc. : alk. paper)Subject(s): Programming languages (Electronic computers)DDC classification: 005.13 LOC classification: QA76.7 | .P54 2002
    Contents:
    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.
    Tags from this library: No tags from this library for this title. Log in to add tags.
        Average rating: 0.0 (0 votes)
    Item type Current library Call number Copy number Status Notes Date due Barcode
    Books Books Female Library
    		QA76.7 .P54 2002 (Browse shelf (Opens below)) 1 Available STACKS 51952000076674
    Books Books Main Library
    		QA76.7 .P54 2002 (Browse shelf (Opens below)) 1 Available STACKS 51952000054344

    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.

    1 2

    There are no comments on this title.

    to post a comment.