DatatypeContexts Deprecated in Latest GHC: Why?

by

It’s deprecated because it was a misfeature, and didn’t actually have any useful functionality! All it did was force a bunch of extra constraints in other locations. In particular, when pattern matching on such a type, you’d be forced to add a constraint, rather than (as one might initially hope) get access to a context, based on the knowledge that one must have been available to construct the value in the first place.

The “replacement”, which actually works the other way and tracks the known contexts for you, is to use GADT-style declarations instead:

data MyType a where
    ConstructorOne :: Ord a => a -> MyType a
    ConstructorTwo :: Ord a => a -> a -> MyType a

GADTs in general are more flexible in many other ways as well, but for this particular case what happens is that creating a value needs the Ord constraint, which is then carried along with the value, and pattern matching on the constructor pulls it back out. So you don’t even need the context on the functions using it, because you know that by virtue of expecting something of type MyType a, you’ll get an Ord a constraint with it.

More Related Contents:

  1. Haskell \p -> not takeWhile
  2. Sum of two numbers with function in haskell
  3. How to group similar items in a list using Haskell?
  4. How do I deal with many levels of indentation?
  5. Memoization in Haskell?
  6. Wrong IO actions order using putStr and getLine
  7. Haskell types frustrating a simple ‘average’ function
  8. Difference between `data` and `newtype` in Haskell
  9. How do functors work in haskell?
  10. What’s the “|” for in a Haskell class definition?
  11. Haskell function composition operator of type (c→d) → (a→b→c) → (a→b→d)
  12. Lifting a higher order function in Haskell
  13. Distinction between typeclasses MonadPlus, Alternative, and Monoid?
  14. Function definition by special cases in GHCi
  15. What constitutes a fold for types other than list?
  16. Defining a new monad in haskell raises no instance for Applicative
  17. Lambda for type expressions in Haskell?
  18. Pattern matching identical values
  19. Composing Monads v. Applicative Functors
  20. Abusing the algebra of algebraic data types – why does this work?
  21. What does the : infix operator do in Haskell?
  22. Why should Applicative be a superclass of Monad?
  23. withFile vs. openFile
  24. Monoidal Functor is Applicative but where is the Monoid typeclass in the definition of Applicative?
  25. How to return a pure value from a impure method
  26. How to convert Unicode Escape Sequence to Unicode String in Haskell
  27. Haskell: Where vs. Let
  28. How does the ST monad work?
  29. An example of a Foldable which is not a Functor (or not Traversable)?
  30. Random number in Haskell [duplicate]

Leave a Comment