Data.Machine.Moore

http://en.wikipedia.org/wiki/Moore_machine

Documentation

data Moore a b

Moore machines

Constructors

Moore b (a -> Moore a b)

Instances

Corepresentable Moore

Associated Types

type Corep (Moore :: * -> * -> *) :: * -> *

Methods

cotabulate :: (Corep Moore d -> c) -> Moore d c

Closed Moore

Methods

closed :: Moore a b -> Moore (x -> a) (x -> b)

Costrong Moore

Methods

unfirst :: Moore (a, d) (b, d) -> Moore a b

unsecond :: Moore (d, a) (d, b) -> Moore a b

Profunctor Moore

Methods

dimap :: (a -> b) -> (c -> d) -> Moore b c -> Moore a d

lmap :: (a -> b) -> Moore b c -> Moore a c

rmap :: (b -> c) -> Moore a b -> Moore a c

(#.) :: Coercible * c b => (b -> c) -> Moore a b -> Moore a c

(.#) :: Coercible * b a => Moore b c -> (a -> b) -> Moore a c

Automaton Moore

Methods

auto :: Moore a b -> Process a b

Cosieve Moore []

Methods

cosieve :: Moore a b -> [a] -> b

Monad (Moore a)

slow diagonalization

Methods

(>>=) :: Moore a a -> (a -> Moore a b) -> Moore a b

(>>) :: Moore a a -> Moore a b -> Moore a b

return :: a -> Moore a a

fail :: String -> Moore a a

Functor (Moore a)

Methods

fmap :: (a -> b) -> Moore a a -> Moore a b

(<$) :: a -> Moore a b -> Moore a a

MonadFix (Moore a)

Methods

mfix :: (a -> Moore a a) -> Moore a a

Applicative (Moore a)

Methods

pure :: a -> Moore a a

(<*>) :: Moore a (a -> b) -> Moore a a -> Moore a b

(*>) :: Moore a a -> Moore a b -> Moore a b

(<*) :: Moore a a -> Moore a b -> Moore a a

Distributive (Moore a)

Methods

distribute :: Functor f => f (Moore a a) -> Moore a (f a)

collect :: Functor f => (a -> Moore a b) -> f a -> Moore a (f b)

distributeM :: Monad m => m (Moore a a) -> Moore a (m a)

collectM :: Monad m => (a -> Moore a b) -> m a -> Moore a (m b)

Representable (Moore a)

Associated Types

type Rep (Moore a :: * -> *) :: *

Methods

tabulate :: (Rep (Moore a) -> a) -> Moore a a

index :: Moore a a -> Rep (Moore a) -> a

MonadZip (Moore a)

Methods

mzip :: Moore a a -> Moore a b -> Moore a (a, b)

mzipWith :: (a -> b -> c) -> Moore a a -> Moore a b -> Moore a c

munzip :: Moore a (a, b) -> (Moore a a, Moore a b)

Comonad (Moore a)

Methods

extract :: Moore a a -> a

duplicate :: Moore a a -> Moore a (Moore a a)

extend :: (Moore a a -> b) -> Moore a a -> Moore a b

ComonadApply (Moore a)

Methods

(<@>) :: Moore a (a -> b) -> Moore a a -> Moore a b

(@>) :: Moore a a -> Moore a b -> Moore a b

(<@) :: Moore a a -> Moore a b -> Moore a a

Pointed (Moore a)

Methods

point :: a -> Moore a a

Copointed (Moore a)

Methods

copoint :: Moore a a -> a

MonadReader [a] (Moore a)

Methods

ask :: Moore a [a]

local :: ([a] -> [a]) -> Moore a a -> Moore a a

reader :: ([a] -> a) -> Moore a a

type Corep Moore

type Corep Moore = []

type Rep (Moore a)

type Rep (Moore a) = [a]

logMoore :: Monoid m => Moore m m

Accumulate the input as a sequence.

unfoldMoore :: (s -> (b, a -> s)) -> s -> Moore a b

Construct a Moore machine from a state valuation and transition function