Polyvariant Cardinality Analysis for Non-strict Higher-order Functional Languages: Brief Announcement

Abstract

In this brief announcement we outline work we have done on defining a polyvariant cardinality analysis for a non-strict higherorder 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.