Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Pandora.Pattern.Transformer.Lowerable
Documentation
class Lowerable t where Source #
When providing a new instance, you should ensure it satisfies one law: * Interchange: extract . lower ≡ extract
Instances
(forall (t :: Type -> Type). Bindable t ((->) :: Type -> Type -> Type), forall (t :: Type -> Type). Pointable t ((->) :: Type -> Type -> Type)) => Lowerable Instruction Source # | |
Lowerable Construction Source # | |
Lowerable Tap Source # | |
Extractable t ((->) :: Type -> Type -> Type) => 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' ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type), Distributive t' ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type)) => Lowerable (t <:<.>:> t') Source # | |
Extractable t ((->) :: Type -> Type -> Type) => Lowerable (UT Covariant Covariant t) Source # | |
Extractable t ((->) :: Type -> Type -> Type) => Lowerable (TU Covariant Covariant t :: (Type -> Type) -> Type -> Type) Source # | |