Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. stateless :: forall (e :: (Type -> Type) -> Type -> Type) (m :: Type -> Type) (n :: Type -> Type) ans . Monad n => (e m ~> n) -> AlgHandler e m n ans

   heftia	Control.Monad.Hefty

   Lifts a stateless handler into a algebraic handler.

2. stateless :: forall (e :: (Type -> Type) -> Type -> Type) (m :: Type -> Type) (n :: Type -> Type) ans . Monad n => (e m ~> n) -> AlgHandler e m n ans

   heftia	Control.Monad.Hefty.Interpret

   Lifts a stateless handler into a algebraic handler.

3. stateS :: forall (m :: Type -> Type) s a b . (Functor m, Monad m) => MSF m (s, a) (s, b) -> MSF (StateT s m) a b

   dunai	Control.Monad.Trans.MSF.State

   Build an MSF in the State monad from one that takes the state as an extra input. This is the opposite of runStateS.

4. stateRef :: forall (m :: Type -> Type) s . Monad m => Ref (StateT s m) s

   monadology	Control.Monad.Ology.Data.Ref

   No documentation available.

5. stateToReaderContT :: forall (m :: Type -> Type) s a r . Monad m => StateT s m a -> ContT r (ReaderT s m) a

   monadology	Control.Monad.Ology.Specific.ContT

   No documentation available.

6. accumToStateT :: forall (m :: Type -> Type) s a . (Functor m, Monoid s) => AccumT s m a -> StateT s m a

   transformers	Control.Monad.Trans.Accum

   Convert an accumulation (append-only) computation into a fully stateful computation.

7. evalState :: State s a -> s -> a

   transformers	Control.Monad.Trans.State.Lazy

   Evaluate a state computation with the given initial state and return the final value, discarding the final state.

   • evalState m s = fst (runState m
     s)

8. evalStateT :: Monad m => StateT s m a -> s -> m a

   transformers	Control.Monad.Trans.State.Lazy

   Evaluate a state computation with the given initial state and return the final value, discarding the final state.

   • evalStateT m s = liftM fst
     (runStateT m s)

9. execState :: State s a -> s -> s

   transformers	Control.Monad.Trans.State.Lazy

   Evaluate a state computation with the given initial state and return the final state, discarding the final value.

   • execState m s = snd (runState m
     s)

10. execStateT :: Monad m => StateT s m a -> s -> m s

    transformers	Control.Monad.Trans.State.Lazy

    Evaluate a state computation with the given initial state and return the final state, discarding the final value.

    • execStateT m s = liftM snd
      (runStateT m s)

Page 9 of many | Previous | Next