Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities between these two forms of usage analysis. We make their connection precise by developing an expressive generic analysis that can be instantiated to both sharing analysis and uniqueness typing. The resulting system, which combines parametric polymorphism with effect subsumption, is specified within the general framework of qualified types, so that readily available tools and techniques can be used for the development of implementations and metatheory.
|Title of host publication||Proceedings of the 12th ACM SIGPLAN international conference on Functional programming|
|Subtitle of host publication||ICFP '07|
|Editors||R. Hinze, N. Ramsey|
|Publisher||Association for Computing Machinery|
|Number of pages||12|
|Publication status||Published - 1 Oct 2007|