The representable-tries package

[Tags: bsd3, library]

Tries from representations of polynomial functors

[Skip to ReadMe]


Versions0.1, 0.2, 0.2.1, 0.2.2, 0.2.3,, 0.3, 0.3.1,,, 0.3.2, 0.3.4, 0.3.6, 0.3.7, 0.5.0,, 1.8.0, 1.8.1, 2.0,,,,, 2.0.2, 2.0.3, 2.0.4, 2.0.5, 2.2, 2.2.1, 2.4,,, 2.5, 3.0, 3.0.1,, 3.0.2
Change logCHANGELOG.markdown
Dependenciesadjunctions (>=3), base (==4.*), bifunctors (>=3), comonad (>=3), comonad-transformers (>=3), containers (>=0.3 && <0.6), distributive (>=0.2.2), keys (>=, mtl (>=2.0.1 && <2.2), representable-functors (>=, semigroupoids (>=3), semigroups (>=, transformers (>=0.2 && <0.4) [details]
CopyrightCopyright (C) 2011 Edward A. Kmett
AuthorEdward A. Kmett
MaintainerEdward A. Kmett <>
CategoryData Structures, Functors, Monads, Comonads
Home page
Bug tracker
Source repositoryhead: git clone git://
UploadedSun Jan 6 22:58:36 UTC 2013 by EdwardKmett
Downloads5346 total (242 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees

Readme for representable-tries-3.0.2


Build Status

This package provides a simple function memoization scheme based on the notion of representable functors.

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.

Given the existence of representable functors, we can choose a Traversable representable functor that has our data type as a representation, and use it to memoize functions by building a data structure that has one place to hold each answer for each possible argument.

Contact Information

Contributions and bug reports are welcome!

Please feel free to contact me through github or on the #haskell IRC channel on

-Edward Kmett