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 …

Several recent studies have introduced lightweight versions of Java: reduced languages in
which complex features like threads and reflection are dropped to enable rigorous …

We motivate the design of typed assembly language (TAL) and present a type-preserving
ttranslation from Systemn F to TAL. The typed assembly language we pressent is based on a …

We study two partial type inference methods for a language combining subty** and
impredicative polymorphism. Both methods are local in the sense that missing annotations …

Milner, Parrow, and Walker's π-calculus [MPW92, Mil91] generalizes the channel-based
communication of CCS and its relatives by allowing channels to be passed as data along …

Several recent studies have introduced lightweight versions of Java: reduced languages in
which complex features like threads and reflection are dropped to enable rigorous …

Many important applications must run continuously and without interruption, yet must be
changed to fix bugs or upgrade functionality. No prior general-purpose methodology for …

Recent years have seen the development of several foundational models for statically typed
object-oriented programming. But despite their intuitive similarity, differences in the technical …

F≤ is a typed λ-calculus with subty** and bounded second-order polymorphism. First
proposed by Cardelli and Wegner, it has been widely studied as a core calculus for type …

We investigate proof rules for information hiding, using the recent formalism of separation
logic. In essence, we use the separating conjunction to partition the internal resources of a …