The Modula-3 Type System Page 1 The Modula-3 Type System Luca Cardelli* Jim Donahue+
IvIick Jordan+ Bill Kalsow* Greg Nelson* Abstract This paper presents an overview of the …

In most programming languages, a system of types is used to distinguish between different
types of values. Types are checked" in some way, either statically during program …

Program modules are the application of dependent type theory with universes to the large-
scale structuring of programs. As MacQueen [84] observed, the hierarchical structuring of …

The ML programming language restricts type polymorphism to occur only in the\let-in"
construct and requires every occurrence of a formal parameter of a function (a-abstraction) …

In a recent contribution to SIGPLAN Notices [1], Czyzowicz and Iglewski present an effective
and elegant technique for implementing generic types in Modula-2. The present paper …

Standard ML is a modern high-level programming language. This paper presents an
introduction to the language, concentrating on the highlevel features of ML that assist in …

Generic control operators, such as fold,, can be generated from algebraic type definitions.
The class of types to which these techniques are applicable is generalized to all algebraic …

In a language with a polymorphic type system, a term of type Vt. f (t) can be treated (possibly
after suitable instantiation) as having any of the types in the set:{f (t) l tisatype}. It is' natural to …

The current interest in structured programming using disciplined program control statements,
together with the popularity and wide distribution of FORTRAN, has resulted in a number of …

The benefits of strong typing to disciplined programming, to compile-time error detection and
to program verification are well known. Strong typing is especially natural for functional …