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 …

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

We describe a framework for adding type qualifiers to a language. Type qualifiers encode a
simple but highly useful form of subtyping. Our framework extends standard type rules to …

We present a general framework HM (X) for type systems with constraints. The framework
stays in the tradition of the Hindley/Milner type system. Its type system instances are sound …

Giving types to binary methods causes significant problems for object‐oriented language
designers and programmers. This paper offers a comprehensive description of the problems …

The widespread use of object-oriented languages and Internet security concerns are just the
beginning. Add embedded systems, multiple memory banks, highly pipelined units …

The concept of an object-oriented database programming language (OODBPL) is appealing
because it has the potential of combining the advantages of object orientation and database …

We demonstrate the pragmatic value of the principal typing property, a property distinct from
ML's principal type property, by studying a type system with principal typings. The type …

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 …

A polymorphic, constraint-based type inference algorithm for an object-oriented language is
defined. A generalized form of type, polymorphic recursively constrained types, are inferred …