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 s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

tell :: w -> TaggedT s m ()

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

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

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

Defined in Data.Functor.Trans.Tagged

Methods

get :: TaggedT s m t

put :: t -> TaggedT s m ()

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

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

Defined in Data.Functor.Trans.Tagged

Methods

ask :: TaggedT s m r

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

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

ComonadTrans (TaggedT s :: (Type -> Type) -> Type -> Type)

Defined in Data.Functor.Trans.Tagged

Methods

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

ComonadHoist (TaggedT s :: (Type -> Type) -> Type -> Type)

Defined in Data.Functor.Trans.Tagged

Methods

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

MonadTrans (TaggedT s :: (Type -> Type) -> Type -> Type)

Defined in Data.Functor.Trans.Tagged

Methods

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

Monad m => Monad (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

return :: a -> TaggedT s m a

Functor m => Functor (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

MonadFix m => MonadFix (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

Applicative m => Applicative (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

pure :: a -> TaggedT s m a

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

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

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

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

Foldable f => Foldable (TaggedT s f)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

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

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

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

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

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

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

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

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

null :: TaggedT s f a -> Bool

length :: TaggedT s f a -> Int

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

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

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

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

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

Traversable f => Traversable (TaggedT s f)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

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

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

Contravariant m => Contravariant (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

MonadIO m => MonadIO (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

liftIO :: IO a -> TaggedT s m a

Alternative m => Alternative (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

empty :: TaggedT s m a

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

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

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

MonadPlus m => MonadPlus (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

mzero :: TaggedT s m a

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

Comonad w => Comonad (TaggedT s w)

Defined in Data.Functor.Trans.Tagged

Methods

extract :: TaggedT s w a -> a

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

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

Distributive f => Distributive (TaggedT s f)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

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

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

MonadThrow m => MonadThrow (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

MonadCatch m => MonadCatch (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

MonadMask m => MonadMask (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

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

MonadCont m => MonadCont (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

Plus m => Plus (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

zero :: TaggedT s m a

Alt m => Alt (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

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

Apply m => Apply (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

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

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

Bind m => Bind (TaggedT s m)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

Extend f => Extend (TaggedT s f)

Defined in Data.Functor.Trans.Tagged

Methods

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

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

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

Defined in Data.Functor.Trans.Tagged

Methods

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

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

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

Defined in Data.Functor.Trans.Tagged

Methods

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

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

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

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

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

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

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

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

Defined in Data.Functor.Trans.Tagged

Methods

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

readList :: ReadS [TaggedT s m b]

readPrec :: ReadPrec (TaggedT s m b)

readListPrec :: ReadPrec [TaggedT s m b]

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

Defined in Data.Functor.Trans.Tagged

Methods

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

show :: TaggedT s m b -> String

showList :: [TaggedT 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