A Usage Analysis with Bounded Usage Polymorphism and Subtyping

Authors:
Jörgen Gustavsson;Josef Svenningsson
Affiliations:
-;-
Venue:
IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Year:
2000

Citing 17
Cited 4

Linear logic

Theoretical Computer Science
TIM: A simple, lazy abstract machine to execute supercombinators

Proc. of a conference on Functional programming languages and computer architecture
A natural semantics for lazy evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The type and effect discipline

Information and Computation
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
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
Type-base flow analysis: from polymorphic subtyping to CFL-reachability

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Avoiding Unnecessary Updates

Proceedings of the 1992 Glasgow Workshop on Functional Programming
The GRIN Project: A Highly Optimising Back End for Lazy Functional Languages

IFL '96 Selected Papers from the 8th International Workshop on Implementation of Functional Languages
Types for 0, 1 or Many Uses

IFL '97 Selected Papers from the 9th International Workshop on Implementation of Functional Languages
Non-determinism Analysis in a Parallel-Functional Language

IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Deriving a lazy abstract machine

Journal of Functional Programming

Non-determinism Analysis in a Parallel-Functional Language

IFL '00 Selected Papers from the 12th International Workshop on Implementation of Functional Languages
Polymorphism, subtyping, whole program analysis and accurate data types in usage analysis

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Shape analysis in a functional language by using regular languages

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Modular, higher-order cardinality analysis in theory and practice

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Usage analysis aims to predict the number of times a heap allocated closure is used. Previously proposed usage analyses have proved not to scale up well to large programs. In this paper we present a powerful and accurate type based analysis designed to scale up for large programs. The key features of the type system are usage subtyping and bounded usage polymorphism. Bounded polymorphism can lead to huge constraint sets so to express constraints compactly we introduce a new expressive form of constraints which allows constraints to be represented compactly through calls to constraint abstractions.