 | monoid-transformer-0.0.2: Monoid counterparts to some ubiquitous monad transformers | Source code | Contents | Index |
| Data.Monoid.State |
newtype T s a = Cons {
| |
| pure :: a -> T s a | |
| evaluate :: s -> T s a -> a | |
| execute :: s -> T s a -> s | |
| put :: Monoid a => s -> T s a | |
| modify :: Monoid a => (s -> s) -> T s a | |
| mapFst :: (a -> c) -> (a, b) -> (c, b) |
| newtype T s a | Source |
This resembles the pure State monad. However, State in transformers is a StateT and mtl is not Haskell 98. I hope I have the more natural parameter order for evaluate in contrast to mtl and transformers. However, it is different from the parameter order of run. | ||||||
| Constructors | ||||||
| ||||||
| pure :: a -> T s a | Source |
| evaluate :: s -> T s a -> a | Source |
| execute :: s -> T s a -> s | Source |
| put :: Monoid a => s -> T s a | Source |
| modify :: Monoid a => (s -> s) -> T s a | Source |
| mapFst :: (a -> c) -> (a, b) -> (c, b) | Source |