total-map VS data-category

Compare total-map vs data-category and see what are their differences.

total-map

Finitely represented /total/ maps (by conal)

data-category

Library of categories, with categorical constructions on them (by sjoerdvisscher)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
total-map data-category
- 1
15 54
- -
0.0 3.3
over 4 years ago 8 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.

total-map

Posts with mentions or reviews of total-map. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning total-map 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)
    7 projects | /r/haskell | 2 Oct 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 total-map and data-category you can also consider the following projects:

fclabels - First class composable record labels for Haskell.

data-lens - Haskell 98 Lenses

cassava-conduit - Conduit interface for cassava [Haskell]

data-lens-fd - Lenses with Functional Dependencies

monoid-extras - Miscellaneous constructions on monoids

interpolatedstring-perl6 - QuasiQuoter for Perl6-style multi-line interpolated strings with q, qq and qc support.

proto-lens - API for protocol buffers using modern Haskell language and library patterns.

file-embed - Use Template Haskell to embed file contents directly.

kan-extensions - Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor

data-structure-inferrer - A program that analyzes source code with a data-structure wildcard and suggests the right one.

folds - Folds and sequence algebras