Intensional Refinement Datatypes: With Application to Scalable Verification of Pattern-Match Safety

Research output: Contribution to journalArticle (Academic Journal)peer-review

71 Downloads (Pure)

Abstract

The pattern-match safety problem is to verify that a given functional program will never crash due to non-exhaustive patterns in its function definitions. We present a refinement type system that can be used to solve this problem. The system extends ML-style type systems with algebraic data types by a limited form of structural subtyping and environment-level intersection. We describe a fully automatic, sound and complete type inference procedure for this system which, under reasonable assumptions, is worst-case linear-time in the program size. Compositionality is essential to obtaining this complexity guarantee. A prototype implementation for Haskell is able to analyse a selection of packages from the Hackage database in a few hundred milliseconds.
Original languageEnglish
Article number55
Number of pages29
JournalProceedings of the ACM on Programming Languages
Volume5
Issue numberPOPL
DOIs
Publication statusPublished - 4 Jan 2021

Structured keywords

  • Programming Languages

Fingerprint

Dive into the research topics of 'Intensional Refinement Datatypes: With Application to Scalable Verification of Pattern-Match Safety'. Together they form a unique fingerprint.

Cite this