Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
class Lowerable cat t where Source #
When providing a new instance, you should ensure it satisfies one law: * Interchange: extract . lower ≡ extract
Instances
Lowerable ((->) :: Type -> Type -> Type) Tap Source # | |
(forall (t :: Type -> Type). Bindable ((->) :: Type -> Type -> Type) t, forall (t :: Type -> Type). Monoidal (-->) (-->) (:*:) (:*:) t) => Lowerable ((->) :: Type -> Type -> Type) Instruction Source # | |
Defined in Pandora.Paradigm.Primary.Transformer.Instruction lower :: Covariant (->) (->) u => Instruction u a -> u a Source # | |
(forall (u :: Type -> Type). Semimonoidal (<--) (:*:) (:*:) u) => Lowerable ((->) :: Type -> Type -> Type) Construction Source # | |
Defined in Pandora.Paradigm.Primary.Transformer.Construction lower :: Covariant (->) (->) u => Construction u a -> u a Source # | |
Lowerable ((->) :: Type -> Type -> Type) (Backwards :: (Type -> Type) -> Type -> Type) Source # | |
Lowerable ((->) :: Type -> Type -> Type) (Reverse :: (Type -> Type) -> Type -> Type) Source # | |
Lowerable ((->) :: Type -> Type -> Type) (Schematic Comonad t) => Lowerable ((->) :: Type -> Type -> Type) ((:<) t) Source # | |
(Adjoint ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t t', Distributive ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t') => Lowerable ((->) :: Type -> Type -> Type) (t <:<.>:> t') Source # | |
Monoidal (<--) (-->) (:*:) (:*:) t => Lowerable ((->) :: Type -> Type -> Type) (UT Covariant Covariant t) Source # | |
Monoidal (<--) (-->) (:*:) (:*:) t => Lowerable ((->) :: Type -> Type -> Type) (TU Covariant Covariant t :: (Type -> Type) -> Type -> Type) Source # | |
Monoidal (<--) (-->) (:*:) (:*:) t => Lowerable ((->) :: Type -> Type -> Type) (TT Covariant Covariant t :: (Type -> Type) -> Type -> Type) Source # | |