Hoogle Search

Within LTS Haskell 24.2 (ghc-9.10.2)

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

  1. module Control.Monad.Trans.Has.State

    No documentation available.

  2. module Control.Monad.Hefty.State

    Interpreter for the State effect.

  3. module Control.Monad.Trans.Memo.State

    Defines MemoStateT - generalized (to any Data.MapLike content) memoization monad transformer

  4. type State s = StateT s Identity

    monadology Control.Monad.Ology.Specific.StateT

    A state monad parameterized by the type s of the state to carry. The return function leaves the state unchanged, while >>= uses the final state of the first computation as the initial state of the second.

  5. type State s = StateT s Identity

    rev-state Control.Monad.RevState

    No documentation available.

  6. type State s = StateT s Identity

    rev-state Control.Monad.Trans.RevState

    No documentation available.

  7. module Control.Monad.Trans.Indexed.State

    The state indexed monad transformer.

  8. state :: forall (m :: Type -> Type) s a r w . Monad m => (s -> (a, s)) -> RWST r w s m a

    transformers Control.Monad.Trans.RWS.CPS

    Construct a state monad computation from a state transformer function.

  9. state :: forall w (m :: Type -> Type) s a r . (Monoid w, Monad m) => (s -> (a, s)) -> RWST r w s m a

    transformers Control.Monad.Trans.RWS.Lazy

    Construct a state monad computation from a state transformer function.

  10. state :: forall w (m :: Type -> Type) s a r . (Monoid w, Monad m) => (s -> (a, s)) -> RWST r w s m a

    transformers Control.Monad.Trans.RWS.Strict

    Construct a state monad computation from a state transformer function.

Page 3 of many | Previous | Next