pointless-haskell-0.0.3: Pointless Haskell librarySource codeContentsIndex
Generics.Pointless.Fctrable
Portabilitynon-portable
Stabilityexperimental
Maintainerhpacheco@di.uminho.pt
Description

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

This module defines a class of representable functors.

Synopsis
data Fctr f where
I :: Fctr Id
K :: Fctr (Const c)
:*!: :: (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
fctr :: Fctr f
fixF :: Fctr f -> Fix f
fctrF :: Fctrable f => Fix f -> Fctr f
Documentation
data Fctr f whereSource
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)
:*!: :: (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 whereSource
Class of representable functors.
Methods
fctr :: Fctr fSource
show/hide Instances
fixF :: Fctr f -> Fix fSource
The fixpoint of a representable functor.
fctrF :: Fctrable f => Fix f -> Fctr fSource
The representation of the fixpoint of a representable functor.
Produced by Haddock version 2.6.0