|7 days ago||12 days ago|
|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.
Programming with -XStrict/Unlifted datatypes and associated ecosystem/libraries/preludes
2 projects | reddit.com/r/haskell | 30 Dec 2022
"Make invalid laziness unrepresentable" means you should use strict versions of container types instead of lazy ones. However, for better or for worse, sometimes the "strict version" of a data type is not actually a strict data type, it's just a strict API to the lazy type. Examples include Data.Map.Strict (not Data.Map or Data.Map.Lazy) or Data.HashMap.Strict (not Data.HashMap.Lazy) (sadly there is no Data.Sequence.Strict but perhaps there will be one day).
Monthly Hask Anything (June 2022)
5 projects | reddit.com/r/haskell | 3 Jun 2022
Why is seemingly infinite (lazy) recursion faster?
2 projects | reddit.com/r/haskell | 24 May 2022
Edison and containers both have sequence types that support efficient, cons, snoc, viewL, viewR, append, map, and length.
Haskell - Important Libraries
11 projects | reddit.com/r/haskell | 24 Mar 2022
Assessing Haskell (blogpost, slightly negative!)
3 projects | reddit.com/r/haskell | 30 Nov 2021
Calling linked lists Haskell's "primary data structure" seems off-base to me. Yes, there's String, yes, there's built-in syntax for List... but there's also everything in containers, and vector is pretty easy to use in practice, though it would probably be good for more learning material to mention it more prominently.
Looking for projects that make heavy use of IntMap which have benchmarks
4 projects | reddit.com/r/haskell | 18 Sep 2021
I asked this on the libraries mailing list but thought posting here would bring in potentially more responses. I made a recent change to the behaviour of lookup and find (see here for more details: https://github.com/haskell/containers/pull/800).
Semver doesn't mean MAJOR.MINOR.PATCH, it means FAILS.FEATURES.BUGS
2 projects | reddit.com/r/programmingcirclejerk | 7 Aug 2021
Rust has nothing on Haskell. containers, which might as well be considered part of the standard library, has been out for almost 14 years and is still 0.x
Monthly Hask Anything (July 2021)
2 projects | reddit.com/r/haskell | 5 Jul 2021
When I was first learning I did a bunch of leetcode/codewars to get familiar with the containers library and GHCI repl workflow. Then using Real World Haskell as a reference I implemented a few coreutils to play with IO.
Library for Tree-like data structure
2 projects | reddit.com/r/haskell | 3 Oct 2022
I am about to start a new project in Haskell, model checking with (new) tree-like data structures. I think it is best to start building on a library such that i can already have elegant base functions, yet i am wondering what library is currently the standard? I read about fgl ( https://hackage.haskell.org/package/fgl ), yet it is a very old library.
-🎄- 2021 Day 12 Solutions -🎄-
145 projects | reddit.com/r/adventofcode | 11 Dec 2021
Using fgl but only as a data structure this time, with edge labels denoting whether the target is a big room. Not using any of its algorithms as it doesn't have anything built-in for "traversal with re-visiting".
-🎄- 2021 Day 9 Solutions -🎄-
185 projects | reddit.com/r/adventofcode | 8 Dec 2021
For part 2, instead of trying to union-merge from the lowest points, I simply found all connected regions of <9. I say "simply" because I just threw things at fgl, but setting the graph up first took a bit of work. buildGr is fast but picky about the exact order things come in with.
What are some alternatives?
singletons - Fake dependent types in Haskell using singletons
igraph - Incomplete Haskell bindings to the igraph library (which is written in C)
EdisonAPI - Edison: A Library of Efficient Data Structures
hevm - Dapp, Seth, Hevm, and more
Agda - Agda is a dependently typed programming language / interactive theorem prover.
miso - :ramen: A tasty Haskell front-end framework
psqueues - Priority Search Queues in three different flavors for Haskell
adjunctions - Simple adjunctions
distributive - Dual Traversable