| HasInitialObject Nat Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.Simplex |
| HasInitialObject BOOL Source Github # | |
Instance detailsDefined in Proarrow.Colimit.Initial |
| HasInitialObject COST Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.Cost |
| HasInitialObject FINHASK Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.FinHask |
| HasInitialObject FINREL Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.FinRel |
| HasInitialObject FINSET Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.FinSet |
| HasInitialObject LINEAR Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.Linear |
| HasInitialObject POINTED Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.PointedHask |
| HasInitialObject () Source Github # | |
Instance detailsDefined in Proarrow.Colimit.Initial |
| HasInitialObject Type Source Github # | |
Instance detailsDefined in Proarrow.Colimit.Initial |
| CategoryOf k => HasInitialObject (FAM k) Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.Fam |
| Num a => HasInitialObject (MatK a) Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.Mat |
| HasTerminalObject k => HasInitialObject (OPPOSITE k) Source Github # | |
Instance detailsDefined in Proarrow.Colimit.Initial |
| HasInitialObject (ORDINAL ('S n)) Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.Ordinal |
| HasInitialObject k => HasInitialObject (COPROD k) Source Github # | |
Instance detailsDefined in Proarrow.Colimit.BinaryCoproduct |
| HasInitialObject k => HasInitialObject (PROD k) Source Github # | |
Instance detailsDefined in Proarrow.Limit.BinaryProduct |
| (CategoryOf j, CategoryOf k) => HasInitialObject (FINITARY j k) Source Github # | |
Instance detailsDefined in Proarrow.Category.Enriched.Finitary.Topos |
| (HasInitialObject k, Monad p) => HasInitialObject (KLEISLI p) Source Github # | Dually, the initial object lifts to the Kleisli category of a Monad: there p a b is
a ~> p % b, so the presheaf p (-) z is representable and takes colimits in k to limits. |
Instance detailsDefined in Proarrow.Category.Instance.Kleisli |
| (CategoryOf j, CategoryOf k) => HasInitialObject (j +-> k) Source Github # | |
Instance detailsDefined in Proarrow.Colimit.Initial |
| (HasInitialObject j, HasInitialObject k) => HasInitialObject (j, k) Source Github # | |
Instance detailsDefined in Proarrow.Colimit.Initial |
| CategoryOf k1 => HasInitialObject (k1 -> Type) Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.Nat |
| (HasFiniteCovers t k, FiniteCat j, FiniteCat k) => HasInitialObject (SHEAVES t j k) Source Github # | Colimits are the presheaf colimits, sheafified: take the FINITARY colimit, follow its cocone
with unitSheafify, and get the universal property from extendSheafify. This works because
sheafification is a left adjoint. The initial sheaf need not be the initial presheaf. Joins covers the
bottom of a lattice by the empty family, so every sheaf has one section there. |
Instance detailsDefined in Proarrow.Category.Enriched.Finitary.Sheaf |
| (HasInitialObject j, CategoryOf k, CodiscreteProfunctor p) => HasInitialObject (COLLAGE p) Source Github # | |
Instance detailsDefined in Proarrow.Category.Instance.Collage |
| Elem HasInitialObject cs => HasInitialObject (FREE cs p) Source Github # | |
Instance detailsDefined in Proarrow.Colimit.Initial |