summaryrefslogtreecommitdiff
path: root/compiler/prelude/PrelRules.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/prelude/PrelRules.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/prelude/PrelRules.hs')
-rw-r--r--compiler/prelude/PrelRules.hs1
1 files changed, 0 insertions, 1 deletions
diff --git a/compiler/prelude/PrelRules.hs b/compiler/prelude/PrelRules.hs
index 49cfa982fb..2a174b13fc 100644
--- a/compiler/prelude/PrelRules.hs
+++ b/compiler/prelude/PrelRules.hs
@@ -645,7 +645,6 @@ instance Applicative RuleM where
(<*>) = ap
instance Monad RuleM where
- return = pure
RuleM f >>= g = RuleM $ \dflags iu e -> case f dflags iu e of
Nothing -> Nothing
Just r -> runRuleM (g r) dflags iu e