pandora-0.2.8: A box of patterns and paradigms

Safe HaskellSafe
LanguageHaskell2010

Pandora.Pattern.Transformer.Lowerable

Synopsis

Documentation

class Lowerable t where Source #

When providing a new instance, you should ensure it satisfies one law:
* Interchange: extract . lower ≡ extract

Methods

lower :: Extractable u => t u ~> u Source #

Instances
Lowerable Construction Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Transformer.Construction

Lowerable (Backwards :: (Type -> Type) -> Type -> Type) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Transformer.Backwards

Methods

lower :: Extractable u => Backwards u ~> u Source #

Lowerable (Reverse :: (Type -> Type) -> Type -> Type) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

lower :: Extractable u => Reverse u ~> u Source #

Extractable t => Lowerable (UT Covariant Covariant t) Source # 
Instance details

Defined in Pandora.Paradigm.Controlflow.Joint.Schemes.UT

Extractable t => Lowerable (TU Covariant Covariant t :: (Type -> Type) -> Type -> Type) Source # 
Instance details

Defined in Pandora.Paradigm.Controlflow.Joint.Schemes.TU

(Adjoint t t', Distributive t') => Lowerable (TUT Covariant Covariant Covariant t t') Source # 
Instance details

Defined in Pandora.Paradigm.Controlflow.Joint.Schemes.TUT