Idris2Doc : Control.Monad.TransitionIndexed

Control.Monad.TransitionIndexed

(source)

Definitions

interfaceTransitionIndexedPointed : (z : Type) -> ((ty : Type) ->z-> (ty->z) ->Type) ->Type
  A TransitionIndexed pointed type defines purity but is not necessarily
Applicative.

Parameters: z, m
Methods:
pure : (x : a) ->ma (fx) f
pure : TransitionIndexedPointedzm=> (x : a) ->ma (fx) f
Visibility: public export
interfaceTransitionIndexedMonad : (z : Type) -> ((ty : Type) ->z-> (ty->z) ->Type) ->Type
  A TransitionIndexed monad is like an indexed monad but the third
index is determined by a function that takes the first index as input.

One readily available example of a type that fits this interface is
a type representing stateful transitions and the values that fall
out of them.

For example, take the final Door example from "Type-Driven Development with Idris."

data DoorCmd : (ty : Type) ->
DoorState ->
(ty -> DoorState) ->
Type

Parameters: z, m
Methods:
bind : maxf-> ((res : a) ->mb (fres) g) ->mbxg
bind : TransitionIndexedMonadzm=>maxf-> ((res : a) ->mb (fres) g) ->mbxg
Visibility: public export
(>>>=) : TransitionIndexedMonadzm=>maxf-> ((res : a) ->mb (fres) g) ->mbxg
Visibility: public export
Fixity Declarations:
infixl operator, level 1
infixl operator, level 1
(=<<<) : TransitionIndexedMonadzm=> ((res : a) ->mb (fres) g) ->maxf->mbxg
  Flipped version of `>>>=

Visibility: public export
Fixity Declarations:
infixl operator, level 1
infixl operator, level 1
(>>>) : TransitionIndexedMonadzm=>m () xf-> Lazy (mb (f ()) g) ->mbxg
Visibility: public export
Fixity Declarations:
infixl operator, level 1
infixl operator, level 1
when : TransitionIndexedPointedzm=>Bool-> Lazy (m () (f ()) f) ->m () (f ()) f
  Conditionally execute an expression when the boolean is true.

Visibility: export
unless : TransitionIndexedPointedzm=>Bool-> Lazy (m () (f ()) f) ->m () (f ()) f
  Execute an expression unless the boolean is true.

Visibility: export
traverse_ : (Foldablet, (TransitionIndexedPointedzm, TransitionIndexedMonadzm)) => (a->mbx (constx)) ->ta->m () x (constx)
  Map each element of a structure to a computation, evaluate those
computations and discard the results.

Visibility: public export
sequence_ : (Foldablet, (TransitionIndexedPointedzm, TransitionIndexedMonadzm)) =>t (max (constx)) ->m () x (constx)
  Evaluate each computation in a structure and discard the results.

Visibility: public export
for_ : (Foldablet, (TransitionIndexedPointedzm, TransitionIndexedMonadzm)) =>ta-> (a->mbx (constx)) ->m () x (constx)
  Like `traverse_` but with the arguments flipped.

Visibility: public export