data-category
Library of categories, with categorical constructions on them (by sjoerdvisscher)
dependent-map
Dependently-typed finite maps (partial dependent products) (by obsidiansystems)
data-category | dependent-map | |
---|---|---|
1 | 1 | |
54 | 61 | |
- | - | |
3.3 | 0.0 | |
9 months ago | over 1 year ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | LicenseRef-OtherLicense |
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.
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.
dependent-map
Posts with mentions or reviews of dependent-map.
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)
Are there any clever ways to abstract the reallyUnsafePtrEquality traversal trick (as found e.g. here). Integrating it into something like uniplate was the only real idea I had, but I'm sure the overhead there would more than negate the saved allocations.
What are some alternatives?
When comparing data-category and dependent-map you can also consider the following projects:
data-lens - Haskell 98 Lenses
d10 - Digits 0-9
data-lens-fd - Lenses with Functional Dependencies
dependent-state
cassava-conduit - Conduit interface for cassava [Haskell]
critbit - A Haskell implementation of crit-bit trees.
folds - Folds and sequence algebras
hierarchy
total-map - Finitely represented /total/ maps
relevant-time - relevant times useful for looking forward or backward in time from a time-anchor
kan-extensions - Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
conffmt - language-conf - .conf (e.g. nginx configuration) parsers and pretty-printers for the Haskell programming language.
data-category vs data-lens
dependent-map vs d10
data-category vs data-lens-fd
dependent-map vs dependent-state
data-category vs cassava-conduit
dependent-map vs critbit
data-category vs folds
dependent-map vs hierarchy
data-category vs total-map
dependent-map vs relevant-time
data-category vs kan-extensions
dependent-map vs conffmt