This report details the design and implementation of the ZINC system. This is an
implementation of the ML language, intended to serve as a test eld for various extensions of …

Bounded quantification was introduced by Cardelli and Wegner as a means of ty**
functions that operate uniformly over all subtypes of a given type. They defined a simple …

We show that the type inference problem for a lambda calculus with records, including a
record concatenation operator, is decidable. We show that this calculus does not have …

Strongly typed languages with records may have inclusion rules so that records with more
fields can be used instead of records with less fields. But these rules lead to a global …

We present a method for providing semantic interpretations for languages with a type system
featuring inheritance polymorphism. Our approach is illustrated on an extension of the …

Qualified types can be viewed as a generalization of type classes in the functional language
Haskell and the theorem prover Isabelle. These in turn are extensions of equality types in …

Publisher Summary This chapter presents some basic issues in the type-theoretic study of
programming language concepts. It presents Church's typed lambda calculus as an …

We define a simple collection of operations for creating and manipulating record structures,
where records are intended as finite associations of values to labels. A second-order type …

Subty** appears in a variety of programming languages, in the form of the 'automatic
coercion'of integers to reals, Pascal subranges, and subtypes arising from class hierarchies …

We develop a formal, type-theoretic account of the basic mechanisms of object-oriented
programming: encapsulation, message passing, subty** and inheritance. By modelling …