A general scheme for the automatic inference of variable types

Authors:
Marc A. Kaplan;Jeffrey D. Ullman
Affiliations:
Princeton University;Princeton University
Venue:
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1978

Citing 6
Cited 12

A Fast and Usually Linear Algorithm for Global Flow Analysis

Journal of the ACM (JACM)
A unified approach to global program optimization

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Analysis of a simple algorithm for global data flow problems

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Binding time optimization in programming languages: Some thoughts toward the design of an ideal language

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)

A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)

Compiling APL: the Yorktown APL translator

IBM Journal of Research and Development
ACORN: APL to C on real numbers

APL '90 Conference proceedings on APL 90: for the future
Object-oriented type inference

OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
Analysis of recursive types in Lisp-like languages

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Experience with the SETL Optimizer

ACM Transactions on Programming Languages and Systems (TOPLAS)
Type checking in an imperfect world

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Flow analysis and optimization of LISP-like structures

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An APL compiler for the UNIX timesharing system

APL '83 Proceedings of the international conference on APL
Tentative compilation: A design for an APL compiler

APL '79 Proceedings of the international conference on APL: part 1
Steps toward an APL compiler

APL '79 Proceedings of the international conference on APL: part 1
An algebraic array shape inference system for MATLAB®

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.00

Visualization

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.