Pandora.Paradigm.Controlflow.Joint.Schemes.UT

Documentation

newtype UT ct cu t u a

Constructors

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

Instances

Covariant Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(<$>) :: (a -> b) -> Stack a -> Stack b

comap :: (a -> b) -> Stack a -> Stack b

(<$) :: a -> Stack b -> Stack a

($>) :: Stack a -> b -> Stack b

void :: Stack a -> Stack ()

loeb :: Stack (a <-| Stack) -> Stack a

(<&>) :: Stack a -> (a -> b) -> Stack b

(<$$>) :: Covariant u => (a -> b) -> ((Stack :. u) := a) -> (Stack :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Stack :. (u :. v)) := a) -> (Stack :. (u :. v)) := b

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

(<&&>) :: Covariant u => ((Stack :. u) := a) -> (a -> b) -> (Stack :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Stack :. (u :. v)) := a) -> (a -> b) -> (Stack :. (u :. v)) := b

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

Covariant Graph

Defined in Pandora.Paradigm.Structure.Graph

Methods

(<$>) :: (a -> b) -> Graph a -> Graph b

comap :: (a -> b) -> Graph a -> Graph b

(<$) :: a -> Graph b -> Graph a

($>) :: Graph a -> b -> Graph b

void :: Graph a -> Graph ()

loeb :: Graph (a <-| Graph) -> Graph a

(<&>) :: Graph a -> (a -> b) -> Graph b

(<$$>) :: Covariant u => (a -> b) -> ((Graph :. u) := a) -> (Graph :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Graph :. (u :. v)) := a) -> (Graph :. (u :. v)) := b

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

(<&&>) :: Covariant u => ((Graph :. u) := a) -> (a -> b) -> (Graph :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Graph :. (u :. v)) := a) -> (a -> b) -> (Graph :. (u :. v)) := b

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

Covariant Binary

Defined in Pandora.Paradigm.Structure.Binary

Methods

(<$>) :: (a -> b) -> Binary a -> Binary b

comap :: (a -> b) -> Binary a -> Binary b

(<$) :: a -> Binary b -> Binary a

($>) :: Binary a -> b -> Binary b

void :: Binary a -> Binary ()

loeb :: Binary (a <-| Binary) -> Binary a

(<&>) :: Binary a -> (a -> b) -> Binary b

(<$$>) :: Covariant u => (a -> b) -> ((Binary :. u) := a) -> (Binary :. u) := b

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Binary :. (u :. v)) := a) -> (Binary :. (u :. v)) := b

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

(<&&>) :: Covariant u => ((Binary :. u) := a) -> (a -> b) -> (Binary :. u) := b

(<&&&>) :: (Covariant u, Covariant v) => ((Binary :. (u :. v)) := a) -> (a -> b) -> (Binary :. (u :. v)) := b

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

Applicative Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(<*>) :: Stack (a -> b) -> Stack a -> Stack b

apply :: Stack (a -> b) -> Stack a -> Stack b

(*>) :: Stack a -> Stack b -> Stack b

(<*) :: Stack a -> Stack b -> Stack a

forever :: Stack a -> Stack b

(<**>) :: Applicative u => ((Stack :. u) := (a -> b)) -> ((Stack :. u) := a) -> (Stack :. u) := b

(<***>) :: (Applicative u, Applicative v) => ((Stack :. (u :. v)) := (a -> b)) -> ((Stack :. (u :. v)) := a) -> (Stack :. (u :. v)) := b

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

Alternative Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(<+>) :: Stack a -> Stack a -> Stack a

alter :: Stack a -> Stack a -> Stack a

Avoidable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

empty :: Stack a

Pointable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

point :: a |-> Stack

Pointable Binary

Defined in Pandora.Paradigm.Structure.Binary

Methods

point :: a |-> Binary

Traversable Stack

Defined in Pandora.Paradigm.Structure.Stack

Methods

(->>) :: (Pointable u, Applicative u) => Stack a -> (a -> u b) -> (u :. Stack) := b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Stack a -> (u :. Stack) := b

sequence :: (Pointable u, Applicative u) => ((Stack :. u) := a) -> (u :. Stack) := a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Stack) := a) -> (a -> u b) -> (u :. (v :. Stack)) := b

(->>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w) => ((w :. (v :. Stack)) := a) -> (a -> u b) -> (u :. (w :. (v :. Stack))) := b

(->>>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w, Traversable j) => ((j :. (w :. (v :. Stack))) := a) -> (a -> u b) -> (u :. (j :. (w :. (v :. Stack)))) := b

Traversable Graph

Defined in Pandora.Paradigm.Structure.Graph

Methods

(->>) :: (Pointable u, Applicative u) => Graph a -> (a -> u b) -> (u :. Graph) := b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Graph a -> (u :. Graph) := b

sequence :: (Pointable u, Applicative u) => ((Graph :. u) := a) -> (u :. Graph) := a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Graph) := a) -> (a -> u b) -> (u :. (v :. Graph)) := b

(->>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w) => ((w :. (v :. Graph)) := a) -> (a -> u b) -> (u :. (w :. (v :. Graph))) := b

(->>>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w, Traversable j) => ((j :. (w :. (v :. Graph))) := a) -> (a -> u b) -> (u :. (j :. (w :. (v :. Graph)))) := b

Traversable Binary

Defined in Pandora.Paradigm.Structure.Binary

Methods

(->>) :: (Pointable u, Applicative u) => Binary a -> (a -> u b) -> (u :. Binary) := b

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Binary a -> (u :. Binary) := b

sequence :: (Pointable u, Applicative u) => ((Binary :. u) := a) -> (u :. Binary) := a

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Binary) := a) -> (a -> u b) -> (u :. (v :. Binary)) := b

(->>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w) => ((w :. (v :. Binary)) := a) -> (a -> u b) -> (u :. (w :. (v :. Binary))) := b

(->>>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w, Traversable j) => ((j :. (w :. (v :. Binary))) := a) -> (a -> u b) -> (u :. (j :. (w :. (v :. Binary)))) := b

Semigroup (Stack a)

Defined in Pandora.Paradigm.Structure.Stack

Methods

(+) :: Stack a -> Stack a -> Stack a

Monoid (Stack a)

Defined in Pandora.Paradigm.Structure.Stack

Methods

zero :: Stack a

Setoid a => Setoid (Stack a)

Defined in Pandora.Paradigm.Structure.Stack

Methods

(==) :: Stack a -> Stack a -> Boolean

(/=) :: Stack a -> Stack a -> Boolean

Substructure (Left :: Type -> Wye Type) Binary

Defined in Pandora.Paradigm.Structure.Binary

Associated Types

type Output Left Binary a = (r :: Type)

Methods

sub :: Binary a :-. Output Left Binary a

Substructure (Right :: Type -> Wye Type) Binary

Defined in Pandora.Paradigm.Structure.Binary

Associated Types

type Output Right Binary a = (r :: Type)

Methods

sub :: Binary a :-. Output Right Binary a

Pointable t => Liftable (UT Covariant Covariant t)

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

Methods

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

Extractable t => Lowerable (UT Covariant Covariant t)

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

Methods

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

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

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

Covariant u => Covariant (UT Covariant Covariant ((->) e :: Type -> Type) u)

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

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

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

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

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

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

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

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

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

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

(<$$$$>) :: (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

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

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

(<&&&&>) :: (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

Covariant u => Covariant (UT Covariant Covariant ((:*:) e) u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

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

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

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

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

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

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

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

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

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

(<$$$$>) :: (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

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

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

(<&&&&>) :: (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

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

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

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

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

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

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

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

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

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

(<$$$$>) :: (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

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

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

(<&&&&>) :: (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

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

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

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

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

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

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

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

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

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

(<$$$$>) :: (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

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

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

(<&&&&>) :: (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

(Semigroup e, Pointable u, Bindable u) => Bindable (UT Covariant Covariant ((:*:) e) u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

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

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

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

join :: ((UT Covariant Covariant ((:*:) e) u :. UT Covariant Covariant ((:*:) e) u) := a) -> UT Covariant Covariant ((:*:) e) u a

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

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

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

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

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

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

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

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

Applicative u => Applicative (UT Covariant Covariant ((->) e :: Type -> Type) u)

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

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

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

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

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

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

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

(<***>) :: (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

(<****>) :: (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

(Semigroup e, Applicative u) => Applicative (UT Covariant Covariant ((:*:) e) u)

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

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

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

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

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

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

(<***>) :: (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

(<****>) :: (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

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

Defined in Pandora.Paradigm.Basis.Maybe

Methods

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

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

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

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

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

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

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

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

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

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

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

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

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

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

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

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

(Semigroup e, Extendable u) => Extendable (UT Covariant Covariant ((->) e :: Type -> Type) u)

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

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

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

extend :: (UT Covariant Covariant ((->) e) u a -> b) -> UT Covariant Covariant ((->) e) u a -> UT Covariant Covariant ((->) e) u b

duplicate :: UT Covariant Covariant ((->) e) u a -> (UT Covariant Covariant ((->) e) u :. UT Covariant Covariant ((->) e) u) := a

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

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

(Pointable u, Monoid e) => Pointable (UT Covariant Covariant ((:*:) e) u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

point :: a |-> UT Covariant Covariant ((:*:) e) u

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

Defined in Pandora.Paradigm.Basis.Maybe

Methods

point :: a |-> UT Covariant Covariant Maybe u

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

Defined in Pandora.Paradigm.Basis.Conclusion

Methods

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

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

Defined in Pandora.Paradigm.Basis.Maybe

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

Defined in Pandora.Paradigm.Basis.Conclusion

(Monoid e, Extractable u) => Extractable (UT Covariant Covariant ((->) e :: Type -> Type) u)

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

extract :: a <-| UT Covariant Covariant ((->) e) u

type Nonempty Stack

Defined in Pandora.Paradigm.Structure.Stack

type Nonempty Stack = Twister Maybe

type Nonempty Graph

Defined in Pandora.Paradigm.Structure.Graph

type Nonempty Graph = Twister Edges

type Nonempty Binary

Defined in Pandora.Paradigm.Structure.Binary

type Nonempty Binary = Twister Wye

type Output (Left :: Type -> Wye Type) Binary a

Defined in Pandora.Paradigm.Structure.Binary

type Output (Left :: Type -> Wye Type) Binary a = (Left :: (Any :: Type) -> Wye (Any :: Type)) :# Binary a

type Output (Right :: Type -> Wye Type) Binary a

Defined in Pandora.Paradigm.Structure.Binary

type Output (Right :: Type -> Wye Type) Binary a = (Right :: (Any :: Type) -> Wye (Any :: Type)) :# Binary a

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