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.

Exact lookup

1. state :: forall (m :: Type -> Type) s a . Monad m => (s -> (a, s)) -> StateT s m a

   transformers	Control.Monad.Trans.State.Lazy

   Construct a state monad computation from a function. (The inverse of runState.)

2. state :: forall (m :: Type -> Type) s a . Monad m => (s -> (a, s)) -> StateT s m a

   transformers	Control.Monad.Trans.State.Strict

   Construct a state monad computation from a function. (The inverse of runState.)

3. state :: MonadState s m => (s -> (a, s)) -> m a

   mtl	Control.Monad.State.Class

   Embed a simple state action into the monad.

4. state :: MonadState s m => (s -> (a, s)) -> m a

   mtl	Control.Monad.State.Lazy

   Embed a simple state action into the monad.

5. state :: MonadState s m => (s -> (a, s)) -> m a

   mtl	Control.Monad.State.Strict

   Embed a simple state action into the monad.

6. state :: MonadState s m => (s -> (a, s)) -> m a

   adjunctions	Control.Monad.Representable.State

   Embed a simple state action into the monad.

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

   dunai	Control.Monad.Trans.MSF.RWS

   Construct a state monad computation from a state transformer function.

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

   dunai	Control.Monad.Trans.MSF.State

   Construct a state monad computation from a function. (The inverse of runState.)

9. state :: forall (m :: Type -> Type) s a . Monad m => (s -> (a, s)) -> StateT s m a

   monadology	Control.Monad.Ology.Specific.StateT

   Construct a state monad computation from a function. (The inverse of runState.)

10. state :: MonadRevState s m => (s -> (a, s)) -> m a

    rev-state	Control.Monad.RevState.Class

    No documentation available.

Page 4 of many | Previous | Next