| Safe Haskell | None |
|---|---|
| Language | GHC2024 |
Proarrow.Category.Instance.Zero
Description
Documentation
Instances
data Zero (a :: VOID) (b :: VOID) Source Github #
Instances
| DaggerProfunctor Zero Source Github # | |
| Promonad Zero Source Github # | |
| DecidableProfunctor Zero Source Github # | |
Defined in Proarrow.Category.Enriched.Thin | |
| ThinProfunctor Zero Source Github # | |
Defined in Proarrow.Category.Enriched.Thin | |
| Profunctor Zero Source Github # | |
Defined in Proarrow.Category.Instance.Zero Methods dimap :: forall (c :: VOID) (a :: VOID) (b :: VOID) (d :: VOID). (c ~> a) -> (b ~> d) -> Zero a b -> Zero c d Source Github # lmap :: forall (c :: VOID) (a :: VOID) (b :: VOID). (c ~> a) -> Zero a b -> Zero c b Source Github # rmap :: forall (b :: VOID) (d :: VOID) (a :: VOID). (b ~> d) -> Zero a b -> Zero a d Source Github # (\\) :: forall (a :: VOID) (b :: VOID) r. ((Ob a, Ob b) => r) -> Zero a b -> r Source Github # | |
| type HasArrow Zero (a :: VOID) (b :: VOID) Source Github # | |
| type Holds Zero (a :: VOID) (b :: VOID) Source Github # | |
data family Absurd :: VOID +-> k Source Github #
Instances
| CategoryOf k => FunctorForRep (Absurd :: VOID +-> k) Source Github # | |
| (CategoryOf a, HasInitialObject k) => HasColimits (Corep (Absurd :: VOID +-> a) :: VOID -> a -> Type) k Source Github # | Colimits weighted by the empty functor are pointwise initial objects. |
Defined in Proarrow.Colimit Methods colimit :: forall (d :: k +-> VOID). Corepresentable d => (Corep (Absurd :: VOID +-> a) :.: Colimit (Corep (Absurd :: VOID +-> a)) d) :~> d Source Github # colimitUniv :: forall (d :: k +-> VOID) (p :: k +-> a). (Corepresentable d, Profunctor p) => ((Corep (Absurd :: VOID +-> a) :.: p) :~> d) -> p :~> Colimit (Corep (Absurd :: VOID +-> a)) d Source Github # | |
| (CategoryOf a, HasTerminalObject k) => HasLimits (Rep (Absurd :: VOID +-> a) :: a -> VOID -> Type) k Source Github # | Limits weighted by the empty functor are pointwise terminal objects. |
Defined in Proarrow.Limit Methods limit :: forall (d :: VOID +-> k). Representable d => (Limit (Rep (Absurd :: VOID +-> a)) d :.: Rep (Absurd :: VOID +-> a)) :~> d Source Github # limitUniv :: forall (d :: VOID +-> k) (p :: a +-> k). (Representable d, Profunctor p) => ((p :.: Rep (Absurd :: VOID +-> a)) :~> d) -> p :~> Limit (Rep (Absurd :: VOID +-> a)) d Source Github # | |
| type Colimit (Corep (Absurd :: VOID +-> a) :: VOID -> a -> Type) (d :: k +-> VOID) Source Github # | |
| type Limit (Rep (Absurd :: VOID +-> a) :: a -> VOID -> Type) (d :: VOID +-> k) Source Github # | |