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.


Properties

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.1.1, 0.6.2, 0.6.3, 0.6.3.1, 0.6.3.2
Dependenciesalgebraic-classes (==0.5.*), base (>=4.4 && <5), comonad (>=3.0 && <3.2), constraints (>=0.3.2 && <0.4), template-haskell (>=2.8.0.0 && <2.8.1), transformers (>=0.2.0.0 && <0.4), void (>=0.4 && <0.7)
LicenseBSD3
AuthorSjoerd Visscher
Maintainersjoerd@w3future.com
Stabilityexperimental
CategoryData, Math
Home pagehttps://github.com/sjoerdvisscher/free-functors
Bug trackerhttps://github.com/sjoerdvisscher/free-functors/issues
Source repositoryhead: git clone git://github.com/sjoerdvisscher/free-functors.git
Upload dateSat Aug 31 11:40:23 UTC 2013
Uploaded bySjoerdVisscher
Downloads989 total (92 in last 30 days)

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees