We present a type system for the programming language Erlang. The type system supports subtyping and declarationfree recursive types, using subtyping constraints. Our system is si...
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...
Allyn Dimock, Robert Muller, Franklyn A. Turbak, J...
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
We observe that the principal typing property of a type system is the enabling technology for modularity and separate compilation [10]. We use this technology to formulate a modul...
This paper describes the development of the programming language Erlang during the period 1985-1997. Erlang is a concurrent programming language designed for programming large-sca...
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
The large number of programming languages in the world is a consequence of the broad spectrum of human preferences for different notational styles and semantic models, which depen...
PROPAGATOR is a family of patterns for consistently updating objects in a dependency network. The propagator patterns are found in such diverse applications as MAKE, WWW, spreadsh...