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

Hidde Verstoep, J. Hage

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)


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 languageEnglish
Title of host publicationProceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation
Subtitle of host publicationPEPM '15
PublisherAssociation for Computing Machinery
Number of pages4
ISBN (Print)9781450332972
Publication statusPublished - 13 Jan 2015


  • type-based program analysis
  • cardinality analysis
  • uniqueness typing
  • polyvariance
  • absence analysis
  • sharing analysis
  • usage analysis


Dive into the research topics of 'Polyvariant Cardinality Analysis for Non-strict Higher-order Functional Languages: Brief Announcement'. Together they form a unique fingerprint.

Cite this