name: free-functors
version: 0.2
synopsis: Provides free functors that are adjoint to functors that forget class constraints.
description: 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
subclasses 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.
category: Data, Math
license: BSD3
license-file: LICENSE
author: Sjoerd Visscher
maintainer: sjoerd@w3future.com
stability: experimental
homepage: https://github.com/sjoerdvisscher/free-functors
bug-reports: https://github.com/sjoerdvisscher/free-functors/issues
build-type: Simple
cabal-version: >= 1.10
extra-source-files:
examples/*.hs
Library
HS-Source-Dirs:
src
exposed-modules:
Data.Functor.Cofree,
Data.Functor.Free,
Data.Functor.HCofree,
Data.Functor.HFree
default-language:
Haskell2010
build-depends:
base >= 4.4 && < 5,
constraints >= 0.3.2 && < 0.4,
transformers >= 0.2.0.0 && < 0.4,
comonad >= 3.0 && < 3.1,
void >= 0.4 && < 0.7
source-repository head
type: git
location: git://github.com/sjoerdvisscher/free-functors.git