summaryrefslogtreecommitdiff
path: root/compiler/utils/Maybes.hs
diff options
context:
space:
mode:
authorHerbert Valerio Riedel <hvr@gnu.org>2015-12-31 16:42:38 +0100
committerHerbert Valerio Riedel <hvr@gnu.org>2015-12-31 22:38:52 +0100
commit3c8cb7f43c89e9a2b754adc5e639985f0b95b1f1 (patch)
tree7c027a215ed2b15fd66ce99ca533cc9348df745e /compiler/utils/Maybes.hs
parent2f923ce2ab8bad6d01645c735c81bbf1b9ff1e05 (diff)
downloadhaskell-3c8cb7f43c89e9a2b754adc5e639985f0b95b1f1.tar.gz
Remove some redundant definitions/constraints
Starting with GHC 7.10 and base-4.8, `Monad` implies `Applicative`, which allows to simplify some definitions to exploit the superclass relationship. This a first refactoring to that end.
Diffstat (limited to 'compiler/utils/Maybes.hs')
-rw-r--r--compiler/utils/Maybes.hs2
1 files changed, 0 insertions, 2 deletions
diff --git a/compiler/utils/Maybes.hs b/compiler/utils/Maybes.hs
index ac5107029b..83dc9b6864 100644
--- a/compiler/utils/Maybes.hs
+++ b/compiler/utils/Maybes.hs
@@ -17,7 +17,6 @@ module Maybes (
MaybeT(..), liftMaybeT
) where
-import Control.Applicative as A
import Control.Monad
import Control.Monad.Trans.Maybe
import Data.Maybe
@@ -84,7 +83,6 @@ instance Applicative (MaybeErr err) where
(<*>) = ap
instance Monad (MaybeErr err) where
- return = A.pure
Succeeded v >>= k = k v
Failed e >>= _ = Failed e