| Copyright | (c) Jorge Santiago Alvarez Cuadros, 2016 |
|---|---|
| License | GPL-3 |
| Maintainer | sanjorgek@ciencias.unam.mx |
| Stability | experimental |
| Portability | portable |
| Safe Haskell | Safe |
| Language | Haskell2010 |
Data.State
Contents
Description
Simple State function, have an isomorphism with Maybe but order are diferent
Data and type
Macine states are only a label, maybe a letter
Instances
| Monad State Source | Same as Maybe |
| Functor State Source | Same as Maybe |
| Applicative State Source | Same as Maybe |
| Foldable State Source | |
| Bounded a => Bounded (State a) Source | In this differ with Maybe because this show a upper bounded order |
| Enum a => Enum (State a) Source | Same as Maybe |
| Eq a => Eq (State a) Source | |
| Ord a => Ord (State a) Source | |
| Show a => Show (State a) Source | |
| Monoid a => Monoid (State a) Source |
type Final a = [State a] Source
Final state represent a set of states which elements put end to computation