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 …

The λ-calculus is considered a useful mathematical tool in the study of programming
languages, since programs can be identified with λ-terms. However, if one goes further and …

This text develops a comprehensive theory of programming languages based on type
systems and structural operational semantics. Language concepts are precisely defined by …

First published in 1998, this textbook is a broad but rigourous survey of the theoretical basis
for the design, definition and implementation of programming languages and of systems for …

The FLINT project at Yale aims to build a state-of-the-art systems environment for modern
typesafe languages. One important component of the FLINT system is a high-performance …

Theories of dependent types have been proposed as a foundation of constructive
mathematics and as a framework in which to construct certified programs. In these …

Traditional techniques for implementing polymorphism use a universal representation for
objects of unknown type. Often, this forces a compiler to use universal representations even …

The design of a module system for constructing and maintaining large programs is a difficult
task that raises a number of theoretical and practical issues. A fundamental issue is the …