State

module Control.Monad.State
mtl Control.Monad.State
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.
module Control.Monad.Trans.State
transformers Control.Monad.Trans.State
State monads, passing an updatable state through a computation. Some computations may not require the full power of state transformers: * For a read-only state, see Control.Monad.Trans.Reader. * To accumulate a value without using it on the way, see Control.Monad.Trans.Writer. This version is lazy; for a strict version, see Control.Monad.Trans.State.Strict, which has the same interface.
module Graphics.UI.GLUT.State
GLUT Graphics.UI.GLUT.State
GLUT maintains a considerable amount of programmer visible state. Some (but not all) of this state may be directly retrieved.
State :: Path -> Counts -> State
HUnit Test.HUnit.Base
State :: s -> SourcePos -> u -> State s u
parsec Text.Parsec.Prim, parsec Text.ParserCombinators.Parsec.Prim
data State
HUnit Test.HUnit.Base
Keeps track of the remaining tests and the results of the performed tests. As each test is performed, the path is removed and the counts are updated as appropriate.
data State
QuickCheck Test.QuickCheck.State
State represents QuickCheck's internal state while testing a property. The state is made visible to callback functions.
data State s u
parsec Text.Parsec.Prim, parsec Text.ParserCombinators.Parsec.Prim
type State s = StateT s Identity
transformers Control.Monad.Trans.State.Lazy, transformers Control.Monad.Trans.State.Strict, mtl Control.Monad.State.Lazy, mtl Control.Monad.State.Strict
A state monad parameterized by the type s of the state to carry. The return function leaves the state unchanged, while >>= uses the final state of the first computation as the initial state of the second.
state :: (Monoid w, Monad m) => (s -> (a, s)) -> RWST r w s m a
transformers Control.Monad.Trans.RWS.Lazy, transformers Control.Monad.Trans.RWS.Strict
Construct a state monad computation from a state transformer function.
state :: Monad m => (s -> (a, s)) -> StateT s m a
transformers Control.Monad.Trans.State.Lazy, transformers Control.Monad.Trans.State.Strict
Construct a state monad computation from a function. (The inverse of runState.)
state :: MonadState s m => (s -> (a, s)) -> m a
mtl Control.Monad.State.Class, mtl Control.Monad.State.Lazy, mtl Control.Monad.State.Strict
package state
package
Data.State Version 0.1
package state-record
package
This package provides a Template Haskell function which transforms a normal record declaration into one which supports many useful operations when used as the state in a State monad. Version 0.0.1
package statechart
package
TODO Version 0.1.0
package stateful-mtl
package
A MonadST type class, instances, and some helpful monad functions. Version 1.0.7
stateInput :: State s u -> s
parsec Text.Parsec.Prim, parsec Text.ParserCombinators.Parsec.Prim
statePos :: State s u -> SourcePos
parsec Text.Parsec.Prim, parsec Text.ParserCombinators.Parsec.Prim
package stateref
package
A collection of type-classes generalizing the read/write/modify operations for stateful variables provided by things like IORef, TVar, &c. Note that The interface has changed a bit from the 0.2.* version.  "*Ref" functions are now called "*Reference" and new "*Ref" function exist with simpler signatures. The new Ref existential type provides a convenient monad-indexed reference type, and the HasRef class indicates monads for which there is a default reference type for every referent. Version 0.3
package statestack
package
Simple State-like monad transformer where states can be saved to and restored from an internal stack. Version 0.1.1

Show more results