ICFP
1997
ACM
13 years 8 months ago
1997
ACM
An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares fo...
ICFP
1997
ACM
13 years 8 months ago
1997
ACM
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...
ICFP
1997
ACM
13 years 8 months ago
1997
ACM
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...
ICFP
1997
ACM
13 years 8 months ago
1997
ACM
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...
ICFP
1997
ACM
13 years 8 months ago
1997
ACM
ICFP
1997
ACM
13 years 8 months ago
1997
ACM
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...
ICFP
1997
ACM
13 years 8 months ago
1997
ACM
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...
ICFP
1997
ACM
13 years 8 months ago
1997
ACM
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 ...