{-# LANGUAGE AllowAmbiguousTypes #-}
module Proarrow.Tools.SMC.Internal.Additive where
import Data.Kind (Constraint)
import Proarrow.Category.Monoidal qualified as M
import Proarrow.Category.Monoidal.Distributive (Distributive (..), DistributiveProfunctor, branch)
import Proarrow.Colimit.BinaryCoproduct (HasBinaryCoproducts (..))
import Proarrow.Colimit.Initial (HasInitialObject (..))
import Proarrow.Core (CAT, Profunctor (..), Promonad (..), obj)
import Proarrow.Limit.BinaryProduct (HasBinaryProducts (..))
import Proarrow.Limit.Terminal (HasTerminalObject (..))
import Proarrow.Object (pattern Objs)
import Prelude (($), type (~))
import Proarrow.Tools.SMC.Internal.Context
import Proarrow.Tools.SMC.Internal.Pattern
import Proarrow.Tools.SMC.Internal.Syntax
import Proarrow.Tools.SMC.Internal.Term
{-# INLINE with #-}
with
:: forall {k} (a :: SYN k) b d g1 g2
. (HasBinaryProducts k, Thin (Union g1 g2) g1, Thin (Union g1 g2) g2)
=> Term d g1 a
-> Term d g2 b
-> Term d (Union g1 g2) (a :&& b)
with :: forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g1 :: Ctx k)
(g2 :: Ctx k).
(HasBinaryProducts k, Thin (Union g1 g2) g1,
Thin (Union g1 g2) g2) =>
Term d g1 a -> Term d g2 b -> Term d (Union g1 g2) (a :&& b)
with (MkTerm Interp (Mul g1) ~> Interp a
f) (MkTerm Interp (Mul g2) ~> Interp b
h) = (Interp (Mul (Union g1 g2)) ~> Interp (a :&& b))
-> TermP (~>) d (Union g1 g2) (a :&& b)
forall {k} (p :: CAT k) (g :: Ctx k) (a :: SYN k) (d :: Nat).
p (Interp (Mul g)) (Interp a) -> TermP p d g a
MkTerm ((Interp (Mul g1) ~> Interp a
f (Interp (Mul g1) ~> Interp a)
-> (Interp (Mul (Union g1 g2)) ~> Interp (Mul g1))
-> Interp (Mul (Union g1 g2)) ~> Interp a
forall (b :: k) (c :: k) (a :: k). (b ~> c) -> (a ~> b) -> a ~> c
forall {k} (p :: CAT k) (b :: k) (c :: k) (a :: k).
Promonad p =>
p b c -> p a b -> p a c
. forall (g :: Ctx k) (h :: Ctx k).
Thin g h =>
Interp (Mul g) ~> Interp (Mul h)
forall {k} (g :: Ctx k) (h :: Ctx k).
Thin g h =>
Interp (Mul g) ~> Interp (Mul h)
thin @(Union g1 g2) @g1) (Interp (Mul (Union g1 g2)) ~> Interp a)
-> (Interp (Mul (Union g1 g2)) ~> Interp b)
-> Interp (Mul (Union g1 g2)) ~> (Interp a && Interp b)
forall (a :: k) (x :: k) (y :: k).
(a ~> x) -> (a ~> y) -> a ~> (x && y)
forall k (a :: k) (x :: k) (y :: k).
HasBinaryProducts k =>
(a ~> x) -> (a ~> y) -> a ~> (x && y)
&&& (Interp (Mul g2) ~> Interp b
h (Interp (Mul g2) ~> Interp b)
-> (Interp (Mul (Union g1 g2)) ~> Interp (Mul g2))
-> Interp (Mul (Union g1 g2)) ~> Interp b
forall (b :: k) (c :: k) (a :: k). (b ~> c) -> (a ~> b) -> a ~> c
forall {k} (p :: CAT k) (b :: k) (c :: k) (a :: k).
Promonad p =>
p b c -> p a b -> p a c
. forall (g :: Ctx k) (h :: Ctx k).
Thin g h =>
Interp (Mul g) ~> Interp (Mul h)
forall {k} (g :: Ctx k) (h :: Ctx k).
Thin g h =>
Interp (Mul g) ~> Interp (Mul h)
thin @(Union g1 g2) @g2))
{-# INLINE exl #-}
exl
:: forall {k} {p} (a :: SYN k) b d g
. (HasBinaryProducts k, Profunctor p, KnownObj a, KnownObj b) => TermP p d g (a :&& b) -> TermP p d g a
exl :: forall {k} {p :: k +-> k} (a :: SYN k) (b :: SYN k) (d :: Nat)
(g :: Ctx k).
(HasBinaryProducts k, Profunctor p, KnownObj a, KnownObj b) =>
TermP p d g (a :&& b) -> TermP p d g a
exl = (Interp (a :&& b) ~> Interp a)
-> TermP p d g (a :&& b) -> TermP p d g a
forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
(p :: CAT k).
Profunctor p =>
(Interp a ~> Interp b) -> TermP p d g a -> TermP p d g b
rmapT (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @a (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @b (forall k (a :: k) (b :: k).
(HasBinaryProducts k, Ob a, Ob b) =>
(a && b) ~> a
fst @k @(Interp a) @(Interp b))))
{-# INLINE exr #-}
exr
:: forall {k} {p} (a :: SYN k) b d g
. (HasBinaryProducts k, Profunctor p, KnownObj a, KnownObj b) => TermP p d g (a :&& b) -> TermP p d g b
exr :: forall {k} {p :: k +-> k} (a :: SYN k) (b :: SYN k) (d :: Nat)
(g :: Ctx k).
(HasBinaryProducts k, Profunctor p, KnownObj a, KnownObj b) =>
TermP p d g (a :&& b) -> TermP p d g b
exr = (Interp (a :&& b) ~> Interp b)
-> TermP p d g (a :&& b) -> TermP p d g b
forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
(p :: CAT k).
Profunctor p =>
(Interp a ~> Interp b) -> TermP p d g a -> TermP p d g b
rmapT (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @a (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @b (forall k (a :: k) (b :: k).
(HasBinaryProducts k, Ob a, Ob b) =>
(a && b) ~> b
snd @k @(Interp a) @(Interp b))))
{-# INLINE absorb #-}
absorb
:: forall {k} {p} (s :: SYN k) d g. (HasTerminalObject k, Profunctor p, KnownObj s) => TermP p d g s -> TermP p d g Top
absorb :: forall {k} {p :: k +-> k} (s :: SYN k) (d :: Nat) (g :: Ctx k).
(HasTerminalObject k, Profunctor p, KnownObj s) =>
TermP p d g s -> TermP p d g Top
absorb = (Interp s ~> Interp Top) -> TermP p d g s -> TermP p d g Top
forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
(p :: CAT k).
Profunctor p =>
(Interp a ~> Interp b) -> TermP p d g a -> TermP p d g b
rmapT (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @s (forall k (a :: k).
(HasTerminalObject k, Ob a) =>
a ~> TerminalObject
terminate @k @(Interp s)))
{-# INLINE inl #-}
inl
:: forall {k} (a :: SYN k) b d g p
. (Profunctor p, HasBinaryCoproducts k, KnownObj a, KnownObj b)
=> TermP p d g a -> TermP p d g (a :|| b)
inl :: forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
(p :: k +-> k).
(Profunctor p, HasBinaryCoproducts k, KnownObj a, KnownObj b) =>
TermP p d g a -> TermP p d g (a :|| b)
inl = forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
(p :: CAT k).
Profunctor p =>
(Interp a ~> Interp b) -> TermP p d g a -> TermP p d g b
forall (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
(p :: CAT k).
Profunctor p =>
(Interp a ~> Interp b) -> TermP p d g a -> TermP p d g b
rmapT @a @(a :|| b) (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @a (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @b (forall k (a :: k) (b :: k).
(HasBinaryCoproducts k, Ob a, Ob b) =>
a ~> (a || b)
lft @k @(Interp a) @(Interp b))))
{-# INLINE inr #-}
inr
:: forall {k} (a :: SYN k) b d g p
. (Profunctor p, HasBinaryCoproducts k, KnownObj a, KnownObj b)
=> TermP p d g b -> TermP p d g (a :|| b)
inr :: forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
(p :: k +-> k).
(Profunctor p, HasBinaryCoproducts k, KnownObj a, KnownObj b) =>
TermP p d g b -> TermP p d g (a :|| b)
inr = forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
(p :: CAT k).
Profunctor p =>
(Interp a ~> Interp b) -> TermP p d g a -> TermP p d g b
forall (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
(p :: CAT k).
Profunctor p =>
(Interp a ~> Interp b) -> TermP p d g a -> TermP p d g b
rmapT @b @(a :|| b) (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @a (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @b (forall k (a :: k) (b :: k).
(HasBinaryCoproducts k, Ob a, Ob b) =>
b ~> (a || b)
rgt @k @(Interp a) @(Interp b))))
type Sum :: forall {k}. SYN k -> SYN k -> SYN k -> Constraint
class (Interp s ~ Interp (a :|| b)) => Sum s a b
instance {-# INCOHERENT #-} (s ~ (a :|| b)) => Sum s a b
instance (z ~ (x || y), a ~ F x, b ~ F y) => Sum (F z) a b
{-# INLINE caseOf #-}
caseOf
:: forall {k} (a :: SYN k) b c d g r1 r2 t1 cont1 t2 cont2 s (p :: CAT k)
. ( Distributive k
, Promonad p
, DistributiveProfunctor p
, Sum s a b
, KnownObj a
, KnownObj b
, Binds p d r1 a c t1 cont1
, Binds p d r2 b c t2 cont2
, Thin (Union r1 r2) r1
, Thin (Union r1 r2) r2
, Merge (Union r1 r2) g
)
=> TermP p d g s
-> (t1 -> cont1)
-> (t2 -> cont2)
-> TermP p d (Union (Union r1 r2) g) c
caseOf :: forall {k} (a :: SYN k) (b :: SYN k) (c :: SYN k) (d :: Nat)
(g :: Ctx k) (r1 :: Ctx k) (r2 :: Ctx k) t1 cont1 t2 cont2
(s :: SYN k) (p :: CAT k).
(Distributive k, Promonad p, DistributiveProfunctor p, Sum s a b,
KnownObj a, KnownObj b, Binds p d r1 a c t1 cont1,
Binds p d r2 b c t2 cont2, Thin (Union r1 r2) r1,
Thin (Union r1 r2) r2, Merge (Union r1 r2) g) =>
TermP p d g s
-> (t1 -> cont1)
-> (t2 -> cont2)
-> TermP p d (Union (Union r1 r2) g) c
caseOf (MkTerm p (Interp (Mul g)) (Interp s)
x) t1 -> cont1
f t2 -> cont2
h =
forall (g :: Ctx k) r.
(KnownCtx g, Monoidal k) =>
(Ob (Interp (Mul g)) => r) -> r
forall {k} (g :: Ctx k) r.
(KnownCtx g, Monoidal k) =>
(Ob (Interp (Mul g)) => r) -> r
withCtxOb @(Union r1 r2)
( forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @a
( forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @b
( case ((Interp (Mul (Union r1 r2)) ** Interp a)
~> (Interp (Mul r1) ** Interp a))
-> p (Interp (Mul r1) ** Interp a) (Interp c)
-> p (Interp (Mul (Union r1 r2)) ** Interp a) (Interp c)
forall (c :: k) (a :: k) (b :: k). (c ~> a) -> p a b -> p c b
forall {j} {k} (p :: j +-> k) (c :: k) (a :: k) (b :: j).
Profunctor p =>
(c ~> a) -> p a b -> p c b
lmap (forall (g :: Ctx k) (h :: Ctx k).
Thin g h =>
Interp (Mul g) ~> Interp (Mul h)
forall {k} (g :: Ctx k) (h :: Ctx k).
Thin g h =>
Interp (Mul g) ~> Interp (Mul h)
thin @(Union r1 r2) @r1 (Interp (Mul (Union r1 r2)) ~> Interp (Mul r1))
-> (Interp a ~> Interp a)
-> (Interp (Mul (Union r1 r2)) ** Interp a)
~> (Interp (Mul r1) ** Interp a)
forall (x1 :: k) (x2 :: k) (y1 :: k) (y2 :: k).
(x1 ~> x2) -> (y1 ~> y2) -> (x1 ** y1) ~> (x2 ** y2)
forall {j} {k} (p :: j +-> k) (x1 :: k) (x2 :: j) (y1 :: k)
(y2 :: j).
MonoidalProfunctor p =>
p x1 x2 -> p y1 y2 -> p (x1 ** y1) (x2 ** y2)
M.** forall (a :: k). (CategoryOf k, Ob a) => Obj a
forall {k} (a :: k). (CategoryOf k, Ob a) => Obj a
obj @(Interp a)) (forall {k} (p :: CAT k) (n :: Nat) (g :: Ctx k) (a :: SYN k)
(b :: SYN k) t cont.
Binds p n g a b t cont =>
(t -> cont) -> p (Interp (Mul g) ** Interp a) (Interp b)
forall (p :: CAT k) (n :: Nat) (g :: Ctx k) (a :: SYN k)
(b :: SYN k) t cont.
Binds p n g a b t cont =>
(t -> cont) -> p (Interp (Mul g) ** Interp a) (Interp b)
bound @p @d @r1 @a @c t1 -> cont1
f) of
l :: p (Interp (Mul (Union r1 r2)) ** Interp a) (Interp c)
l@p (Interp (Mul (Union r1 r2)) ** Interp a) (Interp c)
Objs -> case ((Interp (Mul (Union r1 r2)) ** Interp b)
~> (Interp (Mul r2) ** Interp b))
-> p (Interp (Mul r2) ** Interp b) (Interp c)
-> p (Interp (Mul (Union r1 r2)) ** Interp b) (Interp c)
forall (c :: k) (a :: k) (b :: k). (c ~> a) -> p a b -> p c b
forall {j} {k} (p :: j +-> k) (c :: k) (a :: k) (b :: j).
Profunctor p =>
(c ~> a) -> p a b -> p c b
lmap (forall (g :: Ctx k) (h :: Ctx k).
Thin g h =>
Interp (Mul g) ~> Interp (Mul h)
forall {k} (g :: Ctx k) (h :: Ctx k).
Thin g h =>
Interp (Mul g) ~> Interp (Mul h)
thin @(Union r1 r2) @r2 (Interp (Mul (Union r1 r2)) ~> Interp (Mul r2))
-> (Interp b ~> Interp b)
-> (Interp (Mul (Union r1 r2)) ** Interp b)
~> (Interp (Mul r2) ** Interp b)
forall (x1 :: k) (x2 :: k) (y1 :: k) (y2 :: k).
(x1 ~> x2) -> (y1 ~> y2) -> (x1 ** y1) ~> (x2 ** y2)
forall {j} {k} (p :: j +-> k) (x1 :: k) (x2 :: j) (y1 :: k)
(y2 :: j).
MonoidalProfunctor p =>
p x1 x2 -> p y1 y2 -> p (x1 ** y1) (x2 ** y2)
M.** forall (a :: k). (CategoryOf k, Ob a) => Obj a
forall {k} (a :: k). (CategoryOf k, Ob a) => Obj a
obj @(Interp b)) (forall {k} (p :: CAT k) (n :: Nat) (g :: Ctx k) (a :: SYN k)
(b :: SYN k) t cont.
Binds p n g a b t cont =>
(t -> cont) -> p (Interp (Mul g) ** Interp a) (Interp b)
forall (p :: CAT k) (n :: Nat) (g :: Ctx k) (a :: SYN k)
(b :: SYN k) t cont.
Binds p n g a b t cont =>
(t -> cont) -> p (Interp (Mul g) ** Interp a) (Interp b)
bound @p @d @r2 @b @c t2 -> cont2
h) of
r :: p (Interp (Mul (Union r1 r2)) ** Interp b) (Interp c)
r@p (Interp (Mul (Union r1 r2)) ** Interp b) (Interp c)
Objs ->
p (Interp (Mul (Union (Union r1 r2) g))) (Interp c)
-> TermP p d (Union (Union r1 r2) g) c
forall {k} (p :: CAT k) (g :: Ctx k) (a :: SYN k) (d :: Nat).
p (Interp (Mul g)) (Interp a) -> TermP p d g a
MkTerm (p (Interp (Mul (Union (Union r1 r2) g))) (Interp c)
-> TermP p d (Union (Union r1 r2) g) c)
-> p (Interp (Mul (Union (Union r1 r2) g))) (Interp c)
-> TermP p d (Union (Union r1 r2) g) c
forall a b. (a -> b) -> a -> b
$
(Interp (Mul (Union (Union r1 r2) g))
~> (Interp (Mul (Union r1 r2)) ** Interp (Mul g)))
-> p (Interp (Mul (Union r1 r2)) ** Interp (Mul g)) (Interp c)
-> p (Interp (Mul (Union (Union r1 r2) g))) (Interp c)
forall (c :: k) (a :: k) (b :: k). (c ~> a) -> p a b -> p c b
forall {j} {k} (p :: j +-> k) (c :: k) (a :: k) (b :: j).
Profunctor p =>
(c ~> a) -> p a b -> p c b
lmap (forall (g1 :: Ctx k) (g2 :: Ctx k).
Merge g1 g2 =>
Interp (Mul (Union g1 g2)) ~> (Interp (Mul g1) ** Interp (Mul g2))
forall {k} (g1 :: Ctx k) (g2 :: Ctx k).
Merge g1 g2 =>
Interp (Mul (Union g1 g2)) ~> (Interp (Mul g1) ** Interp (Mul g2))
merge @(Union r1 r2) @g) (p (Interp (Mul (Union r1 r2)) ** Interp (Mul g)) (Interp c)
-> p (Interp (Mul (Union (Union r1 r2) g))) (Interp c))
-> p (Interp (Mul (Union r1 r2)) ** Interp (Mul g)) (Interp c)
-> p (Interp (Mul (Union (Union r1 r2) g))) (Interp c)
forall a b. (a -> b) -> a -> b
$
p (Interp (Mul (Union r1 r2)) ** Interp (Mul g))
((Interp (Mul (Union r1 r2)) ** Interp a)
|| (Interp (Mul (Union r1 r2)) ** Interp b))
-> p (Interp (Mul (Union r1 r2)) ** Interp a) (Interp c)
-> p (Interp (Mul (Union r1 r2)) ** Interp b) (Interp c)
-> p (Interp (Mul (Union r1 r2)) ** Interp (Mul g)) (Interp c)
forall {k} (a :: k) (b :: k) (c :: k) (i :: k) (p :: k +-> k).
(DistributiveProfunctor p, Promonad p, Distributive k, Ob a, Ob b,
Ob c) =>
p i (a || b) -> p a c -> p b c -> p i c
branch
(((Interp (Mul (Union r1 r2)) ** Interp s)
~> ((Interp (Mul (Union r1 r2)) ** Interp a)
|| (Interp (Mul (Union r1 r2)) ** Interp b)))
-> p (Interp (Mul (Union r1 r2)) ** Interp (Mul g))
(Interp (Mul (Union r1 r2)) ** Interp s)
-> p (Interp (Mul (Union r1 r2)) ** Interp (Mul g))
((Interp (Mul (Union r1 r2)) ** Interp a)
|| (Interp (Mul (Union r1 r2)) ** Interp b))
forall (b :: k) (d :: k) (a :: k). (b ~> d) -> p a b -> p a d
forall {j} {k} (p :: j +-> k) (b :: j) (d :: j) (a :: k).
Profunctor p =>
(b ~> d) -> p a b -> p a d
rmap (forall k (a :: k) (b :: k) (c :: k).
(Distributive k, Ob a, Ob b, Ob c) =>
(a ** (b || c)) ~> ((a ** b) || (a ** c))
distL @k @(Interp (Mul (Union r1 r2))) @(Interp a) @(Interp b)) (forall {k} (p :: CAT k) (a :: k). (Promonad p, Ob a) => p a a
forall (p :: CAT k) (a :: k). (Promonad p, Ob a) => p a a
id @p @(Interp (Mul (Union r1 r2))) p (Interp (Mul (Union r1 r2))) (Interp (Mul (Union r1 r2)))
-> p (Interp (Mul g)) (Interp s)
-> p (Interp (Mul (Union r1 r2)) ** Interp (Mul g))
(Interp (Mul (Union r1 r2)) ** Interp s)
forall (x1 :: k) (x2 :: k) (y1 :: k) (y2 :: k).
p x1 x2 -> p y1 y2 -> p (x1 ** y1) (x2 ** y2)
forall {j} {k} (p :: j +-> k) (x1 :: k) (x2 :: j) (y1 :: k)
(y2 :: j).
MonoidalProfunctor p =>
p x1 x2 -> p y1 y2 -> p (x1 ** y1) (x2 ** y2)
M.** p (Interp (Mul g)) (Interp s)
x))
p (Interp (Mul (Union r1 r2)) ** Interp a) (Interp c)
l
p (Interp (Mul (Union r1 r2)) ** Interp b) (Interp c)
r
)
)
)
{-# INLINE ifThenElse #-}
ifThenElse
:: forall {k} (a :: SYN k) b c d g r1 r2 t1 cont1 t2 cont2 s (p :: CAT k)
. ( Distributive k
, Promonad p
, DistributiveProfunctor p
, Sum s a b
, KnownObj a
, KnownObj b
, Binds p d r1 a c t1 cont1
, Binds p d r2 b c t2 cont2
, Thin (Union r1 r2) r1
, Thin (Union r1 r2) r2
, Merge (Union r1 r2) g
)
=> TermP p d g s
-> (t1 -> cont1)
-> (t2 -> cont2)
-> TermP p d (Union (Union r1 r2) g) c
ifThenElse :: forall {k} (a :: SYN k) (b :: SYN k) (c :: SYN k) (d :: Nat)
(g :: Ctx k) (r1 :: Ctx k) (r2 :: Ctx k) t1 cont1 t2 cont2
(s :: SYN k) (p :: CAT k).
(Distributive k, Promonad p, DistributiveProfunctor p, Sum s a b,
KnownObj a, KnownObj b, Binds p d r1 a c t1 cont1,
Binds p d r2 b c t2 cont2, Thin (Union r1 r2) r1,
Thin (Union r1 r2) r2, Merge (Union r1 r2) g) =>
TermP p d g s
-> (t1 -> cont1)
-> (t2 -> cont2)
-> TermP p d (Union (Union r1 r2) g) c
ifThenElse = forall {k} (a :: SYN k) (b :: SYN k) (c :: SYN k) (d :: Nat)
(g :: Ctx k) (r1 :: Ctx k) (r2 :: Ctx k) t1 cont1 t2 cont2
(s :: SYN k) (p :: CAT k).
(Distributive k, Promonad p, DistributiveProfunctor p, Sum s a b,
KnownObj a, KnownObj b, Binds p d r1 a c t1 cont1,
Binds p d r2 b c t2 cont2, Thin (Union r1 r2) r1,
Thin (Union r1 r2) r2, Merge (Union r1 r2) g) =>
TermP p d g s
-> (t1 -> cont1)
-> (t2 -> cont2)
-> TermP p d (Union (Union r1 r2) g) c
forall (a :: SYN k) (b :: SYN k) (c :: SYN k) (d :: Nat)
(g :: Ctx k) (r1 :: Ctx k) (r2 :: Ctx k) t1 cont1 t2 cont2
(s :: SYN k) (p :: CAT k).
(Distributive k, Promonad p, DistributiveProfunctor p, Sum s a b,
KnownObj a, KnownObj b, Binds p d r1 a c t1 cont1,
Binds p d r2 b c t2 cont2, Thin (Union r1 r2) r1,
Thin (Union r1 r2) r2, Merge (Union r1 r2) g) =>
TermP p d g s
-> (t1 -> cont1)
-> (t2 -> cont2)
-> TermP p d (Union (Union r1 r2) g) c
caseOf @a @b @c @d @g @r1 @r2 @t1 @cont1 @t2 @cont2 @s @p
{-# INLINE absurd #-}
absurd
:: forall {k} {p} (s :: SYN k) c d g1 g2
. (Distributive k, M.MonoidalProfunctor p, KnownObj s, KnownObj c, Merge g1 g2)
=> TermP p d g1 s -> TermP p d g2 Zero -> TermP p d (Union g1 g2) c
absurd :: forall {k} {p :: k +-> k} (s :: SYN k) (c :: SYN k) (d :: Nat)
(g1 :: Ctx k) (g2 :: Ctx k).
(Distributive k, MonoidalProfunctor p, KnownObj s, KnownObj c,
Merge g1 g2) =>
TermP p d g1 s -> TermP p d g2 Zero -> TermP p d (Union g1 g2) c
absurd TermP p d g1 s
e TermP p d g2 Zero
z = (Interp (s :** Zero) ~> Interp c)
-> TermP p d (Union g1 g2) (s :** Zero)
-> TermP p d (Union g1 g2) c
forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
(p :: CAT k).
Profunctor p =>
(Interp a ~> Interp b) -> TermP p d g a -> TermP p d g b
rmapT (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @s (forall {k} (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
forall (s :: SYN k) r. KnownObj s => (Ob (Interp s) => r) -> r
withSynOb @c (forall k (a :: k). (HasInitialObject k, Ob a) => InitialObject ~> a
initiate @k @(Interp c) (InitialObject ~> Interp c)
-> ((Interp s ** InitialObject) ~> InitialObject)
-> (Interp s ** InitialObject) ~> Interp c
forall (b :: k) (c :: k) (a :: k). (b ~> c) -> (a ~> b) -> a ~> c
forall {k} (p :: CAT k) (b :: k) (c :: k) (a :: k).
Promonad p =>
p b c -> p a b -> p a c
. forall k (a :: k).
(Distributive k, Ob a) =>
(a ** InitialObject) ~> InitialObject
absorbL @k @(Interp s)))) (TermP p d g1 s
e TermP p d g1 s
-> TermP p d g2 Zero -> TermP p d (Union g1 g2) (s :** Zero)
forall {k} (d :: Nat) (g1 :: Ctx k) (g2 :: Ctx k) (a :: SYN k)
(b :: SYN k) (p :: CAT k).
(MonoidalProfunctor p, Merge g1 g2) =>
TermP p d g1 a
-> TermP p d g2 b -> TermP p d (Union g1 g2) (a :** b)
** TermP p d g2 Zero
z)