rawr
heaps
Our great sponsors
| rawr | heaps | |
|---|---|---|
| - | 1 | |
| 26 | 29 | |
| - | - | |
| 0.0 | 0.0 | |
| over 2 years ago | over 1 year ago | |
| Haskell | Haskell | |
| BSD 3-clause "New" or "Revised" 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.
rawr
We haven't tracked posts mentioning rawr yet.
Tracking mentions began in Dec 2020.
heaps
-
What's "One Cool Thing" about OCaml? I.e. some piece of code or language concept which is more elegant or powerful in ocaml than in most or all other mainstream languages, but that could be explained to a room of unfamiliar cs majors in under five minutes?
You can implement all this in Haskell (and Kmett has), but the double-layer functor presentation is beautiful in its expression of recursion and memoization through the composition of first-class modules. Yes, you could do this with typeclasses in Haskell, but typeclasses but I think there's just an element of elegance to first-class modules that can't be found with typeclasses. (Not the mention Haskell's horridly bare-bones module system.)
What are some alternatives?
graphite - Haskell graphs and networks library
fgl - A Functional Graph Library for Haskell
vinyl - Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.
EdisonAPI - Edison: A Library of Efficient Data Structures
naperian - Efficient representable functors
helf - Haskell implementation of the Edinburgh Logical Framework
monadic-arrays - MArray instances for monad transformers
flux-monoid - A monoid which counts changing values in a sequence
nonemptymap - NonEmpty Map Libary
repa-array - High performance, regular, shape polymorphic parallel arrays.
btree-concurrent - A backend agnostic, concurrent BTree written in Haskell
map-syntax - Syntax sugar and explicit semantics for statically defined maps