Pandora.Pattern.Functor.Contravariant

Documentation

class Contravariant (t :: * -> *) where

When providing a new instance, you should ensure it satisfies the two laws:
* Identity morphism: contramap identity ≡ identity
* Interpreted of morphisms: contramap f . contramap g ≡ contramap (g . f)

Minimal complete definition

(>$<)

Methods

(>$<) :: (a -> b) -> t b -> t a infixl 4

Infix version of contramap

contramap :: (a -> b) -> t b -> t a

Prefix version of >$<

(>$) :: b -> t b -> t a infixl 4

Replace all locations in the output with the same value

($<) :: t b -> b -> t a infixl 4

Flipped version of >$

full :: t () -> t a

Fill the input of evaluation

(>&<) :: t b -> (a -> b) -> t a

Flipped infix version of contramap

(>$$<) :: Contravariant u => (a -> b) -> ((t :. u) := a) -> (t :. u) := b

Infix versions of contramap with various nesting levels

(>$$$<) :: (Contravariant u, Contravariant v) => (a -> b) -> ((t :. (u :. v)) := b) -> (t :. (u :. v)) := a

(>$$$$<) :: (Contravariant u, Contravariant v, Contravariant w) => (a -> b) -> ((t :. (u :. (v :. w))) := a) -> (t :. (u :. (v :. w))) := b

(>&&<) :: Contravariant u => ((t :. u) := a) -> (a -> b) -> (t :. u) := b

Infix flipped versions of contramap with various nesting levels

(>&&&<) :: (Contravariant u, Contravariant v) => ((t :. (u :. v)) := b) -> (a -> b) -> (t :. (u :. v)) := a

(>&&&&<) :: (Contravariant u, Contravariant v, Contravariant w) => ((t :. (u :. (v :. w))) := a) -> (a -> b) -> (t :. (u :. (v :. w))) := b

Instances

Contravariant Predicate

Defined in Pandora.Paradigm.Primary.Functor.Predicate

Methods

(>$<) :: (a -> b) -> Predicate b -> Predicate a

contramap :: (a -> b) -> Predicate b -> Predicate a

(>$) :: b -> Predicate b -> Predicate a

($<) :: Predicate b -> b -> Predicate a

full :: Predicate () -> Predicate a

(>&<) :: Predicate b -> (a -> b) -> Predicate a

(>$$<) :: Contravariant u => (a -> b) -> ((Predicate :. u) := a) -> (Predicate :. u) := b

(>$$$<) :: (Contravariant u, Contravariant v) => (a -> b) -> ((Predicate :. (u :. v)) := b) -> (Predicate :. (u :. v)) := a

(>$$$$<) :: (Contravariant u, Contravariant v, Contravariant w) => (a -> b) -> ((Predicate :. (u :. (v :. w))) := a) -> (Predicate :. (u :. (v :. w))) := b

(>&&<) :: Contravariant u => ((Predicate :. u) := a) -> (a -> b) -> (Predicate :. u) := b

(>&&&<) :: (Contravariant u, Contravariant v) => ((Predicate :. (u :. v)) := b) -> (a -> b) -> (Predicate :. (u :. v)) := a

(>&&&&<) :: (Contravariant u, Contravariant v, Contravariant w) => ((Predicate :. (u :. (v :. w))) := a) -> (a -> b) -> (Predicate :. (u :. (v :. w))) := b

Contravariant (Proxy :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Proxy

Methods

(>$<) :: (a -> b) -> Proxy b -> Proxy a

contramap :: (a -> b) -> Proxy b -> Proxy a

(>$) :: b -> Proxy b -> Proxy a

($<) :: Proxy b -> b -> Proxy a

full :: Proxy () -> Proxy a

(>&<) :: Proxy b -> (a -> b) -> Proxy a

(>$$<) :: Contravariant u => (a -> b) -> ((Proxy :. u) := a) -> (Proxy :. u) := b

(>$$$<) :: (Contravariant u, Contravariant v) => (a -> b) -> ((Proxy :. (u :. v)) := b) -> (Proxy :. (u :. v)) := a

(>$$$$<) :: (Contravariant u, Contravariant v, Contravariant w) => (a -> b) -> ((Proxy :. (u :. (v :. w))) := a) -> (Proxy :. (u :. (v :. w))) := b

(>&&<) :: Contravariant u => ((Proxy :. u) := a) -> (a -> b) -> (Proxy :. u) := b

(>&&&<) :: (Contravariant u, Contravariant v) => ((Proxy :. (u :. v)) := b) -> (a -> b) -> (Proxy :. (u :. v)) := a

(>&&&&<) :: (Contravariant u, Contravariant v, Contravariant w) => ((Proxy :. (u :. (v :. w))) := a) -> (a -> b) -> (Proxy :. (u :. (v :. w))) := b

Contravariant (Constant a :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Constant

Methods

(>$<) :: (a0 -> b) -> Constant a b -> Constant a a0

contramap :: (a0 -> b) -> Constant a b -> Constant a a0

(>$) :: b -> Constant a b -> Constant a a0

($<) :: Constant a b -> b -> Constant a a0

full :: Constant a () -> Constant a a0

(>&<) :: Constant a b -> (a0 -> b) -> Constant a a0

(>$$<) :: Contravariant u => (a0 -> b) -> ((Constant a :. u) := a0) -> (Constant a :. u) := b

(>$$$<) :: (Contravariant u, Contravariant v) => (a0 -> b) -> ((Constant a :. (u :. v)) := b) -> (Constant a :. (u :. v)) := a0

(>$$$$<) :: (Contravariant u, Contravariant v, Contravariant w) => (a0 -> b) -> ((Constant a :. (u :. (v :. w))) := a0) -> (Constant a :. (u :. (v :. w))) := b

(>&&<) :: Contravariant u => ((Constant a :. u) := a0) -> (a0 -> b) -> (Constant a :. u) := b

(>&&&<) :: (Contravariant u, Contravariant v) => ((Constant a :. (u :. v)) := b) -> (a0 -> b) -> (Constant a :. (u :. v)) := a0

(>&&&&<) :: (Contravariant u, Contravariant v, Contravariant w) => ((Constant a :. (u :. (v :. w))) := a0) -> (a0 -> b) -> (Constant a :. (u :. (v :. w))) := b

Contravariant t => Contravariant (Backwards t)

Defined in Pandora.Paradigm.Primary.Transformer.Backwards

Methods

(>$<) :: (a -> b) -> Backwards t b -> Backwards t a

contramap :: (a -> b) -> Backwards t b -> Backwards t a

(>$) :: b -> Backwards t b -> Backwards t a

($<) :: Backwards t b -> b -> Backwards t a

full :: Backwards t () -> Backwards t a

(>&<) :: Backwards t b -> (a -> b) -> Backwards t a

(>$$<) :: Contravariant u => (a -> b) -> ((Backwards t :. u) := a) -> (Backwards t :. u) := b

(>$$$<) :: (Contravariant u, Contravariant v) => (a -> b) -> ((Backwards t :. (u :. v)) := b) -> (Backwards t :. (u :. v)) := a

(>$$$$<) :: (Contravariant u, Contravariant v, Contravariant w) => (a -> b) -> ((Backwards t :. (u :. (v :. w))) := a) -> (Backwards t :. (u :. (v :. w))) := b

(>&&<) :: Contravariant u => ((Backwards t :. u) := a) -> (a -> b) -> (Backwards t :. u) := b

(>&&&<) :: (Contravariant u, Contravariant v) => ((Backwards t :. (u :. v)) := b) -> (a -> b) -> (Backwards t :. (u :. v)) := a

(>&&&&<) :: (Contravariant u, Contravariant v, Contravariant w) => ((Backwards t :. (u :. (v :. w))) := a) -> (a -> b) -> (Backwards t :. (u :. (v :. w))) := b

Contravariant t => Contravariant (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

(>$<) :: (a -> b) -> Reverse t b -> Reverse t a

contramap :: (a -> b) -> Reverse t b -> Reverse t a

(>$) :: b -> Reverse t b -> Reverse t a

($<) :: Reverse t b -> b -> Reverse t a

full :: Reverse t () -> Reverse t a

(>&<) :: Reverse t b -> (a -> b) -> Reverse t a

(>$$<) :: Contravariant u => (a -> b) -> ((Reverse t :. u) := a) -> (Reverse t :. u) := b

(>$$$<) :: (Contravariant u, Contravariant v) => (a -> b) -> ((Reverse t :. (u :. v)) := b) -> (Reverse t :. (u :. v)) := a

(>$$$$<) :: (Contravariant u, Contravariant v, Contravariant w) => (a -> b) -> ((Reverse t :. (u :. (v :. w))) := a) -> (Reverse t :. (u :. (v :. w))) := b

(>&&<) :: Contravariant u => ((Reverse t :. u) := a) -> (a -> b) -> (Reverse t :. u) := b

(>&&&<) :: (Contravariant u, Contravariant v) => ((Reverse t :. (u :. v)) := b) -> (a -> b) -> (Reverse t :. (u :. v)) := a

(>&&&&<) :: (Contravariant u, Contravariant v, Contravariant w) => ((Reverse t :. (u :. (v :. w))) := a) -> (a -> b) -> (Reverse t :. (u :. (v :. w))) := b

Contravariant (Kan (Left :: Type -> Wye Type) t u b)

Defined in Pandora.Paradigm.Primary.Transformer.Kan

Methods

(>$<) :: (a -> b0) -> Kan Left t u b b0 -> Kan Left t u b a

contramap :: (a -> b0) -> Kan Left t u b b0 -> Kan Left t u b a

(>$) :: b0 -> Kan Left t u b b0 -> Kan Left t u b a

($<) :: Kan Left t u b b0 -> b0 -> Kan Left t u b a

full :: Kan Left t u b () -> Kan Left t u b a

(>&<) :: Kan Left t u b b0 -> (a -> b0) -> Kan Left t u b a

(>$$<) :: Contravariant u0 => (a -> b0) -> ((Kan Left t u b :. u0) := a) -> (Kan Left t u b :. u0) := b0

(>$$$<) :: (Contravariant u0, Contravariant v) => (a -> b0) -> ((Kan Left t u b :. (u0 :. v)) := b0) -> (Kan Left t u b :. (u0 :. v)) := a

(>$$$$<) :: (Contravariant u0, Contravariant v, Contravariant w) => (a -> b0) -> ((Kan Left t u b :. (u0 :. (v :. w))) := a) -> (Kan Left t u b :. (u0 :. (v :. w))) := b0

(>&&<) :: Contravariant u0 => ((Kan Left t u b :. u0) := a) -> (a -> b0) -> (Kan Left t u b :. u0) := b0

(>&&&<) :: (Contravariant u0, Contravariant v) => ((Kan Left t u b :. (u0 :. v)) := b0) -> (a -> b0) -> (Kan Left t u b :. (u0 :. v)) := a

(>&&&&<) :: (Contravariant u0, Contravariant v, Contravariant w) => ((Kan Left t u b :. (u0 :. (v :. w))) := a) -> (a -> b0) -> (Kan Left t u b :. (u0 :. (v :. w))) := b0