{-# LANGUAGE AllowAmbiguousTypes #-}
{-# OPTIONS_GHC -Wno-orphans #-}
module Proarrow.Category.Monoidal.Coclosed where
import Proarrow.Category.Instance.Opposite (OPPOSITE (..), Op (..))
import Proarrow.Category.Instance.Unit (Unit (..))
import Proarrow.Category.Monoidal (Monoidal (..))
import Proarrow.Category.Monoidal.Cartesian (Cartesian)
import Proarrow.Category.Monoidal.Closed (Closed (..))
import Proarrow.Colimit.BinaryCoproduct
( COPROD (..)
, Cocartesian
, Coprod (..)
, HasCoproducts
)
import Proarrow.Core (CategoryOf (..), UN)
import Proarrow.Limit.BinaryProduct (PROD (..), Prod (..))
class (Monoidal k) => Coclosed k where
type (a :: k) <~~ (b :: k) :: k
withObCoExp :: (Ob (a :: k), Ob b) => ((Ob (a <~~ b)) => r) -> r
coeval :: (Ob (a :: k), Ob b) => a ~> (a <~~ b) ** b
coevalUniv :: (Ob (b :: k), Ob c) => a ~> c ** b -> (a <~~ b) ~> c
instance Coclosed () where
type (a :: ()) <~~ (b :: ()) = '()
withObCoExp :: forall (a :: ()) (b :: ()) r.
(Ob a, Ob b) =>
(Ob (a <~~ b) => r) -> r
withObCoExp Ob (a <~~ b) => r
f = r
Ob (a <~~ b) => r
f
coeval :: forall (a :: ()) (b :: ()). (Ob a, Ob b) => a ~> ((a <~~ b) ** b)
coeval = a ~> ((a <~~ b) ** b)
Unit '() '()
Unit
coevalUniv :: forall (b :: ()) (c :: ()) (a :: ()).
(Ob b, Ob c) =>
(a ~> (c ** b)) -> (a <~~ b) ~> c
coevalUniv a ~> (c ** b)
Unit a '()
Unit = (a <~~ b) ~> c
Unit '() '()
Unit
instance (Coclosed k) => Closed (OPPOSITE k) where
type OP a ~~> OP b = OP (b <~~ a)
withObExp :: forall (a :: OPPOSITE k) (b :: OPPOSITE k) r.
(Ob a, Ob b) =>
(Ob (a ~~> b) => r) -> r
withObExp @(OP a) @(OP b) Ob (a ~~> b) => r
r = forall k (a :: k) (b :: k) r.
(Coclosed k, Ob a, Ob b) =>
(Ob (a <~~ b) => r) -> r
withObCoExp @k @b @a r
Ob (UN OP b <~~ UN OP a) => r
Ob (a ~~> b) => r
r
curry :: forall (a :: OPPOSITE k) (b :: OPPOSITE k) (c :: OPPOSITE k).
(Ob a, Ob b) =>
((a ** b) ~> c) -> a ~> (b ~~> c)
curry @(OP a) @(OP b) (Op b1 ~> a1
f) = ((b1 <~~ UN OP b) ~> UN OP a)
-> Op (~>) (OP (UN OP a)) (OP (b1 <~~ UN OP b))
forall {j} {k} (p :: j +-> k) (b1 :: k) (a1 :: j).
p b1 a1 -> Op p (OP a1) (OP b1)
Op (forall k (b :: k) (c :: k) (a :: k).
(Coclosed k, Ob b, Ob c) =>
(a ~> (c ** b)) -> (a <~~ b) ~> c
coevalUniv @k @b @a b1 ~> a1
b1 ~> (UN OP a ** UN OP b)
f)
apply :: forall (a :: OPPOSITE k) (b :: OPPOSITE k).
(Ob a, Ob b) =>
((a ~~> b) ** a) ~> b
apply @(OP a) @(OP b) = (UN OP b ~> ((UN OP b <~~ UN OP a) ** UN OP a))
-> Op (~>) (OP ((UN OP b <~~ UN OP a) ** UN OP a)) (OP (UN OP b))
forall {j} {k} (p :: j +-> k) (b1 :: k) (a1 :: j).
p b1 a1 -> Op p (OP a1) (OP b1)
Op (forall k (a :: k) (b :: k).
(Coclosed k, Ob a, Ob b) =>
a ~> ((a <~~ b) ** b)
coeval @k @b @a)
instance (Closed k) => Coclosed (OPPOSITE k) where
type OP a <~~ OP b = OP (b ~~> a)
withObCoExp :: forall (a :: OPPOSITE k) (b :: OPPOSITE k) r.
(Ob a, Ob b) =>
(Ob (a <~~ b) => r) -> r
withObCoExp @(OP a) @(OP b) Ob (a <~~ b) => r
r = forall k (a :: k) (b :: k) r.
(Closed k, Ob a, Ob b) =>
(Ob (a ~~> b) => r) -> r
withObExp @k @b @a r
Ob (UN OP b ~~> UN OP a) => r
Ob (a <~~ b) => r
r
coeval :: forall (a :: OPPOSITE k) (b :: OPPOSITE k).
(Ob a, Ob b) =>
a ~> ((a <~~ b) ** b)
coeval @(OP a) @(OP b) = (((UN OP b ~~> UN OP a) ** UN OP b) ~> UN OP a)
-> Op (~>) (OP (UN OP a)) (OP ((UN OP b ~~> UN OP a) ** UN OP b))
forall {j} {k} (p :: j +-> k) (b1 :: k) (a1 :: j).
p b1 a1 -> Op p (OP a1) (OP b1)
Op (forall k (a :: k) (b :: k).
(Closed k, Ob a, Ob b) =>
((a ~~> b) ** a) ~> b
apply @_ @b @a)
coevalUniv :: forall (b :: OPPOSITE k) (c :: OPPOSITE k) (a :: OPPOSITE k).
(Ob b, Ob c) =>
(a ~> (c ** b)) -> (a <~~ b) ~> c
coevalUniv @(OP b) @(OP c) (Op b1 ~> a1
f) = (UN OP c ~> (UN OP b ~~> a1))
-> Op (~>) (OP (UN OP b ~~> a1)) (OP (UN OP c))
forall {j} {k} (p :: j +-> k) (b1 :: k) (a1 :: j).
p b1 a1 -> Op p (OP a1) (OP b1)
Op (forall k (a :: k) (b :: k) (c :: k).
(Closed k, Ob a, Ob b) =>
((a ** b) ~> c) -> a ~> (b ~~> c)
curry @k @c @b b1 ~> a1
(UN OP c ** UN OP b) ~> a1
f)
instance (HasCoproducts k, Coclosed (COPROD k)) => Closed (PROD (OPPOSITE k)) where
type PR (OP a) ~~> PR (OP b) = PR (OP (UN COPR (COPR b <~~ COPR a)))
withObExp :: forall (a :: PROD (OPPOSITE k)) (b :: PROD (OPPOSITE k)) r.
(Ob a, Ob b) =>
(Ob (a ~~> b) => r) -> r
withObExp @(PR (OP a)) @(PR (OP b)) Ob (a ~~> b) => r
r = forall k (a :: k) (b :: k) r.
(Coclosed k, Ob a, Ob b) =>
(Ob (a <~~ b) => r) -> r
withObCoExp @(COPROD k) @(COPR b) @(COPR a) r
Ob (a ~~> b) => r
Ob (COPR (UN OP (UN PR b)) <~~ COPR (UN OP (UN PR a))) => r
r
curry :: forall (a :: PROD (OPPOSITE k)) (b :: PROD (OPPOSITE k))
(c :: PROD (OPPOSITE k)).
(Ob a, Ob b) =>
((a ** b) ~> c) -> a ~> (b ~~> c)
curry @(PR (OP a)) @(PR (OP b)) (Prod (Op b1 ~> a1
f)) =
case forall k (b :: k) (c :: k) (a :: k).
(Coclosed k, Ob b, Ob c) =>
(a ~> (c ** b)) -> (a <~~ b) ~> c
coevalUniv @(COPROD k) @(COPR b) @(COPR a) ((b1 ~> a1) -> Coprod (~>) (COPR b1) (COPR a1)
forall {j} {k} (p :: j +-> k) (a1 :: k) (b1 :: j).
p a1 b1 -> Coprod p (COPR a1) (COPR b1)
Coprod b1 ~> a1
f) of
Coprod a1 ~> b1
g -> Op (~>) (OP b1) (OP a1) -> Prod (Op (~>)) (PR (OP b1)) (PR (OP a1))
forall {j} {k} (p :: j +-> k) (a1 :: k) (b1 :: j).
p a1 b1 -> Prod p (PR a1) (PR b1)
Prod ((a1 ~> b1) -> Op (~>) (OP b1) (OP a1)
forall {j} {k} (p :: j +-> k) (b1 :: k) (a1 :: j).
p b1 a1 -> Op p (OP a1) (OP b1)
Op a1 ~> b1
g)
apply :: forall (a :: PROD (OPPOSITE k)) (b :: PROD (OPPOSITE k)).
(Ob a, Ob b) =>
((a ~~> b) ** a) ~> b
apply @(PR (OP a)) @(PR (OP b)) = Op
(~>)
(OP
(UN COPR (COPR (UN OP (UN PR b)) <~~ COPR (UN OP (UN PR a)))
|| UN OP (UN PR a)))
(OP (UN OP (UN PR b)))
-> Prod
(Op (~>))
(PR
(OP
(UN COPR (COPR (UN OP (UN PR b)) <~~ COPR (UN OP (UN PR a)))
|| UN OP (UN PR a))))
(PR (OP (UN OP (UN PR b))))
forall {j} {k} (p :: j +-> k) (a1 :: k) (b1 :: j).
p a1 b1 -> Prod p (PR a1) (PR b1)
Prod ((UN OP (UN PR b)
~> (UN COPR (COPR (UN OP (UN PR b)) <~~ COPR (UN OP (UN PR a)))
|| UN OP (UN PR a)))
-> Op
(~>)
(OP
(UN COPR (COPR (UN OP (UN PR b)) <~~ COPR (UN OP (UN PR a)))
|| UN OP (UN PR a)))
(OP (UN OP (UN PR b)))
forall {j} {k} (p :: j +-> k) (b1 :: k) (a1 :: j).
p b1 a1 -> Op p (OP a1) (OP b1)
Op (Coprod
(~>)
(COPR (UN OP (UN PR b)))
(COPR
(UN COPR (COPR (UN OP (UN PR b)) <~~ COPR (UN OP (UN PR a)))
|| UN OP (UN PR a)))
-> UN OP (UN PR b)
~> (UN COPR (COPR (UN OP (UN PR b)) <~~ COPR (UN OP (UN PR a)))
|| UN OP (UN PR a))
forall {j} {k} (p :: j +-> k) (a :: k) (b :: j).
Coprod p (COPR a) (COPR b) -> p a b
unCoprod (forall k (a :: k) (b :: k).
(Coclosed k, Ob a, Ob b) =>
a ~> ((a <~~ b) ** b)
coeval @(COPROD k) @(COPR b) @(COPR a))))
instance (Cartesian k, Closed (PROD k)) => Coclosed (COPROD (OPPOSITE k)) where
type COPR (OP a) <~~ COPR (OP b) = COPR (OP (UN PR (PR b ~~> PR a)))
withObCoExp :: forall (a :: COPROD (OPPOSITE k)) (b :: COPROD (OPPOSITE k)) r.
(Ob a, Ob b) =>
(Ob (a <~~ b) => r) -> r
withObCoExp @(COPR (OP a)) @(COPR (OP b)) Ob (a <~~ b) => r
r = forall k (a :: k) (b :: k) r.
(Closed k, Ob a, Ob b) =>
(Ob (a ~~> b) => r) -> r
withObExp @(PROD k) @(PR b) @(PR a) r
Ob (PR (UN OP (UN COPR b)) ~~> PR (UN OP (UN COPR a))) => r
Ob (a <~~ b) => r
r
coeval :: forall (a :: COPROD (OPPOSITE k)) (b :: COPROD (OPPOSITE k)).
(Ob a, Ob b) =>
a ~> ((a <~~ b) ** b)
coeval @(COPR (OP a)) @(COPR (OP b)) = Op
(~>)
(OP (UN OP (UN COPR a)))
(OP
(UN PR (PR (UN OP (UN COPR b)) ~~> PR (UN OP (UN COPR a)))
&& UN OP (UN COPR b)))
-> Coprod
(Op (~>))
(COPR (OP (UN OP (UN COPR a))))
(COPR
(OP
(UN PR (PR (UN OP (UN COPR b)) ~~> PR (UN OP (UN COPR a)))
&& UN OP (UN COPR b))))
forall {j} {k} (p :: j +-> k) (a1 :: k) (b1 :: j).
p a1 b1 -> Coprod p (COPR a1) (COPR b1)
Coprod (((UN PR (PR (UN OP (UN COPR b)) ~~> PR (UN OP (UN COPR a)))
&& UN OP (UN COPR b))
~> UN OP (UN COPR a))
-> Op
(~>)
(OP (UN OP (UN COPR a)))
(OP
(UN PR (PR (UN OP (UN COPR b)) ~~> PR (UN OP (UN COPR a)))
&& UN OP (UN COPR b)))
forall {j} {k} (p :: j +-> k) (b1 :: k) (a1 :: j).
p b1 a1 -> Op p (OP a1) (OP b1)
Op (Prod
(~>)
(PR
(UN PR (PR (UN OP (UN COPR b)) ~~> PR (UN OP (UN COPR a)))
&& UN OP (UN COPR b)))
(PR (UN OP (UN COPR a)))
-> (UN PR (PR (UN OP (UN COPR b)) ~~> PR (UN OP (UN COPR a)))
&& UN OP (UN COPR b))
~> UN OP (UN COPR a)
forall {j} {k} (p :: j +-> k) (a :: k) (b :: j).
Prod p (PR a) (PR b) -> p a b
unProd (forall k (a :: k) (b :: k).
(Closed k, Ob a, Ob b) =>
((a ~~> b) ** a) ~> b
apply @_ @(PR b) @(PR a))))
coevalUniv :: forall (b :: COPROD (OPPOSITE k)) (c :: COPROD (OPPOSITE k))
(a :: COPROD (OPPOSITE k)).
(Ob b, Ob c) =>
(a ~> (c ** b)) -> (a <~~ b) ~> c
coevalUniv @(COPR (OP b)) @(COPR (OP c)) (Coprod (Op b1 ~> a1
f)) =
case forall k (a :: k) (b :: k) (c :: k).
(Closed k, Ob a, Ob b) =>
((a ** b) ~> c) -> a ~> (b ~~> c)
curry @_ @(PR c) @(PR b) ((b1 ~> a1) -> Prod (~>) (PR b1) (PR a1)
forall {j} {k} (p :: j +-> k) (a1 :: k) (b1 :: j).
p a1 b1 -> Prod p (PR a1) (PR b1)
Prod b1 ~> a1
f) of
Prod a1 ~> b1
g -> Op (~>) (OP b1) (OP a1)
-> Coprod (Op (~>)) (COPR (OP b1)) (COPR (OP a1))
forall {j} {k} (p :: j +-> k) (a1 :: k) (b1 :: j).
p a1 b1 -> Coprod p (COPR a1) (COPR b1)
Coprod ((a1 ~> b1) -> Op (~>) (OP b1) (OP a1)
forall {j} {k} (p :: j +-> k) (b1 :: k) (a1 :: j).
p b1 a1 -> Op p (OP a1) (OP b1)
Op a1 ~> b1
g)
class (Cocartesian k, Coclosed k) => CoCCC k
instance (Cocartesian k, Coclosed k) => CoCCC k