Safe Haskell	None
Language	GHC2021

Data.InternalCategory.PolyComonad

Documentation

data Pos (f :: Type -> Type) where Source #

Constructors

Position :: forall (f :: Type -> Type) a. Tag f a -> Pos f

Instances details

GEq (Tag f) => Eq (Pos f) Source #
Instance details Defined in Data.InternalCategory.PolyComonad Methods (==) :: Pos f -> Pos f -> Bool # (/=) :: Pos f -> Pos f -> Bool #
(Comonad f, Polynomial f, GEq (Tag f)) => ICategory (Pos f) (Dir f) Source #
Instance details Defined in Data.InternalCategory.PolyComonad Methods foldPath :: Path (Pos f) (Dir f) -> Dir f Source #
(Comonad f, Polynomial f, GEq (Tag f)) => IQuiver (Pos f) (Dir f) Source #
Instance details Defined in Data.InternalCategory.PolyComonad Methods src :: Dir f -> Pos f Source # tgt :: Dir f -> Pos f Source #

data Dir (f :: Type -> Type) where Source #

Constructors

Direction :: forall (f :: Type -> Type) a. Tag f a -> a -> Dir f

Instances details

(Comonad f, Polynomial f, GEq (Tag f)) => ICategory (Pos f) (Dir f) Source #
Instance details Defined in Data.InternalCategory.PolyComonad Methods foldPath :: Path (Pos f) (Dir f) -> Dir f Source #
(Comonad f, Polynomial f, GEq (Tag f)) => IQuiver (Pos f) (Dir f) Source #
Instance details Defined in Data.InternalCategory.PolyComonad Methods src :: Dir f -> Pos f Source # tgt :: Dir f -> Pos f Source #

identityDir :: forall (f :: Type -> Type). (Comonad f, Polynomial f) => Pos f -> Dir f Source #

composeDir :: forall (f :: Type -> Type). (Comonad f, Polynomial f, GEq (Tag f)) => Dir f -> Dir f -> Maybe (Dir f) Source #