:: Monoid_a _ => _ a

look :: forall w (sig :: (Type -> Type) -> Type -> Type) m . Has (Accum w) sig m => m w
fused-effects Control.Effect.Accum
Look up the previous accumulation 
runAccum w look = return (w, w)
runAccum w (look >>= continuation) = runAccum w (continuation w)
cutfail :: forall (sig :: (Type -> Type) -> Type -> Type) m a . Has Cut sig m => m a
fused-effects Control.Effect.Cut
Fail the current branch, and prevent backtracking within the nearest enclosing call (if any). Contrast with empty, which fails the current branch but allows backtracking. 
cutfail >>= k = cutfail

cutfail <|> m = cutfail
empty :: forall (sig :: (Type -> Type) -> Type -> Type) m a . Has Empty sig m => m a
fused-effects Control.Effect.Empty
Abort the computation. empty annihilates >>=: 
empty >>= k = empty
ask :: forall r (sig :: (Type -> Type) -> Type -> Type) m . Has (Reader r) sig m => m r
fused-effects Control.Effect.Reader
Retrieve the environment value. 
runReader a (ask >>= k) = runReader a (k a)
get :: forall s (sig :: (Type -> Type) -> Type -> Type) m . Has (State s) sig m => m s
fused-effects Control.Effect.State
Get the current state value. 
runState a (get >>= k) = runState a (k a)
autoTC :: forall t a . Auto (TyPred t) a => t a
decidable Data.Type.Predicate.Auto
A version of auto that "just works" with type inference, if the predicate is a type constructor.
exitFailure :: MonadIO m => m a
relude Relude.Lifted.Exit
Lifted version of exitFailure. 
>>> exitFailure
*** Exception: ExitFailure 1
exitSuccess :: MonadIO m => m a
relude Relude.Lifted.Exit
Lifted version of exitSuccess. 
>>> exitSuccess
*** Exception: ExitSuccess
exitFailure :: MonadIO m => m a
rio RIO, stack Stack.Prelude
Lifted version of "System.Exit.exitFailure". @since 0.1.9.0.
exitSuccess :: MonadIO m => m a
rio RIO, stack Stack.Prelude
Lifted version of "System.Exit.exitSuccess". @since 0.1.9.0.
exitFailure :: MonadIO m => m a
universum Universum.Lifted.Env
Lifted version of exitFailure.
exitSuccess :: MonadIO m => m a
universum Universum.Lifted.Env
Lifted version of exitSuccess.
exitCleanly :: MonadIO m => m a
hdaemonize System.Posix.Daemonize
Use this function when the daemon should terminate normally. It logs a message, and exits with status 0.
empty :: C set => set a
board-games Game.Mastermind.CodeSet
unit :: C set => set a
board-games Game.Mastermind.CodeSet
empty :: Vector v a => v a
vector Data.Vector.Generic
O(1) The empty vector.
empty :: Vector v a => v a
rio RIO.Vector
O(1) Empty vector
mk0 :: (Vector v a, Dim v ~ 0) => v a
fixed-vector Data.Vector.Fixed
pending :: (HasCallStack, MonadThrow m) => m a
sandwich Test.Sandwich.Expectations
Throws a Pending exception, which will cause the test to be marked as pending.
mzero :: MonadPlus m => m a
base Control.Monad GHC.Base, amazonka-core Amazonka.Prelude, pipes Pipes, base-compat Control.Monad.Compat Control.Monad.Compat, protolude Protolude.Monad, relude Relude.Monad.Reexport, rio RIO.Prelude, base-prelude BasePrelude, turtle Turtle, classy-prelude ClassyPrelude, Cabal-syntax Distribution.Compat.Prelude, universum Universum.Monad.Reexport, fused-effects Control.Effect.NonDet, ihaskell IHaskellPrelude, base-compat-batteries Control.Monad.Compat, Agda Agda.Utils.Monad, rebase Rebase.Prelude, hledger Hledger.Cli.Script, massiv-test Test.Massiv.Utils, incipit-base Incipit.Base, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, can-i-haz Control.Monad.Except.CoHas Control.Monad.Reader.Has, yesod-paginator Yesod.Paginator.Prelude, control-monad-free Control.Monad.Free, distribution-opensuse OpenSuse.Prelude, hledger-web Hledger.Web.Import
The identity of mplus. It should also satisfy the equations 
mzero >>= f  =  mzero
v >> mzero   =  mzero
The default definition is 
mzero = empty
mzero :: MonadPlus m => m a
stack Stack.Prelude
empty :: Alternative f => f a
base Control.Applicative GHC.Base, fused-effects Control.Effect.NonDet
The identity of <|> 
empty <|> a     == a
a     <|> empty == a
empty :: Alternative f => f a
protolude Protolude, parser-combinators Control.Applicative.Combinators Control.Monad.Combinators, relude Relude.Applicative, base-prelude BasePrelude, turtle Turtle, classy-prelude ClassyPrelude, Cabal-syntax Distribution.Compat.Prelude, algebraic-graphs Algebra.Graph.HigherKinded.Class, universum Universum.Applicative, effectful-core Effectful.NonDet, ihaskell IHaskellPrelude, flatparse FlatParse.Basic FlatParse.Stateful, rebase Rebase.Prelude, threepenny-gui Graphics.UI.Threepenny.Core, configuration-tools Configuration.Utils.CommandLine, hledger Hledger.Cli.Script, list-transformer List.Transformer, fmlist Data.FMList, incipit-base Incipit.Base, cabal-install-solver Distribution.Solver.Compat.Prelude, opt-env-conf OptEnvConf.Parser, loc Data.Loc.Internal.Prelude, frisby Text.Parsers.Frisby, verset Verset
The identity of <|>
empty :: Alternative f => forall a . () => f a
optional-args Data.Optional
The identity of <|>
look :: MonadAccum w m => m w
mtl Control.Monad.Accum
Retrieve the accumulated result so far.