Data.Functor.Decomposed

Documentation

class Decomposed d where

A type class for types d :: (* -> *) -> * -> * that represent compositions of functors. For a functor f :: * -> *, d f t should look like some functor applied to the type f t, and fmap1 is just fmap for that functor.

Minimal complete definition

fmap1

Methods

fmap1 :: (f t -> g t) -> d f t -> d g t

Instances

Decomposed HoleF

Methods

fmap1 :: (f t -> g t) -> HoleF f t -> HoleF g t

Decomposed (AnnotatedF a)

Methods

fmap1 :: (f t -> g t) -> AnnotatedF a f t -> AnnotatedF a g t

natmap :: (Functor f, Functor g) => (forall t. f t -> g t) -> Fix f -> Fix g

Given a natural transformation between functors, produce a function between the fixpoints of those functors.