Copyright | (c) The University of Glasgow 2001 |
---|---|
License | BSD-style (see the file libraries/base/LICENSE) |
Maintainer | libraries@haskell.org |
Stability | stable |
Portability | non-portable (requires universal quantification for runST) |
Safe Haskell | Trustworthy |
Language | Haskell2010 |
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.
References (variables) that can be used within the ST
monad are
provided by Data.STRef, and arrays are provided by
Data.Array.ST.
The ST
Monad
The strict ST
monad.
The ST
monad allows for destructive updates, but is escapable (unlike IO).
A computation of type
returns a value of type ST
s aa
, and
execute in "thread" s
. The s
parameter is either
- an uninstantiated type variable (inside invocations of
runST
), or RealWorld
(inside invocations ofstToIO
).
It serves to keep the internal states of different invocations
of runST
separate from each other and from invocations of
stToIO
.
The >>=
and >>
operations are strict in the state (though not in
values stored in the state). For example,
runST
(writeSTRef _|_ v >>= f) = _|_
Instances
Applicative (ST s) Source # | @since base-4.4.0.0 |
Functor (ST s) Source # | @since base-2.01 |
Monad (ST s) Source # | @since base-2.01 |
MonadFix (ST s) Source # | @since base-2.01 |
Monoid a => Monoid (ST s a) Source # | @since base-4.11.0.0 |
Semigroup a => Semigroup (ST s a) Source # | @since base-4.11.0.0 |
Show (ST s a) Source # | @since base-2.01 |
runST :: (forall s. ST s a) -> a Source #
Return the value computed by a state thread.
The forall
ensures that the internal state used by the ST
computation is inaccessible to the rest of the program.