Control.Monad.Constrained.Reader

This module duplicates the Control.Monad.Reader module from the mtl, for constrained monads.

Documentation

class Monad m => MonadReader r m | m -> r where

A class for reader monads.

Minimal complete definition

reader, local

Associated Types

type ReaderSuitable m a :: Constraint

Methods

ask :: ReaderSuitable m r => m r

Retrieves the environment

local :: (ReaderSuitable m a, ReaderSuitable m r) => (r -> r) -> m a -> m a

Executes a computation in a modified environment.

reader :: (ReaderSuitable m r, ReaderSuitable m a) => (r -> a) -> m a

Retrieves a function of the current environment.

Instances

MonadReader r m => MonadReader r (MaybeT m)

Associated Types

type ReaderSuitable (MaybeT m :: * -> *) a :: Constraint

Methods

ask :: MaybeT m r

local :: (ReaderSuitable (MaybeT m) a, ReaderSuitable (MaybeT m) r) => (r -> r) -> MaybeT m a -> MaybeT m a

reader :: (ReaderSuitable (MaybeT m) r, ReaderSuitable (MaybeT m) a) => (r -> a) -> MaybeT m a

MonadReader r ((->) r)

Associated Types

type ReaderSuitable ((->) r :: * -> *) a :: Constraint

Methods

ask :: r -> r

local :: (ReaderSuitable ((->) r) a, ReaderSuitable ((->) r) r) => (r -> r) -> (r -> a) -> r -> a

reader :: (ReaderSuitable ((->) r) r, ReaderSuitable ((->) r) a) => (r -> a) -> r -> a

MonadReader r m => MonadReader r (StateT s m)

Associated Types

type ReaderSuitable (StateT s m :: * -> *) a :: Constraint

Methods

ask :: StateT s m r

local :: (ReaderSuitable (StateT s m) a, ReaderSuitable (StateT s m) r) => (r -> r) -> StateT s m a -> StateT s m a

reader :: (ReaderSuitable (StateT s m) r, ReaderSuitable (StateT s m) a) => (r -> a) -> StateT s m a

MonadReader r m => MonadReader r (StateT s m)

Associated Types

type ReaderSuitable (StateT s m :: * -> *) a :: Constraint

Methods

ask :: StateT s m r

local :: (ReaderSuitable (StateT s m) a, ReaderSuitable (StateT s m) r) => (r -> r) -> StateT s m a -> StateT s m a

reader :: (ReaderSuitable (StateT s m) r, ReaderSuitable (StateT s m) a) => (r -> a) -> StateT s m a

MonadReader r m => MonadReader r (IdentityT * m)

Associated Types

type ReaderSuitable (IdentityT * m :: * -> *) a :: Constraint

Methods

ask :: IdentityT * m r

local :: (ReaderSuitable (IdentityT * m) a, ReaderSuitable (IdentityT * m) r) => (r -> r) -> IdentityT * m a -> IdentityT * m a

reader :: (ReaderSuitable (IdentityT * m) r, ReaderSuitable (IdentityT * m) a) => (r -> a) -> IdentityT * m a

MonadReader r m => MonadReader r (ExceptT e m)

Associated Types

type ReaderSuitable (ExceptT e m :: * -> *) a :: Constraint

Methods

ask :: ExceptT e m r

local :: (ReaderSuitable (ExceptT e m) a, ReaderSuitable (ExceptT e m) r) => (r -> r) -> ExceptT e m a -> ExceptT e m a

reader :: (ReaderSuitable (ExceptT e m) r, ReaderSuitable (ExceptT e m) a) => (r -> a) -> ExceptT e m a

MonadReader r m => MonadReader r (WriterT w m)

Associated Types

type ReaderSuitable (WriterT w m :: * -> *) a :: Constraint

Methods

ask :: WriterT w m r

local :: (ReaderSuitable (WriterT w m) a, ReaderSuitable (WriterT w m) r) => (r -> r) -> WriterT w m a -> WriterT w m a

reader :: (ReaderSuitable (WriterT w m) r, ReaderSuitable (WriterT w m) a) => (r -> a) -> WriterT w m a

MonadReader r' m => MonadReader r' (ContT * r m)

Associated Types

type ReaderSuitable (ContT * r m :: * -> *) a :: Constraint

Methods

ask :: ContT * r m r'

local :: (ReaderSuitable (ContT * r m) a, ReaderSuitable (ContT * r m) r') => (r' -> r') -> ContT * r m a -> ContT * r m a

reader :: (ReaderSuitable (ContT * r m) r', ReaderSuitable (ContT * r m) a) => (r' -> a) -> ContT * r m a

Monad m => MonadReader r (ReaderT * r m)

Associated Types

type ReaderSuitable (ReaderT * r m :: * -> *) a :: Constraint

Methods

ask :: ReaderT * r m r

local :: (ReaderSuitable (ReaderT * r m) a, ReaderSuitable (ReaderT * r m) r) => (r -> r) -> ReaderT * r m a -> ReaderT * r m a

reader :: (ReaderSuitable (ReaderT * r m) r, ReaderSuitable (ReaderT * r m) a) => (r -> a) -> ReaderT * r m a

newtype ReaderT k r m a :: forall k. * -> (k -> *) -> k -> *

The reader monad transformer, which adds a read-only environment to the given monad.

The return function ignores the environment, while >>= passes the inherited environment to both subcomputations.

Constructors

ReaderT

Fields

• runReaderT :: r -> m a

Instances

MonadError e m => MonadError e (ReaderT * r m)

Associated Types

type SuitableError (ReaderT * r m :: * -> *) a :: Constraint

Methods

throwError :: SuitableError (ReaderT * r m) a => e -> ReaderT * r m a

catchError :: SuitableError (ReaderT * r m) a => ReaderT * r m a -> (e -> ReaderT * r m a) -> ReaderT * r m a

Monad m => MonadReader r (ReaderT * r m)

Associated Types

type ReaderSuitable (ReaderT * r m :: * -> *) a :: Constraint

Methods

ask :: ReaderT * r m r

local :: (ReaderSuitable (ReaderT * r m) a, ReaderSuitable (ReaderT * r m) r) => (r -> r) -> ReaderT * r m a -> ReaderT * r m a

reader :: (ReaderSuitable (ReaderT * r m) r, ReaderSuitable (ReaderT * r m) a) => (r -> a) -> ReaderT * r m a

MonadState s m => MonadState s (ReaderT * r m)

Associated Types

type StateSuitable (ReaderT * r m :: * -> *) a :: Constraint

Methods

get :: ReaderT * r m s

put :: s -> ReaderT * r m ()

state :: (StateSuitable (ReaderT * r m) a, StateSuitable (ReaderT * r m) s) => (s -> (a, s)) -> ReaderT * r m a

MonadWriter w m => MonadWriter w (ReaderT * r m)

Associated Types

type WriterSuitable (ReaderT * r m :: * -> *) a :: Constraint

Methods

writer :: WriterSuitable (ReaderT * r m) a => (a, w) -> ReaderT * r m a

tell :: w -> ReaderT * r m ()

listenC :: WriterSuitable (ReaderT * r m) b => (a -> w -> b) -> ReaderT * r m a -> ReaderT * r m b

passC :: WriterSuitable (ReaderT * r m) a => (a -> w -> w) -> ReaderT * r m a -> ReaderT * r m a

MonadTrans (ReaderT * r)

Methods

lift :: Monad m => m a -> ReaderT * r m a

MonadTrans (ReaderT * r)

Associated Types

type SuitableLift (ReaderT * r :: (* -> *) -> * -> *) (m :: * -> *) a :: Constraint

Methods

lift :: (Monad m, SuitableLift (ReaderT * r) m a) => m a -> ReaderT * r m a

Monad m => Monad (ReaderT * r m)

Methods

(>>=) :: ReaderT * r m a -> (a -> ReaderT * r m b) -> ReaderT * r m b

(>>) :: ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m b

return :: a -> ReaderT * r m a

fail :: String -> ReaderT * r m a

Functor m => Functor (ReaderT * r m)

Methods

fmap :: (a -> b) -> ReaderT * r m a -> ReaderT * r m b

(<$) :: a -> ReaderT * r m b -> ReaderT * r m a

MonadFix m => MonadFix (ReaderT * r m)

Methods

mfix :: (a -> ReaderT * r m a) -> ReaderT * r m a

MonadFail m => MonadFail (ReaderT * r m)

Methods

fail :: String -> ReaderT * r m a

Applicative m => Applicative (ReaderT * r m)

Methods

pure :: a -> ReaderT * r m a

(<*>) :: ReaderT * r m (a -> b) -> ReaderT * r m a -> ReaderT * r m b

(*>) :: ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m b

(<*) :: ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m a

MonadZip m => MonadZip (ReaderT * r m)

Methods

mzip :: ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m (a, b)

mzipWith :: (a -> b -> c) -> ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m c

munzip :: ReaderT * r m (a, b) -> (ReaderT * r m a, ReaderT * r m b)

MonadIO m => MonadIO (ReaderT * r m)

Methods

liftIO :: IO a -> ReaderT * r m a

Alternative m => Alternative (ReaderT * r m)

Methods

empty :: ReaderT * r m a

(<|>) :: ReaderT * r m a -> ReaderT * r m a -> ReaderT * r m a

some :: ReaderT * r m a -> ReaderT * r m [a]

many :: ReaderT * r m a -> ReaderT * r m [a]

MonadPlus m => MonadPlus (ReaderT * r m)

Methods

mzero :: ReaderT * r m a

mplus :: ReaderT * r m a -> ReaderT * r m a -> ReaderT * r m a

Alternative m => Alternative (ReaderT * r m)

Methods

empty :: Suitable (ReaderT * r m) a => ReaderT * r m a

(<|>) :: Suitable (ReaderT * r m) a => ReaderT * r m a -> ReaderT * r m a -> ReaderT * r m a

some :: Suitable (ReaderT * r m) [a] => ReaderT * r m a -> ReaderT * r m [a]

many :: Suitable (ReaderT * r m) [a] => ReaderT * r m a -> ReaderT * r m [a]

Monad m => Monad (ReaderT * r m)

Methods

(>>=) :: Suitable (ReaderT * r m) b => ReaderT * r m a -> (a -> ReaderT * r m b) -> ReaderT * r m b

Applicative m => Applicative (ReaderT * r m)

Methods

pure :: Suitable (ReaderT * r m) a => a -> ReaderT * r m a

(<*>) :: Suitable (ReaderT * r m) b => ReaderT * r m (a -> b) -> ReaderT * r m a -> ReaderT * r m b

(*>) :: Suitable (ReaderT * r m) b => ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m b

(<*) :: Suitable (ReaderT * r m) a => ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m a

liftA :: Suitable (ReaderT * r m) b => (Vect xs -> b) -> AppVect (ReaderT * r m) xs -> ReaderT * r m b

liftA2 :: Suitable (ReaderT * r m) c => (a -> b -> c) -> ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m c

liftA3 :: Suitable (ReaderT * r m) d => (a -> b -> c -> d) -> ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m c -> ReaderT * r m d

liftA4 :: Suitable (ReaderT * r m) e => (a -> b -> c -> d -> e) -> ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m c -> ReaderT * r m d -> ReaderT * r m e

liftA5 :: Suitable (ReaderT * r m) g => (a -> b -> c -> d -> e -> g) -> ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m c -> ReaderT * r m d -> ReaderT * r m e -> ReaderT * r m g

liftA6 :: Suitable (ReaderT * r m) h => (a -> b -> c -> d -> e -> g -> h) -> ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m c -> ReaderT * r m d -> ReaderT * r m e -> ReaderT * r m g -> ReaderT * r m h

liftA7 :: Suitable (ReaderT * r m) i => (a -> b -> c -> d -> e -> g -> h -> i) -> ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m c -> ReaderT * r m d -> ReaderT * r m e -> ReaderT * r m g -> ReaderT * r m h -> ReaderT * r m i

liftA8 :: Suitable (ReaderT * r m) j => (a -> b -> c -> d -> e -> g -> h -> i -> j) -> ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m c -> ReaderT * r m d -> ReaderT * r m e -> ReaderT * r m g -> ReaderT * r m h -> ReaderT * r m i -> ReaderT * r m j

liftA9 :: Suitable (ReaderT * r m) k => (a -> b -> c -> d -> e -> g -> h -> i -> j -> k) -> ReaderT * r m a -> ReaderT * r m b -> ReaderT * r m c -> ReaderT * r m d -> ReaderT * r m e -> ReaderT * r m g -> ReaderT * r m h -> ReaderT * r m i -> ReaderT * r m j -> ReaderT * r m k

Functor m => Functor (ReaderT * r m)

Associated Types

type Suitable (ReaderT * r m :: * -> *) a :: Constraint

Methods

fmap :: Suitable (ReaderT * r m) b => (a -> b) -> ReaderT * r m a -> ReaderT * r m b

(<$) :: Suitable (ReaderT * r m) a => a -> ReaderT * r m b -> ReaderT * r m a

MonadCont m => MonadCont (ReaderT * r m)

Methods

callCC :: ((a -> ReaderT * r m b) -> ReaderT * r m a) -> ReaderT * r m a

MonadIO m => MonadIO (ReaderT * r m)

Associated Types

type SuitableIO (ReaderT * r m :: * -> *) a :: Constraint

Methods

liftIO :: SuitableIO (ReaderT * r m) a => IO a -> ReaderT * r m a

type SuitableLift (ReaderT * r) m a

type SuitableLift (ReaderT * r) m a = ()

type Suitable (ReaderT * r m) a

type Suitable (ReaderT * r m) a = Suitable m a

type SuitableError (ReaderT * r m) a

type SuitableError (ReaderT * r m) a = SuitableError m a

type SuitableIO (ReaderT * r m) a

type SuitableIO (ReaderT * r m) a = SuitableIO m a

type ReaderSuitable (ReaderT * r m) a

type ReaderSuitable (ReaderT * r m) a = Suitable m a

type StateSuitable (ReaderT * r m) a

type StateSuitable (ReaderT * r m) a = StateSuitable m a

type WriterSuitable (ReaderT * r m) a

type WriterSuitable (ReaderT * r m) a = WriterSuitable m a

type Reader r = ReaderT * r Identity

The parameterizable reader monad.

Computations are functions of a shared environment.

The return function ignores the environment, while >>= passes the inherited environment to both subcomputations.