Polymorphism, subtyping, whole program analysis and accurate data types in usage analysis

Authors:
Tobias Gedell;Jörgen Gustavsson;Josef Svenningsson
Affiliations:
Department of Computing Science, Chalmers University of Technology and Göteborg University;Spotfire, Inc.;Department of Computing Science, Chalmers University of Technology and Göteborg University
Venue:
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Year:
2006

Citing 18
Cited 1

Implementing Haskell overloading

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Type inference with polymorphic recursion

ACM Transactions on Programming Languages and Systems (TOPLAS)
Once upon a type

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Let-floating: moving bindings to give faster programs

Proceedings of the first ACM SIGPLAN international conference on Functional programming
Points-to analysis in almost linear time

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type based sharing analysis for update avoidance and optimisation

ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Once upon a polymorphic type

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Unification-based pointer analysis with directional assignments

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Scalable context-sensitive flow analysis using instantiation constraints

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Ultra-fast aliasing analysis using CLA: a million lines of C code in a second

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Constraint Abstractions

PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Optimizing Lazy Functional Programs Using Flow Inference

SAS '95 Proceedings of the Second International Symposium on Static Analysis
Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C

SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Estimating the Impact of Scalable Pointer Analysis on Optimization

SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Polymorphic Type Schemes and Recursive Definitions

Proceedings of the 6th Colloquium on International Symposium on Programming
Avoiding Unnecessary Updates

Proceedings of the 1992 Glasgow Workshop on Functional Programming
A Usage Analysis with Bounded Usage Polymorphism and Subtyping

IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages

A generic usage analysis with subeffect qualifiers

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are a number of choices to be made in the design of a type based usage analysis. Some of these are: Should the analysis be monomorphic or have some degree of polymorphism? What about subtyping? How should the analysis deal with user defined algebraic data types? Should it be a whole program analysis? Several researchers have speculated that these features are important but there has been a lack of empirical evidence. In this paper we present a systematic evaluation of each of these features in the context of a full scale implementation of a usage analysis for Haskell. Our measurements show that all features increase the precision. It is, however, not necessary to have them all to obtain an acceptable precision.