Types and programming languages

Properties 8Hide

Children

• Chapter 1. Introduction
• Chapter 2. Mathematical preliminaries
• Part I. Untyped systems

Cover Date2002 DescriptionA rigorous and comprehensive treatment of type systems for programming languages. Covers the lambda calculus, subtyping, bounded polymorphism, recursive types, and System F, grounded in formal proof theory. Isbn978-0262162098 JourneyProgramming Language Theory Tags

• type theory
• lambda calculus
• type systems
• programming languages

Urlhttps://www.cis.upenn.edu/~bcpierce/tapl/