Safe Haskell	Safe
Language	Haskell2010

Pandora.Paradigm.Controlflow.Joint.Schemes.UT

Documentation

newtype UT ct cu t u a Source #

Constructors

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

Instances

Interpreted (UT ct cu t u) Source #
Instance details Defined in Pandora.Paradigm.Controlflow.Joint.Schemes.UT Associated Types type Primary (UT ct cu t u) a :: Type Source # Methods unwrap :: UT ct cu t u a -> Primary (UT ct cu t u) a Source #
Covariant u => Covariant (UT Co Co ((:*:) e) u) Source #
Instance details Defined in Pandora.Paradigm.Inventory.Accumulator Methods (<$>) :: (a -> b) -> UT Co Co ((::) e) u a -> UT Co Co ((::) e) u b Source # comap :: (a -> b) -> UT Co Co ((::) e) u a -> UT Co Co ((::) e) u b Source # (<$) :: a -> UT Co Co ((::) e) u b -> UT Co Co ((::) e) u a Source # ($>) :: UT Co Co ((::) e) u a -> b -> UT Co Co ((::) e) u b Source # void :: UT Co Co ((::) e) u a -> UT Co Co ((::) e) u () Source # loeb :: UT Co Co ((::) e) u (a <-\| UT Co Co ((::) e) u) -> UT Co Co ((::) e) u a Source # (<&>) :: UT Co Co ((::) e) u a -> (a -> b) -> UT Co Co ((::) e) u b Source # (<$$>) :: Covariant u0 => (a -> b) -> ((UT Co Co ((::) e) u :. u0) := a) -> (UT Co Co ((::) e) u :. u0) := b Source # (<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((UT Co Co ((::) e) u :. (u0 :. v)) := a) -> (UT Co Co ((::) e) u :. (u0 :. v)) := b Source # (<$$$$>) :: (Covariant u0, Covariant v, Covariant w) => (a -> b) -> ((UT Co Co ((::) e) u :. (u0 :. (v :. w))) := a) -> (UT Co Co ((::) e) u :. (u0 :. (v :. w))) := b Source # (<&&>) :: Covariant u0 => ((UT Co Co ((::) e) u :. u0) := a) -> (a -> b) -> (UT Co Co ((::) e) u :. u0) := b Source # (<&&&>) :: (Covariant u0, Covariant v) => ((UT Co Co ((::) e) u :. (u0 :. v)) := a) -> (a -> b) -> (UT Co Co ((::) e) u :. (u0 :. v)) := b Source # (<&&&&>) :: (Covariant u0, Covariant v, Covariant w) => ((UT Co Co ((::) e) u :. (u0 :. (v :. w))) := a) -> (a -> b) -> (UT Co Co ((:*:) e) u :. (u0 :. (v :. w))) := b Source #
Covariant u => Covariant (UT Co Co Maybe u) Source #
Instance details Defined in Pandora.Paradigm.Basis.Maybe Methods (<$>) :: (a -> b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b Source # comap :: (a -> b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b Source # (<$) :: a -> UT Co Co Maybe u b -> UT Co Co Maybe u a Source # ($>) :: UT Co Co Maybe u a -> b -> UT Co Co Maybe u b Source # void :: UT Co Co Maybe u a -> UT Co Co Maybe u () Source # loeb :: UT Co Co Maybe u (a <-\| UT Co Co Maybe u) -> UT Co Co Maybe u a Source # (<&>) :: UT Co Co Maybe u a -> (a -> b) -> UT Co Co Maybe u b Source # (<$$>) :: Covariant u0 => (a -> b) -> ((UT Co Co Maybe u :. u0) := a) -> (UT Co Co Maybe u :. u0) := b Source # (<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((UT Co Co Maybe u :. (u0 :. v)) := a) -> (UT Co Co Maybe u :. (u0 :. v)) := b Source # (<$$$$>) :: (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 Source # (<&&>) :: Covariant u0 => ((UT Co Co Maybe u :. u0) := a) -> (a -> b) -> (UT Co Co Maybe u :. u0) := b Source # (<&&&>) :: (Covariant u0, Covariant v) => ((UT Co Co Maybe u :. (u0 :. v)) := a) -> (a -> b) -> (UT Co Co Maybe u :. (u0 :. v)) := b Source # (<&&&&>) :: (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 Source #
Covariant u => Covariant (UT Co Co (Conclusion e) u) Source #
Instance details Defined in Pandora.Paradigm.Basis.Conclusion Methods (<$>) :: (a -> b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b Source # comap :: (a -> b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b Source # (<$) :: a -> UT Co Co (Conclusion e) u b -> UT Co Co (Conclusion e) u a Source # ($>) :: UT Co Co (Conclusion e) u a -> b -> UT Co Co (Conclusion e) u b Source # void :: UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u () Source # loeb :: UT Co Co (Conclusion e) u (a <-\| UT Co Co (Conclusion e) u) -> UT Co Co (Conclusion e) u a Source # (<&>) :: UT Co Co (Conclusion e) u a -> (a -> b) -> UT Co Co (Conclusion e) u b Source # (<$$>) :: Covariant u0 => (a -> b) -> ((UT Co Co (Conclusion e) u :. u0) := a) -> (UT Co Co (Conclusion e) u :. u0) := b Source # (<$$$>) :: (Covariant u0, Covariant v) => (a -> b) -> ((UT Co Co (Conclusion e) u :. (u0 :. v)) := a) -> (UT Co Co (Conclusion e) u :. (u0 :. v)) := b Source # (<$$$$>) :: (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 Source # (<&&>) :: Covariant u0 => ((UT Co Co (Conclusion e) u :. u0) := a) -> (a -> b) -> (UT Co Co (Conclusion e) u :. u0) := b Source # (<&&&>) :: (Covariant u0, Covariant v) => ((UT Co Co (Conclusion e) u :. (u0 :. v)) := a) -> (a -> b) -> (UT Co Co (Conclusion e) u :. (u0 :. v)) := b Source # (<&&&&>) :: (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 Source #
(Semigroup e, Pointable u, Bindable u) => Bindable (UT Co Co ((:*:) e) u) Source #
Instance details Defined in Pandora.Paradigm.Inventory.Accumulator Methods (>>=) :: UT Co Co ((::) e) u a -> (a -> UT Co Co ((::) e) u b) -> UT Co Co ((::) e) u b Source # (=<<) :: (a -> UT Co Co ((::) e) u b) -> UT Co Co ((::) e) u a -> UT Co Co ((::) e) u b Source # bind :: (a -> UT Co Co ((::) e) u b) -> UT Co Co ((::) e) u a -> UT Co Co ((::) e) u b Source # join :: ((UT Co Co ((::) e) u :. UT Co Co ((::) e) u) := a) -> UT Co Co ((::) e) u a Source # (>=>) :: (a -> UT Co Co ((::) e) u b) -> (b -> UT Co Co ((::) e) u c) -> a -> UT Co Co ((::) e) u c Source # (<=<) :: (b -> UT Co Co ((::) e) u c) -> (a -> UT Co Co ((::) e) u b) -> a -> UT Co Co ((::) e) u c Source #
(Pointable u, Bindable u) => Bindable (UT Co Co Maybe u) Source #
Instance details 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 Source # (=<<) :: (a -> UT Co Co Maybe u b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b Source # bind :: (a -> UT Co Co Maybe u b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b Source # join :: ((UT Co Co Maybe u :. UT Co Co Maybe u) := a) -> UT Co Co Maybe u a Source # (>=>) :: (a -> UT Co Co Maybe u b) -> (b -> UT Co Co Maybe u c) -> a -> UT Co Co Maybe u c Source # (<=<) :: (b -> UT Co Co Maybe u c) -> (a -> UT Co Co Maybe u b) -> a -> UT Co Co Maybe u c Source #
(Pointable u, Bindable u) => Bindable (UT Co Co (Conclusion e) u) Source #
Instance details 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 Source # (=<<) :: (a -> UT Co Co (Conclusion e) u b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b Source # bind :: (a -> UT Co Co (Conclusion e) u b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b Source # join :: ((UT Co Co (Conclusion e) u :. UT Co Co (Conclusion e) u) := a) -> UT Co Co (Conclusion e) u a Source # (>=>) :: (a -> UT Co Co (Conclusion e) u b) -> (b -> UT Co Co (Conclusion e) u c) -> a -> UT Co Co (Conclusion e) u c Source # (<=<) :: (b -> UT Co Co (Conclusion e) u c) -> (a -> UT Co Co (Conclusion e) u b) -> a -> UT Co Co (Conclusion e) u c Source #
(Semigroup e, Applicative u) => Applicative (UT Co Co ((:*:) e) u) Source #
Instance details Defined in Pandora.Paradigm.Inventory.Accumulator Methods (<>) :: UT Co Co ((::) e) u (a -> b) -> UT Co Co ((::) e) u a -> UT Co Co ((::) e) u b Source # apply :: UT Co Co ((::) e) u (a -> b) -> UT Co Co ((::) e) u a -> UT Co Co ((::) e) u b Source # (>) :: UT Co Co ((::) e) u a -> UT Co Co ((::) e) u b -> UT Co Co ((::) e) u b Source # (<) :: UT Co Co ((::) e) u a -> UT Co Co ((::) e) u b -> UT Co Co ((::) e) u a Source # forever :: UT Co Co ((::) e) u a -> UT Co Co ((::) e) u b Source # (<>) :: Applicative u0 => ((UT Co Co ((::) e) u :. u0) := (a -> b)) -> ((UT Co Co ((::) e) u :. u0) := a) -> (UT Co Co ((::) e) u :. u0) := b Source # (<**>) :: (Applicative u0, Applicative v) => ((UT Co Co ((::) e) u :. (u0 :. v)) := (a -> b)) -> ((UT Co Co ((::) e) u :. (u0 :. v)) := a) -> (UT Co Co ((::) e) u :. (u0 :. v)) := b Source # (<***>) :: (Applicative u0, Applicative v, Applicative w) => ((UT Co Co ((::) e) u :. (u0 :. (v :. w))) := (a -> b)) -> ((UT Co Co ((::) e) u :. (u0 :. (v :. w))) := a) -> (UT Co Co ((::) e) u :. (u0 :. (v :. w))) := b Source #
Applicative u => Applicative (UT Co Co Maybe u) Source #
Instance details 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 Source # apply :: UT Co Co Maybe u (a -> b) -> UT Co Co Maybe u a -> UT Co Co Maybe u b Source # (>) :: UT Co Co Maybe u a -> UT Co Co Maybe u b -> UT Co Co Maybe u b Source # (<) :: UT Co Co Maybe u a -> UT Co Co Maybe u b -> UT Co Co Maybe u a Source # forever :: UT Co Co Maybe u a -> UT Co Co Maybe u b Source # (<>) :: Applicative u0 => ((UT Co Co Maybe u :. u0) := (a -> b)) -> ((UT Co Co Maybe u :. u0) := a) -> (UT Co Co Maybe u :. u0) := b Source # (<>) :: (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 Source # (<**>) :: (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 Source #
Applicative u => Applicative (UT Co Co (Conclusion e) u) Source #
Instance details 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 Source # apply :: UT Co Co (Conclusion e) u (a -> b) -> UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b Source # (>) :: UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b -> UT Co Co (Conclusion e) u b Source # (<) :: UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b -> UT Co Co (Conclusion e) u a Source # forever :: UT Co Co (Conclusion e) u a -> UT Co Co (Conclusion e) u b Source # (<>) :: 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 Source # (<>) :: (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 Source # (<**>) :: (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 Source #
(Pointable u, Monoid e) => Pointable (UT Co Co ((:*:) e) u) Source #
Instance details Defined in Pandora.Paradigm.Inventory.Accumulator Methods point :: a \|-> UT Co Co ((:*:) e) u Source #
Pointable u => Pointable (UT Co Co Maybe u) Source #
Instance details Defined in Pandora.Paradigm.Basis.Maybe Methods point :: a \|-> UT Co Co Maybe u Source #
Pointable u => Pointable (UT Co Co (Conclusion e) u) Source #
Instance details Defined in Pandora.Paradigm.Basis.Conclusion Methods point :: a \|-> UT Co Co (Conclusion e) u Source #
Monad u => Monad (UT Co Co Maybe u) Source #
Instance details Defined in Pandora.Paradigm.Basis.Maybe
Monad u => Monad (UT Co Co (Conclusion e) u) Source #
Instance details Defined in Pandora.Paradigm.Basis.Conclusion
type Primary (UT ct cu t u) a Source #
Instance details Defined in Pandora.Paradigm.Controlflow.Joint.Schemes.UT type Primary (UT ct cu t u) a = (u :. t) := a