first-class-families
memory
Our great sponsors
| first-class-families | memory | |
|---|---|---|
| 1 | 0 | |
| 84 | 47 | |
| - | - | |
| 6.2 | 0.0 | |
| 14 days ago | 8 months ago | |
| Haskell | Haskell | |
| MIT License | 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.
first-class-families
-
Foldr type level implementation
First class families is the approach I'm familiar with, although it can feel a bit heavy-handed. There's a chapter in Thinking with Types about how to use fcf.
memory
We haven't tracked posts mentioning memory yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
hyperloglogplus - Haskell implementation of HyperLogLog++ & MinHash for efficient cardinality and intersection estimation
generic-data - Generic data types in Haskell, utilities for GHC.Generics
tttool - Trying to understand the file format of Tip Toi
require - 🔌 Scrap your qualified import clutter
parconc-examples - Sample code to accompany the book "Parallel and Concurrent Programming in Haskell"
nixfromnpm - Convert NPM packages into nix expressions
ramus - 📶 - Elm style FRP library for Haskell
d-bus - strongly typed dbus client library
chart-unit - Unital Charts
laborantin-hs - Experiment-management framework in Haskell
xmonad - The core of xmonad, a small but functional ICCCM-compliant tiling window manager
CheatSheet - A Haskell CheatSheet in PDF and literate source formats.