| Portability | portable |
|---|---|
| Stability | provisional |
| Maintainer | Edward Kmett <[email protected]> |
| Safe Haskell | Safe-Infered |
Data.Machine.Moore
Description
Documentation
Moore machines
Instances
| Profunctor Moore | |
| Automaton Moore | |
| Monad (Moore a) | slow diagonalization |
| Functor (Moore a) | |
| Applicative (Moore a) | |
| Comonad (Moore a) | |
| ComonadApply (Moore a) |
unfoldMoore :: (s -> (b, a -> s)) -> s -> Moore a bSource
Construct a Moore machine from a state valuation and transition function