Defining a new monad in haskell raises no instance for Applicative

by

This is the Applicative Monad Proposal (AMP). Now whenever you declare something as Monad, you also have to declare it as Applicative (and therefore Functor). Mathematically speaking, every monad is an applicative functor, so this makes sense.

You can do the following to remove the error:

instance Functor Wrap where
  fmap f (Wrap x) = Wrap (f x)

instance Applicative Wrap where
  pure = Wrap
  Wrap f <*> Wrap x = Wrap (f x)

https://wiki.haskell.org/Functor-Applicative-Monad_Proposal

Edit: Maybe I should point out more clearly that this is a recent thing? The code you posted used to work before, but with recent versions of GHC you’ll get an error. It’s a breaking change.

Edit: The following declarations should work for any monad:

import Control.Applicative -- Otherwise you can't do the Applicative instance.
import Control.Monad (liftM, ap)

instance Functor ??? where
  fmap = liftM

instance Applicative ??? where
  pure  = return
  (<*>) = ap

Depending on the monad in question, there may be more efficient implementations possible, but this is a simple starting point.

More Related Contents:

  1. What is a monad?
  2. Good examples of Not a Functor/Functor/Applicative/Monad?
  3. Applicatives compose, monads don’t
  4. Monads with Join() instead of Bind()
  5. Operating on a return from a Maybe that contains “Just”
  6. A Haskell function of type: IO String-> String
  7. IO happens out of order when using getLine and putStr
  8. What is indexed monad?
  9. Is Haskell truly pure (is any language that deals with input and output outside the system)?
  10. Should do-notation be avoided in Haskell?
  11. Euler 43 – is there a monad to help write this list comprehension?
  12. Why does haskell’s bind function take a function from non-monadic to monadic
  13. Expressing do block using only monadic bind syntax
  14. Why do we need monads?
  15. Difference between Monad and Applicative in Haskell
  16. What is a monad?
  17. Is there a way to place some impure code inside pure functions?
  18. Concrete example showing that monads are not closed under composition (with proof)?
  19. How to use (->) instances of Monad and confusion about (->)
  20. Why are side-effects modeled as monads in Haskell?
  21. Converting IO Int to Int
  22. How to interpret bind/>>= of the function instance?
  23. Why should Applicative be a superclass of Monad?
  24. How to enumerate a recursive datatype in Haskell?
  25. Haskell – depth for each node in binary tree using Reader monad
  26. How to return a pure value from a impure method
  27. How does the ST monad work?
  28. In what sense is the IO Monad pure?
  29. How Monads are considered pure?
  30. Is Haskell’s mapM not lazy?

Leave a Comment