Pandora.Paradigm.Primary.Transformer.Reverse

Documentation

newtype Reverse t a

Constructors

Reverse (t a)

Instances

(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Monoidal (-->) (-->) (:*:) (:*:) t) => Monoidal (-->) (-->) (:*:) (:*:) (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

unit :: Proxy (:*:) -> (Unit (:*:) --> a) --> Reverse t a

(Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t, Monoidal (<--) (-->) (:*:) (:*:) t) => Monoidal (<--) (-->) (:*:) (:*:) (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

unit :: Proxy (:*:) -> (Unit (:*:) --> a) <-- Reverse t a

(Semimonoidal (-->) (:*:) (:*:) t, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t) => Semimonoidal (-->) (:*:) (:*:) (Reverse t :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

mult :: forall (a :: k) (b :: k). (Reverse t a :*: Reverse t b) --> Reverse t (a :*: b)

(Semimonoidal (<--) (:*:) (:*:) t, Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t) => Semimonoidal (<--) (:*:) (:*:) (Reverse t :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

mult :: forall (a :: k) (b :: k). (Reverse t a :*: Reverse t b) <-- Reverse t (a :*: b)

Hoistable ((->) :: Type -> Type -> Type) (Reverse :: (Type -> Type) -> Type -> Type)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

(/|\) :: Covariant (->) (->) u => (forall a. u a -> v a) -> forall (a :: k). Reverse u a -> Reverse v a

Liftable ((->) :: Type -> Type -> Type) (Reverse :: (Type -> Type) -> Type -> Type)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

lift :: Covariant (->) (->) u => u a -> Reverse u a

Lowerable ((->) :: Type -> Type -> Type) (Reverse :: (Type -> Type) -> Type -> Type)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

lower :: Covariant (->) (->) u => Reverse u a -> u a

Interpreted ((->) :: Type -> Type -> Type) (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Associated Types

type Primary (Reverse t) a

Methods

run :: Reverse t a -> Primary (Reverse t) a

unite :: Primary (Reverse t) a -> Reverse t a

(!) :: Reverse t a -> Primary (Reverse t) a

(||=) :: (Semigroupoid (->), Interpreted (->) u) => (Primary (Reverse t) a -> Primary u b) -> Reverse t a -> u b

(=||) :: (Semigroupoid (->), Interpreted (->) u) => (Reverse t a -> u b) -> Primary (Reverse t) a -> Primary u b

(<$||=) :: (Semigroupoid (->), Covariant (->) (->) j, Interpreted (->) u) => (Primary (Reverse t) a -> Primary u b) -> (j := Reverse t a) -> (j := u b)

(=||$>) :: (Covariant (->) (->) j, Interpreted (->) u) => (Reverse t a -> u b) -> (j := Primary (Reverse t) a) -> (j := Primary u b)

Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t => Covariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

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

(<-|-|-) :: (Covariant (->) (Betwixt (->) (->)) u, Covariant (Betwixt (->) (->)) (->) (Reverse t)) => (a -> b) -> Reverse t (u a) -> Reverse t (u b)

(<-|-|-|-) :: (Covariant (->) (Betwixt (->) (Betwixt (->) (->))) v, Covariant (Betwixt (->) (Betwixt (->) (->))) (Betwixt (Betwixt (->) (->)) (->)) u, Covariant (Betwixt (Betwixt (->) (->)) (->)) (->) (Reverse t)) => (a -> b) -> Reverse t (u (v a)) -> Reverse t (u (v b))

Distributive ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t => Distributive ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

(-<<) :: Covariant (->) (->) u => (a -> Reverse t b) -> u a -> Reverse t (u b)

Contravariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t => Contravariant ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

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

Traversable ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) t => Traversable ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type) (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

(<<-) :: (Covariant (->) (->) u, Monoidal (Straight (->)) (Straight (->)) (:*:) (:*:) u) => (a -> u b) -> Reverse t a -> u (Reverse t b)

type Primary (Reverse t) a

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

type Primary (Reverse t) a = t a