atto-lisp
dependent-map
atto-lisp | dependent-map | |
---|---|---|
- | 1 | |
24 | 61 | |
- | - | |
0.0 | 0.0 | |
about 4 years ago | over 1 year ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | LicenseRef-OtherLicense |
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.
atto-lisp
We haven't tracked posts mentioning atto-lisp yet.
Tracking mentions began in Dec 2020.
dependent-map
-
Monthly Hask Anything (October 2021)
Are there any clever ways to abstract the reallyUnsafePtrEquality traversal trick (as found e.g. here). Integrating it into something like uniplate was the only real idea I had, but I'm sure the overhead there would more than negate the saved allocations.
What are some alternatives?
netlist-to-vhdl - Netlist and Verilog Haskell Package
d10 - Digits 0-9
rei - Process lists easily
dependent-state
lens - Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens
critbit - A Haskell implementation of crit-bit trees.
resource-pool - A high-performance striped resource pooling implementation for Haskell
hierarchy
caledon - higher order dependently typed logic programing
relevant-time - relevant times useful for looking forward or backward in time from a time-anchor
refined - Refinement types with static checking
conffmt - language-conf - .conf (e.g. nginx configuration) parsers and pretty-printers for the Haskell programming language.