:: IO_a_ -> _ IO_ThreadId -package:freckle-app -package:envelope -package:configuration-tools -package:happstack-server

evaluate :: MonadBase IO m => a -> m a
lifted-base Control.Exception.Lifted
Generalized version of evaluate.
throwError :: Has (Throw e) sig m => e -> m a
fused-effects Control.Effect.Throw
Throw an error, escaping the current computation up to the nearest catchError (if any). 
runThrow (throwError e >>= k) = runThrow (throwError e)
replicateT :: Default (Replicator r f) b b => r -> f b
product-profunctors Data.Profunctor.Product.Examples
A higher-order generalisation of replicate. For example 
foo :: IO (String, String, String)
foo = replicateT getLine

> foo
Hello
world
!
("Hello","world","!")
traverseT :: Default (Traverse f) a b => a -> f b
product-profunctors Data.Profunctor.Product.Examples
Use sequenceT instead. It has a better name.
sequenceT :: Default (Sequence f) a b => a -> f b
product-profunctors Data.Profunctor.Product.Examples
A higher-order generalisation of sequenceA. For example 
> sequenceT (print 3110, putStrLn World) :: IO ((), ())
3110
World
((),())
pure :: Applicative f => a -> f a
base Prelude Control.Applicative GHC.Base, hedgehog Hedgehog.Internal.Prelude, ghc GHC.HsToCore.Monad GHC.Prelude.Basic GHC.Utils.Monad, semigroupoids Semigroupoids.Do, base-compat Prelude.Compat, protolude Protolude, diagrams-lib Diagrams.Prelude, relude Relude.Applicative, rio RIO.Prelude, base-prelude BasePrelude, turtle Turtle, graphviz Data.GraphViz.Parsing, classy-prelude ClassyPrelude, basic-prelude CorePrelude, universum Universum.Applicative, Cabal-syntax Distribution.Compat.Prelude, github GitHub.Internal.Prelude, numhask NumHask.Prelude, basement Basement.Compat.Base Basement.Imports, foundation Foundation, ghc-lib-parser GHC.Prelude.Basic GHC.Utils.Monad, dimensional Numeric.Units.Dimensional.Prelude, rebase Rebase.Prelude, quaalude Essentials, hledger Hledger.Cli.Script, mixed-types-num Numeric.MixedTypes.PreludeHiding, xmonad-contrib XMonad.Config.Prime, stack Stack.Prelude, incipit-base Incipit.Base, LambdaHack Game.LambdaHack.Core.Prelude, ghc-lib GHC.HsToCore.Monad, appar Text.Appar.ByteString Text.Appar.LazyByteString Text.Appar.String, breakpoint Debug.Breakpoint.GhcFacade, cabal-install-solver Distribution.Solver.Compat.Prelude, loc Data.Loc.Internal.Prelude, yesod-paginator Yesod.Paginator.Prelude, distribution-opensuse OpenSuse.Prelude, faktory Faktory.Prelude, frisby Text.Parsers.Frisby, hledger-web Hledger.Web.Import, termonad Termonad.Prelude
Lift a value.
dataPureDefault :: Applicative f => a -> f a
linear-base Control.Functor.Linear
Apply the control pure over a data applicative.
pure :: Applicative f => a -> f a
linear-base Data.Functor.Linear
pure :: Applicative f => forall a . () => a -> f a
optional-args Data.Optional
Lift a value.
return :: Monad m => a -> m a
base Prelude Control.Monad Control.Monad.Instances GHC.Base, hedgehog Hedgehog.Internal.Prelude, ghc GHC.Prelude.Basic, semigroupoids Semigroupoids.Do, base-compat Control.Monad.Compat Prelude.Compat, protolude Protolude.Monad, haskell-gi-base Data.GI.Base.ShortPrelude, relude Relude.Monad.Reexport, rio RIO.Prelude, base-prelude BasePrelude, classy-prelude ClassyPrelude, numeric-prelude NumericPrelude NumericPrelude.Base, basic-prelude CorePrelude, universum Universum.Monad.Reexport, base-compat-batteries Control.Monad.Compat, Cabal-syntax Distribution.Compat.Prelude, github GitHub.Internal.Prelude, numhask NumHask.Prelude, basement Basement.Compat.Base Basement.Imports, foundation Foundation, ghc-lib-parser GHC.Prelude.Basic, prelude-compat Prelude2010, dimensional Numeric.Units.Dimensional.Prelude, rebase Rebase.Prelude, hledger Hledger.Cli.Script
Inject a value into the monadic type.
return' :: Monad m => a -> m a
IfElse Control.Monad.IfElse
Strict version of return because usually we don't need that extra thunk.