-
> The concept here is that there are a bunch of concurrent utilities that we could have which are very, very commonly needed, but which aren't available. They should all be implemented on top of the C…
-
I don't have a good examples for this one, but if you have `Bar.toList` in your codebase and `toList` is a unique suffix, then define `Foo.toList` in your scratch file, `toList` will resolve to `Bar.t…
-
I have been concerned for a while (e.g. #1473 ) that traverse/sequence is not stack safe in general, and several interesting Applicatives will throw in this case.
Recently, I have been implementing…
-
After a while, I revisited miser, trying to recall what I found so interesting about it. The main theme of my thought was however why oMiser defines so many rules? Can't the number be somehow made sma…
-
-
Hi, very cool project. I have a dataviz background and really like the visualization.
Question: is the MIT license in this project's `package.json` correct? I need a purely functional deque for a …
-
The current queue implementation does not work properly in a persistent setting. It also doesn't have much in the way of proof behind it. I've opened pull request #10 to add Okasaki-style Banker's que…
-
The system uses lots of datastructures like `HashMap`, `HashSet`, etc.
Since they need to be part of the public API we cannot make them internal.
My current approach is to leave `HashMap`, `Hash…
-
GHC 8.8.1 was [released](https://mail.haskell.org/pipermail/ghc-devs/2019-August/018050.html). I created this issue for collecting/reporting the required changes/issues.
The GHC 8.8 migration guide…
-
Add purely functional random-access list as described in [this paper](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.55.5156&rep=rep1&type=pdf) by Okasaki. The random-access list support all…