Safe Haskell	None
Language	GHC2024

Proarrow.Profunctor.HaskValue

Documentation

data HaskValue c (a :: k) (b :: j) where Source Github #

Constructors

HaskValue :: forall {k} {j} (a :: k) (b :: j) c. (Ob a, Ob b) => c -> HaskValue c a b

Instances

Instances details

(Monoid c, Monoidal j, Monoidal k) => MonoidalProfunctor (HaskValue c :: k -> j -> Type) Source Github #
Instance details Defined in Proarrow.Profunctor.HaskValue Methods par0 :: HaskValue c (Unit :: k) (Unit :: j) Source Github # par :: forall (x1 :: k) (x2 :: j) (y1 :: k) (y2 :: j). HaskValue c x1 x2 -> HaskValue c y1 y2 -> HaskValue c (x1 y1) (x2 y2) Source Github #
(CategoryOf j, CategoryOf k) => Profunctor (HaskValue c :: k -> j -> Type) Source Github #
Instance details Defined in Proarrow.Profunctor.HaskValue Methods dimap :: forall (c0 :: k) (a :: k) (b :: j) (d :: j). (c0 ~> a) -> (b ~> d) -> HaskValue c a b -> HaskValue c c0 d Source Github # lmap :: forall (c0 :: k) (a :: k) (b :: j). (c0 ~> a) -> HaskValue c a b -> HaskValue c c0 b Source Github # rmap :: forall (b :: j) (d :: j) (a :: k). (b ~> d) -> HaskValue c a b -> HaskValue c a d Source Github # (\\) :: forall (a :: k) (b :: j) r. ((Ob a, Ob b) => r) -> HaskValue c a b -> r Source Github #
Copowered Type k => HasColimits (HaskValue n :: () -> () -> Type) k Source Github #
Instance details Defined in Proarrow.Category.Colimit Methods colimit :: forall (d :: k +-> ()). Corepresentable d => ((HaskValue n :: () -> () -> Type) :.: Colimit (HaskValue n :: () -> () -> Type) d) :~> d Source Github # colimitUniv :: forall (d :: k +-> ()) (p :: k +-> ()). (Corepresentable d, Profunctor p) => (((HaskValue n :: () -> () -> Type) :.: p) :~> d) -> p :~> Colimit (HaskValue n :: () -> () -> Type) d Source Github #
Powered Type k => HasLimits (HaskValue n :: () -> () -> Type) k Source Github #
Instance details Defined in Proarrow.Category.Limit Methods limit :: forall (d :: () +-> k). Representable d => (Limit (HaskValue n :: () -> () -> Type) d :.: (HaskValue n :: () -> () -> Type)) :~> d Source Github # limitUniv :: forall (d :: () +-> k) (p :: () +-> k). (Representable d, Profunctor p) => ((p :.: (HaskValue n :: () -> () -> Type)) :~> d) -> p :~> Limit (HaskValue n :: () -> () -> Type) d Source Github #
SelfAction k => Cotraversable (HaskValue c :: k -> k -> Type) Source Github #
Instance details Defined in Proarrow.Profunctor.HaskValue Methods cotraverse :: forall (p :: k +-> k). StrongDistributiveProfunctor p => (p :.: (HaskValue c :: k -> k -> Type)) :~> ((HaskValue c :: k -> k -> Type) :.: p) Source Github #
SelfAction k => Traversable (HaskValue c :: k -> k -> Type) Source Github #
Instance details Defined in Proarrow.Profunctor.HaskValue Methods traverse :: forall (p :: k +-> k). StrongDistributiveProfunctor p => ((HaskValue c :: k -> k -> Type) :.: p) :~> (p :.: (HaskValue c :: k -> k -> Type)) Source Github #
(Monoid c, CategoryOf k) => Promonad (HaskValue c :: k -> k -> Type) Source Github #
Instance details Defined in Proarrow.Profunctor.HaskValue Methods id :: forall (a :: k). Ob a => HaskValue c a a Source Github # (.) :: forall (b :: k) (c0 :: k) (a :: k). HaskValue c b c0 -> HaskValue c a b -> HaskValue c a c0 Source Github #
type Colimit (HaskValue n :: () -> () -> Type) (d :: k +-> ()) Source Github #
Instance details Defined in Proarrow.Category.Colimit type Colimit (HaskValue n :: () -> () -> Type) (d :: k +-> ()) = Corep (CopowerLimit n d)
type Limit (HaskValue n :: () -> () -> Type) (d :: () +-> k) Source Github #
Instance details Defined in Proarrow.Category.Limit type Limit (HaskValue n :: () -> () -> Type) (d :: () +-> k) = Rep (PowerLimit n d)