By the same authors

A Static Checker for Safe Pattern Matching in Haskell

Research output: Contribution to conferencePaper

Author(s)

Department/unit(s)

Publication details

DatePublished - 2007
Original languageUndefined/Unknown

Abstract

A Haskell program may fail at runtime with a pattern-match error if the program has any incomplete (non-exhaustive) patterns in definitions or case alternatives. This paper describes a static checker that allows non-exhaustive patterns to exist, yet ensures that a pattern-match error does not occur. It describes a constraint language that can be used to reason about pattern matches, along with mechanisms to propagate these constraints between program components.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations