Why is GHC complaining about non-exhaustive patterns?

by

It’s because the pattern matching is incomplete. There’s no guarantee that one of x==a, x<a, or x>a holds. For instance, if the type is Double and x is NaN then none of them are True.

More Related Contents:

  1. Memory footprint of Haskell data types
  2. When is memoization automatic in GHC Haskell?
  3. Small Haskell program compiled with GHC into huge binary
  4. Wrong IO actions order using putStr and getLine
  5. What is fusion in Haskell?
  6. How to make a CAF not a CAF in Haskell?
  7. What does the `forall` keyword in Haskell/GHC do?
  8. Is there a list of GHC extensions that are considered ‘safe’?
  9. Haskell \p -> not takeWhile
  10. Sum of two numbers with function in haskell
  11. How do I deal with many levels of indentation?
  12. Memoization in Haskell?
  13. Difference between `data` and `newtype` in Haskell
  14. How do functors work in haskell?
  15. double stream feed to prevent unneeded memoization?
  16. Currying subtraction
  17. Haskell: how to evaluate a String like “1+2”
  18. Why does haskell’s bind function take a function from non-monadic to monadic
  19. Difference between Monad and Applicative in Haskell
  20. Why is lazy evaluation useful?
  21. Using Maybe type in Haskell
  22. What is a monad?
  23. Why is there “data” and “newtype” in Haskell? [duplicate]
  24. Abusing the algebra of algebraic data types – why does this work?
  25. What does the : infix operator do in Haskell?
  26. Monoidal Functor is Applicative but where is the Monoid typeclass in the definition of Applicative?
  27. How to return a pure value from a impure method
  28. How to convert Unicode Escape Sequence to Unicode String in Haskell
  29. Functional lenses
  30. How does Haskell printf work?

Leave a Comment