Pandora.Paradigm.Controlflow.Joint.Schemes.UT

Documentation

newtype UT ct cu t u a

Constructors

UT ((u :. t) := a)

Instances

Interpreted (UT ct cu t u)

Defined in Pandora.Paradigm.Controlflow.Joint.Schemes.UT

Associated Types

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

Methods

unwrap :: UT ct cu t u a -> Primary (UT ct cu t u) a

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

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

Defined in Pandora.Paradigm.Basis.Maybe

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

Defined in Pandora.Paradigm.Basis.Conclusion

type Primary (UT ct cu t u) a

Defined in Pandora.Paradigm.Controlflow.Joint.Schemes.UT

type Primary (UT ct cu t u) a = (u :. t) := a