[Haskell-cafe] non-exhaustive pattern match(es)?

Niklas Hambüchen mail at nh2.me
Tue Jun 10 23:27:25 UTC 2014

To propose an actual solution to your problem: You can use the `compare`
function from Data.Ord.

It returns a `data Ordering = LT | EQ | GT`, which you can pattern match
on with a totality check.

More information about the Haskell-Cafe mailing list