{-# LANGUAGE QualifiedDo #-}
{-# LANGUAGE RecursiveDo #-}

-- | The __Int construction__ (Joyal-Street-Verity) on a traced monoidal category @k@: objects are
-- formal differences @'I' plus minus@ of @k@-objects, and morphisms are @k@-morphisms between the
-- appropriately tensored halves, composed by tracing out the middle. The result is compact closed
-- (the free such over @k@) with duals given by swapping the two halves.
module Proarrow.Category.Instance.IntConstruction where

import Prelude (($), type (~))

import Proarrow.Category.Monoidal (Monoidal (..), MonoidalProfunctor, SymMonoidal (..), first, second, swap)
import Proarrow.Category.Monoidal qualified as M
import Proarrow.Category.Monoidal.Closed (Closed (..))
import Proarrow.Category.Monoidal.CompactClosed (CompactClosed (..))
import Proarrow.Category.Monoidal.Dialogue (Dialogue (..))
import Proarrow.Category.Monoidal.IsoMix (IsoMix (..))
import Proarrow.Category.Monoidal.StarAutonomous (ExpSA, StarAutonomous (..), applySA, currySA, expSA)
import Proarrow.Category.Monoidal.Strength (TracedMonoidal)
import Proarrow.Core (CAT, CategoryOf (..), Profunctor (..), Promonad (..), dimapDefault, obj, (\\))
import Proarrow.Tools.SMC (SYN (F, (:**)), lift, toSMC, toSMC1, (-<))
import Proarrow.Tools.SMC qualified as SMC

data INT k = I k k

type family IntPlus (i :: INT k) :: k where
  IntPlus (I a b) = a
type family IntMinus (i :: INT k) :: k where
  IntMinus (I a b) = b

type IntConstruction :: CAT (INT k)
data IntConstruction a b where
  Int :: (Ob ap, Ob am, Ob bp, Ob bm) => ap ** bm ~> am ** bp -> IntConstruction (I ap am) (I bp bm)

toInt :: forall {k} (a :: k) b m. (TracedMonoidal k, Ob m) => (a ~> b) -> I a m ~> I b m
toInt :: forall {k} (a :: k) (b :: k) (m :: k).
(TracedMonoidal k, Ob m) =>
(a ~> b) -> 'I a m ~> 'I b m
toInt a ~> b
f = ((a ** m) ~> (m ** b)) -> IntConstruction ('I a m) ('I b m)
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @b @m ((b ** m) ~> (m ** b))
-> ((a ** m) ~> (b ** m)) -> (a ** m) ~> (m ** 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
. (a ~> b
f (a ~> b) -> (m ~> m) -> (a ** m) ~> (b ** m)
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 @m)) ((Ob a, Ob b) => IntConstruction ('I a m) ('I b m))
-> (a ~> b) -> IntConstruction ('I a m) ('I b m)
forall (a :: k) (b :: k) r. ((Ob a, Ob b) => r) -> (a ~> b) -> r
forall {j} {k} (p :: j +-> k) (a :: k) (b :: j) r.
Profunctor p =>
((Ob a, Ob b) => r) -> p a b -> r
\\ a ~> b
f

isoToInt :: forall {k} (a :: k) b. (TracedMonoidal k) => (a ~> b) -> (b ~> a) -> I a a ~> I b b
isoToInt :: forall {k} (a :: k) (b :: k).
TracedMonoidal k =>
(a ~> b) -> (b ~> a) -> 'I a a ~> 'I b b
isoToInt a ~> b
f b ~> a
g = ((a ** b) ~> (a ** b)) -> IntConstruction ('I a a) ('I b b)
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @b @a ((b ** a) ~> (a ** b))
-> ((a ** b) ~> (b ** a)) -> (a ** b) ~> (a ** 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
. (a ~> b
f (a ~> b) -> (b ~> a) -> (a ** b) ~> (b ** 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.** b ~> a
g)) ((Ob a, Ob b) => IntConstruction ('I a a) ('I b b))
-> (a ~> b) -> IntConstruction ('I a a) ('I b b)
forall (a :: k) (b :: k) r. ((Ob a, Ob b) => r) -> (a ~> b) -> r
forall {j} {k} (p :: j +-> k) (a :: k) (b :: j) r.
Profunctor p =>
((Ob a, Ob b) => r) -> p a b -> r
\\ a ~> b
f ((Ob b, Ob a) => IntConstruction ('I a a) ('I b b))
-> (b ~> a) -> IntConstruction ('I a a) ('I b b)
forall (a :: k) (b :: k) r. ((Ob a, Ob b) => r) -> (a ~> b) -> r
forall {j} {k} (p :: j +-> k) (a :: k) (b :: j) r.
Profunctor p =>
((Ob a, Ob b) => r) -> p a b -> r
\\ b ~> a
g

fromInt :: forall {k} (a :: k) b m. (TracedMonoidal k) => (I a m ~> I b m) -> a ~> b
fromInt :: forall {k} (a :: k) (b :: k) (m :: k).
TracedMonoidal k =>
('I a m ~> 'I b m) -> a ~> b
fromInt (Int (ap ** bm) ~> (am ** bp)
f) = (TermP (Hom k) 1 '[ '(0, F a)] (F a)
 -> TermP
      (Hom k)
      (1 + PSize (TermP (Hom k) 1 '[ '(0, F a)] (F a)))
      (Union
         (Minus
            '[ '(2, F b)]
            (Union
               (Vars k (TermP (Hom k) 1 '[ '(1, F m)] (F m)))
               (Vars k (TermP (Hom k) (ZonkAny 0) '[ '(2, F b)] (F b)))))
         (Minus
            (Union '[] (Union '[ '(0, F a)] '[ '(1, F m)]))
            (Union
               (Vars k (TermP (Hom k) 1 '[ '(1, F m)] (F m)))
               (Vars k (TermP (Hom k) (ZonkAny 0) '[ '(2, F b)] (F b))))))
      (F b))
-> a ~> b
forall {k} (a :: k) (b :: k) t cont.
(Monoidal k, Binds (~>) 0 '[] (F a) (F b) t cont) =>
(t -> cont) -> a ~> b
toSMC1 \TermP (Hom k) 1 '[ '(0, F a)] (F a)
a -> SMC.do
  let f' :: (TermP (Hom k) 1 '[ '(0, F a)] (F a),
 TermP (Hom k) 1 '[ '(1, F m)] (F m))
-> TermP
     (Hom k) 1 (Union '[ '(0, F a)] '[ '(1, F m)]) (F m :** F b)
f' = forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
       (p :: CAT k) t.
(Promonad p, ToTerm p t d g a) =>
p (Interp a) (Interp b) -> t -> TermP p d g b
forall (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
       (p :: CAT k) t.
(Promonad p, ToTerm p t d g a) =>
p (Interp a) (Interp b) -> t -> TermP p d g b
lift @(F a :** F m) @(F m :** F b) (ap ** bm) ~> (am ** bp)
Interp (F a :** F m) ~> Interp (F m :** F b)
f
  rec (m, b) <- f' (a, m)
  b

instance (TracedMonoidal k) => Profunctor (IntConstruction :: CAT (INT k)) where
  dimap :: forall (c :: INT k) (a :: INT k) (b :: INT k) (d :: INT k).
(c ~> a) -> (b ~> d) -> IntConstruction a b -> IntConstruction c d
dimap = (c ~> a) -> (b ~> d) -> IntConstruction a b -> IntConstruction c d
IntConstruction c a
-> IntConstruction b d
-> IntConstruction a b
-> IntConstruction c d
forall {k} (p :: CAT k) (c :: k) (a :: k) (b :: k) (d :: k).
Promonad p =>
p c a -> p b d -> p a b -> p c d
dimapDefault
  (Ob a, Ob b) => r
r \\ :: forall (a :: INT k) (b :: INT k) r.
((Ob a, Ob b) => r) -> IntConstruction a b -> r
\\ Int{} = r
(Ob a, Ob b) => r
r
instance (TracedMonoidal k) => Promonad (IntConstruction :: CAT (INT k)) where
  id :: forall (a :: INT k). Ob a => IntConstruction a a
id @a = ((IntPlus a ** IntMinus a) ~> (IntMinus a ** IntPlus a))
-> IntConstruction
     ('I (IntPlus a) (IntMinus a)) ('I (IntPlus a) (IntMinus a))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @(IntPlus a) @(IntMinus a))
  Int @bp @bm @cp @cm (ap ** bm) ~> (am ** bp)
f . :: forall (b :: INT k) (c :: INT k) (a :: INT k).
IntConstruction b c -> IntConstruction a b -> IntConstruction a c
. Int @ap @am (ap ** bm) ~> (am ** bp)
g =
    ((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (((ap ** bm) ~> (am ** bp))
 -> IntConstruction ('I ap am) ('I bp bm))
-> ((ap ** bm) ~> (am ** bp))
-> IntConstruction ('I ap am) ('I bp bm)
forall a b. (a -> b) -> a -> b
$ forall {k} (a :: SYN k) (b :: SYN k) t cont.
(Monoidal k, Binds (~>) 0 '[] a b t cont) =>
(t -> cont) -> Interp a ~> Interp b
forall (a :: SYN k) (b :: SYN k) t cont.
(Monoidal k, Binds (Hom k) 0 '[] a b t cont) =>
(t -> cont) -> Interp a ~> Interp b
toSMC @(F ap :** F cm) \TermP (Hom k) 1 '[ '(0, F ap :** F bm)] (F ap :** F bm)
x -> SMC.do
      let g' :: (TermP (Hom k) 3 '[ '(1, F ap)] (F ap),
 TermP (Hom k) 3 '[ '(7, F am)] (F am))
-> TermP
     (Hom k) 3 (Union '[ '(1, F ap)] '[ '(7, F am)]) (F am :** F ap)
g' = forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
       (p :: CAT k) t.
(Promonad p, ToTerm p t d g a) =>
p (Interp a) (Interp b) -> t -> TermP p d g b
forall (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
       (p :: CAT k) t.
(Promonad p, ToTerm p t d g a) =>
p (Interp a) (Interp b) -> t -> TermP p d g b
lift @(F ap :** F bm) @(F am :** F bp) (ap ** bm) ~> (am ** bp)
Interp (F ap :** F am) ~> Interp (F am :** F ap)
g
          f' :: (TermP (Hom k) 3 '[ '(6, F ap)] (F ap),
 TermP (Hom k) 3 '[ '(2, F bm)] (F bm))
-> TermP
     (Hom k) 3 (Union '[ '(6, F ap)] '[ '(2, F bm)]) (F am :** F bp)
f' = forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
       (p :: CAT k) t.
(Promonad p, ToTerm p t d g a) =>
p (Interp a) (Interp b) -> t -> TermP p d g b
forall (a :: SYN k) (b :: SYN k) (d :: Nat) (g :: Ctx k)
       (p :: CAT k) t.
(Promonad p, ToTerm p t d g a) =>
p (Interp a) (Interp b) -> t -> TermP p d g b
lift @(F bp :** F cm) @(F bm :** F cp) (ap ** bm) ~> (am ** bp)
Interp (F ap :** F bm) ~> Interp (F am :** F bp)
f
      (ap, cm) <- TermP (Hom k) 1 '[ '(0, F ap :** F bm)] (F ap :** F bm)
x
      rec ((am, bp), (bm, cp)) <- (g' (ap, bm), f' (bp, cm))
      (am, cp)

-- | The Int construction, a.k.a. the geometry of interaction,
-- the free compact closed category on a traced monoidal category.
instance (TracedMonoidal k) => CategoryOf (INT k) where
  type (~>) = IntConstruction
  type Ob a = (a ~ I (IntPlus a) (IntMinus a), Ob (IntPlus a), Ob (IntMinus a))

instance (TracedMonoidal k) => MonoidalProfunctor (IntConstruction :: CAT (INT k)) where
  one :: IntConstruction Unit Unit
one = ((Unit ** Unit) ~> (Unit ** Unit))
-> IntConstruction ('I Unit Unit) ('I Unit Unit)
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @Unit @Unit)
  Int @ap @am @bp @bm (ap ** bm) ~> (am ** bp)
f ** :: forall (x1 :: INT k) (x2 :: INT k) (y1 :: INT k) (y2 :: INT k).
IntConstruction x1 x2
-> IntConstruction y1 y2 -> IntConstruction (x1 ** y1) (x2 ** y2)
** Int @cp @cm @dp @dm (ap ** bm) ~> (am ** bp)
g =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I ap am) @(I cp cm) ((Ob ('I ap am ** 'I ap am) =>
  IntConstruction (x1 ** y1) (x2 ** y2))
 -> IntConstruction (x1 ** y1) (x2 ** y2))
-> (Ob ('I ap am ** 'I ap am) =>
    IntConstruction (x1 ** y1) (x2 ** y2))
-> IntConstruction (x1 ** y1) (x2 ** y2)
forall a b. (a -> b) -> a -> b
$
      forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I bp bm) @(I dp dm) ((Ob ('I bp bm ** 'I bp bm) =>
  IntConstruction (x1 ** y1) (x2 ** y2))
 -> IntConstruction (x1 ** y1) (x2 ** y2))
-> (Ob ('I bp bm ** 'I bp bm) =>
    IntConstruction (x1 ** y1) (x2 ** y2))
-> IntConstruction (x1 ** y1) (x2 ** y2)
forall a b. (a -> b) -> a -> b
$
        (((ap ** ap) ** (bm ** bm)) ~> ((am ** am) ** (bp ** bp)))
-> IntConstruction
     ('I (ap ** ap) (am ** am)) ('I (bp ** bp) (bm ** bm))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int ((((ap ** ap) ** (bm ** bm)) ~> ((am ** am) ** (bp ** bp)))
 -> IntConstruction
      ('I (ap ** ap) (am ** am)) ('I (bp ** bp) (bm ** bm)))
-> (((ap ** ap) ** (bm ** bm)) ~> ((am ** am) ** (bp ** bp)))
-> IntConstruction
     ('I (ap ** ap) (am ** am)) ('I (bp ** bp) (bm ** bm))
forall a b. (a -> b) -> a -> b
$ forall {k} (a :: SYN k) (b :: SYN k) t cont.
(Monoidal k, Binds (~>) 0 '[] a b t cont) =>
(t -> cont) -> Interp a ~> Interp b
forall (a :: SYN k) (b :: SYN k) t cont.
(Monoidal k, Binds (~>) 0 '[] a b t cont) =>
(t -> cont) -> Interp a ~> Interp b
toSMC @((F ap :** F cp) :** (F bm :** F dm)) @((F am :** F cm) :** (F bp :** F dp)) \TermP
  (~>)
  1
  '[ '(0, (F ap :** F ap) :** (F bm :** F bm))]
  ((F ap :** F ap) :** (F bm :** F bm))
x -> SMC.do
          ((ap, cp), (bm, dm)) <- TermP
  (~>)
  1
  '[ '(0, (F ap :** F ap) :** (F bm :** F bm))]
  ((F ap :** F ap) :** (F bm :** F bm))
x
          (am, bp) <- f -< (ap, bm)
          (cm, dp) <- g -< (cp, dm)
          ((am, cm), (bp, dp))

-- | The monoidal tensor is pointwise, tensoring of the plus and minus parts.
instance (TracedMonoidal k) => Monoidal (INT k) where
  type Unit = I Unit Unit
  type a ** b = I (IntPlus a ** IntPlus b) (IntMinus a ** IntMinus b)
  withOb2 :: forall (a :: INT k) (b :: INT k) r.
(Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @a @b Ob (a ** b) => r
r = forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @(IntPlus a) @(IntPlus b) (forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @(IntMinus a) @(IntMinus b) r
Ob (IntMinus a ** IntMinus b) => r
Ob (a ** b) => r
r)
  leftUnitor :: forall (a :: INT k). Ob a => (Unit ** a) ~> a
leftUnitor @(I ap am) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @Unit @ap ((Ob (Unit ** IntPlus a) => (Unit ** a) ~> a) -> (Unit ** a) ~> a)
-> (Ob (Unit ** IntPlus a) => (Unit ** a) ~> a) -> (Unit ** a) ~> a
forall a b. (a -> b) -> a -> b
$
      forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @Unit @am ((Ob (Unit ** IntMinus a) => (Unit ** a) ~> a) -> (Unit ** a) ~> a)
-> (Ob (Unit ** IntMinus a) => (Unit ** a) ~> a)
-> (Unit ** a) ~> a
forall a b. (a -> b) -> a -> b
$
        (((Unit ** IntPlus a) ** IntMinus a)
 ~> ((Unit ** IntMinus a) ** IntPlus a))
-> IntConstruction
     ('I (Unit ** IntPlus a) (Unit ** IntMinus a))
     ('I (IntPlus a) (IntMinus a))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (a ** c) ~> (b ** c)
forall {k} (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (a ** c) ~> (b ** c)
first @ap (forall k (a :: k). (Monoidal k, Ob a) => a ~> (Unit ** a)
leftUnitorInv @k @am) ((IntMinus a ** IntPlus a) ~> ((Unit ** IntMinus a) ** IntPlus a))
-> (((Unit ** IntPlus a) ** IntMinus a)
    ~> (IntMinus a ** IntPlus a))
-> ((Unit ** IntPlus a) ** IntMinus a)
   ~> ((Unit ** IntMinus a) ** IntPlus 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 k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @ap @am ((IntPlus a ** IntMinus a) ~> (IntMinus a ** IntPlus a))
-> (((Unit ** IntPlus a) ** IntMinus a)
    ~> (IntPlus a ** IntMinus a))
-> ((Unit ** IntPlus a) ** IntMinus a) ~> (IntMinus a ** IntPlus 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 (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (a ** c) ~> (b ** c)
forall {k} (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (a ** c) ~> (b ** c)
first @am (forall k (a :: k). (Monoidal k, Ob a) => (Unit ** a) ~> a
leftUnitor @k @ap))
  leftUnitorInv :: forall (a :: INT k). Ob a => a ~> (Unit ** a)
leftUnitorInv @(I ap am) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @Unit @ap ((Ob (Unit ** IntPlus a) => a ~> (Unit ** a)) -> a ~> (Unit ** a))
-> (Ob (Unit ** IntPlus a) => a ~> (Unit ** a)) -> a ~> (Unit ** a)
forall a b. (a -> b) -> a -> b
$
      forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @Unit @am ((Ob (Unit ** IntMinus a) => a ~> (Unit ** a)) -> a ~> (Unit ** a))
-> (Ob (Unit ** IntMinus a) => a ~> (Unit ** a))
-> a ~> (Unit ** a)
forall a b. (a -> b) -> a -> b
$
        ((IntPlus a ** (Unit ** IntMinus a))
 ~> (IntMinus a ** (Unit ** IntPlus a)))
-> IntConstruction
     ('I (IntPlus a) (IntMinus a))
     ('I (Unit ** IntPlus a) (Unit ** IntMinus a))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (c ** a) ~> (c ** b)
forall {k} (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (c ** a) ~> (c ** b)
second @am (forall k (a :: k). (Monoidal k, Ob a) => a ~> (Unit ** a)
leftUnitorInv @k @ap) ((IntMinus a ** IntPlus a) ~> (IntMinus a ** (Unit ** IntPlus a)))
-> ((IntPlus a ** (Unit ** IntMinus a))
    ~> (IntMinus a ** IntPlus a))
-> (IntPlus a ** (Unit ** IntMinus a))
   ~> (IntMinus a ** (Unit ** IntPlus 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 k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @ap @am ((IntPlus a ** IntMinus a) ~> (IntMinus a ** IntPlus a))
-> ((IntPlus a ** (Unit ** IntMinus a))
    ~> (IntPlus a ** IntMinus a))
-> (IntPlus a ** (Unit ** IntMinus a)) ~> (IntMinus a ** IntPlus 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 (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (c ** a) ~> (c ** b)
forall {k} (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (c ** a) ~> (c ** b)
second @ap (forall k (a :: k). (Monoidal k, Ob a) => (Unit ** a) ~> a
leftUnitor @k @am))
  rightUnitor :: forall (a :: INT k). Ob a => (a ** Unit) ~> a
rightUnitor @(I ap am) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @ap @Unit ((Ob (IntPlus a ** Unit) => (a ** Unit) ~> a) -> (a ** Unit) ~> a)
-> (Ob (IntPlus a ** Unit) => (a ** Unit) ~> a) -> (a ** Unit) ~> a
forall a b. (a -> b) -> a -> b
$
      forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @am @Unit ((Ob (IntMinus a ** Unit) => (a ** Unit) ~> a) -> (a ** Unit) ~> a)
-> (Ob (IntMinus a ** Unit) => (a ** Unit) ~> a)
-> (a ** Unit) ~> a
forall a b. (a -> b) -> a -> b
$
        (((IntPlus a ** Unit) ** IntMinus a)
 ~> ((IntMinus a ** Unit) ** IntPlus a))
-> IntConstruction
     ('I (IntPlus a ** Unit) (IntMinus a ** Unit))
     ('I (IntPlus a) (IntMinus a))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (a ** c) ~> (b ** c)
forall {k} (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (a ** c) ~> (b ** c)
first @ap (forall k (a :: k). (Monoidal k, Ob a) => a ~> (a ** Unit)
rightUnitorInv @k @am) ((IntMinus a ** IntPlus a) ~> ((IntMinus a ** Unit) ** IntPlus a))
-> (((IntPlus a ** Unit) ** IntMinus a)
    ~> (IntMinus a ** IntPlus a))
-> ((IntPlus a ** Unit) ** IntMinus a)
   ~> ((IntMinus a ** Unit) ** IntPlus 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 k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @ap @am ((IntPlus a ** IntMinus a) ~> (IntMinus a ** IntPlus a))
-> (((IntPlus a ** Unit) ** IntMinus a)
    ~> (IntPlus a ** IntMinus a))
-> ((IntPlus a ** Unit) ** IntMinus a) ~> (IntMinus a ** IntPlus 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 (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (a ** c) ~> (b ** c)
forall {k} (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (a ** c) ~> (b ** c)
first @am (forall k (a :: k). (Monoidal k, Ob a) => (a ** Unit) ~> a
rightUnitor @k @ap))
  rightUnitorInv :: forall (a :: INT k). Ob a => a ~> (a ** Unit)
rightUnitorInv @(I ap am) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @ap @Unit ((Ob (IntPlus a ** Unit) => a ~> (a ** Unit)) -> a ~> (a ** Unit))
-> (Ob (IntPlus a ** Unit) => a ~> (a ** Unit)) -> a ~> (a ** Unit)
forall a b. (a -> b) -> a -> b
$
      forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @am @Unit ((Ob (IntMinus a ** Unit) => a ~> (a ** Unit)) -> a ~> (a ** Unit))
-> (Ob (IntMinus a ** Unit) => a ~> (a ** Unit))
-> a ~> (a ** Unit)
forall a b. (a -> b) -> a -> b
$
        ((IntPlus a ** (IntMinus a ** Unit))
 ~> (IntMinus a ** (IntPlus a ** Unit)))
-> IntConstruction
     ('I (IntPlus a) (IntMinus a))
     ('I (IntPlus a ** Unit) (IntMinus a ** Unit))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (c ** a) ~> (c ** b)
forall {k} (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (c ** a) ~> (c ** b)
second @am (forall k (a :: k). (Monoidal k, Ob a) => a ~> (a ** Unit)
rightUnitorInv @k @ap) ((IntMinus a ** IntPlus a) ~> (IntMinus a ** (IntPlus a ** Unit)))
-> ((IntPlus a ** (IntMinus a ** Unit))
    ~> (IntMinus a ** IntPlus a))
-> (IntPlus a ** (IntMinus a ** Unit))
   ~> (IntMinus a ** (IntPlus a ** Unit))
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) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @ap @am ((IntPlus a ** IntMinus a) ~> (IntMinus a ** IntPlus a))
-> ((IntPlus a ** (IntMinus a ** Unit))
    ~> (IntPlus a ** IntMinus a))
-> (IntPlus a ** (IntMinus a ** Unit)) ~> (IntMinus a ** IntPlus 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 (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (c ** a) ~> (c ** b)
forall {k} (c :: k) (a :: k) (b :: k).
(Monoidal k, Ob c) =>
(a ~> b) -> (c ** a) ~> (c ** b)
second @ap (forall k (a :: k). (Monoidal k, Ob a) => (a ** Unit) ~> a
rightUnitor @k @am))
  associator :: forall (a :: INT k) (b :: INT k) (c :: INT k).
(Ob a, Ob b, Ob c) =>
((a ** b) ** c) ~> (a ** (b ** c))
associator @(I ap am) @(I bp bm) @(I cp cm) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I ap am) @(I bp bm) ((Ob
    ('I (IntPlus a) (IntMinus a) ** 'I (IntPlus b) (IntMinus b)) =>
  ((a ** b) ** c) ~> (a ** (b ** c)))
 -> ((a ** b) ** c) ~> (a ** (b ** c)))
-> (Ob
      ('I (IntPlus a) (IntMinus a) ** 'I (IntPlus b) (IntMinus b)) =>
    ((a ** b) ** c) ~> (a ** (b ** c)))
-> ((a ** b) ** c) ~> (a ** (b ** c))
forall a b. (a -> b) -> a -> b
$
      forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I ap am ** I bp bm) @(I cp cm) ((Ob
    (('I (IntPlus a) (IntMinus a) ** 'I (IntPlus b) (IntMinus b))
     ** 'I (IntPlus c) (IntMinus c)) =>
  ((a ** b) ** c) ~> (a ** (b ** c)))
 -> ((a ** b) ** c) ~> (a ** (b ** c)))
-> (Ob
      (('I (IntPlus a) (IntMinus a) ** 'I (IntPlus b) (IntMinus b))
       ** 'I (IntPlus c) (IntMinus c)) =>
    ((a ** b) ** c) ~> (a ** (b ** c)))
-> ((a ** b) ** c) ~> (a ** (b ** c))
forall a b. (a -> b) -> a -> b
$
        forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I bp bm) @(I cp cm) ((Ob
    ('I (IntPlus b) (IntMinus b) ** 'I (IntPlus c) (IntMinus c)) =>
  ((a ** b) ** c) ~> (a ** (b ** c)))
 -> ((a ** b) ** c) ~> (a ** (b ** c)))
-> (Ob
      ('I (IntPlus b) (IntMinus b) ** 'I (IntPlus c) (IntMinus c)) =>
    ((a ** b) ** c) ~> (a ** (b ** c)))
-> ((a ** b) ** c) ~> (a ** (b ** c))
forall a b. (a -> b) -> a -> b
$
          forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I ap am) @(I bp bm ** I cp cm) ((Ob
    ('I (IntPlus a) (IntMinus a)
     ** ('I (IntPlus b) (IntMinus b) ** 'I (IntPlus c) (IntMinus c))) =>
  ((a ** b) ** c) ~> (a ** (b ** c)))
 -> ((a ** b) ** c) ~> (a ** (b ** c)))
-> (Ob
      ('I (IntPlus a) (IntMinus a)
       ** ('I (IntPlus b) (IntMinus b) ** 'I (IntPlus c) (IntMinus c))) =>
    ((a ** b) ** c) ~> (a ** (b ** c)))
-> ((a ** b) ** c) ~> (a ** (b ** c))
forall a b. (a -> b) -> a -> b
$
            ((((IntPlus a ** IntPlus b) ** IntPlus c)
  ** (IntMinus a ** (IntMinus b ** IntMinus c)))
 ~> (((IntMinus a ** IntMinus b) ** IntMinus c)
     ** (IntPlus a ** (IntPlus b ** IntPlus c))))
-> IntConstruction
     ('I
        ((IntPlus a ** IntPlus b) ** IntPlus c)
        ((IntMinus a ** IntMinus b) ** IntMinus c))
     ('I
        (IntPlus a ** (IntPlus b ** IntPlus c))
        (IntMinus a ** (IntMinus b ** IntMinus c)))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int
              ( forall k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @(ap ** (bp ** cp)) @((am ** bm) ** cm)
                  (((IntPlus a ** (IntPlus b ** IntPlus c))
  ** ((IntMinus a ** IntMinus b) ** IntMinus c))
 ~> (((IntMinus a ** IntMinus b) ** IntMinus c)
     ** (IntPlus a ** (IntPlus b ** IntPlus c))))
-> ((((IntPlus a ** IntPlus b) ** IntPlus c)
     ** (IntMinus a ** (IntMinus b ** IntMinus c)))
    ~> ((IntPlus a ** (IntPlus b ** IntPlus c))
        ** ((IntMinus a ** IntMinus b) ** IntMinus c)))
-> (((IntPlus a ** IntPlus b) ** IntPlus c)
    ** (IntMinus a ** (IntMinus b ** IntMinus c)))
   ~> (((IntMinus a ** IntMinus b) ** IntMinus c)
       ** (IntPlus a ** (IntPlus b ** IntPlus 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) (b :: k) (c :: k).
(Monoidal k, Ob a, Ob b, Ob c) =>
((a ** b) ** c) ~> (a ** (b ** c))
associator @k @ap @bp @cp (((IntPlus a ** IntPlus b) ** IntPlus c)
 ~> (IntPlus a ** (IntPlus b ** IntPlus c)))
-> ((IntMinus a ** (IntMinus b ** IntMinus c))
    ~> ((IntMinus a ** IntMinus b) ** IntMinus c))
-> (((IntPlus a ** IntPlus b) ** IntPlus c)
    ** (IntMinus a ** (IntMinus b ** IntMinus c)))
   ~> ((IntPlus a ** (IntPlus b ** IntPlus c))
       ** ((IntMinus a ** IntMinus b) ** IntMinus c))
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 k (a :: k) (b :: k) (c :: k).
(Monoidal k, Ob a, Ob b, Ob c) =>
(a ** (b ** c)) ~> ((a ** b) ** c)
associatorInv @k @am @bm @cm)
              )
  associatorInv :: forall (a :: INT k) (b :: INT k) (c :: INT k).
(Ob a, Ob b, Ob c) =>
(a ** (b ** c)) ~> ((a ** b) ** c)
associatorInv @(I ap am) @(I bp bm) @(I cp cm) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I ap am) @(I bp bm) ((Ob
    ('I (IntPlus a) (IntMinus a) ** 'I (IntPlus b) (IntMinus b)) =>
  (a ** (b ** c)) ~> ((a ** b) ** c))
 -> (a ** (b ** c)) ~> ((a ** b) ** c))
-> (Ob
      ('I (IntPlus a) (IntMinus a) ** 'I (IntPlus b) (IntMinus b)) =>
    (a ** (b ** c)) ~> ((a ** b) ** c))
-> (a ** (b ** c)) ~> ((a ** b) ** c)
forall a b. (a -> b) -> a -> b
$
      forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I ap am ** I bp bm) @(I cp cm) ((Ob
    (('I (IntPlus a) (IntMinus a) ** 'I (IntPlus b) (IntMinus b))
     ** 'I (IntPlus c) (IntMinus c)) =>
  (a ** (b ** c)) ~> ((a ** b) ** c))
 -> (a ** (b ** c)) ~> ((a ** b) ** c))
-> (Ob
      (('I (IntPlus a) (IntMinus a) ** 'I (IntPlus b) (IntMinus b))
       ** 'I (IntPlus c) (IntMinus c)) =>
    (a ** (b ** c)) ~> ((a ** b) ** c))
-> (a ** (b ** c)) ~> ((a ** b) ** c)
forall a b. (a -> b) -> a -> b
$
        forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I bp bm) @(I cp cm) ((Ob
    ('I (IntPlus b) (IntMinus b) ** 'I (IntPlus c) (IntMinus c)) =>
  (a ** (b ** c)) ~> ((a ** b) ** c))
 -> (a ** (b ** c)) ~> ((a ** b) ** c))
-> (Ob
      ('I (IntPlus b) (IntMinus b) ** 'I (IntPlus c) (IntMinus c)) =>
    (a ** (b ** c)) ~> ((a ** b) ** c))
-> (a ** (b ** c)) ~> ((a ** b) ** c)
forall a b. (a -> b) -> a -> b
$
          forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I ap am) @(I bp bm ** I cp cm) ((Ob
    ('I (IntPlus a) (IntMinus a)
     ** ('I (IntPlus b) (IntMinus b) ** 'I (IntPlus c) (IntMinus c))) =>
  (a ** (b ** c)) ~> ((a ** b) ** c))
 -> (a ** (b ** c)) ~> ((a ** b) ** c))
-> (Ob
      ('I (IntPlus a) (IntMinus a)
       ** ('I (IntPlus b) (IntMinus b) ** 'I (IntPlus c) (IntMinus c))) =>
    (a ** (b ** c)) ~> ((a ** b) ** c))
-> (a ** (b ** c)) ~> ((a ** b) ** c)
forall a b. (a -> b) -> a -> b
$
            (((IntPlus a ** (IntPlus b ** IntPlus c))
  ** ((IntMinus a ** IntMinus b) ** IntMinus c))
 ~> ((IntMinus a ** (IntMinus b ** IntMinus c))
     ** ((IntPlus a ** IntPlus b) ** IntPlus c)))
-> IntConstruction
     ('I
        (IntPlus a ** (IntPlus b ** IntPlus c))
        (IntMinus a ** (IntMinus b ** IntMinus c)))
     ('I
        ((IntPlus a ** IntPlus b) ** IntPlus c)
        ((IntMinus a ** IntMinus b) ** IntMinus c))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int
              ( forall k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @((ap ** bp) ** cp) @(am ** (bm ** cm))
                  ((((IntPlus a ** IntPlus b) ** IntPlus c)
  ** (IntMinus a ** (IntMinus b ** IntMinus c)))
 ~> ((IntMinus a ** (IntMinus b ** IntMinus c))
     ** ((IntPlus a ** IntPlus b) ** IntPlus c)))
-> (((IntPlus a ** (IntPlus b ** IntPlus c))
     ** ((IntMinus a ** IntMinus b) ** IntMinus c))
    ~> (((IntPlus a ** IntPlus b) ** IntPlus c)
        ** (IntMinus a ** (IntMinus b ** IntMinus c))))
-> ((IntPlus a ** (IntPlus b ** IntPlus c))
    ** ((IntMinus a ** IntMinus b) ** IntMinus c))
   ~> ((IntMinus a ** (IntMinus b ** IntMinus c))
       ** ((IntPlus a ** IntPlus b) ** IntPlus 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) (b :: k) (c :: k).
(Monoidal k, Ob a, Ob b, Ob c) =>
(a ** (b ** c)) ~> ((a ** b) ** c)
associatorInv @k @ap @bp @cp ((IntPlus a ** (IntPlus b ** IntPlus c))
 ~> ((IntPlus a ** IntPlus b) ** IntPlus c))
-> (((IntMinus a ** IntMinus b) ** IntMinus c)
    ~> (IntMinus a ** (IntMinus b ** IntMinus c)))
-> ((IntPlus a ** (IntPlus b ** IntPlus c))
    ** ((IntMinus a ** IntMinus b) ** IntMinus c))
   ~> (((IntPlus a ** IntPlus b) ** IntPlus c)
       ** (IntMinus a ** (IntMinus b ** IntMinus c)))
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 k (a :: k) (b :: k) (c :: k).
(Monoidal k, Ob a, Ob b, Ob c) =>
((a ** b) ** c) ~> (a ** (b ** c))
associator @k @am @bm @cm)
              )

instance (TracedMonoidal k) => SymMonoidal (INT k) where
  swap :: forall (a :: INT k) (b :: INT k).
(Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @(I ap am) @(I bp bm) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @ap @bp ((Ob (IntPlus a ** IntPlus b) => (a ** b) ~> (b ** a))
 -> (a ** b) ~> (b ** a))
-> (Ob (IntPlus a ** IntPlus b) => (a ** b) ~> (b ** a))
-> (a ** b) ~> (b ** a)
forall a b. (a -> b) -> a -> b
$
      forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @am @bm ((Ob (IntMinus a ** IntMinus b) => (a ** b) ~> (b ** a))
 -> (a ** b) ~> (b ** a))
-> (Ob (IntMinus a ** IntMinus b) => (a ** b) ~> (b ** a))
-> (a ** b) ~> (b ** a)
forall a b. (a -> b) -> a -> b
$
        forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @bp @ap ((Ob (IntPlus b ** IntPlus a) => (a ** b) ~> (b ** a))
 -> (a ** b) ~> (b ** a))
-> (Ob (IntPlus b ** IntPlus a) => (a ** b) ~> (b ** a))
-> (a ** b) ~> (b ** a)
forall a b. (a -> b) -> a -> b
$
          forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @bm @am ((Ob (IntMinus b ** IntMinus a) => (a ** b) ~> (b ** a))
 -> (a ** b) ~> (b ** a))
-> (Ob (IntMinus b ** IntMinus a) => (a ** b) ~> (b ** a))
-> (a ** b) ~> (b ** a)
forall a b. (a -> b) -> a -> b
$
            (((IntPlus a ** IntPlus b) ** (IntMinus b ** IntMinus a))
 ~> ((IntMinus a ** IntMinus b) ** (IntPlus b ** IntPlus a)))
-> IntConstruction
     ('I (IntPlus a ** IntPlus b) (IntMinus a ** IntMinus b))
     ('I (IntPlus b ** IntPlus a) (IntMinus b ** IntMinus a))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int ((forall k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @bm @am ((IntMinus b ** IntMinus a) ~> (IntMinus a ** IntMinus b))
-> ((IntPlus a ** IntPlus b) ~> (IntPlus b ** IntPlus a))
-> ((IntMinus b ** IntMinus a) ** (IntPlus a ** IntPlus b))
   ~> ((IntMinus a ** IntMinus b) ** (IntPlus b ** IntPlus 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 k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @ap @bp) (((IntMinus b ** IntMinus a) ** (IntPlus a ** IntPlus b))
 ~> ((IntMinus a ** IntMinus b) ** (IntPlus b ** IntPlus a)))
-> (((IntPlus a ** IntPlus b) ** (IntMinus b ** IntMinus a))
    ~> ((IntMinus b ** IntMinus a) ** (IntPlus a ** IntPlus b)))
-> ((IntPlus a ** IntPlus b) ** (IntMinus b ** IntMinus a))
   ~> ((IntMinus a ** IntMinus b) ** (IntPlus b ** IntPlus 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 k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @(ap ** bp) @(bm ** am))

instance (TracedMonoidal k) => Closed (INT k) where
  type a ~~> b = ExpSA a b
  withObExp :: forall (a :: INT k) (b :: INT k) r.
(Ob a, Ob b) =>
(Ob (a ~~> b) => r) -> r
withObExp @a @b Ob (a ~~> b) => r
r = forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @(IntMinus a) @(IntPlus b) (forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @(IntPlus a) @(IntMinus b) r
Ob (IntPlus a ** IntMinus b) => r
Ob (a ~~> b) => r
r)
  curry :: forall (a :: INT k) (b :: INT k) (c :: INT k).
(Ob a, Ob b) =>
((a ** b) ~> c) -> a ~> (b ~~> c)
curry @a @b @c = forall {k} (a :: k) (b :: k) (c :: k).
(StarAutonomous k, Ob a, Ob b) =>
((a ** b) ~> c) -> a ~> ExpSA b c
forall (a :: INT k) (b :: INT k) (c :: INT k).
(StarAutonomous (INT k), Ob a, Ob b) =>
((a ** b) ~> c) -> a ~> ExpSA b c
currySA @a @b @c
  apply :: forall (a :: INT k) (b :: INT k).
(Ob a, Ob b) =>
((a ~~> b) ** a) ~> b
apply @b @c = forall {k} (b :: k) (c :: k).
(StarAutonomous k, Ob b, Ob c) =>
(ExpSA b c ** b) ~> c
forall (b :: INT k) (c :: INT k).
(StarAutonomous (INT k), Ob b, Ob c) =>
(ExpSA b c ** b) ~> c
applySA @b @c
  ^^^ :: forall (a :: INT k) (b :: INT k) (x :: INT k) (y :: INT k).
(b ~> y) -> (x ~> a) -> (a ~~> b) ~> (x ~~> y)
(^^^) = (b ~> y) -> (x ~> a) -> ExpSA a b ~> ExpSA x y
(b ~> y) -> (x ~> a) -> (a ~~> b) ~> (x ~~> y)
forall {k} (a :: k) (b :: k) (x :: k) (y :: k).
StarAutonomous k =>
(b ~> y) -> (x ~> a) -> ExpSA a b ~> ExpSA x y
expSA

instance (TracedMonoidal k) => Dialogue (INT k) where
  type Dual (I p n) = I n p
  withObDual :: forall (a :: INT k) r. Ob a => (Ob (Dual a) => r) -> r
withObDual Ob (Dual a) => r
r = r
Ob (Dual a) => r
r
  dual :: forall (a :: INT k) (b :: INT k). (a ~> b) -> Dual b ~> Dual a
dual (Int @ap @am @bp @bm (ap ** bm) ~> (am ** bp)
f) = ((bm ** ap) ~> (bp ** am)) -> IntConstruction ('I bm bp) ('I am ap)
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @am @bp ((am ** bp) ~> (bp ** am))
-> ((bm ** ap) ~> (am ** bp)) -> (bm ** ap) ~> (bp ** am)
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
. (ap ** bm) ~> (am ** bp)
f ((ap ** bm) ~> (am ** bp))
-> ((bm ** ap) ~> (ap ** bm)) -> (bm ** ap) ~> (am ** bp)
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) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @bm @ap)
  linDist :: forall (a :: INT k) (b :: INT k) (c :: INT k).
(Ob a, Ob b, Ob c) =>
((a ** b) ~> Dual c) -> a ~> Dual (b ** c)
linDist @(I ap am) @(I bp bm) @(I cp cm) (Int (ap ** bm) ~> (am ** bp)
f) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I bp bm) @(I cp cm) (((IntPlus a ** (IntPlus b ** IntPlus c))
 ~> (IntMinus a ** (IntMinus b ** IntMinus c)))
-> IntConstruction
     ('I (IntPlus a) (IntMinus a))
     ('I (IntMinus b ** IntMinus c) (IntPlus b ** IntPlus c))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k) (b :: k) (c :: k).
(Monoidal k, Ob a, Ob b, Ob c) =>
((a ** b) ** c) ~> (a ** (b ** c))
associator @k @am @bm @cm ((am ** IntMinus c) ~> (IntMinus a ** (IntMinus b ** IntMinus c)))
-> ((IntPlus a ** (IntPlus b ** IntPlus c)) ~> (am ** IntMinus c))
-> (IntPlus a ** (IntPlus b ** IntPlus c))
   ~> (IntMinus a ** (IntMinus b ** IntMinus 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
. (ap ** bm) ~> (am ** bp)
(ap ** IntPlus c) ~> (am ** IntMinus c)
f ((ap ** IntPlus c) ~> (am ** IntMinus c))
-> ((IntPlus a ** (IntPlus b ** IntPlus c)) ~> (ap ** IntPlus c))
-> (IntPlus a ** (IntPlus b ** IntPlus c)) ~> (am ** IntMinus 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) (b :: k) (c :: k).
(Monoidal k, Ob a, Ob b, Ob c) =>
(a ** (b ** c)) ~> ((a ** b) ** c)
associatorInv @k @ap @bp @cp))
  linDistInv :: forall (a :: INT k) (b :: INT k) (c :: INT k).
(Ob a, Ob b, Ob c) =>
(a ~> Dual (b ** c)) -> (a ** b) ~> Dual c
linDistInv @(I ap am) @(I bp bm) @(I cp cm) (Int (ap ** bm) ~> (am ** bp)
f) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I ap am) @(I bp bm) ((((IntPlus a ** IntPlus b) ** IntPlus c)
 ~> ((IntMinus a ** IntMinus b) ** IntMinus c))
-> IntConstruction
     ('I (IntPlus a ** IntPlus b) (IntMinus a ** IntMinus b))
     ('I (IntMinus c) (IntPlus c))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k) (b :: k) (c :: k).
(Monoidal k, Ob a, Ob b, Ob c) =>
(a ** (b ** c)) ~> ((a ** b) ** c)
associatorInv @k @am @bm @cm ((IntMinus a ** bp) ~> ((IntMinus a ** IntMinus b) ** IntMinus c))
-> (((IntPlus a ** IntPlus b) ** IntPlus c) ~> (IntMinus a ** bp))
-> ((IntPlus a ** IntPlus b) ** IntPlus c)
   ~> ((IntMinus a ** IntMinus b) ** IntMinus 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
. (ap ** bm) ~> (am ** bp)
(IntPlus a ** bm) ~> (IntMinus a ** bp)
f ((IntPlus a ** bm) ~> (IntMinus a ** bp))
-> (((IntPlus a ** IntPlus b) ** IntPlus c) ~> (IntPlus a ** bm))
-> ((IntPlus a ** IntPlus b) ** IntPlus c) ~> (IntMinus a ** bp)
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) (b :: k) (c :: k).
(Monoidal k, Ob a, Ob b, Ob c) =>
((a ** b) ** c) ~> (a ** (b ** c))
associator @k @ap @bp @cp))
  doubleNegInv :: forall (a :: INT k). Ob a => a ~> Dual (Dual a)
doubleNegInv = a ~> Dual (Dual a)
IntConstruction
  ('I (IntPlus a) (IntMinus a)) ('I (IntPlus a) (IntMinus a))
forall {k} (p :: CAT k) (a :: k). (Promonad p, Ob a) => p a a
forall (a :: INT k). Ob a => IntConstruction a a
id

instance (TracedMonoidal k) => StarAutonomous (INT k) where
  dualInv :: forall (a :: INT k) (b :: INT k).
(Ob a, Ob b) =>
(Dual a ~> Dual b) -> b ~> a
dualInv (Int @ap @am @bp @bm (ap ** bm) ~> (am ** bp)
f) = ((IntPlus b ** IntMinus a) ~> (IntMinus b ** IntPlus a))
-> IntConstruction
     ('I (IntPlus b) (IntMinus b)) ('I (IntPlus a) (IntMinus a))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @am @bp ((IntPlus a ** IntMinus b) ~> (IntMinus b ** IntPlus a))
-> ((IntPlus b ** IntMinus a) ~> (IntPlus a ** IntMinus b))
-> (IntPlus b ** IntMinus a) ~> (IntMinus b ** IntPlus 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
. (ap ** bm) ~> (am ** bp)
(IntMinus a ** IntPlus b) ~> (IntPlus a ** IntMinus b)
f ((IntMinus a ** IntPlus b) ~> (IntPlus a ** IntMinus b))
-> ((IntPlus b ** IntMinus a) ~> (IntMinus a ** IntPlus b))
-> (IntPlus b ** IntMinus a) ~> (IntPlus a ** IntMinus 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 k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @bm @ap)
  doubleNeg :: forall (a :: INT k). Ob a => Dual (Dual a) ~> a
doubleNeg = Dual (Dual a) ~> a
IntConstruction
  ('I (IntPlus a) (IntMinus a)) ('I (IntPlus a) (IntMinus a))
forall {k} (p :: CAT k) (a :: k). (Promonad p, Ob a) => p a a
forall (a :: INT k). Ob a => IntConstruction a a
id

instance (TracedMonoidal k) => IsoMix (INT k) where
  dualUnit :: Dual Unit ~> Unit
dualUnit = Dual Unit ~> Unit
IntConstruction ('I Unit Unit) ('I Unit Unit)
forall {k} (p :: CAT k) (a :: k). (Promonad p, Ob a) => p a a
forall (a :: INT k). Ob a => IntConstruction a a
id
  dualUnitInv :: Unit ~> Dual Unit
dualUnitInv = Unit ~> Dual Unit
IntConstruction ('I Unit Unit) ('I Unit Unit)
forall {k} (p :: CAT k) (a :: k). (Promonad p, Ob a) => p a a
forall (a :: INT k). Ob a => IntConstruction a a
id
  dualityCounit :: forall (a :: INT k). Ob a => (Dual a ** a) ~> Unit
dualityCounit @(I p n) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @p @n ((Ob (IntPlus a ** IntMinus a) => (Dual a ** a) ~> Unit)
 -> (Dual a ** a) ~> Unit)
-> (Ob (IntPlus a ** IntMinus a) => (Dual a ** a) ~> Unit)
-> (Dual a ** a) ~> Unit
forall a b. (a -> b) -> a -> b
$ forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @n @p ((Ob (IntMinus a ** IntPlus a) => (Dual a ** a) ~> Unit)
 -> (Dual a ** a) ~> Unit)
-> (Ob (IntMinus a ** IntPlus a) => (Dual a ** a) ~> Unit)
-> (Dual a ** a) ~> Unit
forall a b. (a -> b) -> a -> b
$ (((IntMinus a ** IntPlus a) ** Unit)
 ~> ((IntPlus a ** IntMinus a) ** Unit))
-> IntConstruction
     ('I (IntMinus a ** IntPlus a) (IntPlus a ** IntMinus a))
     ('I Unit Unit)
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k). (Monoidal k, Ob a) => a ~> (a ** Unit)
rightUnitorInv @k @(p ** n) ((IntPlus a ** IntMinus a) ~> ((IntPlus a ** IntMinus a) ** Unit))
-> (((IntMinus a ** IntPlus a) ** Unit)
    ~> (IntPlus a ** IntMinus a))
-> ((IntMinus a ** IntPlus a) ** Unit)
   ~> ((IntPlus a ** IntMinus a) ** Unit)
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) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @n @p ((IntMinus a ** IntPlus a) ~> (IntPlus a ** IntMinus a))
-> (((IntMinus a ** IntPlus a) ** Unit)
    ~> (IntMinus a ** IntPlus a))
-> ((IntMinus a ** IntPlus a) ** Unit) ~> (IntPlus a ** IntMinus 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 k (a :: k). (Monoidal k, Ob a) => (a ** Unit) ~> a
rightUnitor @k @(n ** p))

instance (TracedMonoidal k) => CompactClosed (INT k) where
  distribDual :: forall (a :: INT k) (b :: INT k).
(Ob a, Ob b) =>
Dual (a ** b) ~> (Dual a ** Dual b)
distribDual @(I ap am) @(I bp bm) = forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @(INT k) @(I ap am) @(I bp bm) ((((IntMinus a ** IntMinus b) ** (IntPlus a ** IntPlus b))
 ~> ((IntPlus a ** IntPlus b) ** (IntMinus a ** IntMinus b)))
-> IntConstruction
     ('I (IntMinus a ** IntMinus b) (IntPlus a ** IntPlus b))
     ('I (IntMinus a ** IntMinus b) (IntPlus a ** IntPlus b))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @(am ** bm) @(ap ** bp)))
  dualityUnit :: forall (a :: INT k). Ob a => Unit ~> (a ** Dual a)
dualityUnit @(I p n) =
    forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @p @n ((Ob (IntPlus a ** IntMinus a) => Unit ~> (a ** Dual a))
 -> Unit ~> (a ** Dual a))
-> (Ob (IntPlus a ** IntMinus a) => Unit ~> (a ** Dual a))
-> Unit ~> (a ** Dual a)
forall a b. (a -> b) -> a -> b
$ forall k (a :: k) (b :: k) r.
(Monoidal k, Ob a, Ob b) =>
(Ob (a ** b) => r) -> r
withOb2 @k @n @p ((Ob (IntMinus a ** IntPlus a) => Unit ~> (a ** Dual a))
 -> Unit ~> (a ** Dual a))
-> (Ob (IntMinus a ** IntPlus a) => Unit ~> (a ** Dual a))
-> Unit ~> (a ** Dual a)
forall a b. (a -> b) -> a -> b
$ ((Unit ** (IntMinus a ** IntPlus a))
 ~> (Unit ** (IntPlus a ** IntMinus a)))
-> IntConstruction
     ('I Unit Unit)
     ('I (IntPlus a ** IntMinus a) (IntMinus a ** IntPlus a))
forall {k} (ap :: k) (am :: k) (bp :: k) (bm :: k).
(Ob ap, Ob am, Ob bp, Ob bm) =>
((ap ** bm) ~> (am ** bp)) -> IntConstruction ('I ap am) ('I bp bm)
Int (forall k (a :: k). (Monoidal k, Ob a) => a ~> (Unit ** a)
leftUnitorInv @k @(p ** n) ((IntPlus a ** IntMinus a) ~> (Unit ** (IntPlus a ** IntMinus a)))
-> ((Unit ** (IntMinus a ** IntPlus a))
    ~> (IntPlus a ** IntMinus a))
-> (Unit ** (IntMinus a ** IntPlus a))
   ~> (Unit ** (IntPlus a ** IntMinus 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 k (a :: k) (b :: k).
(SymMonoidal k, Ob a, Ob b) =>
(a ** b) ~> (b ** a)
swap @k @n @p ((IntMinus a ** IntPlus a) ~> (IntPlus a ** IntMinus a))
-> ((Unit ** (IntMinus a ** IntPlus a))
    ~> (IntMinus a ** IntPlus a))
-> (Unit ** (IntMinus a ** IntPlus a)) ~> (IntPlus a ** IntMinus 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 k (a :: k). (Monoidal k, Ob a) => (Unit ** a) ~> a
leftUnitor @k @(n ** p))