kind-generics
adjunctions
kind-generics | adjunctions | |
---|---|---|
2 | 1 | |
- | 44 | |
- | - | |
- | 3.3 | |
- | 7 months ago | |
Haskell | ||
- | 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.
kind-generics
-
Version 0.6 of Flat, a principled, portable and compact binary data format
There are other generic frameworks, such as generics-sop and kind-generics so even within generic default methods we are limiting ourselves to only deriving GHC.Generics. There should be one newtype for each generic framework so you can derive via SOP.Generically and Kind.Generically.
-
Practical Generic Programming over a Universe of Native Datatypes
kind-generics-sop
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].
What are some alternatives?
flat - Principled and efficient binary serialization
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
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)
tie-knot - "Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values.
haggle - An efficient graph library for Haskell