representable-functors: Representable functors

[ bsd3, data-structures, deprecated, functors, library, monads ] [ Propose Tags ]
Deprecated in favor of adjunctions

Representable functors


[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0, 0.1.0.1, 0.1.0.2, 0.2.0, 0.3.0, 0.3.0.1, 0.3.0.2, 0.3.0.3, 0.4.0, 0.4.1, 0.4.2, 0.4.3, 0.4.4, 0.5.0, 1.8.0, 2.0, 2.0.0.1, 2.0.0.3, 2.0.0.4, 2.0.0.5, 2.0.1, 2.0.2, 2.1, 2.1.2, 2.2, 2.2.1, 2.2.1.1, 2.4, 2.4.0.1, 2.4.0.2, 2.5, 3.0, 3.0.0.1, 3.0.0.2, 3.0.0.3, 3.0.1, 3.1, 3.2.0.1, 3.2.0.2
Change log CHANGELOG.markdown
Dependencies array (>=0.3.0.2 && <0.6), base (>=4 && <5), comonad (>=3 && <4), comonad-transformers (>=3 && <4), comonads-fd (>=3 && <4), containers (>=0.3 && <0.6), contravariant (>=0.4.1 && <1), distributive (>=0.2.2 && <1), free (>=3 && <4), keys (>=3 && <4), mtl (>=2.0.1.0 && <2.2), semigroupoids (>=3 && <4), semigroups (>=0.8.3.1 && <1), transformers (>=0.2 && <0.4) [details]
License BSD-3-Clause
Copyright Copyright (C) 2011-2013 Edward A. Kmett
Author Edward A. Kmett
Maintainer Edward A. Kmett <ekmett@gmail.com>
Category Monads, Functors, Data Structures
Home page http://github.com/ekmett/representable-functors/
Bug tracker http://github.com/ekmett/representable-functors/issues
Source repo head: git clone git://github.com/ekmett/representable-functors.git
Uploaded by EdwardKmett at 2013-10-13T15:00:49Z
Distributions
Reverse Dependencies 10 direct, 7811 indirect [details]
Downloads 30353 total (53 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Successful builds reported [all 1 reports]

Readme for representable-functors-3.2.0.2

[back to package description]

representable-functors

Build Status

This package provides representable functors for haskell. In category theory a representable functor (more pedantically a corepresentable functor) is one such that f a is isomorphic to x -> a. We choose the name Representable here because we are talking about haskell Functor instances, and they are all covariant, so this is the more natural notion of representability for Haskell.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on irc.freenode.net.

-Edward Kmett