Copyright | (c) Daniel Mendler 2016, (c) Andy Gill 2001, (c) Oregon Graduate Institute of Science and Technology, 2001 |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | mail@daniel-mendler.de |
Stability | experimental |
Portability | non-portable (multi-param classes, functional dependencies) |
Safe Haskell | Safe |
Language | Haskell2010 |
Stricter RWS monad using continuation-passing-style for the writer output.
Inspired by the paper Functional Programming with Overloading and Higher-Order Polymorphism, Mark P Jones (http://web.cecs.pdx.edu/~mpj/) Advanced School of Functional Programming, 1995.
- type RWS r w s = RWST r w s Identity
- rws :: Monoid w => (r -> s -> (a, s, w)) -> RWS r w s a
- runRWS :: Monoid w => RWS r w s a -> r -> s -> (a, s, w)
- evalRWS :: Monoid w => RWS r w s a -> r -> s -> (a, w)
- execRWS :: Monoid w => RWS r w s a -> r -> s -> (s, w)
- mapRWS :: (Monoid w, Monoid w') => ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b
- withRWS :: (r' -> s -> (r, s)) -> RWS r w s a -> RWS r' w s a
- data RWST r w s m a :: * -> * -> * -> (* -> *) -> * -> *
- runRWST :: Monoid w => RWST r w s m a -> r -> s -> m (a, s, w)
- evalRWST :: (Monad m, Monoid w) => RWST r w s m a -> r -> s -> m (a, w)
- execRWST :: (Monad m, Monoid w) => RWST r w s m a -> r -> s -> m (s, w)
- mapRWST :: (Monad n, Monoid w, Monoid w') => (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b
- withRWST :: (r' -> s -> (r, s)) -> RWST r w s m a -> RWST r' w s m a
The RWS monad
The RWST monad transformer
data RWST r w s m a :: * -> * -> * -> (* -> *) -> * -> * #
MonadTrans (RWST r w s) | |
Monad m => Monad (RWST r w s m) | |
Functor m => Functor (RWST r w s m) | |
MonadFix m => MonadFix (RWST r w s m) | |
MonadFail m => MonadFail (RWST r w s m) | |
(Functor m, Monad m) => Applicative (RWST r w s m) | |
MonadIO m => MonadIO (RWST r w s m) | |
(Functor m, MonadPlus m) => Alternative (RWST r w s m) | |
(Functor m, MonadPlus m) => MonadPlus (RWST r w s m) | |
mapRWST :: (Monad n, Monoid w, Monoid w') => (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b #