diff options
author | Herbert Valerio Riedel <hvr@gnu.org> | 2015-12-31 16:42:38 +0100 |
---|---|---|
committer | Herbert Valerio Riedel <hvr@gnu.org> | 2015-12-31 22:38:52 +0100 |
commit | 3c8cb7f43c89e9a2b754adc5e639985f0b95b1f1 (patch) | |
tree | 7c027a215ed2b15fd66ce99ca533cc9348df745e /compiler/utils/State.hs | |
parent | 2f923ce2ab8bad6d01645c735c81bbf1b9ff1e05 (diff) | |
download | haskell-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/State.hs')
-rw-r--r-- | compiler/utils/State.hs | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/compiler/utils/State.hs b/compiler/utils/State.hs index fb6f2c3554..8eca4657df 100644 --- a/compiler/utils/State.hs +++ b/compiler/utils/State.hs @@ -15,7 +15,6 @@ instance Applicative (State s) where (# x, s'' #) -> (# f x, s'' #) instance Monad (State s) where - return = pure m >>= n = State $ \s -> case runState' m s of (# r, s' #) -> runState' (n r) s' |