Portability	portable
Stability	provisional
Maintainer	Edward Kmett <ekmett@gmail.com>
Safe Haskell	None

Data.Machine.Moore

Description

Synopsis

Documentation

Moore machines

Constructors

Moore b (a -> Moore a b)

Instances

Profunctor Moore
Automaton Moore
Monad (Moore a)	slow diagonalization
Functor (Moore a)
Functor (Moore a) => Applicative (Moore a)
Functor (Moore a) => Comonad (Moore a)
Comonad (Moore a) => ComonadApply (Moore a)
Pointed (Moore a)
Copointed (Moore a)

Accumulate the input as a sequence.

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

Construct a Moore machine from a state valuation and transition function