Modulelinear-base-0.4.0Haskell2010

Control.Functor.Linear.Internal.Reader

2 types
10 values

Packagelinear-base-0.4.0
Exports12
LanguageHaskell2010
LicenceMIT
SourceReader.hs

typetype Reader r = ReaderT r Identity

valuereader :: Monad m => (r %1 -> a) %1 -> ReaderT r m a

valuerunReader :: Reader r a %1 -> r %1 -> a

valuemapReader :: (a %1 -> b) %1 -> Reader r a %1 -> Reader r b

valuewithReader :: (r' %1 -> r) %1 -> Reader r a %1 -> Reader r' a

newtypenewtype ReaderT r (m :: Type -> Type) a

A linear reader monad transformer. This reader monad requires that use of the read-only state is explict.

The monad instance requires that r be Dupable. This means that you should use the linear reader monad just like the non-linear monad, except that the type system ensures that you explicity use or discard the read-only state (with the Consumable instance).

Constructors

ReaderT (r %1 -> m a)

Instances6MonadTrans, Monad, Functor, Applicative

Dupable r => MonadTrans (ReaderT r)Defined in linear-base-0.4.0 · Control.Functor.Linear.Internal.Reader
(Applicative m, Dupable r) => Applicative (ReaderT r m)Defined in linear-base-0.4.0 · Control.Functor.Linear.Internal.Reader
Functor m => Functor (ReaderT r m)Defined in linear-base-0.4.0 · Control.Functor.Linear.Internal.Reader
(Monad m, Dupable r) => Monad (ReaderT r m)Defined in linear-base-0.4.0 · Control.Functor.Linear.Internal.Reader
Functor m => Functor (ReaderT r m)Defined in linear-base-0.4.0 · Control.Functor.Linear.Internal.Reader
(Applicative m, Dupable r) => Applicative (ReaderT r m)Defined in linear-base-0.4.0 · Control.Functor.Linear.Internal.Reader

valuerunReaderT :: ReaderT r m a %1 -> r %1 -> m a

Provide an intial read-only state and run the monadic computation in a reader monad transformer

valuemapReaderT :: (m a %1 -> n b) %1 -> ReaderT r m a %1 -> ReaderT r n b

valuewithReaderT :: (r' %1 -> r) %1 -> ReaderT r m a %1 -> ReaderT r' m a

valueask :: Applicative m => ReaderT r m r

valuelocal :: (r %1 -> r) %1 -> ReaderT r m a %1 -> ReaderT r m a

valueasks :: Monad m => (r %1 -> a) %1 -> ReaderT r m a

Orphan instances

4 instances

MonadTrans (ReaderT r)
Applicative m => Applicative (ReaderT r m)
Functor m => Functor (ReaderT r m)
Monad m => Monad (ReaderT r m)