A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Global tagging optimization by type inference
1992
Proceedings of the 1992 ACM conference on LISP and functional programming - LFP '92
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and structured data, especially in lists: Steenkiste and Hennessy report that 80~o of all dynamic type checking operations are due to list operations, most of which are statically eliminated by our type inference algorithm. The computed information can also be used for nnboxing and closure allocation (reference escape) analysis, although this is not pursued in this paper.
doi:10.1145/141471.141542
dblp:conf/lfp/Henglein92
fatcat:36byej6fwzcytpm7ll6hinpym4