Intensional Datatype Refinement

August 04, 2020 · Entered Twilight · 🏛 Proc. ACM Program. Lang.

"Last commit was 5.0 years ago (≥5 year threshold)"

Evidence collected by the PWNC Scanner

Repo contents: .gitignore, ChangeLog.md, LICENSE, README.md, Setup.hs, benchmark, cabal.project, docs, intensional-datatys.cabal, profile, src, test

Authors Eddie Jones, Steven Ramsay arXiv ID 2008.01452 Category cs.PL: Programming Languages Citations 3 Venue Proc. ACM Program. Lang. Repository https://github.com/bristolpl/intensional-datatys ⭐ 5 Last Checked 2 months ago

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 datatypes 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.