representable-functors: Representable functors
Deprecated.
in favor of adjunctions
| Versions | 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.5), base (==4.*), comonad (==3.*), comonad-transformers (>=3), comonads-fd (>=3), containers (>=0.3 && <0.6), contravariant (>=0.2.0.1), distributive (>=0.2.2), free (>=3), keys (>=3), mtl (>=2.0.1.0 && <2.2), semigroupoids (>=3), semigroups (>=0.8.3.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> |
| Revised | Revision 1 made by HerbertValerioRiedel at Thu Jan 8 08:47:46 UTC 2015 |
| 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 Tue Mar 26 07:45:44 UTC 2013 |
| Distributions | Debian:2.4.0.2, NixOS:3.2.0.2 |
| Downloads | 14278 total (98 in the last 30 days) |
| Rating | (no votes yet) [estimated by rule of succession] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] Hackage Matrix CI |
Downloads
- representable-functors-3.1.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
Readme for representable-functors-3.1
[back to package description]representable-functors
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