|
Numeric.Probability.Transition |
|
|
|
|
Description |
Deterministic and probabilistic generators
|
|
Synopsis |
|
|
|
|
Transitions
|
|
|
deterministic generator
|
|
type T prob a = a -> T prob a | Source |
|
probabilistic generator
|
|
|
|
|
map maps a change function to the result of a transformation
(map is somehow a lifted form of map)
The restricted type of f results from the fact that the
argument to t cannot be changed to b in the result T type.
|
|
|
unfold a distribution of transitions into one transition
NOTE: The argument transitions must be independent
|
|
|
Composition of transitions similar to Numeric.Probability.Monad.compose
but with intermediate duplicate elimination.
|
|
Spreading changes into transitions
|
|
|
functions to convert a list of changes into a transition
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Spreading transitions into transitions
|
|
type SpreadT prob a = [T prob a] -> T prob a | Source |
|
functions to convert a list of transitions into a transition
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Produced by Haddock version 2.4.2 |