adjunctions
subwordgraph
Our great sponsors
adjunctions | subwordgraph | |
---|---|---|
1 | - | |
44 | 0 | |
- | - | |
3.3 | 0.0 | |
7 months ago | almost 8 years ago | |
Haskell | Haskell | |
GNU General Public License v3.0 or later | BSD 3-clause "New" or "Revised" License |
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.
adjunctions
-
Version 0.6 of Flat, a principled, portable and compact binary data format
To specify a representing type I can generically derive Representable via More a `ShapedBy` [a].
subwordgraph
We haven't tracked posts mentioning subwordgraph yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
miso - :ramen: A tasty Haskell front-end framework
fgl - A Functional Graph Library for Haskell
containers - Assorted concrete container types
graphite - Haskell graphs and networks library
parameterized-utils - A set of utilities for using indexed types including containers, equality, and comparison.
containers - Bitnami container images
repa-array - High performance, regular, shape polymorphic parallel arrays.
clafer - Clafer is a lightweight modeling language
EdisonAPI - Edison: A Library of Efficient Data Structures
perfect-hash-generator - Perfect minimal hashing implementation in native Haskell
distributive - Dual Traversable
I1M - Código Haskell usado en el curso de I1M (Informática de 1º de Matemática)