proarrow
Safe HaskellNone
LanguageGHC2024

Proarrow.Category.Instance.Fam

Documentation

data FAM k Source Github #

Constructors

DEP_ (x +-> k) 

Instances

Instances details
CategoryOf k => FunctorForRep (Embed :: k +-> FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

fmap :: forall (a :: k) (b :: k). (a ~> b) -> ((Embed :: k +-> FAM k) @ a) ~> ((Embed :: k +-> FAM k) @ b) Source Github #

CategoryOf k => CategoryOf (FAM k) Source Github #

The Fam construction a.k.a. the free coproduct completion of k

Instance details

Defined in Proarrow.Category.Instance.Fam

Associated Types

type (~>) 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (~>) = Fam :: FAM k -> FAM k -> Type
CategoryOf k => HasBinaryCoproducts (FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

withObCoprod :: forall (a :: FAM k) (b :: FAM k) r. (Ob a, Ob b) => (Ob (a || b) => r) -> r Source Github #

lft :: forall (a :: FAM k) (b :: FAM k). (Ob a, Ob b) => a ~> (a || b) Source Github #

rgt :: forall (a :: FAM k) (b :: FAM k). (Ob a, Ob b) => b ~> (a || b) Source Github #

(|||) :: forall (x :: FAM k) (a :: FAM k) (y :: FAM k). (x ~> a) -> (y ~> a) -> (x || y) ~> a Source Github #

(+++) :: forall (a :: FAM k) (b :: FAM k) (x :: FAM k) (y :: FAM k). (a ~> x) -> (b ~> y) -> (a || b) ~> (x || y) Source Github #

HasBinaryProducts k => HasBinaryProducts (FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

withObProd :: forall (a :: FAM k) (b :: FAM k) r. (Ob a, Ob b) => (Ob (a && b) => r) -> r Source Github #

fst :: forall (a :: FAM k) (b :: FAM k). (Ob a, Ob b) => (a && b) ~> a Source Github #

snd :: forall (a :: FAM k) (b :: FAM k). (Ob a, Ob b) => (a && b) ~> b Source Github #

(&&&) :: forall (a :: FAM k) (x :: FAM k) (y :: FAM k). (a ~> x) -> (a ~> y) -> a ~> (x && y) Source Github #

(***) :: forall (a :: FAM k) (b :: FAM k) (x :: FAM k) (y :: FAM k). (a ~> x) -> (b ~> y) -> (a && b) ~> (x && y) Source Github #

CategoryOf k => HasInitialObject (FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Associated Types

type InitialObject 
Instance details

Defined in Proarrow.Category.Instance.Fam

type InitialObject = DEP VOID (Rep (Initiate :: VOID +-> k))

Methods

initiate :: forall (a :: FAM k). Ob a => (InitialObject :: FAM k) ~> a Source Github #

HasTerminalObject k => HasTerminalObject (FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Associated Types

type TerminalObject 
Instance details

Defined in Proarrow.Category.Instance.Fam

type TerminalObject = DEP () (TerminalProfunctor :: k -> () -> Type)

Methods

terminate :: forall (a :: FAM k). Ob a => a ~> (TerminalObject :: FAM k) Source Github #

CategoryOf k => Promonad (Fam :: FAM k -> FAM k -> Type) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

id :: forall (a :: FAM k). Ob a => Fam a a Source Github #

(.) :: forall (b :: FAM k) (c :: FAM k) (a :: FAM k). Fam b c -> Fam a b -> Fam a c Source Github #

CategoryOf k => Profunctor (Fam :: FAM k -> FAM k -> Type) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

dimap :: forall (c :: FAM k) (a :: FAM k) (b :: FAM k) (d :: FAM k). (c ~> a) -> (b ~> d) -> Fam a b -> Fam c d Source Github #

lmap :: forall (c :: FAM k) (a :: FAM k) (b :: FAM k). (c ~> a) -> Fam a b -> Fam c b Source Github #

rmap :: forall (b :: FAM k) (d :: FAM k) (a :: FAM k). (b ~> d) -> Fam a b -> Fam a d Source Github #

(\\) :: forall (a :: FAM k) (b :: FAM k) r. ((Ob a, Ob b) => r) -> Fam a b -> r Source Github #

CategoryOf k => FunctorForRep (IsPresheafSub :: FAM k +-> Presheaf k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

fmap :: forall (a :: FAM k) (b :: FAM k). (a ~> b) -> ((IsPresheafSub :: FAM k +-> Presheaf k) @ a) ~> ((IsPresheafSub :: FAM k +-> Presheaf k) @ b) Source Github #

type (Embed :: k +-> FAM k) @ (a :: k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (Embed :: k +-> FAM k) @ (a :: k) = DEP () (Rep (Constant a))
type (~>) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (~>) = Fam :: FAM k -> FAM k -> Type
type InitialObject Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type InitialObject = DEP VOID (Rep (Initiate :: VOID +-> k))
type TerminalObject Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type TerminalObject = DEP () (TerminalProfunctor :: k -> () -> Type)
type Ob (a :: FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type Ob (a :: FAM k) = (a ~ DEP (X a) (DX a), Representable (DX a))
type (a :: FAM k) || (b :: FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (a :: FAM k) || (b :: FAM k) = DEP (COPRODUCT (X a) (X b)) (DX a :|||: DX b)
type (a :: FAM k) && (b :: FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (a :: FAM k) && (b :: FAM k) = DEP (X a, X b) (DX a :&&: DX b)
type (IsPresheafSub :: FAM k +-> Presheaf k) @ (DEP x dx :: FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (IsPresheafSub :: FAM k +-> Presheaf k) @ (DEP x dx :: FAM k) = AsPresheaf dx
type UN ('DEP_ :: (x +-> k) -> FAM k) ('DEP_ dx :: FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type UN ('DEP_ :: (x +-> k) -> FAM k) ('DEP_ dx :: FAM k) = dx

type family X (a :: FAM k) where ... Source Github #

Equations

X ('DEP_ dx :: FAM k) = x 

type DX (a :: FAM k) = UN ('DEP_ :: (X a +-> k) -> FAM k) a Source Github #

type DEP x (dx :: x +-> k) = 'DEP_ dx Source Github #

data Fam (a :: FAM k) (b :: FAM k) where Source Github #

Constructors

Fam :: forall {k} {x} {y} {dx :: x +-> k} {dy :: y +-> k} (f :: x +-> y). (Representable dx, Representable dy, Representable f) => (dx :~> (dy :.: f)) -> Fam ('DEP_ dx) ('DEP_ dy) 

Instances

Instances details
CategoryOf k => Promonad (Fam :: FAM k -> FAM k -> Type) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

id :: forall (a :: FAM k). Ob a => Fam a a Source Github #

(.) :: forall (b :: FAM k) (c :: FAM k) (a :: FAM k). Fam b c -> Fam a b -> Fam a c Source Github #

CategoryOf k => Profunctor (Fam :: FAM k -> FAM k -> Type) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

dimap :: forall (c :: FAM k) (a :: FAM k) (b :: FAM k) (d :: FAM k). (c ~> a) -> (b ~> d) -> Fam a b -> Fam c d Source Github #

lmap :: forall (c :: FAM k) (a :: FAM k) (b :: FAM k). (c ~> a) -> Fam a b -> Fam c b Source Github #

rmap :: forall (b :: FAM k) (d :: FAM k) (a :: FAM k). (b ~> d) -> Fam a b -> Fam a d Source Github #

(\\) :: forall (a :: FAM k) (b :: FAM k) r. ((Ob a, Ob b) => r) -> Fam a b -> r Source Github #

data family Embed :: k +-> FAM k Source Github #

Instances

Instances details
CategoryOf k => FunctorForRep (Embed :: k +-> FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

fmap :: forall (a :: k) (b :: k). (a ~> b) -> ((Embed :: k +-> FAM k) @ a) ~> ((Embed :: k +-> FAM k) @ b) Source Github #

type (Embed :: k +-> FAM k) @ (a :: k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (Embed :: k +-> FAM k) @ (a :: k) = DEP () (Rep (Constant a))

data AsPresheaf (dx :: x +-> k) (a :: k) (u :: ()) where Source Github #

Constructors

AsPresheaf :: forall {x} {k} (dx :: x +-> k) (a :: k) (b :: x). dx a b -> AsPresheaf dx a '() 

Instances

Instances details
(CategoryOf k, Profunctor dx) => Profunctor (AsPresheaf dx :: k -> () -> Type) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

dimap :: forall (c :: k) (a :: k) (b :: ()) (d :: ()). (c ~> a) -> (b ~> d) -> AsPresheaf dx a b -> AsPresheaf dx c d Source Github #

lmap :: forall (c :: k) (a :: k) (b :: ()). (c ~> a) -> AsPresheaf dx a b -> AsPresheaf dx c b Source Github #

rmap :: forall (b :: ()) (d :: ()) (a :: k). (b ~> d) -> AsPresheaf dx a b -> AsPresheaf dx a d Source Github #

(\\) :: forall (a :: k) (b :: ()) r. ((Ob a, Ob b) => r) -> AsPresheaf dx a b -> r Source Github #

data family IsPresheafSub :: FAM k +-> Presheaf k Source Github #

Instances

Instances details
CategoryOf k => FunctorForRep (IsPresheafSub :: FAM k +-> Presheaf k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

fmap :: forall (a :: FAM k) (b :: FAM k). (a ~> b) -> ((IsPresheafSub :: FAM k +-> Presheaf k) @ a) ~> ((IsPresheafSub :: FAM k +-> Presheaf k) @ b) Source Github #

type (IsPresheafSub :: FAM k +-> Presheaf k) @ (DEP x dx :: FAM k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (IsPresheafSub :: FAM k +-> Presheaf k) @ (DEP x dx :: FAM k) = AsPresheaf dx

data family Initiate :: VOID +-> k Source Github #

Instances

Instances details
CategoryOf k => FunctorForRep (Initiate :: VOID +-> k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

fmap :: forall (a :: VOID) (b :: VOID). (a ~> b) -> ((Initiate :: VOID +-> k) @ a) ~> ((Initiate :: VOID +-> k) @ b) Source Github #

type (Initiate :: VOID +-> k) @ (a :: VOID) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (Initiate :: VOID +-> k) @ (a :: VOID) = Any :: k

data family LftCat :: j +-> COPRODUCT j k Source Github #

Instances

Instances details
(CategoryOf j, CategoryOf k) => FunctorForRep (LftCat :: j +-> COPRODUCT j k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

fmap :: forall (a :: j) (b :: j). (a ~> b) -> ((LftCat :: j +-> COPRODUCT j k) @ a) ~> ((LftCat :: j +-> COPRODUCT j k) @ b) Source Github #

type (LftCat :: j +-> COPRODUCT j k) @ (a :: j) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (LftCat :: j +-> COPRODUCT j k) @ (a :: j) = 'L a :: COPRODUCT j k

data family RgtCat :: k +-> COPRODUCT j k Source Github #

Instances

Instances details
(CategoryOf j, CategoryOf k) => FunctorForRep (RgtCat :: k +-> COPRODUCT j k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

fmap :: forall (a :: k) (b :: k). (a ~> b) -> ((RgtCat :: k +-> COPRODUCT j k) @ a) ~> ((RgtCat :: k +-> COPRODUCT j k) @ b) Source Github #

type (RgtCat :: k +-> COPRODUCT j k) @ (a :: k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (RgtCat :: k +-> COPRODUCT j k) @ (a :: k) = 'R a :: COPRODUCT j k

data ((p :: i +-> k) :|||: (q :: j +-> k)) (a :: k) (b :: COPRODUCT i j) where Source Github #

Constructors

InjLP :: forall {i} {k} {j} (p :: i +-> k) (a :: k) (b1 :: i) (q :: j +-> k). p a b1 -> (p :|||: q) a ('L b1 :: COPRODUCT i j) 
InjRP :: forall {j} {k} {i} (q :: j +-> k) (a :: k) (b1 :: j) (p :: i +-> k). q a b1 -> (p :|||: q) a ('R b1 :: COPRODUCT i j) 

Instances

Instances details
(Profunctor p, Profunctor q) => Profunctor (p :|||: q :: k -> COPRODUCT i j -> Type) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

dimap :: forall (c :: k) (a :: k) (b :: COPRODUCT i j) (d :: COPRODUCT i j). (c ~> a) -> (b ~> d) -> (p :|||: q) a b -> (p :|||: q) c d Source Github #

lmap :: forall (c :: k) (a :: k) (b :: COPRODUCT i j). (c ~> a) -> (p :|||: q) a b -> (p :|||: q) c b Source Github #

rmap :: forall (b :: COPRODUCT i j) (d :: COPRODUCT i j) (a :: k). (b ~> d) -> (p :|||: q) a b -> (p :|||: q) a d Source Github #

(\\) :: forall (a :: k) (b :: COPRODUCT i j) r. ((Ob a, Ob b) => r) -> (p :|||: q) a b -> r Source Github #

(Representable p, Representable q) => Representable (p :|||: q :: k -> COPRODUCT i j -> Type) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

index :: forall (a :: k) (b :: COPRODUCT i j). (p :|||: q) a b -> a ~> ((p :|||: q) % b) Source Github #

tabulate :: forall (b :: COPRODUCT i j) (a :: k). Ob b => (a ~> ((p :|||: q) % b)) -> (p :|||: q) a b Source Github #

repMap :: forall (a :: COPRODUCT i j) (b :: COPRODUCT i j). (a ~> b) -> ((p :|||: q) % a) ~> ((p :|||: q) % b) Source Github #

trivialRep :: forall (a :: COPRODUCT i j). Ob a => (p :|||: q) ((p :|||: q) % a) a Source Github #

type (p :|||: q :: k -> COPRODUCT i j -> Type) % ('L a :: COPRODUCT i j) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (p :|||: q :: k -> COPRODUCT i j -> Type) % ('L a :: COPRODUCT i j) = p % a
type (p :|||: q :: k -> COPRODUCT i j -> Type) % ('R a :: COPRODUCT i j) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (p :|||: q :: k -> COPRODUCT i j -> Type) % ('R a :: COPRODUCT i j) = q % a

data ((p :: x +-> k) :&&: (q :: y +-> k)) (a :: k) (b :: (x, y)) where Source Github #

Constructors

(:&&:) :: forall {x} {k} {y} (p :: x +-> k) (a :: k) (b1 :: x) (q :: y +-> k) (c :: y). p a b1 -> q a c -> (p :&&: q) a '(b1, c) 

Instances

Instances details
(Profunctor l, Profunctor r, CategoryOf k) => Profunctor (l :&&: r :: k -> (x, y) -> Type) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

dimap :: forall (c :: k) (a :: k) (b :: (x, y)) (d :: (x, y)). (c ~> a) -> (b ~> d) -> (l :&&: r) a b -> (l :&&: r) c d Source Github #

lmap :: forall (c :: k) (a :: k) (b :: (x, y)). (c ~> a) -> (l :&&: r) a b -> (l :&&: r) c b Source Github #

rmap :: forall (b :: (x, y)) (d :: (x, y)) (a :: k). (b ~> d) -> (l :&&: r) a b -> (l :&&: r) a d Source Github #

(\\) :: forall (a :: k) (b :: (x, y)) r0. ((Ob a, Ob b) => r0) -> (l :&&: r) a b -> r0 Source Github #

(Corepresentable l, Corepresentable r, CategoryOf k) => Corepresentable (l :&&: r :: k -> (x, y) -> Type) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

coindex :: forall (a :: k) (b :: (x, y)). (l :&&: r) a b -> ((l :&&: r) %% a) ~> b Source Github #

cotabulate :: forall (a :: k) (b :: (x, y)). Ob a => (((l :&&: r) %% a) ~> b) -> (l :&&: r) a b Source Github #

corepMap :: forall (a :: k) (b :: k). (a ~> b) -> ((l :&&: r) %% a) ~> ((l :&&: r) %% b) Source Github #

trivialCorep :: forall (a :: k). Ob a => (l :&&: r) a ((l :&&: r) %% a) Source Github #

(Representable l, Representable r, HasBinaryProducts k) => Representable (l :&&: r :: k -> (x, y) -> Type) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

Methods

index :: forall (a :: k) (b :: (x, y)). (l :&&: r) a b -> a ~> ((l :&&: r) % b) Source Github #

tabulate :: forall (b :: (x, y)) (a :: k). Ob b => (a ~> ((l :&&: r) % b)) -> (l :&&: r) a b Source Github #

repMap :: forall (a :: (x, y)) (b :: (x, y)). (a ~> b) -> ((l :&&: r) % a) ~> ((l :&&: r) % b) Source Github #

trivialRep :: forall (a :: (x, y)). Ob a => (l :&&: r) ((l :&&: r) % a) a Source Github #

type (l :&&: r :: k -> (x, y) -> Type) %% (a :: k) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (l :&&: r :: k -> (x, y) -> Type) %% (a :: k) = '(l %% a, r %% a)
type (l :&&: r :: k -> (x, y) -> Type) % (ab :: (x, y)) Source Github # 
Instance details

Defined in Proarrow.Category.Instance.Fam

type (l :&&: r :: k -> (x, y) -> Type) % (ab :: (x, y)) = (l % Fst ab) && (r % Snd ab)

type Poly = FAM (OPPOSITE Type) Source Github #