Data.HKD

"Higher-Kinded Data" such as it is

Natural transformation

type (~>) f g = forall a. f a -> g a

Functor

class FFunctor (t :: (k -> Type) -> Type) where

Methods

ffmap :: (f ~> g) -> t f -> t g

Instances

FFunctor (Some :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Some f -> Some g

FFunctor (Some :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Some f -> Some g

FFunctor (Some :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Some f -> Some g

FFunctor (V1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> V1 f -> V1 g

FFunctor (U1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> U1 f -> U1 g

FFunctor (Proxy :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Proxy f -> Proxy g

FFunctor (Limit :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Limit f -> Limit g

FFunctor (Const a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Const a f -> Const a g

FFunctor (Element a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Element a f -> Element a g

FFunctor (NT f :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f0 ~> g) -> NT f f0 -> NT f g

(FFunctor f, FFunctor g) => FFunctor (f :+: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f0 ~> g0) -> (f :+: g) f0 -> (f :+: g) g0

(FFunctor f, FFunctor g) => FFunctor (f :*: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f0 ~> g0) -> (f :*: g) f0 -> (f :*: g) g0

FFunctor (K1 i a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> K1 i a f -> K1 i a g

(FFunctor f, FFunctor g) => FFunctor (Sum f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f0 ~> g0) -> Sum f g f0 -> Sum f g g0

(FFunctor f, FFunctor g) => FFunctor (Product f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f0 ~> g0) -> Product f g f0 -> Product f g g0

(Functor f, FFunctor g) => FFunctor (f :.: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f0 ~> g0) -> (f :.: g) f0 -> (f :.: g) g0

(Functor f, FFunctor g) => FFunctor (Compose f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f0 ~> g0) -> Compose f g f0 -> Compose f g g0

FFunctor (Tab a :: (Type -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Tab a f -> Tab a g

Contravariant

class FContravariant (t :: (k -> Type) -> Type) where

Methods

fcontramap :: (f ~> g) -> t g -> t f

Instances

FContravariant (V1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f ~> g) -> V1 g -> V1 f

FContravariant (U1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f ~> g) -> U1 g -> U1 f

FContravariant (Proxy :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f ~> g) -> Proxy g -> Proxy f

FContravariant (Const a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f ~> g) -> Const a g -> Const a f

(FContravariant f, FContravariant g) => FContravariant (f :+: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f0 ~> g0) -> (f :+: g) g0 -> (f :+: g) f0

(FContravariant f, FContravariant g) => FContravariant (f :*: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f0 ~> g0) -> (f :*: g) g0 -> (f :*: g) f0

FContravariant (K1 i a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f ~> g) -> K1 i a g -> K1 i a f

(FContravariant f, FContravariant g) => FContravariant (Sum f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f0 ~> g0) -> Sum f g g0 -> Sum f g f0

(FContravariant f, FContravariant g) => FContravariant (Product f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f0 ~> g0) -> Product f g g0 -> Product f g f0

(Functor f, FContravariant g) => FContravariant (f :.: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f0 ~> g0) -> (f :.: g) g0 -> (f :.: g) f0

(Functor f, FContravariant g) => FContravariant (Compose f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fcontramap :: (f0 ~> g0) -> Compose f g g0 -> Compose f g f0

FContravariant Logarithm

Defined in Data.HKD

Methods

fcontramap :: (f ~> g) -> Logarithm g -> Logarithm f

Foldable

class FFoldable (t :: (k -> Type) -> Type) where

Minimal complete definition

ffoldMap

Methods

ffoldMap :: Monoid m => (forall a. f a -> m) -> t f -> m

flengthAcc :: Int -> t f -> Int

Instances

FFoldable (Some :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f a -> m) -> Some f -> m

flengthAcc :: Int -> Some f -> Int

FFoldable (Some :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f a -> m) -> Some f -> m

flengthAcc :: Int -> Some f -> Int

FFoldable (Some :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f a -> m) -> Some f -> m

flengthAcc :: Int -> Some f -> Int

FFoldable (U1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f a -> m) -> U1 f -> m

flengthAcc :: Int -> U1 f -> Int

FFoldable (V1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f a -> m) -> V1 f -> m

flengthAcc :: Int -> V1 f -> Int

FFoldable (Proxy :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f a -> m) -> Proxy f -> m

flengthAcc :: Int -> Proxy f -> Int

FFoldable (Limit :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f a -> m) -> Limit f -> m

flengthAcc :: Int -> Limit f -> Int

FFoldable (Const a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a0 :: k0). f a0 -> m) -> Const a f -> m

flengthAcc :: Int -> Const a f -> Int

FFoldable (Element a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a0 :: k0). f a0 -> m) -> Element a f -> m

flengthAcc :: Int -> Element a f -> Int

(FFoldable f, FFoldable g) => FFoldable (f :+: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f0 a -> m) -> (f :+: g) f0 -> m

flengthAcc :: Int -> (f :+: g) f0 -> Int

(FFoldable f, FFoldable g) => FFoldable (f :*: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f0 a -> m) -> (f :*: g) f0 -> m

flengthAcc :: Int -> (f :*: g) f0 -> Int

FFoldable (K1 i a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a0 :: k0). f a0 -> m) -> K1 i a f -> m

flengthAcc :: Int -> K1 i a f -> Int

(FFoldable f, FFoldable g) => FFoldable (Sum f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f0 a -> m) -> Sum f g f0 -> m

flengthAcc :: Int -> Sum f g f0 -> Int

(FFoldable f, FFoldable g) => FFoldable (Product f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f0 a -> m) -> Product f g f0 -> m

flengthAcc :: Int -> Product f g f0 -> Int

(Foldable f, FFoldable g) => FFoldable (f :.: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f0 a -> m) -> (f :.: g) f0 -> m

flengthAcc :: Int -> (f :.: g) f0 -> Int

(Foldable f, FFoldable g) => FFoldable (Compose f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f0 a -> m) -> Compose f g f0 -> m

flengthAcc :: Int -> Compose f g f0 -> Int

flength :: FFoldable t => t f -> Int

ftraverse_ :: (FFoldable t, Applicative m) => (forall a. f a -> m b) -> t f -> m ()

ffor_ :: (FFoldable t, Applicative m) => t f -> (forall a. f a -> m b) -> m ()

Traversable

class (FFoldable t, FFunctor t) => FTraversable (t :: (k -> Type) -> Type) where

Methods

ftraverse :: Applicative m => (forall a. f a -> m (g a)) -> t f -> m (t g)

Instances

FTraversable (Some :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f a -> m (g a)) -> Some f -> m (Some g)

FTraversable (Some :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f a -> m (g a)) -> Some f -> m (Some g)

FTraversable (Some :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f a -> m (g a)) -> Some f -> m (Some g)

FTraversable (V1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f a -> m (g a)) -> V1 f -> m (V1 g)

FTraversable (U1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f a -> m (g a)) -> U1 f -> m (U1 g)

FTraversable (Proxy :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f a -> m (g a)) -> Proxy f -> m (Proxy g)

FTraversable (Const a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a0 :: k0). f a0 -> m (g a0)) -> Const a f -> m (Const a g)

FTraversable (Element a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a0 :: k0). f a0 -> m (g a0)) -> Element a f -> m (Element a g)

(FTraversable f, FTraversable g) => FTraversable (f :+: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f0 a -> m (g0 a)) -> (f :+: g) f0 -> m ((f :+: g) g0)

(FTraversable f, FTraversable g) => FTraversable (f :*: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f0 a -> m (g0 a)) -> (f :*: g) f0 -> m ((f :*: g) g0)

FTraversable (K1 i a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a0 :: k0). f a0 -> m (g a0)) -> K1 i a f -> m (K1 i a g)

(FTraversable f, FTraversable g) => FTraversable (Sum f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f0 a -> m (g0 a)) -> Sum f g f0 -> m (Sum f g g0)

(FTraversable f, FTraversable g) => FTraversable (Product f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f0 a -> m (g0 a)) -> Product f g f0 -> m (Product f g g0)

(Traversable f, FTraversable g) => FTraversable (f :.: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f0 a -> m (g0 a)) -> (f :.: g) f0 -> m ((f :.: g) g0)

(Traversable f, FTraversable g) => FTraversable (Compose f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a :: k0). f0 a -> m (g0 a)) -> Compose f g f0 -> m (Compose f g g0)

ffmapDefault :: FTraversable t => (f ~> g) -> t f -> t g

ffoldMapDefault :: (FTraversable t, Monoid m) => (forall a. f a -> m) -> t f -> m

ffor :: (FTraversable t, Applicative m) => t f -> (forall a. f a -> m (g a)) -> m (t g)

fsequence :: (FTraversable t, Applicative f) => t f -> f (t Identity)

Generic derivation

gftraverse :: forall t (f :: Type -> Type) (g :: Type -> Type) m. (Applicative m, Generic (t f), Generic (t g), GFTraversable (Curried (Yoneda m)) f g (Rep (t f)) (Rep (t g))) => (forall a. f a -> m (g a)) -> t f -> m (t g)

Generically derive ftraverse.

Simple usage:

data Record f = Record
    { fieldInt    :: f Int
    , fieldString :: f String
    , fieldSome   :: Some f
    }
  deriving (Generic)

instance FFunctor     Record where ffmap     = ffmapDefault
instance FFoldable    Record where ffoldMap  = ffoldMapDefault
instance FTraversable Record where ftraverse = gftraverse

Zip & Repeat

class FFunctor t => FZip t where

Methods

fzipWith :: (forall x. f x -> g x -> h x) -> t f -> t g -> t h

Instances

FZip (V1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f x -> g x -> h x) -> V1 f -> V1 g -> V1 h

FZip (U1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f x -> g x -> h x) -> U1 f -> U1 g -> U1 h

FZip (Proxy :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f x -> g x -> h x) -> Proxy f -> Proxy g -> Proxy h

FZip (Limit :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f x -> g x -> h x) -> Limit f -> Limit g -> Limit h

Semigroup a => FZip (Const a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f x -> g x -> h x) -> Const a f -> Const a g -> Const a h

FZip (Element a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f x -> g x -> h x) -> Element a f -> Element a g -> Element a h

FZip (NT f :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f0 x -> g x -> h x) -> NT f f0 -> NT f g -> NT f h

(FZip f, FZip g) => FZip (f :*: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f0 x -> g0 x -> h x) -> (f :*: g) f0 -> (f :*: g) g0 -> (f :*: g) h

Semigroup a => FZip (K1 i a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f x -> g x -> h x) -> K1 i a f -> K1 i a g -> K1 i a h

(FZip f, FZip g) => FZip (Product f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f0 x -> g0 x -> h x) -> Product f g f0 -> Product f g g0 -> Product f g h

(Applicative f, FZip g) => FZip (f :.: g :: (k -> Type) -> Type)

We only need an Apply part of an Applicative.

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f0 x -> g0 x -> h x) -> (f :.: g) f0 -> (f :.: g) g0 -> (f :.: g) h

(Applicative f, FZip g) => FZip (Compose f g :: (k -> Type) -> Type)

We only need an Apply part of an Applicative.

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f0 x -> g0 x -> h x) -> Compose f g f0 -> Compose f g g0 -> Compose f g h

class FZip t => FRepeat t where

Methods

frepeat :: (forall x. f x) -> t f

Instances

FRepeat (U1 :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f x) -> U1 f

FRepeat (Proxy :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f x) -> Proxy f

FRepeat (Limit :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f x) -> Limit f

(Monoid a, Semigroup a) => FRepeat (Const a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f x) -> Const a f

FRepeat (Element a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f x) -> Element a f

FRepeat (NT a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f x) -> NT a f

(FRepeat f, FRepeat g) => FRepeat (f :*: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f0 x) -> (f :*: g) f0

(Monoid a, Semigroup a) => FRepeat (K1 i a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f x) -> K1 i a f

(FRepeat f, FRepeat g) => FRepeat (Product f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f0 x) -> Product f g f0

(Applicative f, FRepeat g) => FRepeat (f :.: g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f0 x) -> (f :.: g) f0

(Applicative f, FRepeat g) => FRepeat (Compose f g :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f0 x) -> Compose f g f0

Generic derivation

gfzipWith :: forall t (f :: Type -> Type) (g :: Type -> Type) (h :: Type -> Type). (Generic (t f), Generic (t g), Generic (t h), GFZip f g h (Rep (t f)) (Rep (t g)) (Rep (t h))) => (forall a. f a -> g a -> h a) -> t f -> t g -> t h

Generically derive fzipWith.

Simple usage:

data Record f = Record
    { fieldInt    :: f Int
    , fieldString :: f String
    }
  deriving (Generic)

instance FZip    Record where fzipWith = gfzipWith
instance FRepeat Record where frepeat  = gfrepeat

gfrepeat :: forall t (f :: Type -> Type). (Generic (t f), GFRepeat f (Rep (t f))) => (forall x. f x) -> t f

Higher kinded data

See also Data.Some in some package. hkd provides instances for it.

newtype Logarithm f

A logarithm.

Recall that function arrow, -> is an exponential object. If we take f = (->) r, then

Logarithm ((->) r) ≅ forall a. (r -> a) -> a ≅ r

and this works for all Distributive / Representable functors.

Constructors

Logarithm

Fields

• runLogarithm :: forall a. f a -> a

Instances

FContravariant Logarithm

Defined in Data.HKD

Methods

fcontramap :: (f ~> g) -> Logarithm g -> Logarithm f

newtype Tab a f

Tabulation.

Constructors

Tab

Fields

• runTab :: Logarithm f -> a

Instances

FFunctor (Tab a :: (Type -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Tab a f -> Tab a g

indexLogarithm :: f a -> Logarithm f -> a

newtype Element a f

Element in f

Constructors

Element

Fields

• runElement :: f a

Instances

FRepeat (Element a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f x) -> Element a f

FZip (Element a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f x -> g x -> h x) -> Element a f -> Element a g -> Element a h

FTraversable (Element a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ftraverse :: Applicative m => (forall (a0 :: k0). f a0 -> m (g a0)) -> Element a f -> m (Element a g)

FFoldable (Element a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a0 :: k0). f a0 -> m) -> Element a f -> m

flengthAcc :: Int -> Element a f -> Int

FFunctor (Element a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Element a f -> Element a g

newtype NT f g

Newtyped "natural" transformation

Constructors

NT

Fields

• runNT :: f ~> g

Instances

FRepeat (NT a :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f x) -> NT a f

FZip (NT f :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f0 x -> g x -> h x) -> NT f f0 -> NT f g -> NT f h

FFunctor (NT f :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f0 ~> g) -> NT f f0 -> NT f g

newtype Limit f

Constructors

Limit

Fields

• runLimit :: forall a. f a

Instances

FRepeat (Limit :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

frepeat :: (forall (x :: k0). f x) -> Limit f

FZip (Limit :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

fzipWith :: (forall (x :: k0). f x -> g x -> h x) -> Limit f -> Limit g -> Limit h

FFoldable (Limit :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffoldMap :: Monoid m => (forall (a :: k0). f a -> m) -> Limit f -> m

flengthAcc :: Int -> Limit f -> Int

FFunctor (Limit :: (k -> Type) -> Type)

Defined in Data.HKD

Methods

ffmap :: (f ~> g) -> Limit f -> Limit g