State is:module
State monads.
This module is inspired by the paper
Functional Programming with
Overloading and Higher-Order Polymorphism, Mark P Jones
(
http://web.cecs.pdx.edu/~mpj/) Advanced School of Functional
Programming, 1995.
State monads, passing an updatable state through a computation.
Some computations may not require the full power of state
transformers:
This version is lazy; for a strict version, see
Control.Monad.Trans.State.Strict, which has the same interface.
State monad for the linear register allocator.
Definition of Megaparsec's
State.
Provides reexports of MonadState and related helpers.
State monads.
This module is inspired by the paper /Functional Programming with
Overloading and Higher-Order Polymorphism/, Mark P Jones
(
http://web.cecs.pdx.edu/~mpj/) Advanced School of Functional
Programming, 1995.
GLUT maintains a considerable amount of programmer visible state. Some
(but not all) of this state may be directly retrieved.
A generalized State monad, parameterized by a Representable functor.
The representation of that functor serves as the state.
An arrow transformer that adds a modifiable state, based of section 9
of Generalising Monads to Arrows, by John Hughes, Science of
Computer Programming 37:67-111, May 2000.
An effect that adds a mutable, updatable state value to a given
computation.
Not all computations require a full-fledged state effect: read-only
state is better served by
Reader, and append-only state without
reads is better served by
Writer.
Predefined carriers:
Access helper functions in a State monad