CurryInfo: transformers-3.0.0 / Control.Monad.Trans.State.mapStateT
definition: 
|
mapStateT :: (Monad m, Monad n)
=> (m (a, s) -> n (b, s))
-> StateT s m a -> StateT s n b
mapStateT f m = StateT $ \s -> f (runStateT m s)
|
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
failfree:
|
(_, _, _, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,_,_) |-> _}
|
|
name:
|
mapStateT |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
(Prelude.Monad a, Prelude.Monad d) => (a (b, c) -> d (e, c)) -> StateT c a b -> StateT c d e |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |