| Safe Haskell | None |
|---|---|
| Language | GHC2024 |
Proarrow.Squares.Initial
Description
Pointwise initial objects as empty weighted colimits.
Synopsis
- type Initial = CorepStar (TerminalProfunctor :: j -> k -> Type)
- type Diagram = Corep (Absurd :: VOID +-> k)
- initial :: (CategoryOf j, HasInitialObject k) => Sq (Corep (Absurd :: VOID +-> j) '::: ('Nil :: Path VOID VOID)) ('Nil :: Path k k) (CorepStar (Diagram :: VOID -> k -> Type) '::: ('Nil :: Path k k)) ((Initial :: k -> j -> Type) '::: ('Nil :: Path k k))
- initiate :: forall {j} {k} (p :: j +-> k). (HasInitialObject k, Representable p) => Sq (Corep (Absurd :: VOID +-> j) '::: ('Nil :: Path VOID VOID)) ('Nil :: Path k k) (CorepStar (Diagram :: VOID -> k -> Type) '::: ('Nil :: Path k k)) (p '::: ('Nil :: Path k k)) -> Sq ('Nil :: Path j j) ('Nil :: Path k k) ((Initial :: k -> j -> Type) '::: ('Nil :: Path k k)) (p '::: ('Nil :: Path k k))
Documentation
type Initial = CorepStar (TerminalProfunctor :: j -> k -> Type) Source Github #
The pointwise initial functor.
initial :: (CategoryOf j, HasInitialObject k) => Sq (Corep (Absurd :: VOID +-> j) '::: ('Nil :: Path VOID VOID)) ('Nil :: Path k k) (CorepStar (Diagram :: VOID -> k -> Type) '::: ('Nil :: Path k k)) ((Initial :: k -> j -> Type) '::: ('Nil :: Path k k)) Source Github #
The empty cocone, weighted by the empty functor.
0----empty----J | | | d>-----@----->I | | K-------------K
Here I = Initial and d = CorepStar Diagram. The indexing category 0 has no objects.
initiate :: forall {j} {k} (p :: j +-> k). (HasInitialObject k, Representable p) => Sq (Corep (Absurd :: VOID +-> j) '::: ('Nil :: Path VOID VOID)) ('Nil :: Path k k) (CorepStar (Diagram :: VOID -> k -> Type) '::: ('Nil :: Path k k)) (p '::: ('Nil :: Path k k)) -> Sq ('Nil :: Path j j) ('Nil :: Path k k) ((Initial :: k -> j -> Type) '::: ('Nil :: Path k k)) (p '::: ('Nil :: Path k k)) Source Github #
Factor an empty cocone through the initial functor, uniquely.