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