Generics.Pointless.Fctrable

Pointless Haskell: point-free programming with recursion patterns as hylomorphisms

This module defines a class of representable functors.

Documentation

data Fctr f where

Functor GADT for polytypic recursive functions. At the moment it does not rely on a Typeable instance for constants.

Constructors

I :: Fctr Id

K :: Fctr (Const c)

L :: Fctr []

(:*!:) :: (Functor f, Functor g) => Fctr f -> Fctr g -> Fctr (f :*: g)

(:+!:) :: (Functor f, Functor g) => Fctr f -> Fctr g -> Fctr (f :+: g)

(:@!:) :: (Functor f, Functor g) => Fctr f -> Fctr g -> Fctr (f :@: g)

class Functor f => Fctrable f where

Class of representable functors.

Methods

fctr :: Fctr f

Instances

Fctrable []

Fctrable Id

Fctrable (Const c)

(Functor f, Fctrable f, Functor g, Fctrable g) => Fctrable ((:@:) f g)

(Functor f, Fctrable f, Functor g, Fctrable g) => Fctrable ((:*:) f g)

(Functor f, Fctrable f, Functor g, Fctrable g) => Fctrable ((:+:) f g)

fixF :: Fctr f -> Fix f

The fixpoint of a representable functor.

fctrF :: Fctrable f => Fix f -> Fctr f

The representation of the fixpoint of a representable functor.