Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
class Liftable cat t where Source #
When providing a new instance, you should ensure it satisfies one law: * Interchange: lift . point ≡ point
Instances
Liftable ((->) :: Type -> Type -> Type) Yoneda Source # | |
Liftable ((->) :: Type -> Type -> Type) Outline Source # | |
Liftable ((->) :: Type -> Type -> Type) Jack Source # | |
Liftable ((->) :: Type -> Type -> Type) Instruction Source # | |
Defined in Pandora.Paradigm.Primary.Transformer.Instruction lift :: Covariant (->) (->) u => u a -> Instruction u a Source # | |
Liftable ((->) :: Type -> Type -> Type) (Schematic Monad t) => Liftable ((->) :: Type -> Type -> Type) ((:>) t) Source # | |
Liftable ((->) :: Type -> Type -> Type) (Backwards :: (Type -> Type) -> Type -> Type) Source # | |
Liftable ((->) :: Type -> Type -> Type) (Reverse :: (Type -> Type) -> Type -> Type) Source # | |
(forall (u :: Type -> Type). Bindable ((->) :: Type -> Type -> Type) u) => Liftable ((->) :: Type -> Type -> Type) (Continuation r) Source # | |
Defined in Pandora.Paradigm.Primary.Transformer.Continuation lift :: Covariant (->) (->) u => u a -> Continuation r u a Source # | |
(Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t' t, Distributive ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t) => Liftable ((->) :: Type -> Type -> Type) (t <:<.>:> t') Source # | |
Monoidal ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (:*:) (:*:) t => Liftable ((->) :: Type -> Type -> Type) (UT Covariant Covariant t) Source # | |
Monoidal ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (:*:) (:*:) t => Liftable ((->) :: Type -> Type -> Type) (TU Covariant Covariant t :: (Type -> Type) -> Type -> Type) Source # | |