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 …

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 classical lambda calculus may be regarded both as a programming language and as a
formal algebraic system for reasoning about computation. It provides a computational model …

Graded Type Theory provides a mechanism to track and reason about resource usage in
type systems. In this paper, we develop GraD, a novel version of such a graded dependent …

Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic
running time. Paul, Vishkin and Wagener (PVW) used the approach in a …

We explore how two different mechanisms for reasoning about state, linear ty** and the
type, region and effect discipline, complement one another in the design of a strongly typed …

Two different operational interpretations of intuitionistic linear logic have been proposed in
the literature. The simplest interpretation recomputes non-linear values every time they are …