| Safe Haskell | None |
|---|---|
| Language | GHC2024 |
Proarrow.Category.Bicategory.MonoidalAsBi
Documentation
newtype MonK k (i :: ()) (j :: ()) Source Github #
Constructors
| MK k |
Instances
| Monoidal k => WithObO2 Cotight (MonK k :: () -> () -> Type) Source Github # | |
| Monoidal k => WithObO2 Tight (MonK k :: () -> () -> Type) Source Github # | |
| Monoidal k => Bicategory (MonK k :: () -> () -> Type) Source Github # | A monoidal category as a bicategory. |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi Methods o :: forall {i :: ()} (j :: ()) (k0 :: ()) (a :: MonK k j k0) (b :: MonK k j k0) (c :: MonK k i j) (d :: MonK k i j). (a ~> b) -> (c ~> d) -> O a c ~> O b d Source Github # withOb2 :: forall {i :: ()} {j :: ()} {k0 :: ()} (a :: MonK k j k0) (b :: MonK k i j) r. (Ob a, Ob b, Ob0 (MonK k) i, Ob0 (MonK k) j, Ob0 (MonK k) k0) => (Ob (O a b) => r) -> r Source Github # withOb0s :: forall {j :: ()} {k0 :: ()} (a :: MonK k j k0) r. Ob a => ((Ob0 (MonK k) j, Ob0 (MonK k) k0) => r) -> r Source Github # (\\\) :: forall (i :: ()) (j :: ()) (ps :: MonK k i j) (qs :: MonK k i j) r. ((Ob0 (MonK k) i, Ob0 (MonK k) j, Ob ps, Ob qs) => r) -> (ps ~> qs) -> r Source Github # leftUnitor :: forall {i :: ()} {j :: ()} (a :: MonK k i j). (Ob0 (MonK k) i, Ob0 (MonK k) j, Ob a) => O (I :: MonK k j j) a ~> a Source Github # leftUnitorInv :: forall {i :: ()} {j :: ()} (a :: MonK k i j). (Ob0 (MonK k) i, Ob0 (MonK k) j, Ob a) => a ~> O (I :: MonK k j j) a Source Github # rightUnitor :: forall {i :: ()} {j :: ()} (a :: MonK k i j). (Ob0 (MonK k) i, Ob0 (MonK k) j, Ob a) => O a (I :: MonK k i i) ~> a Source Github # rightUnitorInv :: forall {i :: ()} {j :: ()} (a :: MonK k i j). (Ob0 (MonK k) i, Ob0 (MonK k) j, Ob a) => a ~> O a (I :: MonK k i i) Source Github # associator :: forall {h :: ()} {i :: ()} {j :: ()} {k0 :: ()} (a :: MonK k j k0) (b :: MonK k i j) (c :: MonK k h i). (Ob0 (MonK k) h, Ob0 (MonK k) i, Ob0 (MonK k) j, Ob0 (MonK k) k0, Ob a, Ob b, Ob c) => O (O a b) c ~> O a (O b c) Source Github # associatorInv :: forall {h :: ()} {i :: ()} {j :: ()} {k0 :: ()} (a :: MonK k j k0) (b :: MonK k i j) (c :: MonK k h i). (Ob0 (MonK k) h, Ob0 (MonK k) i, Ob0 (MonK k) j, Ob0 (MonK k) k0, Ob a, Ob b, Ob c) => O a (O b c) ~> O (O a b) c Source Github # | |
| CompactClosed k => Equipment (MonK k :: () -> () -> Type) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi Methods withCotightAdjoint :: forall {j :: ()} {k1 :: ()} (f :: MonK k j k1) r. IsTight f => ((Adjunction_ f (CotightAdjoint f), IsCotight (CotightAdjoint f)) => r) -> r Source Github # withTightAdjoint :: forall {j :: ()} {k1 :: ()} (f :: MonK k j k1) r. IsCotight f => ((Adjunction_ (TightAdjoint f) f, IsTight (TightAdjoint f)) => r) -> r Source Github # | |
| (Coclosed k, Ob (q <~~ p), Ob p, Ob q) => LeftKanExtension ('MK p :: MonK k c d) ('MK q :: MonK k c e) Source Github # | |
| (Coclosed k, SymMonoidal k, Ob (q <~~ p), Ob p, Ob q) => LeftKanLift ('MK p :: MonK k d c) ('MK q :: MonK k e c) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi Methods lift :: ('MK q :: MonK k e c) ~> O ('MK p :: MonK k d c) (Lift ('MK p :: MonK k d c) ('MK q :: MonK k e c)) Source Github # liftUniv :: forall (g :: MonK k e d). Ob g => (('MK q :: MonK k e c) ~> O ('MK p :: MonK k d c) g) -> Lift ('MK p :: MonK k d c) ('MK q :: MonK k e c) ~> g Source Github # | |
| (Closed k, Ob (p ~~> q), Ob p, Ob q) => RightKanExtension ('MK p :: MonK k c d) ('MK q :: MonK k c e) Source Github # | |
| (Closed k, SymMonoidal k, Ob (p ~~> q), Ob p, Ob q) => RightKanLift ('MK p :: MonK k d c) ('MK q :: MonK k e c) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi Methods rift :: O ('MK p :: MonK k d c) (Rift ('MK p :: MonK k d c) ('MK q :: MonK k e c)) ~> ('MK q :: MonK k e c) Source Github # riftUniv :: forall (g :: MonK k e d). Ob g => (O ('MK p :: MonK k d c) g ~> ('MK q :: MonK k e c)) -> g ~> Rift ('MK p :: MonK k d c) ('MK q :: MonK k e c) Source Github # | |
| (CompactClosed k, Ob j) => HasColimits ('MK j :: MonK k i0 i1) '() Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi Methods withObColimit :: forall (d :: MonK k '() i1) r. IsCotight d => (IsCotight (Colimit ('MK j :: MonK k i0 i1) d) => r) -> r Source Github # colimit :: forall (d :: MonK k '() i1). IsCotight d => O ('MK j :: MonK k i0 i1) (Colimit ('MK j :: MonK k i0 i1) d) ~> d Source Github # colimitUniv :: forall (d :: MonK k '() i1) (p :: MonK k '() i0). (IsCotight d, Ob p) => (O ('MK j :: MonK k i0 i1) p ~> d) -> p ~> Colimit ('MK j :: MonK k i0 i1) d Source Github # | |
| (CompactClosed k, Ob j) => HasLimits ('MK j :: MonK k i a) '() Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi Methods withObLimit :: forall (d :: MonK k i '()) r. IsTight d => (IsTight (Limit ('MK j :: MonK k i a) d) => r) -> r Source Github # limit :: forall (d :: MonK k i '()). IsTight d => O (Limit ('MK j :: MonK k i a) d) ('MK j :: MonK k i a) ~> d Source Github # limitUniv :: forall (d :: MonK k i '()) (p :: MonK k a '()). (IsTight d, Ob p) => (O p ('MK j :: MonK k i a) ~> d) -> p ~> Limit ('MK j :: MonK k i a) d Source Github # | |
| Comonoid m => Comonad ('MK m :: MonK k a a) Source Github # | Comonoids in a monoidal category are comonads when the monoidal category is seen as a bicategory. |
| Monoid m => Monad ('MK m :: MonK k a a) Source Github # | Monoids in a monoidal category are monads when the monoidal category is seen as a bicategory. |
| CategoryOf k => Functor ('MK :: k -> MonK k i j) Source Github # | |
| CategoryOf k => CategoryOf (MonK k i j) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi | |
| CategoryOf k => Promonad (Mon2 :: MonK k i j -> MonK k i j -> Type) Source Github # | |
| CategoryOf k => Profunctor (Mon2 :: MonK k i j -> MonK k i j -> Type) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi | |
| type Ob0 (MonK k1 :: () -> () -> Type) (j :: k2) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi | |
| type IsOb Cotight ('MK a :: MonK k i j) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi | |
| type IsOb Tight ('MK a :: MonK k i j) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi | |
| type Lan ('MK p :: MonK k c d) ('MK q :: MonK k c e) Source Github # | |
| type Lift ('MK p :: MonK k d c) ('MK q :: MonK k e c) Source Github # | |
| type Ran ('MK p :: MonK k c d) ('MK q :: MonK k c e) Source Github # | |
| type Rift ('MK p :: MonK k d c) ('MK q :: MonK k e c) Source Github # | |
| type I Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi | |
| type CotightAdjoint (a :: MonK k i j) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi | |
| type TightAdjoint (a :: MonK k i j) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi | |
| type O ('MK a :: MonK k1 j k2) ('MK b :: MonK k1 i j) Source Github # | |
| type Colimit ('MK j :: MonK k i0 i1) ('MK d :: MonK k '() i1) Source Github # | |
| type Limit ('MK j :: MonK k i a) ('MK d :: MonK k i '()) Source Github # | |
| type UN ('MK :: j1 -> MonK j1 i j2) ('MK k :: MonK j1 i j2) Source Github # | |
| type (~>) Source Github # | |
| type Ob (a :: MonK k i j) Source Github # | |
data Mon2 (a :: MonK k i j) (b :: MonK k i j) where Source Github #
Constructors
| Mon2 :: forall {k} {i :: ()} {j :: ()} (a1 :: k) (b1 :: k). (a1 ~> b1) -> Mon2 ('MK a1 :: MonK k i j) ('MK b1 :: MonK k i j) |
Instances
| CategoryOf k => Promonad (Mon2 :: MonK k i j -> MonK k i j -> Type) Source Github # | |
| CategoryOf k => Profunctor (Mon2 :: MonK k i j -> MonK k i j -> Type) Source Github # | |
Defined in Proarrow.Category.Bicategory.MonoidalAsBi | |
dualAdj :: forall {c :: ()} {d :: ()} {k} (a :: k). (CompactClosed k, Ob a) => Adj ('MK (Dual a) :: MonK k c d) ('MK a :: MonK k d c) Source Github #