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

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. Categories and Subject Descriptors D.3 [Software]: Applicative (functional) languages; F.3.2 [Logics and Meanings of Programs]: Semantics of Programming Languages—Program analysis; D.3.3 [Programming Languages]: Language Constructs and Features— Polymorphism General Terms Languages, Theory, Verification Keywords type-based program analysis, cardinality analysis, uniqueness typing, polyvariance, absence analysis, sharing analysis, usage analysis

• Type: Journal
• Year: 2015
• Where: PEPM
• Authors: Hidde Verstoep, Jurriaan Hage
• Keywords: PEPM 2015, Software Engineering