data-category VS kan-extensions

Compare data-category vs kan-extensions and see what are their differences.

data-category

Library of categories, with categorical constructions on them (by sjoerdvisscher)

kan-extensions

Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor (by ekmett)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
data-category kan-extensions
1 -
54 77
- -
3.3 4.9
9 months ago 2 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.

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.

kan-extensions

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

We haven't tracked posts mentioning kan-extensions yet.
Tracking mentions began in Dec 2020.

What are some alternatives?

When comparing data-category and kan-extensions you can also consider the following projects:

data-lens - Haskell 98 Lenses

semigroupoids

data-lens-fd - Lenses with Functional Dependencies

range-set-list - Memory efficient sets with continuous ranges of elements. List based implementation.

cassava-conduit - Conduit interface for cassava [Haskell]

msgpack - Haskell implementation of MessagePack / msgpack.org[Haskell]

total-map - Finitely represented /total/ maps

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

pretty-hex - A human readable style for binary data.

folds - Folds and sequence algebras

representable-tries - representable tries