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

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.