A Static Checker for Safe Pattern Matching in Haskell

Neil Mitchell; Colin Runciman; Marko van Eekelen

A Static Checker for Safe Pattern Matching in Haskell

Neil Mitchell, Colin Runciman, Marko van Eekelen

Computer Science

Research output: Contribution to conference › Paper

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.

Original language	Undefined/Unknown
Pages	15-30
Publication status	Published - 2007

Cite this

@conference{e013ca9451304130b2c9ef64c5e2021d,

title = "A Static Checker for Safe Pattern Matching in Haskell",

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.",

author = "Neil Mitchell and Colin Runciman and Eekelen, {Marko van}",

year = "2007",

language = "Undefined/Unknown",

pages = "15--30",

}

TY - CONF

T1 - A Static Checker for Safe Pattern Matching in Haskell

AU - Mitchell, Neil

AU - Runciman, Colin

AU - Eekelen, Marko van

PY - 2007

Y1 - 2007

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

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

M3 - Paper

SP - 15

EP - 30

ER -