Safe Haskell | None |
---|---|
Language | Haskell2010 |
Control.Monad.Indexed.Trans.Cont
Description
The indexed continuation transformer: see ContT
.
Documentation
newtype ContT f i j a Source #
Instances
Bind (ContT f :: k -> k -> Type -> Type) Source # | |
Apply (ContT f :: k -> k -> Type -> Type) Source # | |
Defined in Control.Monad.Indexed.Trans.Cont Methods (<*>) :: forall (i :: k0) (j :: k0) a b (k1 :: k0). ContT f i j (a -> b) -> ContT f j k1 a -> ContT f i k1 b Source # (*>) :: forall (i :: k0) (j :: k0) a (k1 :: k0) b. ContT f i j a -> ContT f j k1 b -> ContT f i k1 b Source # (<*) :: forall (i :: k0) (j :: k0) a (k1 :: k0) b. ContT f i j a -> ContT f j k1 b -> ContT f i k1 a Source # liftA2 :: forall a b c (i :: k0) (j :: k0) (k1 :: k0). (a -> b -> c) -> ContT f i j a -> ContT f j k1 b -> ContT f i k1 c Source # | |
Monad (ContT f k2 k2) Source # | |
Functor (ContT f i j) Source # | |
MonadFail m => MonadFail (ContT m k k) Source # | |
Defined in Control.Monad.Indexed.Trans.Cont | |
Applicative (ContT f k2 k2) Source # | |
Defined in Control.Monad.Indexed.Trans.Cont Methods pure :: a -> ContT f k2 k2 a # (<*>) :: ContT f k2 k2 (a -> b) -> ContT f k2 k2 a -> ContT f k2 k2 b # liftA2 :: (a -> b -> c) -> ContT f k2 k2 a -> ContT f k2 k2 b -> ContT f k2 k2 c # (*>) :: ContT f k2 k2 a -> ContT f k2 k2 b -> ContT f k2 k2 b # (<*) :: ContT f k2 k2 a -> ContT f k2 k2 b -> ContT f k2 k2 a # | |
Alternative p => Alternative (ContT p k k) Source # | |
Alternative p => MonadPlus (ContT p k k) Source # | |
evalContT :: Applicative p => ContT p a a a -> p a Source #