Pandora.Paradigm.Schemes.UT

Documentation

newtype UT ct cu t u a

Constructors

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

Instances

Monad u => Catchable e (Conclusion e <.:> u :: Type -> Type)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

catch :: forall (a :: k). (Conclusion e <.:> u) a -> (e -> (Conclusion e <.:> u) a) -> (Conclusion e <.:> u) a

Covariant u => Covariant (((->) e :: Type -> Type) <.:> u)

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

(<$>) :: (a -> b) -> ((->) e <.:> u) a -> ((->) e <.:> u) b

comap :: (a -> b) -> ((->) e <.:> u) a -> ((->) e <.:> u) b

(<$) :: a -> ((->) e <.:> u) b -> ((->) e <.:> u) a

($>) :: ((->) e <.:> u) a -> b -> ((->) e <.:> u) b

void :: ((->) e <.:> u) a -> ((->) e <.:> u) ()

loeb :: ((->) e <.:> u) (a <-| ((->) e <.:> u)) -> ((->) e <.:> u) a

(<&>) :: ((->) e <.:> u) a -> (a -> b) -> ((->) e <.:> u) b

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

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

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

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

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

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

Covariant u => Covariant ((:*:) e <.:> u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

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

comap :: (a -> b) -> ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b

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

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

void :: ((:*:) e <.:> u) a -> ((:*:) e <.:> u) ()

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

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

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

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

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

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

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

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

Covariant u => Covariant (Maybe <.:> u)

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

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

comap :: (a -> b) -> (Maybe <.:> u) a -> (Maybe <.:> u) b

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

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

void :: (Maybe <.:> u) a -> (Maybe <.:> u) ()

loeb :: (Maybe <.:> u) (a <-| (Maybe <.:> u)) -> (Maybe <.:> u) a

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

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

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

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

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

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

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

Covariant u => Covariant (Conclusion e <.:> u)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

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

comap :: (a -> b) -> (Conclusion e <.:> u) a -> (Conclusion e <.:> u) b

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

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

void :: (Conclusion e <.:> u) a -> (Conclusion e <.:> u) ()

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

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

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

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

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

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

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

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

(Semigroup e, Pointable u, Bindable u) => Bindable ((:*:) e <.:> u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

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

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

bind :: (a -> ((:*:) e <.:> u) b) -> ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b

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

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

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

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

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

(Pointable u, Bindable u) => Bindable (Maybe <.:> u)

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

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

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

bind :: (a -> (Maybe <.:> u) b) -> (Maybe <.:> u) a -> (Maybe <.:> u) b

join :: (((Maybe <.:> u) :. (Maybe <.:> u)) := a) -> (Maybe <.:> u) a

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

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

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

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

(Pointable u, Bindable u) => Bindable (Conclusion e <.:> u)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

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

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

bind :: (a -> (Conclusion e <.:> u) b) -> (Conclusion e <.:> u) a -> (Conclusion e <.:> u) b

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

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

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

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

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

Applicative u => Applicative (((->) e :: Type -> Type) <.:> u)

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

(<*>) :: ((->) e <.:> u) (a -> b) -> ((->) e <.:> u) a -> ((->) e <.:> u) b

apply :: ((->) e <.:> u) (a -> b) -> ((->) e <.:> u) a -> ((->) e <.:> u) b

(*>) :: ((->) e <.:> u) a -> ((->) e <.:> u) b -> ((->) e <.:> u) b

(<*) :: ((->) e <.:> u) a -> ((->) e <.:> u) b -> ((->) e <.:> u) a

forever :: ((->) e <.:> u) a -> ((->) e <.:> u) b

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

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

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

(Semigroup e, Applicative u) => Applicative ((:*:) e <.:> u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

(<*>) :: ((:*:) e <.:> u) (a -> b) -> ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b

apply :: ((:*:) e <.:> u) (a -> b) -> ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b

(*>) :: ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b -> ((:*:) e <.:> u) b

(<*) :: ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b -> ((:*:) e <.:> u) a

forever :: ((:*:) e <.:> u) a -> ((:*:) e <.:> u) b

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

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

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

Applicative u => Applicative (Maybe <.:> u)

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

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

apply :: (Maybe <.:> u) (a -> b) -> (Maybe <.:> u) a -> (Maybe <.:> u) b

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

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

forever :: (Maybe <.:> u) a -> (Maybe <.:> u) b

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

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

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

Applicative u => Applicative (Conclusion e <.:> u)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

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

apply :: (Conclusion e <.:> u) (a -> b) -> (Conclusion e <.:> u) a -> (Conclusion e <.:> u) b

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

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

forever :: (Conclusion e <.:> u) a -> (Conclusion e <.:> u) b

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

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

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

(Semigroup e, Extendable u) => Extendable (((->) e :: Type -> Type) <.:> u)

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

(=>>) :: ((->) e <.:> u) a -> (((->) e <.:> u) a -> b) -> ((->) e <.:> u) b

(<<=) :: (((->) e <.:> u) a -> b) -> ((->) e <.:> u) a -> ((->) e <.:> u) b

extend :: (((->) e <.:> u) a -> b) -> ((->) e <.:> u) a -> ((->) e <.:> u) b

duplicate :: ((->) e <.:> u) a -> (((->) e <.:> u) :. ((->) e <.:> u)) := a

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

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

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

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

(Pointable u, Monoid e) => Pointable ((:*:) e <.:> u)

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

point :: a |-> ((:*:) e <.:> u)

Pointable u => Pointable (Maybe <.:> u)

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

point :: a |-> (Maybe <.:> u)

Pointable u => Pointable (Conclusion e <.:> u)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

point :: a |-> (Conclusion e <.:> u)

Monad u => Monad (Maybe <.:> u)

Defined in Pandora.Paradigm.Primary.Functor.Maybe

Methods

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

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

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

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

Monad u => Monad (Conclusion e <.:> u)

Defined in Pandora.Paradigm.Primary.Functor.Conclusion

Methods

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

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

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

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

(Monoid e, Extractable u) => Extractable (((->) e :: Type -> Type) <.:> u)

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

extract :: a <-| ((->) e <.:> u)

(Covariant (t <.:> v), Covariant (w <:.> u), Adjoint v u, Adjoint t w) => Adjoint (t <.:> v) (w <:.> u)

Defined in Pandora.Paradigm.Schemes

Methods

(-|) :: a -> ((t <.:> v) a -> b) -> (w <:.> u) b

(|-) :: (t <.:> v) a -> (a -> (w <:.> u) b) -> b

phi :: ((t <.:> v) a -> b) -> a -> (w <:.> u) b

psi :: (a -> (w <:.> u) b) -> (t <.:> v) a -> b

eta :: a -> ((w <:.> u) :. (t <.:> v)) := a

epsilon :: (((t <.:> v) :. (w <:.> u)) := a) -> a

(Covariant (t <.:> v), Covariant (w <.:> u), Adjoint t u, Adjoint v w) => Adjoint (t <.:> v) (w <.:> u)

Defined in Pandora.Paradigm.Schemes

Methods

(-|) :: a -> ((t <.:> v) a -> b) -> (w <.:> u) b

(|-) :: (t <.:> v) a -> (a -> (w <.:> u) b) -> b

phi :: ((t <.:> v) a -> b) -> a -> (w <.:> u) b

psi :: (a -> (w <.:> u) b) -> (t <.:> v) a -> b

eta :: a -> ((w <.:> u) :. (t <.:> v)) := a

epsilon :: (((t <.:> v) :. (w <.:> u)) := a) -> a

(Covariant (v <:.> t), Covariant (w <.:> u), Adjoint t u, Adjoint v w) => Adjoint (v <:.> t) (w <.:> u)

Defined in Pandora.Paradigm.Schemes

Methods

(-|) :: a -> ((v <:.> t) a -> b) -> (w <.:> u) b

(|-) :: (v <:.> t) a -> (a -> (w <.:> u) b) -> b

phi :: ((v <:.> t) a -> b) -> a -> (w <.:> u) b

psi :: (a -> (w <.:> u) b) -> (v <:.> t) a -> b

eta :: a -> ((w <.:> u) :. (v <:.> t)) := a

epsilon :: (((v <:.> t) :. (w <.:> u)) := a) -> a

Pointable t => Liftable (UT Covariant Covariant t)

Defined in Pandora.Paradigm.Schemes.UT

Methods

lift :: forall (u :: Type -> Type). Covariant u => u ~> UT Covariant Covariant t u

Extractable t => Lowerable (UT Covariant Covariant t)

Defined in Pandora.Paradigm.Schemes.UT

Methods

lower :: forall (u :: Type -> Type). Covariant u => UT Covariant Covariant t u ~> u

Interpreted (UT ct cu t u)

Defined in Pandora.Paradigm.Schemes.UT

Associated Types

type Primary (UT ct cu t u) a

Methods

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

type Primary (UT ct cu t u) a

Defined in Pandora.Paradigm.Schemes.UT

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

type (<.:>) = UT Covariant Covariant

type (>.:>) = UT Contravariant Covariant

type (<.:<) = UT Covariant Contravariant

type (>.:<) = UT Contravariant Contravariant