Merge branch 'generation'
[cc1516.git] / RWST.dcl
1 definition module RWST
2
3 from Control.Applicative import class Applicative
4 from Control.Monad import class Monad
5 from Data.Functor import class Functor
6 from Data.Functor.Identity import :: Identity
7 from Data.Monoid import class Monoid, class Semigroup
8
9 // The RWS monad
10 :: RWS r w s a :== RWST r w s Identity a
11
12 rws :: (r -> s -> (a, s, w)) -> RWS r w s a
13 runRWS :: (RWS r w s a) r s -> (a, s, w)
14 evalRWS :: (RWS r w s a) r s -> (a, w)
15 execRWS :: (RWS r w s a) r s -> (s, w)
16 mapRWS :: ((a, s, w) -> (b, s, w`)) (RWS r w s a) -> RWS r w` s b
17 withRWS :: (r` s -> (r, s)) (RWS r w s a) -> RWS r` w s a
18
19 // The RWST monad transformer
20 :: RWST r w s m a = RWST (r s -> m (a, s, w))
21
22 instance Functor (RWST r w s m) | Monad m & Monoid w
23 instance Applicative (RWST r w s m) | Monad m & Monoid w
24 instance Monad (RWST r w s m) | Monad m & Monoid w
25
26 runRWST :: (RWST r w s m a) r s -> m (a, s, w)
27 evalRWST :: (RWST r w s m a) r s -> m (a, w) | Monad m
28 execRWST :: (RWST r w s m a) r s -> m (s, w) | Monad m
29 mapRWST :: ((m (a, s, w)) -> n (b, s, w`)) (RWST r w s m a) -> RWST r w` s n b
30 withRWST :: (r` -> s -> (r, s)) (RWST r w s m a) -> RWST r` w s m a
31
32 // Reader operations
33 ask :: RWST r w s m r | Monoid w & Monad m
34 local :: (r -> r) (RWST r w s m a) -> RWST r w s m a | Monoid w & Monad m
35 asks :: (r -> a) -> RWST r w s m a | Monoid w & Monad m
36
37 // Writer operations
38 tell :: w -> RWST r w s m () | Monoid w & Monad m
39 listen :: (RWST r w s m a) -> RWST r w s m (a, w) | Monoid w & Monad m
40 pass :: (RWST r w s m (a, w -> w)) -> RWST r w s m a | Monoid w & Monad m
41 listens :: (w -> b) (RWST r w s m a) -> RWST r w s m (a, b)| Monoid w & Monad m
42 censor :: (w -> w) (RWST r w s m a) -> RWST r w s m a | Monoid w & Monad m
43
44 // State operations
45 get :: RWST r w s m s | Monoid w & Monad m
46 put :: s -> RWST r w s m () | Monoid w & Monad m
47 modify :: (s -> s) -> RWST r w s m () | Monoid w & Monad m
48 gets :: (s -> a) -> RWST r w s m a | Monoid w & Monad m
49
50 // Lifting other operations
51 liftCallCC :: ((((a,s,w) -> m (b,s,w)) -> m (a,s,w)) -> m (a,s,w)) ((a -> RWST r w s m b) -> RWST r w s m a) -> RWST r w s m a | Monoid w
52 liftCallCC` :: ((((a,s,w) -> m (b,s,w)) -> m (a,s,w)) -> m (a,s,w)) ((a -> RWST r w s m b) -> RWST r w s m a) -> RWST r w s m a | Monoid w
53 liftCatch :: ((m (a,s,w)) (e -> m (a,s,w)) -> m (a,s,w)) (RWST l w s m a) (e -> RWST l w s m a) -> RWST l w s m a