representable-tries
representable tries (by ekmett)
data-category
Library of categories, with categorical constructions on them (by sjoerdvisscher)
| representable-tries | data-category | |
|---|---|---|
| - | 1 | |
| 7 | 54 | |
| - | - | |
| 0.0 | 3.3 | |
| over 8 years ago | 9 months ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
representable-tries
Posts with mentions or reviews of representable-tries.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning representable-tries yet.
Tracking mentions began in Dec 2020.
data-category
Posts with mentions or reviews of data-category.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-10-02.
-
Monthly Hask Anything (October 2021)
Even a fairly simple statement like "F preserves direct limits over N" is basically impossible to express like this. You can step further from Hask and work at the type level until the very end (which I believe is the approach taken by data-category), you can resign yourself to only expressing things that can be "defunctionalized" (an appropriate use of the term, I think, if not a correct one) down to Haskell functions, which gets you (Co)Yoneda, Lan, Ran, etc. in the general case and I think Traversable in this particular instance, or you can take some intermediate approach with constrained functions and/or explicit witnesses in your data types, but you can't make proper category theory "just work" the way it should.
What are some alternatives?
When comparing representable-tries and data-category you can also consider the following projects:
semigroupoids
data-lens - Haskell 98 Lenses
comonad - Haskell 98 comonads
data-lens-fd - Lenses with Functional Dependencies
folds - Folds and sequence algebras
cassava-conduit - Conduit interface for cassava [Haskell]
streams - Haskell 2010 stream comonads
kan-extensions - Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
total-map - Finitely represented /total/ maps
store - Fast binary serialization in Haskell
representable-tries vs semigroupoids
data-category vs data-lens
representable-tries vs comonad
data-category vs data-lens-fd
representable-tries vs folds
data-category vs cassava-conduit
representable-tries vs streams
data-category vs folds
representable-tries vs kan-extensions
data-category vs total-map
representable-tries vs store
data-category vs kan-extensions