The free-functors package

[Tags: bsd3, library]

A free functor is a left adjoint to a forgetful functor. It used to be the case that the only category that was easy to work with in Haskell was Hask itself, so there were no interesting forgetful functors.

But the new ConstraintKinds feature of GHC provides an easy way of creating subcategories of Hask. That brings interesting opportunities for free (and cofree) functors.

The examples directory contains an implementation of non-empty lists as free semigroups, and automata as free actions. The standard example of free higher order functors is free monads, and this definition can be found in Data.Functor.HFree.


Versions0, 0.1, 0.1.1, 0.1.2, 0.2, 0.3, 0.4, 0.4.1, 0.5, 0.6, 0.6.1,, 0.6.2, 0.6.3,,,, 0.6.4,
Change logNone available
Dependenciesalgebraic-classes (>=0.3.2 && <0.4), base (>=4.4 && <5), comonad (>=3.0 && <3.2), constraints (>=0.3.2 && <0.4), template-haskell (>= && <2.8.1), transformers (>= && <0.4), void (>=0.4 && <0.7) [details]
AuthorSjoerd Visscher
CategoryData, Math
Home page
Bug tracker
Source repositoryhead: git clone git://
UploadedMon Aug 26 15:25:33 UTC 2013 by SjoerdVisscher
Downloads2569 total (102 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees