pandora-0.2.3: A box of patterns and paradigms

Safe HaskellSafe
LanguageHaskell2010

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 (UT Covariant Covariant (Twister Edges) Edges) Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Graph

Methods

(<$>) :: (a -> b) -> UT Covariant Covariant (Twister Edges) Edges a -> UT Covariant Covariant (Twister Edges) Edges b Source #

comap :: (a -> b) -> UT Covariant Covariant (Twister Edges) Edges a -> UT Covariant Covariant (Twister Edges) Edges b Source #

(<$) :: a -> UT Covariant Covariant (Twister Edges) Edges b -> UT Covariant Covariant (Twister Edges) Edges a Source #

($>) :: UT Covariant Covariant (Twister Edges) Edges a -> b -> UT Covariant Covariant (Twister Edges) Edges b Source #

void :: UT Covariant Covariant (Twister Edges) Edges a -> UT Covariant Covariant (Twister Edges) Edges () Source #

loeb :: UT Covariant Covariant (Twister Edges) Edges (a <-| UT Covariant Covariant (Twister Edges) Edges) -> UT Covariant Covariant (Twister Edges) Edges a Source #

(<&>) :: UT Covariant Covariant (Twister Edges) Edges a -> (a -> b) -> UT Covariant Covariant (Twister Edges) Edges b Source #

(<$$>) :: Covariant u => (a -> b) -> ((UT Covariant Covariant (Twister Edges) Edges :. u) := a) -> (UT Covariant Covariant (Twister Edges) Edges :. u) := b Source #

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((UT Covariant Covariant (Twister Edges) Edges :. (u :. v)) := a) -> (UT Covariant Covariant (Twister Edges) Edges :. (u :. v)) := b Source #

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((UT Covariant Covariant (Twister Edges) Edges :. (u :. (v :. w))) := a) -> (UT Covariant Covariant (Twister Edges) Edges :. (u :. (v :. w))) := b Source #

(<&&>) :: Covariant u => ((UT Covariant Covariant (Twister Edges) Edges :. u) := a) -> (a -> b) -> (UT Covariant Covariant (Twister Edges) Edges :. u) := b Source #

(<&&&>) :: (Covariant u, Covariant v) => ((UT Covariant Covariant (Twister Edges) Edges :. (u :. v)) := a) -> (a -> b) -> (UT Covariant Covariant (Twister Edges) Edges :. (u :. v)) := b Source #

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((UT Covariant Covariant (Twister Edges) Edges :. (u :. (v :. w))) := a) -> (a -> b) -> (UT Covariant Covariant (Twister Edges) Edges :. (u :. (v :. w))) := b Source #

Covariant (UT Covariant Covariant (Twister Maybe) Maybe) Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Stack

Methods

(<$>) :: (a -> b) -> UT Covariant Covariant (Twister Maybe) Maybe a -> UT Covariant Covariant (Twister Maybe) Maybe b Source #

comap :: (a -> b) -> UT Covariant Covariant (Twister Maybe) Maybe a -> UT Covariant Covariant (Twister Maybe) Maybe b Source #

(<$) :: a -> UT Covariant Covariant (Twister Maybe) Maybe b -> UT Covariant Covariant (Twister Maybe) Maybe a Source #

($>) :: UT Covariant Covariant (Twister Maybe) Maybe a -> b -> UT Covariant Covariant (Twister Maybe) Maybe b Source #

void :: UT Covariant Covariant (Twister Maybe) Maybe a -> UT Covariant Covariant (Twister Maybe) Maybe () Source #

loeb :: UT Covariant Covariant (Twister Maybe) Maybe (a <-| UT Covariant Covariant (Twister Maybe) Maybe) -> UT Covariant Covariant (Twister Maybe) Maybe a Source #

(<&>) :: UT Covariant Covariant (Twister Maybe) Maybe a -> (a -> b) -> UT Covariant Covariant (Twister Maybe) Maybe b Source #

(<$$>) :: Covariant u => (a -> b) -> ((UT Covariant Covariant (Twister Maybe) Maybe :. u) := a) -> (UT Covariant Covariant (Twister Maybe) Maybe :. u) := b Source #

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

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

(<&&>) :: Covariant u => ((UT Covariant Covariant (Twister Maybe) Maybe :. u) := a) -> (a -> b) -> (UT Covariant Covariant (Twister Maybe) Maybe :. u) := b Source #

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

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

Covariant u => Covariant (UT Covariant Covariant ((:*:) e) u) Source # 
Instance details

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

(<$>) :: (a -> b) -> UT Covariant Covariant ((:*:) e) u a -> UT Covariant Covariant ((:*:) e) u b Source #

comap :: (a -> b) -> UT Covariant Covariant ((:*:) e) u a -> UT Covariant Covariant ((:*:) e) u b Source #

(<$) :: a -> UT Covariant Covariant ((:*:) e) u b -> UT Covariant Covariant ((:*:) e) u a Source #

($>) :: UT Covariant Covariant ((:*:) e) u a -> b -> UT Covariant Covariant ((:*:) e) u b Source #

void :: UT Covariant Covariant ((:*:) e) u a -> UT Covariant Covariant ((:*:) e) u () Source #

loeb :: UT Covariant Covariant ((:*:) e) u (a <-| UT Covariant Covariant ((:*:) e) u) -> UT Covariant Covariant ((:*:) e) u a Source #

(<&>) :: UT Covariant Covariant ((:*:) e) u a -> (a -> b) -> UT Covariant Covariant ((:*:) e) u b Source #

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

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

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

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

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

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

Covariant u => Covariant (UT Covariant Covariant Maybe u) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

comap :: (a -> b) -> UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u b Source #

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

($>) :: UT Covariant Covariant Maybe u a -> b -> UT Covariant Covariant Maybe u b Source #

void :: UT Covariant Covariant Maybe u a -> UT Covariant Covariant Maybe u () Source #

loeb :: UT Covariant Covariant Maybe u (a <-| UT Covariant Covariant Maybe u) -> UT Covariant Covariant Maybe u a Source #

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

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

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

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

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

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

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

Covariant u => Covariant (UT Covariant Covariant (Conclusion e) u) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

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

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

void :: UT Covariant Covariant (Conclusion e) u a -> UT Covariant Covariant (Conclusion e) u () Source #

loeb :: UT Covariant Covariant (Conclusion e) u (a <-| UT Covariant Covariant (Conclusion e) u) -> UT Covariant Covariant (Conclusion e) u a Source #

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

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

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

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

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

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

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

(Semigroup e, Pointable u, Bindable u) => Bindable (UT Covariant Covariant ((:*:) e) u) Source # 
Instance details

Defined in Pandora.Paradigm.Inventory.Accumulator

(Pointable u, Bindable u) => Bindable (UT Covariant Covariant Maybe u) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Maybe

(Pointable u, Bindable u) => Bindable (UT Covariant Covariant (Conclusion e) u) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Conclusion

Applicative (UT Covariant Covariant (Twister Maybe) Maybe) Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Stack

Methods

(<*>) :: UT Covariant Covariant (Twister Maybe) Maybe (a -> b) -> UT Covariant Covariant (Twister Maybe) Maybe a -> UT Covariant Covariant (Twister Maybe) Maybe b Source #

apply :: UT Covariant Covariant (Twister Maybe) Maybe (a -> b) -> UT Covariant Covariant (Twister Maybe) Maybe a -> UT Covariant Covariant (Twister Maybe) Maybe b Source #

(*>) :: UT Covariant Covariant (Twister Maybe) Maybe a -> UT Covariant Covariant (Twister Maybe) Maybe b -> UT Covariant Covariant (Twister Maybe) Maybe b Source #

(<*) :: UT Covariant Covariant (Twister Maybe) Maybe a -> UT Covariant Covariant (Twister Maybe) Maybe b -> UT Covariant Covariant (Twister Maybe) Maybe a Source #

forever :: UT Covariant Covariant (Twister Maybe) Maybe a -> UT Covariant Covariant (Twister Maybe) Maybe b Source #

(<**>) :: Applicative u => ((UT Covariant Covariant (Twister Maybe) Maybe :. u) := (a -> b)) -> ((UT Covariant Covariant (Twister Maybe) Maybe :. u) := a) -> (UT Covariant Covariant (Twister Maybe) Maybe :. u) := b Source #

(<***>) :: (Applicative u, Applicative v) => ((UT Covariant Covariant (Twister Maybe) Maybe :. (u :. v)) := (a -> b)) -> ((UT Covariant Covariant (Twister Maybe) Maybe :. (u :. v)) := a) -> (UT Covariant Covariant (Twister Maybe) Maybe :. (u :. v)) := b Source #

(<****>) :: (Applicative u, Applicative v, Applicative w) => ((UT Covariant Covariant (Twister Maybe) Maybe :. (u :. (v :. w))) := (a -> b)) -> ((UT Covariant Covariant (Twister Maybe) Maybe :. (u :. (v :. w))) := a) -> (UT Covariant Covariant (Twister Maybe) Maybe :. (u :. (v :. w))) := b Source #

(Semigroup e, Applicative u) => Applicative (UT Covariant Covariant ((:*:) e) u) Source # 
Instance details

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

(<*>) :: UT Covariant Covariant ((:*:) e) u (a -> b) -> UT Covariant Covariant ((:*:) e) u a -> UT Covariant Covariant ((:*:) e) u b Source #

apply :: UT Covariant Covariant ((:*:) e) u (a -> b) -> UT Covariant Covariant ((:*:) e) u a -> UT Covariant Covariant ((:*:) e) u b Source #

(*>) :: UT Covariant Covariant ((:*:) e) u a -> UT Covariant Covariant ((:*:) e) u b -> UT Covariant Covariant ((:*:) e) u b Source #

(<*) :: UT Covariant Covariant ((:*:) e) u a -> UT Covariant Covariant ((:*:) e) u b -> UT Covariant Covariant ((:*:) e) u a Source #

forever :: UT Covariant Covariant ((:*:) e) u a -> UT Covariant Covariant ((:*:) e) u b Source #

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

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

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

Applicative u => Applicative (UT Covariant Covariant Maybe u) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Maybe

Applicative u => Applicative (UT Covariant Covariant (Conclusion e) u) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Conclusion

Alternative (UT Covariant Covariant (Twister Maybe) Maybe) Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Stack

Avoidable (UT Covariant Covariant (Twister Maybe) Maybe) Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Stack

Pointable (UT Covariant Covariant (Twister Maybe) Maybe) Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Stack

(Pointable u, Monoid e) => Pointable (UT Covariant Covariant ((:*:) e) u) Source # 
Instance details

Defined in Pandora.Paradigm.Inventory.Accumulator

Pointable u => Pointable (UT Covariant Covariant Maybe u) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Maybe

Pointable u => Pointable (UT Covariant Covariant (Conclusion e) u) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Conclusion

Monad u => Monad (UT Covariant Covariant Maybe u) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Maybe

Monad u => Monad (UT Covariant Covariant (Conclusion e) u) Source # 
Instance details

Defined in Pandora.Paradigm.Basis.Conclusion

Traversable (UT Covariant Covariant (Twister Edges) Edges) Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Graph

Traversable (UT Covariant Covariant (Twister Maybe) Maybe) Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Stack

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