Pandora.Paradigm.Schemes.UT

Documentation

newtype UT ct cu t u a

Constructors

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

Instances

(Pointable u ((->) :: Type -> Type -> Type), Bindable u ((->) :: Type -> Type -> Type)) => 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 t, Covariant u) => Covariant (t <.:> u)

Defined in Pandora.Paradigm.Schemes.UT

Methods

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

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

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

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

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

loeb :: (t <.:> u) (a <:= (t <.:> u)) -> (t <.:> u) a

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

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

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

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

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

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

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

(.#..) :: ((t <.:> u) ~ v a, Category v) => v c d -> ((v a :. v b) := c) -> (v a :. v b) := d

(.#...) :: ((t <.:> u) ~ v a, (t <.:> u) ~ v b, Category v, Covariant (v a), Covariant (v b)) => v d e -> ((v a :. (v b :. v c)) := d) -> (v a :. (v b :. v c)) := e

(.#....) :: ((t <.:> u) ~ v a, (t <.:> u) ~ v b, (t <.:> u) ~ v c, Category v, Covariant (v a), Covariant (v b), Covariant (v c)) => v e f -> ((v a :. (v b :. (v c :. v d))) := e) -> (v a :. (v b :. (v c :. v d))) := f

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

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

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

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

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

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

(Applicative t, Applicative u) => Applicative (t <.:> u)

Defined in Pandora.Paradigm.Schemes.UT

Methods

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

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

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

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

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

(<%>) :: (t <.:> u) a -> (t <.:> u) (a -> b) -> (t <.:> u) b

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

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

(<****>) :: (Applicative u0, Applicative v, Applicative w) => (((t <.:> u) :. (u0 :. (v :. w))) := (a -> b)) -> (((t <.:> u) :. (u0 :. (v :. w))) := a) -> ((t <.:> 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

(<%>) :: ((:*:) e <.:> u) a -> ((:*:) e <.:> u) (a -> b) -> ((:*:) 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

(Traversable t ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type), Bindable t ((->) :: Type -> Type -> Type), Semimonoidal u (:*:) ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type), Pointable u ((->) :: Type -> Type -> Type), Bindable u ((->) :: Type -> Type -> Type)) => Bindable (t <.:> u) ((->) :: Type -> Type -> Type)

Defined in Pandora.Paradigm.Schemes.UT

Methods

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

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

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

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

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

Defined in Pandora.Paradigm.Inventory.Imprint

Methods

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

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

Defined in Pandora.Paradigm.Schemes.UT

Methods

extract :: (t <.:> u) a -> a

(Pointable t ((->) :: Type -> Type -> Type), Pointable u ((->) :: Type -> Type -> Type)) => Pointable (t <.:> u) ((->) :: Type -> Type -> Type)

Defined in Pandora.Paradigm.Schemes.UT

Methods

point :: a -> (t <.:> u) a

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

Defined in Pandora.Paradigm.Inventory.Accumulator

Methods

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

(Covariant_ t ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type), Covariant_ u ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type)) => Covariant_ (t <.:> u) ((->) :: Type -> Type -> Type) ((->) :: Type -> Type -> Type)

Defined in Pandora.Paradigm.Schemes.UT

Methods

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

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

Defined in Pandora.Paradigm.Schemes

Methods

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

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

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

Defined in Pandora.Paradigm.Schemes

Methods

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

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

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

Defined in Pandora.Paradigm.Schemes

Methods

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

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

Pointable t ((->) :: Type -> Type -> Type) => 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 ((->) :: Type -> Type -> Type) => 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

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

(||=) :: Interpreted u0 => (Primary (UT ct cu t u) a -> Primary u0 b) -> UT ct cu t u a -> u0 b

(=||) :: Interpreted u0 => (UT ct cu t u a -> u0 b) -> Primary (UT ct cu t u) a -> Primary u0 b

(<$||=) :: (Covariant j, Interpreted u0) => (Primary (UT ct cu t u) a -> Primary u0 b) -> (j := UT ct cu t u a) -> j := u0 b

(<$$||=) :: (Covariant j, Covariant k, Interpreted u0) => (Primary (UT ct cu t u) a -> Primary u0 b) -> ((j :. k) := UT ct cu t u a) -> (j :. k) := u0 b

(<$$$||=) :: (Covariant j, Covariant k, Covariant l, Interpreted u0) => (Primary (UT ct cu t u) a -> Primary u0 b) -> ((j :. (k :. l)) := UT ct cu t u a) -> (j :. (k :. l)) := u0 b

(<$$$$||=) :: (Covariant j, Covariant k, Covariant l, Covariant m, Interpreted u0) => (Primary (UT ct cu t u) a -> Primary u0 b) -> ((j :. (k :. (l :. m))) := UT ct cu t u a) -> (j :. (k :. (l :. m))) := u0 b

(=||$>) :: (Covariant j, Interpreted u0) => (UT ct cu t u a -> u0 b) -> (j := Primary (UT ct cu t u) a) -> j := Primary u0 b

(=||$$>) :: (Covariant j, Covariant k, Interpreted u0) => (UT ct cu t u a -> u0 b) -> ((j :. k) := Primary (UT ct cu t u) a) -> (j :. k) := Primary u0 b

(=||$$$>) :: (Covariant j, Covariant k, Covariant l, Interpreted u0) => (UT ct cu t u a -> u0 b) -> ((j :. (k :. l)) := Primary (UT ct cu t u) a) -> (j :. (k :. l)) := Primary u0 b

(=||$$$$>) :: (Covariant j, Covariant k, Covariant l, Covariant m, Interpreted u0) => (UT ct cu t u a -> u0 b) -> ((j :. (k :. (l :. m))) := Primary (UT ct cu t u) a) -> (j :. (k :. (l :. m))) := Primary u0 b

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 infixr 3

type (>.:>) = UT Contravariant Covariant infixr 3

type (<.:<) = UT Covariant Contravariant infixr 3

type (>.:<) = UT Contravariant Contravariant infixr 3