{-# LANGUAGE PatternSynonyms #-}
module Proarrow.Category.Instance.Cospan
( COSPAN
, CS
, Cospan
, pattern Cospan
, Undecorated (..)
, arr
, coarr
, Pushout
, Pullback
) where
import Data.Kind (Type)
import Prelude (type (~))
import Proarrow.Category.Instance.DecoratedCospan (DECCOSPAN (..), DecCospan (..))
import Proarrow.Category.Instance.Span (SPAN (..), Span (..))
import Proarrow.Category.Monoidal.Applicative (Alternative (..))
import Proarrow.Colimit.BinaryCoproduct (HasBinaryCoproducts (..), HasCoproducts)
import Proarrow.Colimit.Pushout (HasPushouts (..))
import Proarrow.Core (CAT, CategoryOf (..), tgt, type (+->))
import Proarrow.Functor (Functor (..), FunctorForRep (..))
import Proarrow.Limit.Pullback (HasPullbacks (..))
type Undecorated :: k -> Type
data Undecorated c = Undecorated
instance (CategoryOf k) => Functor (Undecorated :: k -> Type) where
map :: forall (a :: k) (b :: k).
(a ~> b) -> Undecorated a ~> Undecorated b
map a ~> b
_ Undecorated a
Undecorated = Undecorated b
forall k (c :: k). Undecorated c
Undecorated
instance (HasBinaryCoproducts k) => Alternative (Undecorated :: k -> Type) where
empty :: forall (a :: k). Ob a => Unit ~> Undecorated a
empty () = Undecorated a
forall k (c :: k). Undecorated c
Undecorated
alt :: forall (a :: k) (b :: k) (c :: k).
(Ob a, Ob b) =>
((a || b) ~> c)
-> (Undecorated a ** Undecorated b) ~> Undecorated c
alt (a || b) ~> c
_ (Undecorated a, Undecorated b)
_ = Undecorated c
forall k (c :: k). Undecorated c
Undecorated
type COSPAN :: Type -> Type
type COSPAN k = DECCOSPAN (Undecorated :: k -> Type)
type CS :: forall k. k -> COSPAN k
type CS @k = DC @k @Undecorated
type Cospan :: forall k. CAT (COSPAN k)
type Cospan @k = DecCospan @(Undecorated :: k -> Type)
pattern Cospan
:: forall {k} {a :: COSPAN k} {b}. () => forall c a' b'. (a ~ CS a', b ~ CS b') => a' ~> c -> b' ~> c -> Cospan a b
pattern $bCospan :: forall {k} {a :: COSPAN k} {b :: COSPAN k} (c :: k) (a' :: k)
(b' :: k).
(a ~ CS a', b ~ CS b') =>
(a' ~> c) -> (b' ~> c) -> Cospan a b
$mCospan :: forall {r} {k} {a :: COSPAN k} {b :: COSPAN k}.
Cospan a b
-> (forall {c :: k} {a' :: k} {b' :: k}.
(a ~ CS a', b ~ CS b') =>
(a' ~> c) -> (b' ~> c) -> r)
-> ((# #) -> r)
-> r
Cospan f g = DecCospan f g Undecorated
{-# COMPLETE Cospan #-}
arr :: (CategoryOf k) => (a :: k) ~> b -> Cospan (CS a) (CS b)
arr :: forall k (a :: k) (b :: k).
CategoryOf k =>
(a ~> b) -> Cospan (CS a) (CS b)
arr a ~> b
f = (a ~> b) -> (b ~> b) -> Cospan (CS a) (CS b)
forall {k} {a :: COSPAN k} {b :: COSPAN k} (c :: k) (a' :: k)
(b' :: k).
(a ~ CS a', b ~ CS b') =>
(a' ~> c) -> (b' ~> c) -> Cospan a b
Cospan a ~> b
f ((a ~> b) -> b ~> b
forall {k1} {k2} (a :: k2) (b :: k1) (p :: k1 +-> k2).
Profunctor p =>
p a b -> Obj b
tgt a ~> b
f)
coarr :: (CategoryOf k) => (a :: k) ~> b -> Cospan (CS b) (CS a)
coarr :: forall k (a :: k) (b :: k).
CategoryOf k =>
(a ~> b) -> Cospan (CS b) (CS a)
coarr a ~> b
f = (b ~> b) -> (a ~> b) -> Cospan (CS b) (CS a)
forall {k} {a :: COSPAN k} {b :: COSPAN k} (c :: k) (a' :: k)
(b' :: k).
(a ~ CS a', b ~ CS b') =>
(a' ~> c) -> (b' ~> c) -> Cospan a b
Cospan ((a ~> b) -> b ~> b
forall {k1} {k2} (a :: k2) (b :: k1) (p :: k1 +-> k2).
Profunctor p =>
p a b -> Obj b
tgt a ~> b
f) a ~> b
f
data family Pushout :: SPAN k +-> COSPAN k
instance (HasPushouts k, HasCoproducts k, HasPullbacks k) => FunctorForRep (Pushout :: SPAN k +-> COSPAN k) where
type Pushout @ (SP a) = CS a
fmap :: forall (a :: SPAN k) (b :: SPAN k).
(a ~> b) -> (Pushout @ a) ~> (Pushout @ b)
fmap (Span c ~> a1
l c ~> b1
r) = (c ~> a1)
-> (c ~> b1)
-> (forall (p :: k).
(a1 ~> p) -> (b1 ~> p) -> DecCospan (CS a1) (CS b1))
-> DecCospan (CS a1) (CS b1)
forall (o :: k) (a :: k) (b :: k) r.
(o ~> a)
-> (o ~> b) -> (forall (p :: k). (a ~> p) -> (b ~> p) -> r) -> r
forall k (o :: k) (a :: k) (b :: k) r.
HasPushouts k =>
(o ~> a)
-> (o ~> b) -> (forall (p :: k). (a ~> p) -> (b ~> p) -> r) -> r
pushout c ~> a1
l c ~> b1
r (a1 ~> p) -> (b1 ~> p) -> DecCospan (CS a1) (CS b1)
forall (p :: k).
(a1 ~> p) -> (b1 ~> p) -> DecCospan (CS a1) (CS b1)
forall {k} {a :: COSPAN k} {b :: COSPAN k} (c :: k) (a' :: k)
(b' :: k).
(a ~ CS a', b ~ CS b') =>
(a' ~> c) -> (b' ~> c) -> Cospan a b
Cospan
data family Pullback :: COSPAN k +-> SPAN k
instance (HasPushouts k, HasCoproducts k, HasPullbacks k) => FunctorForRep (Pullback :: COSPAN k +-> SPAN k) where
type Pullback @ (CS a) = SP a
fmap :: forall (a :: COSPAN k) (b :: COSPAN k).
(a ~> b) -> (Pullback @ a) ~> (Pullback @ b)
fmap (Cospan a' ~> c
l b' ~> c
r) = (a' ~> c)
-> (b' ~> c)
-> (forall (p :: k).
(p ~> a') -> (p ~> b') -> Span (SP a') (SP b'))
-> Span (SP a') (SP b')
forall (o :: k) (a :: k) (b :: k) r.
(a ~> o)
-> (b ~> o) -> (forall (p :: k). (p ~> a) -> (p ~> b) -> r) -> r
forall k (o :: k) (a :: k) (b :: k) r.
HasPullbacks k =>
(a ~> o)
-> (b ~> o) -> (forall (p :: k). (p ~> a) -> (p ~> b) -> r) -> r
pullback a' ~> c
l b' ~> c
r (p ~> a') -> (p ~> b') -> Span (SP a') (SP b')
forall (p :: k). (p ~> a') -> (p ~> b') -> Span (SP a') (SP b')
forall {k} (c :: k) (a1 :: k) (b1 :: k).
(c ~> a1) -> (c ~> b1) -> Span (SP a1) (SP b1)
Span