A usage analysis with bounded usage polymorphism and subtyping (Q2763385)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1691460
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A usage analysis with bounded usage polymorphism and subtyping |
scientific article; zbMATH DE number 1691460 |
Statements
15 January 2002
0 references
0.7973148822784424
0 references
0.763681948184967
0 references
0.755088746547699
0 references
0.7232575416564941
0 references
0.7229432463645935
0 references
A usage analysis with bounded usage polymorphism and subtyping (English)
0 references
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 \textit{constraint abstractions}. For the entire collection see [Zbl 0977.68824].
0 references
