Global tagging optimization by type inference
- 1 January 1992
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. V (1), 205-215
- https://doi.org/10.1145/141471.141542
Abstract
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, espicially on architectures that provide no special hardware support.Keywords
This publication has 28 references indexed in Scilit:
- Automatic autoprojection of higher order recursive equationsScience of Computer Programming, 1991
- Dynamic typing in a statically typed languageACM Transactions on Programming Languages and Systems, 1991
- The semantics of Scheme control-flow analysisPublished by Association for Computing Machinery (ACM) ,1991
- Tag-free garbage collection for strongly typed programming languagesPublished by Association for Computing Machinery (ACM) ,1991
- Efficient type inference for higher-order binding-time analysisLecture Notes in Computer Science, 1991
- Type inference for polymorphic referencesInformation and Computation, 1990
- TICL—A type inference system for Common LispSoftware: Practice and Experience, 1990
- Experience with the SETL OptimizerACM Transactions on Programming Languages and Systems, 1983
- An Automatic Technique for Selection of Data Representations in SETL ProgramsACM Transactions on Programming Languages and Systems, 1981
- A Scheme for the Automatic Inference of Variable TypesJournal of the ACM, 1980