A comprehensive introduction to type systems and programming languages. A type system
is a syntactic method for automatically checking the absence of certain erroneous behaviors …

This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and
software design and verification, unexpected mathematical beauty. The lambda calculus …

A thorough and accessible introduction to a range of key ideas in type systems for
programming language. The study of type systems for programming languages now touches …

In order to contribute to the solution of the software reliability problem, tools have been
designed to analyze statically the run-time behavior of programs. Because the correctness …

We present new sound and complete axiomatizations of type equality and subtype
inequality for a first-order type language with regular recursive types. The rules are …

We present a type system combining subty** and ML-style parametric polymorphism.
Unlike previous work, our system supports type inference and has compact principal types …

Objective ML is a small practical extension to ML with objects and top level classes. It is fully
compatible with ML; its type system is based on ML polymorphism, record types with …

Induction is a well-established proof principle that is taught in most undergraduate programs
in mathematics and computer science. In computer science, it is used primarily to reason …

To illuminate the fundamental concepts involved in object-oriented programming languages,
we describe the design of TOOPL, a paradigmatic, statically-typed, functional, object …

Many programming languages need to check whether two recursive types are in a subty**
relation. Traditionally recursive types are modelled in two different ways: equi-or iso …