Pandora.Paradigm.Junction.Transformer

Documentation

newtype T t u a

Constructors

T

Fields

• t :: (u :.: t) a

Instances

Pointable t => Liftable (T t)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

lift :: Covariant u => u ~> T t u

Extractable t => Lowerable (T t)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

lower :: Covariant u => T t u ~> u

(Covariant t, Covariant u) => Covariant (T t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(<$>) :: (a -> b) -> T t u a -> T t u b

comap :: (a -> b) -> T t u a -> T t u b

(<$) :: a -> T t u b -> T t u a

($>) :: T t u a -> b -> T t u b

void :: T t u a -> T t u ()

loeb :: T t u (T t u a -> a) -> T t u a

(<$$>) :: Covariant u0 => (a -> b) -> T t u (u0 a) -> T t u (u0 b)

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> T t u (u0 (v a)) -> T t u (u0 (v b))

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

(Applicative t, Applicative u) => Applicative (T t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(<*>) :: T t u (a -> b) -> T t u a -> T t u b

apply :: T t u (a -> b) -> T t u a -> T t u b

(*>) :: T t u a -> T t u b -> T t u b

(<*) :: T t u a -> T t u b -> T t u a

forever :: T t u a -> T t u b

(Covariant t, Alternative u) => Alternative (T t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(<+>) :: T t u a -> T t u a -> T t u a

alter :: T t u a -> T t u a -> T t u a

(Pointable t, Bindable t) => Bindable (Maybe :!: t)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(>>=) :: (Maybe :!: t) a -> (a -> (Maybe :!: t) b) -> (Maybe :!: t) b

(=<<) :: (a -> (Maybe :!: t) b) -> (Maybe :!: t) a -> (Maybe :!: t) b

bind :: (a -> (Maybe :!: t) b) -> (Maybe :!: t) a -> (Maybe :!: t) b

join :: ((Maybe :!: t) :.: (Maybe :!: t)) a -> (Maybe :!: t) a

(>=>) :: (a -> (Maybe :!: t) b) -> (b -> (Maybe :!: t) c) -> a -> (Maybe :!: t) c

(<=<) :: (b -> (Maybe :!: t) c) -> (a -> (Maybe :!: t) b) -> a -> (Maybe :!: t) c

(Pointable t, Bindable t) => Bindable (Conclusion e :!: t)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(>>=) :: (Conclusion e :!: t) a -> (a -> (Conclusion e :!: t) b) -> (Conclusion e :!: t) b

(=<<) :: (a -> (Conclusion e :!: t) b) -> (Conclusion e :!: t) a -> (Conclusion e :!: t) b

bind :: (a -> (Conclusion e :!: t) b) -> (Conclusion e :!: t) a -> (Conclusion e :!: t) b

join :: ((Conclusion e :!: t) :.: (Conclusion e :!: t)) a -> (Conclusion e :!: t) a

(>=>) :: (a -> (Conclusion e :!: t) b) -> (b -> (Conclusion e :!: t) c) -> a -> (Conclusion e :!: t) c

(<=<) :: (b -> (Conclusion e :!: t) c) -> (a -> (Conclusion e :!: t) b) -> a -> (Conclusion e :!: t) c

(Distributive t, Distributive u) => Distributive (T t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

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

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

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

(Covariant t, Exclusive u) => Exclusive (T t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

exclusive :: T t u a

(Extractable t, Extractable u) => Extractable (T t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

extract :: T t u a -> a

(Pointable t, Pointable u) => Pointable (T t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

point :: a -> T t u a

Monad t => Monad (Maybe :!: t)

Defined in Pandora.Paradigm.Basis.Maybe

Monad t => Monad (Conclusion e :!: t)

Defined in Pandora.Paradigm.Basis.Conclusion

(Traversable t, Traversable u) => Traversable (T t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

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

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

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

Semigroup ((u :.: t) a) => Semigroup (T t u a)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(<>) :: T t u a -> T t u a -> T t u a

Monoid ((u :.: t) a) => Monoid (T t u a)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

unit :: T t u a

Setoid ((u :.: t) a) => Setoid (T t u a)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(==) :: T t u a -> T t u a -> Boolean

(/=) :: T t u a -> T t u a -> Boolean

Chain ((u :.: t) a) => Chain (T t u a)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(<=>) :: T t u a -> T t u a -> Ordering

(<) :: T t u a -> T t u a -> Boolean

(<=) :: T t u a -> T t u a -> Boolean

(>) :: T t u a -> T t u a -> Boolean

(>=) :: T t u a -> T t u a -> Boolean

type (:!:) t u = T t u infixr 0

up :: Pointable u => t a -> T t u a

newtype Y t u a

Constructors

Y

Fields

• y :: (u :.: t u) a

Instances

(forall (u :: Type -> Type). Pointable u, Liftable t) => Liftable (Y t)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

lift :: Covariant u => u ~> Y t u

(forall (u :: Type -> Type). Extractable u, Lowerable t) => Lowerable (Y t)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

lower :: Covariant u => Y t u ~> u

(Covariant (t u), Covariant u) => Covariant (Y t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(<$>) :: (a -> b) -> Y t u a -> Y t u b

comap :: (a -> b) -> Y t u a -> Y t u b

(<$) :: a -> Y t u b -> Y t u a

($>) :: Y t u a -> b -> Y t u b

void :: Y t u a -> Y t u ()

loeb :: Y t u (Y t u a -> a) -> Y t u a

(<$$>) :: Covariant u0 => (a -> b) -> Y t u (u0 a) -> Y t u (u0 b)

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> Y t u (u0 (v a)) -> Y t u (u0 (v b))

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

(Applicative (t u), Applicative u) => Applicative (Y t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(<*>) :: Y t u (a -> b) -> Y t u a -> Y t u b

apply :: Y t u (a -> b) -> Y t u a -> Y t u b

(*>) :: Y t u a -> Y t u b -> Y t u b

(<*) :: Y t u a -> Y t u b -> Y t u a

forever :: Y t u a -> Y t u b

(Covariant (t u), Alternative u) => Alternative (Y t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(<+>) :: Y t u a -> Y t u a -> Y t u a

alter :: Y t u a -> Y t u a -> Y t u a

(Distributive (t u), Distributive u) => Distributive (Y t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

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

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

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

(Covariant (t u), Exclusive u) => Exclusive (Y t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

exclusive :: Y t u a

(Extractable (t u), Extractable u) => Extractable (Y t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

extract :: Y t u a -> a

(Pointable (t u), Pointable u) => Pointable (Y t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

point :: a -> Y t u a

(Traversable (t u), Traversable u) => Traversable (Y t u)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

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

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

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

(forall (u1 :: k2 -> Type). Semigroup ((u1 :.: t u1) a)) => Semigroup (Y t u a)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(<>) :: Y t u a -> Y t u a -> Y t u a

(forall (u1 :: k2 -> Type). Monoid ((u1 :.: t u1) a)) => Monoid (Y t u a)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

unit :: Y t u a

(forall (u1 :: k2 -> Type). Setoid ((u1 :.: t u1) a)) => Setoid (Y t u a)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(==) :: Y t u a -> Y t u a -> Boolean

(/=) :: Y t u a -> Y t u a -> Boolean

(forall (u1 :: k2 -> Type). Chain ((u1 :.: t u1) a)) => Chain (Y t u a)

Defined in Pandora.Paradigm.Junction.Transformer

Methods

(<=>) :: Y t u a -> Y t u a -> Ordering

(<) :: Y t u a -> Y t u a -> Boolean

(<=) :: Y t u a -> Y t u a -> Boolean

(>) :: Y t u a -> Y t u a -> Boolean

(>=) :: Y t u a -> Y t u a -> Boolean

type (:>:) t u = Y t u infixr 0