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. state :: forall (m :: Type -> Type) s a . Applicative m => (s -> (a, s)) -> StateT s m a

    rev-state Control.Monad.Trans.RevState

    No documentation available.

  2. newtype StateT s (m :: Type -> Type) a

    transformers Control.Monad.Trans.State.Lazy

    A state transformer monad parameterized by:

    • s - The state.
    • m - The inner monad.
    The return function leaves the state unchanged, while >>= uses the final state of the first computation as the initial state of the second.

  3. StateT :: (s -> m (a, s)) -> StateT s (m :: Type -> Type) a

    transformers Control.Monad.Trans.State.Lazy

    No documentation available.

  4. newtype StateT s (m :: Type -> Type) a

    transformers Control.Monad.Trans.State.Strict

    A state transformer monad parameterized by:

    • s - The state.
    • m - The inner monad.
    The return function leaves the state unchanged, while >>= uses the final state of the first computation as the initial state of the second.

  5. StateT :: (s -> m (a, s)) -> StateT s (m :: Type -> Type) a

    transformers Control.Monad.Trans.State.Strict

    No documentation available.

  6. newtype StateT s (m :: Type -> Type) a

    mtl Control.Monad.State.Lazy

    A state transformer monad parameterized by:

    • s - The state.
    • m - The inner monad.
    The return function leaves the state unchanged, while >>= uses the final state of the first computation as the initial state of the second.

  7. StateT :: (s -> m (a, s)) -> StateT s (m :: Type -> Type) a

    mtl Control.Monad.State.Lazy

    No documentation available.

  8. newtype StateT s (m :: Type -> Type) a

    mtl Control.Monad.State.Strict

    A state transformer monad parameterized by:

    • s - The state.
    • m - The inner monad.
    The return function leaves the state unchanged, while >>= uses the final state of the first computation as the initial state of the second.

  9. StateT :: (s -> m (a, s)) -> StateT s (m :: Type -> Type) a

    mtl Control.Monad.State.Strict

    No documentation available.

  10. newtype StateT (g :: Type -> Type) (m :: Type -> Type) a

    adjunctions Control.Monad.Representable.State

    A state transformer monad parameterized by:

    • g - A representable functor used to memoize results for a state Rep g
    • m - The inner monad.
    The return function leaves the state unchanged, while >>= uses the final state of the first computation as the initial state of the second.

Page 5 of many | Previous | Next