# free-functors: Free functors, adjoint to functors that forget class constraints.

[ bsd3, category-theory, data, library, math ] [ Propose Tags ]

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.

[Index]

• Data

## Downloads

#### Maintainer's Corner

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0, 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, 0.6.3.3, 0.6.4, 0.6.4.1, 0.6.5, 0.7, 0.7.1, 0.7.2, 0.8, 0.8.1, 0.8.2, 0.8.3, 0.8.4, 0.9, 1.0, 1.0.1, 1.1, 1.1.1, 1.1.2, 1.2, 1.2.1 CHANGELOG algebraic-classes (>=0.7 && <0.8), base (>=4.9 && <4.10), bifunctors (>=5 && <6), comonad (>=5 && <6), constraints (>=0.9 && <0.10), contravariant (>=1.4 && <1.5), profunctors (>=5 && <6), template-haskell (>=2.11 && <2.12), transformers (>=0.5 && <0.6) [details] BSD-3-Clause Sjoerd Visscher sjoerd@w3future.com Data, Math https://github.com/sjoerdvisscher/free-functors https://github.com/sjoerdvisscher/free-functors/issues head: git clone git://github.com/sjoerdvisscher/free-functors.git by SjoerdVisscher at 2017-02-04T19:09:03Z NixOS:1.2.1 23860 total (12 in the last 30 days) (no votes yet) [estimated by Bayesian average] λ λ λ Docs available Last success reported on 2017-02-04