Abstract
In this brief announcement we outline work we have done on defining a polyvariant cardinality analysis for a non-strict higher-order language equipped with user defined datatypes and explicit strictness that includes sharing analysis, absence analysis, strictness analysis and uniqueness typing as a special case. It aims to be the basis of an analysis framework in a compiler for a Haskell-like language, that does not have access to an aggressive inliner such as the one present in GHC.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation |
| Subtitle of host publication | PEPM '15 |
| Publisher | Association for Computing Machinery |
| Pages | 139-142 |
| Number of pages | 4 |
| ISBN (Print) | 9781450332972 |
| DOIs | |
| Publication status | Published - 13 Jan 2015 |
Keywords
- type-based program analysis
- cardinality analysis
- uniqueness typing
- polyvariance
- absence analysis
- sharing analysis
- usage analysis