Safe Haskell	None
Language	Haskell2010

Proarrow.Profunctor.Free

Documentation

class (CategoryOf k, Representable (Free ob), forall (b :: k). Ob b => ob (Free ob % b)) => HasFree (ob :: k -> Constraint) where Source Comments #

Associated Types

type Free (ob :: k -> Constraint) :: k +-> k Source Comments #

Methods

lift' :: forall (a :: k) (b :: k). (a ~> b) -> Free ob a b Source Comments #

retract' :: forall (b :: k) (a :: k). ob b => Free ob a b -> a ~> b Source Comments #

Instances

Instances details

HasFree Monoid Source Comments #

Instance details

Defined in Proarrow.Profunctor.Free

Associated Types

type Free Monoid
Instance details Defined in Proarrow.Profunctor.Free type Free Monoid = Star []

Methods

lift' :: (a ~> b) -> Free Monoid a b Source Comments #

retract' :: Monoid b => Free Monoid a b -> a ~> b Source Comments #

HasFree Semigroup Source Comments #

Instance details

Defined in Proarrow.Profunctor.Free

Associated Types

type Free Semigroup
Instance details Defined in Proarrow.Profunctor.Free type Free Semigroup = Star NonEmpty

Methods

lift' :: (a ~> b) -> Free Semigroup a b Source Comments #

retract' :: Semigroup b => Free Semigroup a b -> a ~> b Source Comments #

HasFree (Promonad :: (k +-> k) -> Constraint) Source Comments #

Instance details

Defined in Proarrow.Profunctor.Free

Associated Types

type Free (Promonad :: (k +-> k) -> Constraint)
Instance details Defined in Proarrow.Profunctor.Free type Free (Promonad :: (k +-> k) -> Constraint) = Star (FreePromonad :: (k -> k -> Type) -> k -> k -> Type)

Methods

lift' :: forall (a :: k +-> k) (b :: k +-> k). (a ~> b) -> Free (Promonad :: (k +-> k) -> Constraint) a b Source Comments #

retract' :: forall (b :: k +-> k) (a :: k +-> k). Promonad b => Free (Promonad :: (k +-> k) -> Constraint) a b -> a ~> b Source Comments #

HasFree (Profunctor :: (j +-> k) -> Constraint) Source Comments #

Instance details

Defined in Proarrow.Profunctor.Coyoneda

Associated Types

type Free (Profunctor :: (j +-> k) -> Constraint)
Instance details Defined in Proarrow.Profunctor.Coyoneda type Free (Profunctor :: (j +-> k) -> Constraint) = Star (Coyoneda :: (j +-> k) -> k -> j -> Type)

Methods

lift' :: forall (a :: j +-> k) (b :: j +-> k). (a ~> b) -> Free (Profunctor :: (j +-> k) -> Constraint) a b Source Comments #

retract' :: forall (b :: j +-> k) (a :: j +-> k). Profunctor b => Free (Profunctor :: (j +-> k) -> Constraint) a b -> a ~> b Source Comments #

Monoidal k => HasFree (Applicative :: (k -> Type) -> Constraint) Source Comments #

Instance details

Defined in Proarrow.Profunctor.Free

Associated Types

type Free (Applicative :: (k -> Type) -> Constraint)
Instance details Defined in Proarrow.Profunctor.Free type Free (Applicative :: (k -> Type) -> Constraint) = Star (Ap :: (k -> Type) -> k -> Type)

Methods

lift' :: forall (a :: k -> Type) (b :: k -> Type). (a ~> b) -> Free (Applicative :: (k -> Type) -> Constraint) a b Source Comments #

retract' :: forall (b :: k -> Type) (a :: k -> Type). Applicative b => Free (Applicative :: (k -> Type) -> Constraint) a b -> a ~> b Source Comments #

HasFree (On Monoid Semigroup) Source Comments #

Instance details

Defined in Proarrow.Profunctor.Free

Associated Types

type Free (On Monoid Semigroup)
Instance details Defined in Proarrow.Profunctor.Free type Free (On Monoid Semigroup) = Sub (Star Maybe) :: SUBCAT Semigroup -> SUBCAT Semigroup -> Type

Methods

lift' :: forall (a :: SUBCAT Semigroup) (b :: SUBCAT Semigroup). (a ~> b) -> Free (On Monoid Semigroup) a b Source Comments #

retract' :: forall (b :: SUBCAT Semigroup) (a :: SUBCAT Semigroup). On Monoid Semigroup b => Free (On Monoid Semigroup) a b -> a ~> b Source Comments #

lift :: forall {j} (ob :: j -> Constraint) (a :: j). (HasFree ob, Ob a) => a ~> (Free ob % a) Source Comments #

retract :: forall {k} (ob :: k -> Constraint) (a :: k). (HasFree ob, ob a, Ob a) => (Free ob % a) ~> a Source Comments #

data FreeSub (ob :: OB k) (a :: SUBCAT ob) (b :: k) where Source Comments #

Constructors

FreeSub :: forall {k} (ob :: OB k) (a1 :: k) (b :: k). ob a1 => Free ob a1 b -> FreeSub ob ('SUB a1 :: SUBCAT ob) b

Instances

Instances details

HasFree ob => Profunctor (FreeSub ob :: SUBCAT ob -> j -> Type) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free Methods dimap :: forall (c :: SUBCAT ob) (a :: SUBCAT ob) (b :: j) (d :: j). (c ~> a) -> (b ~> d) -> FreeSub ob a b -> FreeSub ob c d Source Comments # (\\) :: forall (a :: SUBCAT ob) (b :: j) r. ((Ob a, Ob b) => r) -> FreeSub ob a b -> r Source Comments #
HasFree ob => Representable (FreeSub ob :: SUBCAT ob -> j -> Type) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free Methods index :: forall (a :: SUBCAT ob) (b :: j). FreeSub ob a b -> a ~> (FreeSub ob % b) Source Comments # tabulate :: forall (b :: j) (a :: SUBCAT ob). Ob b => (a ~> (FreeSub ob % b)) -> FreeSub ob a b Source Comments # repMap :: forall (a :: j) (b :: j). (a ~> b) -> (FreeSub ob % a) ~> (FreeSub ob % b) Source Comments #
HasFree ob => Adjunction (FreeSub ob :: SUBCAT ob -> k -> Type) (Forget ob :: k -> SUBCAT ob -> Type) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free Methods unit :: forall (a :: k). Ob a => (Forget ob :.: FreeSub ob) a a Source Comments # counit :: (FreeSub ob :.: Forget ob) :~> ((~>) :: CAT (SUBCAT ob)) Source Comments #
type (FreeSub ob :: SUBCAT ob -> j -> Type) % (a :: j) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free type (FreeSub ob :: SUBCAT ob -> j -> Type) % (a :: j) = 'SUB (Free ob % a) :: SUBCAT ob

data Ap (f :: k -> Type) (a :: k) where Source Comments #

Constructors

Pure :: forall {k} (a :: k) (f :: k -> Type). ((Unit :: k) ~> a) -> Ap f a
Eff :: forall {k} (f :: k -> Type) (a :: k). f a -> Ap f a
LiftA2 :: forall {k} (a1 :: k) (b :: k) (a :: k) (f :: k -> Type). (Ob a1, Ob b) => ((a1 ** b) ~> a) -> Ap f a1 -> Ap f b -> Ap f a

Instances

Instances details

(Monoidal k, Functor f) => Applicative (Ap f :: k -> Type) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free Methods pure :: forall (a :: k). ((Unit :: k) ~> a) -> (Unit :: Type) ~> Ap f a Source Comments # liftA2 :: forall (a :: k) (b :: k) (c :: k). (Ob a, Ob b) => ((a b) ~> c) -> (Ap f a Ap f b) ~> Ap f c Source Comments #
(CategoryOf k, Functor f) => Functor (Ap f :: k -> Type) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free Methods map :: forall (a :: k) (b :: k). (a ~> b) -> Ap f a ~> Ap f b Source Comments #
(Monoidal k, Monoid m) => Monoid (Ap f m :: Type) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free Methods mempty :: (Unit :: Type) ~> Ap f m Source Comments # mappend :: (Ap f m ** Ap f m) ~> Ap f m Source Comments #
Functor (Ap :: (k -> Type) -> k -> Type) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free Methods map :: forall (a :: k -> Type) (b :: k -> Type). (a ~> b) -> Ap a ~> Ap b Source Comments #

retractAp :: forall {k} f (a :: k). Applicative f => Ap f a -> f a Source Comments #

data FreePromonad (p :: k -> k -> Type) (a :: k) (b :: k) where Source Comments #

Constructors

Unit :: forall {k} (a :: k) (b :: k) (p :: k -> k -> Type). (a ~> b) -> FreePromonad p a b
Comp :: forall {k} (p :: k -> k -> Type) (b1 :: k) (b :: k) (a :: k). p b1 b -> FreePromonad p a b1 -> FreePromonad p a b

Instances

Instances details

Profunctor p => Profunctor (FreePromonad p :: j -> j -> Type) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free Methods dimap :: forall (c :: j) (a :: j) (b :: j) (d :: j). (c ~> a) -> (b ~> d) -> FreePromonad p a b -> FreePromonad p c d Source Comments # (\\) :: forall (a :: j) (b :: j) r. ((Ob a, Ob b) => r) -> FreePromonad p a b -> r Source Comments #
Profunctor p => Promonad (FreePromonad p :: k -> k -> Type) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free Methods id :: forall (a :: k). Ob a => FreePromonad p a a Source Comments # (.) :: forall (b :: k) (c :: k) (a :: k). FreePromonad p b c -> FreePromonad p a b -> FreePromonad p a c Source Comments #
Functor (FreePromonad :: (k -> k -> Type) -> k -> k -> Type) Source Comments #
Instance details Defined in Proarrow.Profunctor.Free Methods map :: forall (a :: k -> k -> Type) (b :: k -> k -> Type). (a ~> b) -> FreePromonad a ~> FreePromonad b Source Comments #

class (forall k. CategoryOf k => c (f k)) => HasFreeK (c :: Kind -> Constraint) (f :: Kind -> Kind) | c -> f where Source Comments #

Associated Types

type Lift (c :: Kind -> Constraint) (f :: Kind -> Kind) (a :: k) :: f k Source Comments #

type Retract (c :: Kind -> Constraint) (f :: Kind -> Kind) (a :: f k) :: k Source Comments #

Methods

liftK :: forall k (a :: k) (b :: k). CategoryOf k => (a ~> b) -> Lift c f a ~> Lift c f b Source Comments #

retractK :: forall k (a :: f k) (b :: f k). c k => (a ~> b) -> Retract c f a ~> Retract c f b Source Comments #

Instances

Instances details

HasFreeK Monoidal LIST Source Comments #

Instance details

Defined in Proarrow.Profunctor.Free

Associated Types

type Lift Monoidal LIST (a :: k)
Instance details Defined in Proarrow.Profunctor.Free type Lift Monoidal LIST (a :: k) = 'L '[a]
type Retract Monoidal LIST (a :: LIST k)
Instance details Defined in Proarrow.Profunctor.Free type Retract Monoidal LIST (a :: LIST k) = Fold (UN ('L :: [k] -> LIST k) a)

Methods

liftK :: forall k (a :: k) (b :: k). CategoryOf k => (a ~> b) -> Lift Monoidal LIST a ~> Lift Monoidal LIST b Source Comments #

retractK :: forall k (a :: LIST k) (b :: LIST k). Monoidal k => (a ~> b) -> Retract Monoidal LIST a ~> Retract Monoidal LIST b Source Comments #