Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Module for exhaustivity checking over pattern matching definitions The algorithm analyses the clauses of a definition one by one from top to bottom, where in each step it has the cases already missing (uncovered), and it generates the new set of missing cases.
Synopsis
- checkExhaustiveExpr :: forall m. MonadWriter MultipleErrors m => SourceSpan -> Environment -> ModuleName -> Expr -> m Expr
Documentation
checkExhaustiveExpr :: forall m. MonadWriter MultipleErrors m => SourceSpan -> Environment -> ModuleName -> Expr -> m Expr Source #
Exhaustivity checking