Markov.Generic

An implementation of Markov chains allowing non-list containers.

Documentation

class (Applicative t, Comonad t, Monad c) => Markov c t s where

An implementation of Markov chains with non-list containers.

Markov.Markov t s = Markov.Generic.Markov [] t s

Minimal complete definition

transition | step | sequential

Methods

transition :: s -> c (t (s -> s))

step :: t s -> c (t s)

sequential :: [s -> c (t (s -> s))]

Instances

Markov [] ((,) (Product Double)) Urn

Defined in Markov.Example

Methods

transition :: Urn -> [(Product Double, Urn -> Urn)]

step :: (Product Double, Urn) -> [(Product Double, Urn)]

sequential :: [Urn -> [(Product Double, Urn -> Urn)]]