{-# LANGUAGE AllowAmbiguousTypes #-}
module Proarrow.Tools.SMC.Internal.Dialogue where
import Data.Kind (Type)
import GHC.TypeNats (Nat)
import Proarrow.Category.Monoidal (Monoidal (..), MonoidalProfunctor)
import Proarrow.Category.Monoidal.CompactClosed (CompactClosed (..))
import Proarrow.Category.Monoidal.Dialogue (Dialogue (..), dualityCounitSA)
import Proarrow.Category.Monoidal.IsoMix (IsoMix (..))
import Proarrow.Category.Monoidal.StarAutonomous (StarAutonomous (..))
import Proarrow.Core (CategoryOf (..), Profunctor, Promonad (..), arr, 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
infixl 1 |>
infixl 7 :##
{-# INLINE produce #-}
produce :: forall {k} {p} (a :: SYN k) d. (CompactClosed k, Promonad p, KnownObj a) => TermP p d '[] (a :** Not a)
produce :: forall {k} {p :: CAT k} (a :: SYN k) (d :: Nat).
(CompactClosed k, Promonad p, KnownObj a) =>
TermP p d '[] (a :** Not a)
produce = 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 (p (Interp (Mul '[])) (Interp (a :** Not a))
-> TermP p d '[] (a :** Not a)
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 ((Unit ~> (Interp a ** Dual (Interp a)))
-> p Unit (Interp a ** Dual (Interp a))
forall {k} (p :: CAT k) (a :: k) (b :: k).
Promonad p =>
(a ~> b) -> p a b
arr (forall k (a :: k). (CompactClosed k, Ob a) => Unit ~> (a ** Dual a)
dualityUnit @k @(Interp a))))
{-# INLINE annihilate #-}
annihilate
:: forall {k} {p} (a :: SYN k) d g1 g2
. (IsoMix k, MonoidalProfunctor p, KnownObj a, Merge g1 g2)
=> ConsumerP p d g1 a -> TermP p d g2 a -> TermP p d (Union g1 g2) I
annihilate :: forall {k} {p :: k +-> k} (a :: SYN k) (d :: Nat) (g1 :: Ctx k)
(g2 :: Ctx k).
(IsoMix k, MonoidalProfunctor p, KnownObj a, Merge g1 g2) =>
ConsumerP p d g1 a -> TermP p d g2 a -> TermP p d (Union g1 g2) I
annihilate ConsumerP p d g1 a
x TermP p d g2 a
y = (Interp (Not a :** a) ~> Interp I)
-> TermP p d (Union g1 g2) (Not a :** a)
-> TermP p d (Union g1 g2) I
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 (a :: k). (IsoMix k, Ob a) => (Dual a ** a) ~> Unit
dualityCounit @k @(Interp a))) (ConsumerP p d g1 a
x ConsumerP p d g1 a
-> TermP p d g2 a -> TermP p d (Union g1 g2) (Not a :** a)
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 a
y)
type ConsumerP :: forall {k}. k +-> k -> Nat -> Ctx k -> SYN k -> Type
type ConsumerP p d g a = TermP p d g (Not a)
type Consumer d g a = Term d g (Not a)
type CommandP :: forall {k}. k +-> k -> Nat -> Ctx k -> Type
type CommandP p d g = TermP p d g (Not I)
type Command d g = Term d g (Not I)
type (:##) :: forall {k}. SYN k -> SYN k -> SYN k
type a :## b = Not (Not a :** Not b)
{-# INLINE cut #-}
cut
:: forall {k} {p} (a :: SYN k) d g1 g2
. (Dialogue k, MonoidalProfunctor p, KnownObj a, Merge g1 g2)
=> ConsumerP p d g1 a -> TermP p d g2 a -> CommandP p d (Union g1 g2)
cut :: forall {k} {p :: k +-> k} (a :: SYN k) (d :: Nat) (g1 :: Ctx k)
(g2 :: Ctx k).
(Dialogue k, MonoidalProfunctor p, KnownObj a, Merge g1 g2) =>
ConsumerP p d g1 a -> TermP p d g2 a -> CommandP p d (Union g1 g2)
cut ConsumerP p d g1 a
x TermP p d g2 a
y = (Interp (Not a :** a) ~> Interp (Not I))
-> TermP p d (Union g1 g2) (Not a :** a)
-> TermP p d (Union g1 g2) (Not I)
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 (a :: k). (Dialogue k, Ob a) => (Dual a ** a) ~> Dual Unit
forall {k} (a :: k).
(Dialogue k, Ob a) =>
(Dual a ** a) ~> Dual Unit
dualityCounitSA @(Interp a))) (ConsumerP p d g1 a
x ConsumerP p d g1 a
-> TermP p d g2 a -> TermP p d (Union g1 g2) (Not a :** a)
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 a
y)
{-# INLINE (|>) #-}
(|>)
:: forall {k} {p} (a :: SYN k) d g1 g2
. (Dialogue k, MonoidalProfunctor p, KnownObj a, Merge g2 g1)
=> TermP p d g1 a -> ConsumerP p d g2 a -> CommandP p d (Union g2 g1)
TermP p d g1 a
t |> :: forall {k} {p :: k +-> k} (a :: SYN k) (d :: Nat) (g1 :: Ctx k)
(g2 :: Ctx k).
(Dialogue k, MonoidalProfunctor p, KnownObj a, Merge g2 g1) =>
TermP p d g1 a -> ConsumerP p d g2 a -> CommandP p d (Union g2 g1)
|> ConsumerP p d g2 a
k = ConsumerP p d g2 a
-> TermP p d g1 a -> TermP p d (Union g2 g1) (Not I)
forall {k} {p :: k +-> k} (a :: SYN k) (d :: Nat) (g1 :: Ctx k)
(g2 :: Ctx k).
(Dialogue k, MonoidalProfunctor p, KnownObj a, Merge g1 g2) =>
ConsumerP p d g1 a -> TermP p d g2 a -> CommandP p d (Union g1 g2)
cut ConsumerP p d g2 a
k TermP p d g1 a
t
{-# INLINE cont #-}
cont
:: forall {k} d r (a :: SYN k) t cont
. (Dialogue k, Binds (~>) d r a (Not I) t cont)
=> (t -> cont)
-> Term d r (Not a)
cont :: forall {k} (d :: Nat) (r :: Ctx k) (a :: SYN k) t cont.
(Dialogue k, Binds (~>) d r a (Not I) t cont) =>
(t -> cont) -> Term d r (Not a)
cont t -> cont
k =
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 @r
( 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
( (Interp (Mul r) ~> Interp (Not a)) -> TermP (~>) d r (Not a)
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 a ~> (Interp a ** Unit))
-> Dual (Interp a ** Unit) ~> Dual (Interp a)
forall (a :: k) (b :: k). (a ~> b) -> Dual b ~> Dual a
forall k (a :: k) (b :: k).
Dialogue k =>
(a ~> b) -> Dual b ~> Dual a
dual (forall k (a :: k). (Monoidal k, Ob a) => a ~> (a ** Unit)
rightUnitorInv @k @(Interp a))
(Dual (Interp a ** Unit) ~> Dual (Interp a))
-> (Interp (Mul r) ~> Dual (Interp a ** Unit))
-> Interp (Mul r) ~> Dual (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 k (a :: k) (b :: k) (c :: k).
(Dialogue k, Ob a, Ob b, Ob c) =>
((a ** b) ~> Dual c) -> a ~> Dual (b ** c)
linDist @k @(Interp (Mul r)) @(Interp a) @Unit (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 @(~>) @d @r @a @(Not I) t -> cont
k)
)
)
)
{-# INLINE thunk #-}
thunk :: forall {k} {p} (n :: SYN k) d g. TermP p d g n -> TermP p d g (Dn n)
thunk :: forall {k} {p :: CAT k} (n :: SYN k) (d :: Nat) (g :: Ctx k).
TermP p d g n -> TermP p d g (Dn n)
thunk = TermP p d g n -> TermP p d g (Dn n)
forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (d' :: Nat)
(g :: Ctx k) (p :: CAT k).
(Interp a ~ Interp b) =>
TermP p d g a -> TermP p d' g b
recast
{-# INLINE force #-}
force :: forall {k} {p} (n :: SYN k) d g. TermP p d g (Dn n) -> TermP p d g n
force :: forall {k} {p :: CAT k} (n :: SYN k) (d :: Nat) (g :: Ctx k).
TermP p d g (Dn n) -> TermP p d g n
force = TermP p d g (Dn n) -> TermP p d g n
forall {k} (a :: SYN k) (b :: SYN k) (d :: Nat) (d' :: Nat)
(g :: Ctx k) (p :: CAT k).
(Interp a ~ Interp b) =>
TermP p d g a -> TermP p d' g b
recast
{-# INLINE classical #-}
classical
:: forall {k} {p} (a :: SYN k) d g. (StarAutonomous k, Profunctor p, KnownObj a) => TermP p d g (Up a) -> TermP p d g a
classical :: forall {k} {p :: k +-> k} (a :: SYN k) (d :: Nat) (g :: Ctx k).
(StarAutonomous k, Profunctor p, KnownObj a) =>
TermP p d g (Up a) -> TermP p d g a
classical = 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 ((Interp (Up a) ~> Interp a) -> TermP p d g (Up a) -> 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 (a :: k). (StarAutonomous k, Ob a) => Dual (Dual a) ~> a
doubleNeg @k @(Interp a)))