Data.Comp.Multi.HFunctor

This module defines higher-order functors (Johann, Ghani, POPL '08), i.e. endofunctors on the category of endofunctors.

Documentation

class HFunctor h where

This class represents higher-order functors (Johann, Ghani, POPL '08) which are endofunctors on the category of endofunctors.

Minimal complete definition

hfmap

Methods

hfmap :: (f :-> g) -> h f :-> h g

A higher-order functor f also maps a natural transformation g :-> h to a natural transformation f g :-> f h

Instances

HFunctor f => HFunctor (Cxt h f)

Methods

hfmap :: (f :-> g) -> Cxt h f f :-> Cxt h f g

Functor f => HFunctor (Compose * * f)

Methods

hfmap :: (f :-> g) -> Compose * * f f :-> Compose * * f g

HFunctor f => HFunctor ((:&:) * f a)

Methods

hfmap :: (f :-> g) -> (* :&: f) a f :-> (* :&: f) a g

(HFunctor f, HFunctor g) => HFunctor ((:+:) * f g)

Methods

hfmap :: (f :-> g) -> (* :+: f) g f :-> (* :+: f) g g

type (:->) f g = forall i. f i -> g i infixr 0

This type represents natural transformations.

type (:=>) f a = forall i. f i -> a infixr 0

This type represents co-cones from f to a. f :=> a is isomorphic to f :-> K a

type NatM m f g = forall i. f i -> m (g i)

newtype I a

The identity Functor.

Constructors

I

Fields

• unI :: a

Instances

Functor I

Methods

fmap :: (a -> b) -> I a -> I b

(<$) :: a -> I b -> I a

Foldable I

Methods

fold :: Monoid m => I m -> m

foldMap :: Monoid m => (a -> m) -> I a -> m

foldr :: (a -> b -> b) -> b -> I a -> b

foldr' :: (a -> b -> b) -> b -> I a -> b

foldl :: (b -> a -> b) -> b -> I a -> b

foldl' :: (b -> a -> b) -> b -> I a -> b

foldr1 :: (a -> a -> a) -> I a -> a

foldl1 :: (a -> a -> a) -> I a -> a

toList :: I a -> [a]

null :: I a -> Bool

length :: I a -> Int

elem :: Eq a => a -> I a -> Bool

maximum :: Ord a => I a -> a

minimum :: Ord a => I a -> a

sum :: Num a => I a -> a

product :: Num a => I a -> a

Traversable I

Methods

traverse :: Applicative f => (a -> f b) -> I a -> f (I b)

sequenceA :: Applicative f => I (f a) -> f (I a)

mapM :: Monad m => (a -> m b) -> I a -> m (I b)

sequence :: Monad m => I (m a) -> m (I a)

newtype K a i

The parametrised constant functor.

Constructors

K

Fields

• unK :: a

Instances

Functor (K a)

Methods

fmap :: (a -> b) -> K a a -> K a b

(<$) :: a -> K a b -> K a a

Foldable (K a)

Methods

fold :: Monoid m => K a m -> m

foldMap :: Monoid m => (a -> m) -> K a a -> m

foldr :: (a -> b -> b) -> b -> K a a -> b

foldr' :: (a -> b -> b) -> b -> K a a -> b

foldl :: (b -> a -> b) -> b -> K a a -> b

foldl' :: (b -> a -> b) -> b -> K a a -> b

foldr1 :: (a -> a -> a) -> K a a -> a

foldl1 :: (a -> a -> a) -> K a a -> a

toList :: K a a -> [a]

null :: K a a -> Bool

length :: K a a -> Int

elem :: Eq a => a -> K a a -> Bool

maximum :: Ord a => K a a -> a

minimum :: Ord a => K a a -> a

sum :: Num a => K a a -> a

product :: Num a => K a a -> a

Traversable (K a)

Methods

traverse :: Applicative f => (a -> f b) -> K a a -> f (K a b)

sequenceA :: Applicative f => K a (f a) -> f (K a a)

mapM :: Monad m => (a -> m b) -> K a a -> m (K a b)

sequence :: Monad m => K a (m a) -> m (K a a)

Eq a => KEq (K a)

Methods

keq :: K a i -> K a j -> Bool

Ord a => KOrd (K a)

Methods

kcompare :: K a i -> K a j -> Ordering

Eq a => Eq (K a i)

Methods

(==) :: K a i -> K a i -> Bool

(/=) :: K a i -> K a i -> Bool

Ord a => Ord (K a i)

Methods

compare :: K a i -> K a i -> Ordering

(<) :: K a i -> K a i -> Bool

(<=) :: K a i -> K a i -> Bool

(>) :: K a i -> K a i -> Bool

(>=) :: K a i -> K a i -> Bool

max :: K a i -> K a i -> K a i

min :: K a i -> K a i -> K a i

data A f

Constructors

A

Fields

• unA :: forall i. f i

data E f

Constructors

E

Fields

• unE :: f i

runE :: (f :=> b) -> E f -> b

data (f :.: g) e t infixl 5

This data type denotes the composition of two functor families.

Constructors

Comp (f (g e) t)