pandora-0.4.3: A box of patterns and paradigms
Safe HaskellSafe-Inferred
LanguageHaskell2010

Pandora.Pattern.Functor.Divisible

Documentation

class Contravariant t => Divisible t where Source #

Methods

(>*<) :: t b -> t c -> t (b :*: c) infixr 5 Source #

Instances

Instances details
Divisible Predicate Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Functor.Predicate

Methods

(>*<) :: Predicate b -> Predicate c -> Predicate (b :*: c) Source #

Ringoid r => Divisible (Convergence r) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Functor.Convergence

Methods

(>*<) :: Convergence r b -> Convergence r c -> Convergence r (b :*: c) Source #

class Bivariant v => Divisible_ t v source target where Source #

Methods

divide :: Bivariant v => source r (v a b) -> target (v (t a) (t b)) (t r) Source #

Instances

Instances details
Divisible_ Predicate (:*:) ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) Source # 
Instance details

Defined in Pandora.Paradigm.Primary.Functor.Predicate

Methods

divide :: Bivariant (:*:) => (r -> (a :*: b)) -> (Predicate a :*: Predicate b) -> Predicate r Source #