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