Copyright	(C) 2012 Edward Kmett
License	BSD-style (see the file LICENSE)
Maintainer	Edward Kmett <ekmett@gmail.com>
Stability	provisional
Portability	portable
Safe Haskell	None
Language	Haskell2010

Data.Machine.Moore

Description

Synopsis

Documentation

Moore machines

Constructors

Moore b (a -> Moore a b)

Instances

Corepresentable Moore Source
Closed Moore Source
Costrong Moore Source
Profunctor Moore Source
Automaton Moore Source
Cosieve Moore [] Source
Monad (Moore a) Source	slow diagonalization
Functor (Moore a) Source
MonadFix (Moore a) Source
Applicative (Moore a) Source
Distributive (Moore a) Source
Representable (Moore a) Source
MonadZip (Moore a) Source
Comonad (Moore a) Source
ComonadApply (Moore a) Source
Pointed (Moore a) Source
Copointed (Moore a) Source
MonadReader [a] (Moore a) Source
type Corep Moore = [] Source
type Rep (Moore a) = [a] Source

Accumulate the input as a sequence.

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

Construct a Moore machine from a state valuation and transition function