A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
From polyvariant flow information to intersection and union types
1998
Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98
Many polyvariant program analyses have been studied in the 1990s, including k-CFA, polymorphic splitting, and the cartesian product algorithm. The idea of polyvariance is to analyze functions more than once and thereby obtain better precision for each call site. In this paper we present an equivalence theorem which relates a co-inductivelydefined family of polyvariant flow analyses and a standard type system. The proof embodies a way of understanding polyvariant flow information in terms of
doi:10.1145/268946.268963
dblp:conf/popl/PalsbergP98
fatcat:4drw44vsmjbspjo7uagx4t73ki