Types And Programming Languages

Content is presented in a pragmatic, implementation-driven manner. Concepts begin with the untyped lambda-calculus and progress to simple type systems, type reconstruction, and polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies model features of object-oriented languages. Each chapter includes exercises and solutions, and a running implementation is available online, enabling readers to experiment as they learn. Clear dependencies between chapters let readers tailor their learning path.

• Core topics covered: untyped lambda-calculus; simple type systems; type reconstruction; universal and existential polymorphism; subtyping; bounded quantification; recursive types; kinds and type operators; extended case studies modeling OO language features.
• Learning outcomes: understand type safety, reason about language design, apply concepts to real languages and compilers, improve debugging and correctness in software engineering.
• Illustration and writing style: rigorous yet accessible explanations, concrete programming examples, progressive exercises, implementation-focused narrative.
• Interactive features: online running implementation, end-of-chapter exercises with solutions, explicit chapter dependencies enabling flexible study paths.

After reading, you gain a solid foundation in type theory and programming languages, with practical skills to design safer software, reason about compiler behavior, and analyze language features. The material fosters curiosity, confidence, and a deeper appreciation for how formal methods translate into real-world programming practice.