Data.Functor.Trans.Tagged

Tagged values

newtype TaggedT s m b

A Tagged monad parameterized by:

• s - the phantom type
• m - the inner monad
• b - the tagged value

| A TaggedT s m b value is a monadic value m b with an attached phantom type s. This can be used in place of the more traditional but less safe idiom of passing in an undefined value with the type, because unlike an (s -> m b), a TaggedT s m b can't try to use the argument s as a real value.

Moreover, you don't have to rely on the compiler to inline away the extra argument, because the newtype is "free"

Constructors

TagT

Fields

• untagT :: m b

Instances

MonadWriter w m => MonadWriter w (TaggedT k * s m)

Methods

writer :: (a, w) -> TaggedT k * s m a

tell :: w -> TaggedT k * s m ()

listen :: TaggedT k * s m a -> TaggedT k * s m (a, w)

pass :: TaggedT k * s m (a, w -> w) -> TaggedT k * s m a

MonadState t m => MonadState t (TaggedT k * s m)

Methods

get :: TaggedT k * s m t

put :: t -> TaggedT k * s m ()

state :: (t -> (a, t)) -> TaggedT k * s m a

MonadReader r m => MonadReader r (TaggedT k * s m)

Methods

ask :: TaggedT k * s m r

local :: (r -> r) -> TaggedT k * s m a -> TaggedT k * s m a

reader :: (r -> a) -> TaggedT k * s m a

ComonadTrans (TaggedT k * s)

Methods

lower :: Comonad w => TaggedT k * s w a -> w a

ComonadHoist (TaggedT k * s)

Methods

cohoist :: (Comonad w, Comonad v) => (forall x. w x -> v x) -> TaggedT k * s w a -> TaggedT k * s v a

MonadTrans (TaggedT k * s)

Methods

lift :: Monad m => m a -> TaggedT k * s m a

Monad m => Monad (TaggedT k * s m)

Methods

(>>=) :: TaggedT k * s m a -> (a -> TaggedT k * s m b) -> TaggedT k * s m b

(>>) :: TaggedT k * s m a -> TaggedT k * s m b -> TaggedT k * s m b

return :: a -> TaggedT k * s m a

fail :: String -> TaggedT k * s m a

Functor m => Functor (TaggedT k * s m)

Methods

fmap :: (a -> b) -> TaggedT k * s m a -> TaggedT k * s m b

(<$) :: a -> TaggedT k * s m b -> TaggedT k * s m a

MonadFix m => MonadFix (TaggedT k * s m)

Methods

mfix :: (a -> TaggedT k * s m a) -> TaggedT k * s m a

Applicative m => Applicative (TaggedT k * s m)

Methods

pure :: a -> TaggedT k * s m a

(<*>) :: TaggedT k * s m (a -> b) -> TaggedT k * s m a -> TaggedT k * s m b

liftA2 :: (a -> b -> c) -> TaggedT k * s m a -> TaggedT k * s m b -> TaggedT k * s m c

(*>) :: TaggedT k * s m a -> TaggedT k * s m b -> TaggedT k * s m b

(<*) :: TaggedT k * s m a -> TaggedT k * s m b -> TaggedT k * s m a

Foldable f => Foldable (TaggedT k * s f)

Methods

fold :: Monoid m => TaggedT k * s f m -> m

foldMap :: Monoid m => (a -> m) -> TaggedT k * s f a -> m

foldr :: (a -> b -> b) -> b -> TaggedT k * s f a -> b

foldr' :: (a -> b -> b) -> b -> TaggedT k * s f a -> b

foldl :: (b -> a -> b) -> b -> TaggedT k * s f a -> b

foldl' :: (b -> a -> b) -> b -> TaggedT k * s f a -> b

foldr1 :: (a -> a -> a) -> TaggedT k * s f a -> a

foldl1 :: (a -> a -> a) -> TaggedT k * s f a -> a

toList :: TaggedT k * s f a -> [a]

null :: TaggedT k * s f a -> Bool

length :: TaggedT k * s f a -> Int

elem :: Eq a => a -> TaggedT k * s f a -> Bool

maximum :: Ord a => TaggedT k * s f a -> a

minimum :: Ord a => TaggedT k * s f a -> a

sum :: Num a => TaggedT k * s f a -> a

product :: Num a => TaggedT k * s f a -> a

Traversable f => Traversable (TaggedT k * s f)

Methods

traverse :: Applicative f => (a -> f b) -> TaggedT k * s f a -> f (TaggedT k * s f b)

sequenceA :: Applicative f => TaggedT k * s f (f a) -> f (TaggedT k * s f a)

mapM :: Monad m => (a -> m b) -> TaggedT k * s f a -> m (TaggedT k * s f b)

sequence :: Monad m => TaggedT k * s f (m a) -> m (TaggedT k * s f a)

MonadIO m => MonadIO (TaggedT k * s m)

Methods

liftIO :: IO a -> TaggedT k * s m a

Alternative m => Alternative (TaggedT k * s m)

Methods

empty :: TaggedT k * s m a

(<|>) :: TaggedT k * s m a -> TaggedT k * s m a -> TaggedT k * s m a

some :: TaggedT k * s m a -> TaggedT k * s m [a]

many :: TaggedT k * s m a -> TaggedT k * s m [a]

MonadPlus m => MonadPlus (TaggedT k * s m)

Methods

mzero :: TaggedT k * s m a

mplus :: TaggedT k * s m a -> TaggedT k * s m a -> TaggedT k * s m a

Comonad w => Comonad (TaggedT k * s w)

Methods

extract :: TaggedT k * s w a -> a

duplicate :: TaggedT k * s w a -> TaggedT k * s w (TaggedT k * s w a)

extend :: (TaggedT k * s w a -> b) -> TaggedT k * s w a -> TaggedT k * s w b

Contravariant m => Contravariant (TaggedT k * s m)

Methods

contramap :: (a -> b) -> TaggedT k * s m b -> TaggedT k * s m a

(>$) :: b -> TaggedT k * s m b -> TaggedT k * s m a

Distributive f => Distributive (TaggedT k * s f)

Methods

distribute :: Functor f => f (TaggedT k * s f a) -> TaggedT k * s f (f a)

collect :: Functor f => (a -> TaggedT k * s f b) -> f a -> TaggedT k * s f (f b)

distributeM :: Monad m => m (TaggedT k * s f a) -> TaggedT k * s f (m a)

collectM :: Monad m => (a -> TaggedT k * s f b) -> m a -> TaggedT k * s f (m b)

MonadThrow m => MonadThrow (TaggedT k * s m)

Methods

throwM :: Exception e => e -> TaggedT k * s m a

MonadCatch m => MonadCatch (TaggedT k * s m)

Methods

catch :: Exception e => TaggedT k * s m a -> (e -> TaggedT k * s m a) -> TaggedT k * s m a

MonadMask m => MonadMask (TaggedT k * s m)

Methods

mask :: ((forall a. TaggedT k * s m a -> TaggedT k * s m a) -> TaggedT k * s m b) -> TaggedT k * s m b

uninterruptibleMask :: ((forall a. TaggedT k * s m a -> TaggedT k * s m a) -> TaggedT k * s m b) -> TaggedT k * s m b

generalBracket :: TaggedT k * s m a -> (a -> ExitCase b -> TaggedT k * s m c) -> (a -> TaggedT k * s m b) -> TaggedT k * s m (b, c)

MonadCont m => MonadCont (TaggedT k * s m)

Methods

callCC :: ((a -> TaggedT k * s m b) -> TaggedT k * s m a) -> TaggedT k * s m a

Plus m => Plus (TaggedT k * s m)

Methods

zero :: TaggedT k * s m a

Alt m => Alt (TaggedT k * s m)

Methods

(<!>) :: TaggedT k * s m a -> TaggedT k * s m a -> TaggedT k * s m a

some :: Applicative (TaggedT k * s m) => TaggedT k * s m a -> TaggedT k * s m [a]

many :: Applicative (TaggedT k * s m) => TaggedT k * s m a -> TaggedT k * s m [a]

Apply m => Apply (TaggedT k * s m)

Methods

(<.>) :: TaggedT k * s m (a -> b) -> TaggedT k * s m a -> TaggedT k * s m b

(.>) :: TaggedT k * s m a -> TaggedT k * s m b -> TaggedT k * s m b

(<.) :: TaggedT k * s m a -> TaggedT k * s m b -> TaggedT k * s m a

liftF2 :: (a -> b -> c) -> TaggedT k * s m a -> TaggedT k * s m b -> TaggedT k * s m c

Bind m => Bind (TaggedT k * s m)

Methods

(>>-) :: TaggedT k * s m a -> (a -> TaggedT k * s m b) -> TaggedT k * s m b

join :: TaggedT k * s m (TaggedT k * s m a) -> TaggedT k * s m a

Extend f => Extend (TaggedT k * s f)

Methods

duplicated :: TaggedT k * s f a -> TaggedT k * s f (TaggedT k * s f a)

extended :: (TaggedT k * s f a -> b) -> TaggedT k * s f a -> TaggedT k * s f b

Eq (m b) => Eq (TaggedT k1 k2 s m b)

Methods

(==) :: TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b -> Bool

(/=) :: TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b -> Bool

Ord (m b) => Ord (TaggedT k1 k2 s m b)

Methods

compare :: TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b -> Ordering

(<) :: TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b -> Bool

(<=) :: TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b -> Bool

(>) :: TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b -> Bool

(>=) :: TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b -> Bool

max :: TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b

min :: TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b -> TaggedT k1 k2 s m b

Read (m b) => Read (TaggedT k1 k2 s m b)

Methods

readsPrec :: Int -> ReadS (TaggedT k1 k2 s m b)

readList :: ReadS [TaggedT k1 k2 s m b]

readPrec :: ReadPrec (TaggedT k1 k2 s m b)

readListPrec :: ReadPrec [TaggedT k1 k2 s m b]

Show (m b) => Show (TaggedT k1 k2 s m b)

Methods

showsPrec :: Int -> TaggedT k1 k2 s m b -> ShowS

show :: TaggedT k1 k2 s m b -> String

showList :: [TaggedT k1 k2 s m b] -> ShowS

type Tagged s b = TaggedT s Identity b

A Tagged s b value is a value b with an attached phantom type s. This can be used in place of the more traditional but less safe idiom of passing in an undefined value with the type, because unlike an (s -> b), a Tagged s b can't try to use the argument s as a real value.

Moreover, you don't have to rely on the compiler to inline away the extra argument, because the newtype is "free"

tag :: b -> Tagged s b

Tag a value in Identity monad

tagT :: m b -> TaggedT s m b

Easier to type alias for TagT

untag :: Tagged s b -> b

Untag a value in Identity monad

retag :: TaggedT s m b -> TaggedT t m b

Some times you need to change the tag you have lying around. Idiomatic usage is to make a new combinator for the relationship between the tags that you want to enforce, and define that combinator using retag.

data Succ n
retagSucc :: Tagged n a -> Tagged (Succ n) a
retagSucc = retag

mapTaggedT :: (m a -> n b) -> TaggedT s m a -> TaggedT s n b

Lift an operation on underlying monad

reflected :: forall s m a. (Applicative m, Reifies s a) => TaggedT s m a

Reflect reified value back in Applicative context

reflectedM :: forall s m a. (Monad m, Reifies s a) => TaggedT s m a

Reflect reified value back in Monad context

asTaggedTypeOf :: s -> TaggedT s m b -> s

asTaggedTypeOf is a type-restricted version of const. It is usually used as an infix operator, and its typing forces its first argument (which is usually overloaded) to have the same type as the tag of the second.

proxy :: Tagged s b -> Proxy s -> b

Convert from a Tagged representation to a representation based on a Proxy.

proxyT :: TaggedT s m b -> Proxy s -> m b

Convert from a TaggedT representation to a representation based on a Proxy.

unproxy :: (Proxy s -> a) -> Tagged s a

Convert from a representation based on a Proxy to a Tagged representation.

unproxyT :: (Proxy s -> m a) -> TaggedT s m a

Convert from a representation based on a Proxy to a TaggedT representation.

tagSelf :: a -> Tagged a a

Tag a value with its own type.

tagTSelf :: m a -> TaggedT a m a

Tag a value with its own type.

untagSelf :: Tagged a a -> a

untagSelf is a type-restricted version of untag.

untagTSelf :: TaggedT a m a -> m a

untagSelf is a type-restricted version of untag.

tagWith :: proxy s -> a -> Tagged s a

Another way to convert a proxy to a tag.

tagTWith :: proxy s -> m a -> TaggedT s m a

Another way to convert a proxy to a tag.

witness :: Tagged a b -> a -> b

witnessT :: TaggedT a m b -> a -> m b