|Portability||non-portable (requires universal quantification for runST)|
|This library provides support for strict state threads, as
described in the PLDI '94 paper by John Launchbury and Simon Peyton
Jones Lazy Functional State Threads.
|The ST Monad
|data ST s a |
The strict state-transformer monad.
A computation of type ST s a transforms an internal state indexed
by s, and returns a value of type a.
The s parameter is either
- an uninstantiated type variable (inside invocations of runST), or
- RealWorld (inside invocations of Control.Monad.ST.stToIO).
It serves to keep the internal states of different invocations
of runST separate from each other and from invocations of
The >>= and >> operations are strict in the state (though not in
values stored in the state). For example,
runST (writeSTRef _|_ v >>= f) = _|_
|runST :: (forall s. ST s a) -> a|
|Return the value computed by a state transformer computation.
The forall ensures that the internal state used by the ST
computation is inaccessible to the rest of the program.
|fixST :: (a -> ST s a) -> ST s a|
|Allow the result of a state transformer computation to be used (lazily)
inside the computation.
Note that if f is strict, fixST f = _|_.
|Converting ST to IO
|stToIO :: ST RealWorld a -> IO a|
|A monad transformer embedding strict state transformers in the IO
monad. The RealWorld parameter indicates that the internal state
used by the ST computation is a special one supplied by the IO
monad, and thus distinct from those used by invocations of runST.
|unsafeInterleaveST :: ST s a -> ST s a|
|unsafeIOToST :: IO a -> ST s a|
|unsafeSTToIO :: ST s a -> IO a|
|Produced by Haddock version 2.3.0|