Safe Haskell | None |
---|---|
Language | Haskell98 |
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.
- checkExhaustiveModule :: forall m. MonadWriter MultipleErrors m => Environment -> Module -> m ()
Documentation
checkExhaustiveModule :: forall m. MonadWriter MultipleErrors m => Environment -> Module -> m () Source
Exhaustivity checking over a single module