A general scheme for the automatic inference of variable types
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Flow Analysis of Computer Programs
Flow Analysis of Computer Programs
Tentative compilation: a design for an apl compiler.
Tentative compilation: a design for an apl compiler.
ACORN: APL to C on real numbers
APL '90 Conference proceedings on APL 90: for the future
Analysis of recursive types in Lisp-like languages
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
APL '85 Proceedings of the international conference on APL: APL and the future
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
APL '79 Proceedings of the international conference on APL: part 1
Preliminary report on a practical type inference system for common Lisp
ACM SIGPLAN Lisp Pointers
| Hi-index | 0.00 |
We present an algorithn for the determination of run-time types which functions in the presence of errors, and show that it provides more information than that obtained using a previously published algorithm.In Section 1 we define the problem and state the requirements for a practically useful type prediction algorithm. In Section 2 we introduce a model programing language and in Section 3 define type inference rules for that language. Section 4 presents a type prediction algorithm and Section 5 describes how to apply the results to solve the problems stated in Section 1. Section 6 presents an example of our procedure and demonstrates how previous work does not satisfy all requirements.