|
ABSTRACT
We present the best known algorithm for the determination of run-time types in a programming language requiring no type declarations. We demonstrate that it is superior to other published algorithms and that it is the best possible algorithm from among all those that use the same set of primitive operators.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
{B} Bauer, A. M. and H. J. Saal, 'Does APL really need run-time checking?', Software - Practice and Experience, Vol. 4, 1974, pp. 129-138
|
| |
3
|
{D} Donnellan, T., Lattice Theory, Pergamon Press
|
 |
4
|
|
 |
5
|
|
 |
6
|
|
| |
7
|
{Ka} Kam, J. B. and J. D. Ullman, "Monotone Data Flow Analysis Frameworks", Acta Informatica, Vol. 7, January 1977, pp. 305-317
|
 |
8
|
|
| |
9
|
{M} Muchnick, S. S., Private communication. August 1977
|
| |
10
|
|
| |
11
|
{S} Scott, D., Data Types as Lattices, Unpublished lecture notes, Mathematical Centre, Amsterdam, June 1972, see also a paper of the same name in SIAM Journal of Computing, Vol. 5, No. 3, September 1976, pp. 522-587
|
| |
12
|
Tenenbaum, A., Type Determination for Very High Level Languages, Report NSO-3, Courant Institute of Mathematical Sciences, New York University. 1974
|
|