Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Documentation
class Lowerable t where Source #
When providing a new instance, you should ensure it satisfies one law: * Interchange: extract . lower ≡ extract
Instances
Lowerable Tap Source # | |
Lowerable Construction Source # | |
Extractable t => Lowerable (Day t) Source # | |
Lowerable (Backwards :: (Type -> Type) -> Type -> Type) Source # | |
Lowerable (Reverse :: (Type -> Type) -> Type -> Type) Source # | |
Lowerable (Schematic Comonad t) => Lowerable ((:<) t) Source # | |
(Adjoint t t', Distributive t') => Lowerable (t <:<.>:> t') Source # | |
Lowerable (U_T Covariant Covariant t) Source # | |
Lowerable (T_U Covariant Covariant t) Source # | |
Extractable t => Lowerable (UT Covariant Covariant t) Source # | |
Extractable t => Lowerable (TU Covariant Covariant t :: (Type -> Type) -> Type -> Type) Source # | |