Analysis of recursive types in Lisp-like languages
- 1 January 1992
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. V (1) , 216-225
- https://doi.org/10.1145/141471.141544
Abstract
We introduce a new algorithm to analyze recursive, structured types. It derives information from object uses (accesser functions with type checking), as well as from object allocation. The type description is a form of graph grammar and is naturally finite even in the presence of loops. The intended use of the algorithm is to discover and remove unnecessary type checks, but it can be augmented to provide alias information as well.Keywords
This publication has 13 references indexed in Scilit:
- A theory of type polymorphism in programmingPublished by Elsevier ,2003
- TICL—A type inference system for Common LispSoftware: Practice and Experience, 1990
- Analysis of pointers and structuresPublished by Association for Computing Machinery (ACM) ,1990
- Preliminary report on a practical type inference system for common LispACM SIGPLAN Lisp Pointers, 1987
- Constant propagation with conditional branchesPublished by Association for Computing Machinery (ACM) ,1985
- Declaration-free type checkingPublished by Association for Computing Machinery (ACM) ,1985
- A Scheme for the Automatic Inference of Variable TypesJournal of the ACM, 1980
- Type checking in an imperfect worldPublished by Association for Computing Machinery (ACM) ,1979
- A general scheme for the automatic inference of variable typesPublished by Association for Computing Machinery (ACM) ,1978
- Binding time optimization in programming languagesPublished by Association for Computing Machinery (ACM) ,1976