Generics.Pointless.Bifctrable

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

This module defines a class of representable bifunctors.

Documentation

data Bifctr f where

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

Constructors

BI :: Bifctr BId

BK :: Bifctr (BConst c)

BP :: Bifctr BPar

:*!| :: (Bifunctor f, Bifunctor g) => Bifctr f -> Bifctr g -> Bifctr (f :*| g)

:+!| :: (Bifunctor f, Bifunctor g) => Bifctr f -> Bifctr g -> Bifctr (f :+| g)

:@!| :: (Bifunctor f, Bifunctor g) => Bifctr f -> Bifctr g -> Bifctr (f :@| g)

class Bifunctor f => Bifctrable f where

Class of representable bifunctors.

Methods

bctr :: Bifctr f

Instances

Bifctrable BPar

Bifctrable BId

Bifctrable (BConst c)

(Bifunctor f, Bifctrable f, Bifunctor g, Bifctrable g) => Bifctrable (:*| f g)

(Bifunctor f, Bifctrable f, Bifunctor g, Bifctrable g) => Bifctrable (:+| f g)

fixB :: Bifctr f -> BFix f

The fixpoint of a representable bifunctor.

fctrB :: Bifctrable f => BFix f -> Bifctr f

The representation of the fixpoint of a representable functor.