Pandora.Paradigm.Junction.Schemes.UT

Documentation

newtype UT ct cu t u a

Constructors

UT ((u :.: t) >< a)

Instances

Pointable t => Liftable (UT Co Co t)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

lift :: Covariant u => u ~> UT Co Co t u

Extractable t => Lowerable (UT Co Co t)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

lower :: Covariant u => UT Co Co t u ~> u

Composition (UT ct cu t u)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Associated Types

type Outline (UT ct cu t u) a :: Type

Methods

composition :: UT ct cu t u a -> Outline (UT ct cu t u) a

Covariant u => Covariant (UT Maybe () Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(<$>) :: (a -> b) -> UT Maybe () Maybe u a -> UT Maybe () Maybe u b

comap :: (a -> b) -> UT Maybe () Maybe u a -> UT Maybe () Maybe u b

(<$) :: a -> UT Maybe () Maybe u b -> UT Maybe () Maybe u a

($>) :: UT Maybe () Maybe u a -> b -> UT Maybe () Maybe u b

void :: UT Maybe () Maybe u a -> UT Maybe () Maybe u ()

loeb :: UT Maybe () Maybe u (UT Maybe () Maybe u a -> a) -> UT Maybe () Maybe u a

(<&>) :: UT Maybe () Maybe u a -> (a -> b) -> UT Maybe () Maybe u b

(<$$>) :: Covariant u0 => (a -> b) -> ((UT Maybe () Maybe u :.: u0) >< a) -> (UT Maybe () Maybe u :.: u0) >< b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((UT Maybe () Maybe u :.: (u0 :.: v)) >< a) -> (UT Maybe () Maybe u :.: (u0 :.: v)) >< b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((UT Maybe () Maybe u :.: (u0 :.: (v :.: w))) >< a) -> (UT Maybe () Maybe u :.: (u0 :.: (v :.: w))) >< b

(<&&>) :: Covariant u0 => ((UT Maybe () Maybe u :.: u0) >< a) -> (a -> b) -> (UT Maybe () Maybe u :.: u0) >< b

(<&&&>) :: (Covariant u0, Covariant v) => ((UT Maybe () Maybe u :.: (u0 :.: v)) >< a) -> (a -> b) -> (UT Maybe () Maybe u :.: (u0 :.: v)) >< b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((UT Maybe () Maybe u :.: (u0 :.: (v :.: w))) >< a) -> (a -> b) -> (UT Maybe () Maybe u :.: (u0 :.: (v :.: w))) >< b

Covariant u => Covariant (UT (Conclusion e) () (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(<$>) :: (a -> b) -> UT (Conclusion e) () (Conclusion e) u a -> UT (Conclusion e) () (Conclusion e) u b

comap :: (a -> b) -> UT (Conclusion e) () (Conclusion e) u a -> UT (Conclusion e) () (Conclusion e) u b

(<$) :: a -> UT (Conclusion e) () (Conclusion e) u b -> UT (Conclusion e) () (Conclusion e) u a

($>) :: UT (Conclusion e) () (Conclusion e) u a -> b -> UT (Conclusion e) () (Conclusion e) u b

void :: UT (Conclusion e) () (Conclusion e) u a -> UT (Conclusion e) () (Conclusion e) u ()

loeb :: UT (Conclusion e) () (Conclusion e) u (UT (Conclusion e) () (Conclusion e) u a -> a) -> UT (Conclusion e) () (Conclusion e) u a

(<&>) :: UT (Conclusion e) () (Conclusion e) u a -> (a -> b) -> UT (Conclusion e) () (Conclusion e) u b

(<$$>) :: Covariant u0 => (a -> b) -> ((UT (Conclusion e) () (Conclusion e) u :.: u0) >< a) -> (UT (Conclusion e) () (Conclusion e) u :.: u0) >< b

(<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: v)) >< a) -> (UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: v)) >< b

(<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: (v :.: w))) >< a) -> (UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: (v :.: w))) >< b

(<&&>) :: Covariant u0 => ((UT (Conclusion e) () (Conclusion e) u :.: u0) >< a) -> (a -> b) -> (UT (Conclusion e) () (Conclusion e) u :.: u0) >< b

(<&&&>) :: (Covariant u0, Covariant v) => ((UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: v)) >< a) -> (a -> b) -> (UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: v)) >< b

(<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: (v :.: w))) >< a) -> (a -> b) -> (UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: (v :.: w))) >< b

(Covariant t, Covariant u) => Covariant (UT Co Co t u)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

(<$>) :: (a -> b) -> UT Co Co t u a -> UT Co Co t u b

comap :: (a -> b) -> UT Co Co t u a -> UT Co Co t u b

(<$) :: a -> UT Co Co t u b -> UT Co Co t u a

($>) :: UT Co Co t u a -> b -> UT Co Co t u b

void :: UT Co Co t u a -> UT Co Co t u ()

loeb :: UT Co Co t u (UT Co Co t u a -> a) -> UT Co Co t u a

(<&>) :: UT Co Co t u a -> (a -> b) -> UT Co Co t u b

(<$$>) :: Covariant u0 => (a -> b) -> ((UT Co Co t u :.: u0) >< a) -> (UT Co Co t u :.: u0) >< b

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

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

(<&&>) :: Covariant u0 => ((UT Co Co t u :.: u0) >< a) -> (a -> b) -> (UT Co Co t u :.: u0) >< b

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

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

(Pointable u, Bindable u) => Bindable (UT Maybe () Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(>>=) :: UT Maybe () Maybe u a -> (a -> UT Maybe () Maybe u b) -> UT Maybe () Maybe u b

(=<<) :: (a -> UT Maybe () Maybe u b) -> UT Maybe () Maybe u a -> UT Maybe () Maybe u b

bind :: (a -> UT Maybe () Maybe u b) -> UT Maybe () Maybe u a -> UT Maybe () Maybe u b

join :: (UT Maybe () Maybe u :.: UT Maybe () Maybe u) a -> UT Maybe () Maybe u a

(>=>) :: (a -> UT Maybe () Maybe u b) -> (b -> UT Maybe () Maybe u c) -> a -> UT Maybe () Maybe u c

(<=<) :: (b -> UT Maybe () Maybe u c) -> (a -> UT Maybe () Maybe u b) -> a -> UT Maybe () Maybe u c

(Pointable u, Bindable u) => Bindable (UT (Conclusion e) () (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(>>=) :: UT (Conclusion e) () (Conclusion e) u a -> (a -> UT (Conclusion e) () (Conclusion e) u b) -> UT (Conclusion e) () (Conclusion e) u b

(=<<) :: (a -> UT (Conclusion e) () (Conclusion e) u b) -> UT (Conclusion e) () (Conclusion e) u a -> UT (Conclusion e) () (Conclusion e) u b

bind :: (a -> UT (Conclusion e) () (Conclusion e) u b) -> UT (Conclusion e) () (Conclusion e) u a -> UT (Conclusion e) () (Conclusion e) u b

join :: (UT (Conclusion e) () (Conclusion e) u :.: UT (Conclusion e) () (Conclusion e) u) a -> UT (Conclusion e) () (Conclusion e) u a

(>=>) :: (a -> UT (Conclusion e) () (Conclusion e) u b) -> (b -> UT (Conclusion e) () (Conclusion e) u c) -> a -> UT (Conclusion e) () (Conclusion e) u c

(<=<) :: (b -> UT (Conclusion e) () (Conclusion e) u c) -> (a -> UT (Conclusion e) () (Conclusion e) u b) -> a -> UT (Conclusion e) () (Conclusion e) u c

Applicative u => Applicative (UT Maybe () Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

(<*>) :: UT Maybe () Maybe u (a -> b) -> UT Maybe () Maybe u a -> UT Maybe () Maybe u b

apply :: UT Maybe () Maybe u (a -> b) -> UT Maybe () Maybe u a -> UT Maybe () Maybe u b

(*>) :: UT Maybe () Maybe u a -> UT Maybe () Maybe u b -> UT Maybe () Maybe u b

(<*) :: UT Maybe () Maybe u a -> UT Maybe () Maybe u b -> UT Maybe () Maybe u a

forever :: UT Maybe () Maybe u a -> UT Maybe () Maybe u b

(<**>) :: Applicative u0 => (UT Maybe () Maybe u :.: u0) (a -> b) -> (UT Maybe () Maybe u :.: u0) a -> (UT Maybe () Maybe u :.: u0) b

(<***>) :: (Applicative u0, Applicative v) => (UT Maybe () Maybe u :.: (u0 :.: v)) (a -> b) -> (UT Maybe () Maybe u :.: (u0 :.: v)) a -> (UT Maybe () Maybe u :.: (u0 :.: v)) b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => (UT Maybe () Maybe u :.: (u0 :.: (v :.: w))) (a -> b) -> (UT Maybe () Maybe u :.: (u0 :.: (v :.: w))) a -> (UT Maybe () Maybe u :.: (u0 :.: (v :.: w))) b

Applicative u => Applicative (UT (Conclusion e) () (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

(<*>) :: UT (Conclusion e) () (Conclusion e) u (a -> b) -> UT (Conclusion e) () (Conclusion e) u a -> UT (Conclusion e) () (Conclusion e) u b

apply :: UT (Conclusion e) () (Conclusion e) u (a -> b) -> UT (Conclusion e) () (Conclusion e) u a -> UT (Conclusion e) () (Conclusion e) u b

(*>) :: UT (Conclusion e) () (Conclusion e) u a -> UT (Conclusion e) () (Conclusion e) u b -> UT (Conclusion e) () (Conclusion e) u b

(<*) :: UT (Conclusion e) () (Conclusion e) u a -> UT (Conclusion e) () (Conclusion e) u b -> UT (Conclusion e) () (Conclusion e) u a

forever :: UT (Conclusion e) () (Conclusion e) u a -> UT (Conclusion e) () (Conclusion e) u b

(<**>) :: Applicative u0 => (UT (Conclusion e) () (Conclusion e) u :.: u0) (a -> b) -> (UT (Conclusion e) () (Conclusion e) u :.: u0) a -> (UT (Conclusion e) () (Conclusion e) u :.: u0) b

(<***>) :: (Applicative u0, Applicative v) => (UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: v)) (a -> b) -> (UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: v)) a -> (UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: v)) b

(<****>) :: (Applicative u0, Applicative v, Applicative w) => (UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: (v :.: w))) (a -> b) -> (UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: (v :.: w))) a -> (UT (Conclusion e) () (Conclusion e) u :.: (u0 :.: (v :.: w))) b

(Applicative t, Applicative u) => Applicative (UT Co Co t u)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

(<*>) :: UT Co Co t u (a -> b) -> UT Co Co t u a -> UT Co Co t u b

apply :: UT Co Co t u (a -> b) -> UT Co Co t u a -> UT Co Co t u b

(*>) :: UT Co Co t u a -> UT Co Co t u b -> UT Co Co t u b

(<*) :: UT Co Co t u a -> UT Co Co t u b -> UT Co Co t u a

forever :: UT Co Co t u a -> UT Co Co t u b

(<**>) :: Applicative u0 => (UT Co Co t u :.: u0) (a -> b) -> (UT Co Co t u :.: u0) a -> (UT Co Co t u :.: u0) b

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

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

(Covariant t, Alternative u) => Alternative (UT Co Co t u)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

(<+>) :: UT Co Co t u a -> UT Co Co t u a -> UT Co Co t u a

alter :: UT Co Co t u a -> UT Co Co t u a -> UT Co Co t u a

(Covariant t, Avoidable u) => Avoidable (UT Co Co t u)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

idle :: UT Co Co t u a

(Distributive t, Distributive u) => Distributive (UT Co Co t u)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

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

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

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

(>>>-) :: (Covariant t0, Covariant v) => (t0 :.: v) a -> (a -> UT Co Co t u b) -> (UT Co Co t u :.: (t0 :.: v)) b

(>>>>-) :: (Covariant t0, Covariant v, Covariant w) => (t0 :.: (v :.: w)) a -> (a -> UT Co Co t u b) -> (UT Co Co t u :.: (t0 :.: (v :.: w))) b

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

(Extractable t, Extractable u) => Extractable (UT Co Co t u)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

extract :: UT Co Co t u a -> a

Pointable u => Pointable (UT Maybe () Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Methods

point :: a -> UT Maybe () Maybe u a

Pointable u => Pointable (UT (Conclusion e) () (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

point :: a -> UT (Conclusion e) () (Conclusion e) u a

(Pointable t, Pointable u) => Pointable (UT Co Co t u)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

point :: a -> UT Co Co t u a

Monad u => Monad (UT Maybe () Maybe u)

Defined in Pandora.Paradigm.Basis.Maybe

Monad u => Monad (UT (Conclusion e) () (Conclusion e) u)

Defined in Pandora.Paradigm.Basis.Conclusion

(Traversable t, Traversable u) => Traversable (UT Co Co t u)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

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

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

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

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

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

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

Semigroup ((u :.: t) >< a) => Semigroup (UT Co Co t u a)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

(+) :: UT Co Co t u a -> UT Co Co t u a -> UT Co Co t u a

Monoid ((u :.: t) >< a) => Monoid (UT Co Co t u a)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

zero :: UT Co Co t u a

Setoid ((u :.: t) >< a) => Setoid (UT Co Co t u a)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

(==) :: UT Co Co t u a -> UT Co Co t u a -> Boolean

(/=) :: UT Co Co t u a -> UT Co Co t u a -> Boolean

Chain ((u :.: t) >< a) => Chain (UT Co Co t u a)

Defined in Pandora.Paradigm.Junction.Schemes.UT

Methods

(<=>) :: UT Co Co t u a -> UT Co Co t u a -> Ordering

(<) :: UT Co Co t u a -> UT Co Co t u a -> Boolean

(<=) :: UT Co Co t u a -> UT Co Co t u a -> Boolean

(>) :: UT Co Co t u a -> UT Co Co t u a -> Boolean

(>=) :: UT Co Co t u a -> UT Co Co t u a -> Boolean

type Outline (UT ct cu t u) a

Defined in Pandora.Paradigm.Junction.Schemes.UT

type Outline (UT ct cu t u) a = (u :.: t) >< a