proto-lens
API for protocol buffers using modern Haskell language and library patterns. (by google)
data-category
Library of categories, with categorical constructions on them (by sjoerdvisscher)
Our great sponsors
| proto-lens | data-category | |
|---|---|---|
| - | 1 | |
| 446 | 54 | |
| 0.7% | - | |
| 5.0 | 3.3 | |
| 18 days 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.
proto-lens
Posts with mentions or reviews of proto-lens.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning proto-lens 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 proto-lens and data-category you can also consider the following projects:
cassava-conduit - Conduit interface for cassava [Haskell]
data-lens - Haskell 98 Lenses
data-lens-fd - Lenses with Functional Dependencies
base64-bytestring - Fast base64 encoding and decoding for Haskell.
type-iso - Expresses isomorphic and injective relations between types.
total-map - Finitely represented /total/ maps
bimap - Bidirectional mapping between two key types
kan-extensions - Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
msgpack - Haskell implementation of MessagePack / msgpack.org[Haskell]
folds - Folds and sequence algebras
proto-lens vs cassava-conduit
data-category vs data-lens
proto-lens vs data-lens
data-category vs data-lens-fd
proto-lens vs base64-bytestring
data-category vs cassava-conduit
proto-lens vs type-iso
data-category vs total-map
proto-lens vs bimap
data-category vs kan-extensions
proto-lens vs msgpack
data-category vs folds