Pandora.Paradigm.Primary.Transformer.Reverse

Documentation

newtype Reverse t a

Constructors

Reverse (t a)

Instances

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

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

lift :: forall (u :: Type -> Type). Covariant u => u ~> Reverse u

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

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

lower :: forall (u :: Type -> Type). Covariant u => Reverse u ~> u

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

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

hoist :: forall (u :: Type -> Type) (v :: Type -> Type). Covariant u => (u ~> v) -> Reverse u ~> Reverse v

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

Covariant t => Covariant (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

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

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

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

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

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

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

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

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

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

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

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

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

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

Applicative t => Applicative (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

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

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

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

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

forever :: Reverse t a -> Reverse t b

(<**>) :: Applicative u => ((Reverse t :. u) := (a -> b)) -> ((Reverse t :. u) := a) -> (Reverse t :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Reverse t :. (u :. v)) := (a -> b)) -> ((Reverse t :. (u :. v)) := a) -> (Reverse t :. (u :. v)) := b

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

Distributive t => Distributive (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

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

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

distribute :: Covariant u => ((u :. Reverse t) := a) -> (Reverse t :. u) := a

(>>>-) :: (Covariant u, Covariant v) => ((u :. v) := a) -> (a -> Reverse t b) -> (Reverse t :. (u :. v)) := b

(>>>>-) :: (Covariant u, Covariant v, Covariant w) => ((u :. (v :. w)) := a) -> (a -> Reverse t b) -> (Reverse t :. (u :. (v :. w))) := b

(>>>>>-) :: (Covariant u, Covariant v, Covariant w, Covariant j) => ((u :. (v :. (w :. j))) := a) -> (a -> Reverse t b) -> (Reverse t :. (u :. (v :. (w :. j)))) := b

Extractable t => Extractable (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

extract :: a <-| Reverse t

Pointable t => Pointable (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

point :: a |-> Reverse t

Traversable t => Traversable (Reverse t)

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

Methods

(->>) :: (Pointable u, Applicative u) => Reverse t a -> (a -> u b) -> (u :. Reverse t) := b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Reverse t a -> (u :. Reverse t) := b

sequence :: (Pointable u, Applicative u) => ((Reverse t :. u) := a) -> (u :. Reverse t) := a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Reverse t) := a) -> (a -> u b) -> (u :. (v :. Reverse t)) := b

(->>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w) => ((w :. (v :. Reverse t)) := a) -> (a -> u b) -> (u :. (w :. (v :. Reverse t))) := b

(->>>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w, Traversable j) => ((j :. (w :. (v :. Reverse t))) := a) -> (a -> u b) -> (u :. (j :. (w :. (v :. Reverse t)))) := b

Interpreted (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

type Primary (Reverse t) a

Defined in Pandora.Paradigm.Primary.Transformer.Reverse

type Primary (Reverse t) a = t a