-
Okasaki's lazy binomial heaps have good amortized bounds, but extraction is linear in the worst case. It's quite easy to make all operations worst-case logarithmic by representing the spine as a strea…
-
The step algebra should be able to be optimized by running a peephole algorithm.
Keep removing redundant expressions (`Compose(Lift(f), Lift(g)) => Lift(f andThen g)`) a'la chris okasaki's red-blac…
-
A partir des exemples, nous devons implémenter des opérations supplémentaires sur les structures de données conjointes.
-
As reported in #6335 by @Aster89. I can't reproduce, but might be some kind of race condition with the temporary file being deleted before it's read or something?
Relevant logs:
```
16:40:04 DE…
-
Out of curiosity, is there a reason that the [merge](https://github.com/backtracking/ptmap/blob/master/ptmap.ml#L307) implementation is as 2 folds as as opposed to the recursive one written in the or…
-
There are analogues to `foldMap`, `foldr`, and `foldl` available. The `foldMap` is particularly pleasant; it's pretty much like the usual one, but maps into a `Category` instead of a `Monoid`. The `fo…
-
Une liste d'articles que je veux peut-être présenter un jour, mais qui peuvent être choisis par d'autres si désiré.
- *Soutei, a Logic-Based Trust-Management System*, Andrew Pimlott, Oleg Kiselyov:…
-
The choice of `'a list` as the exposed data type imposes slow O(n) patch application.
It'd be nice to have another module using another list-like data type (something similar to Okasaki's random acces…
-
It seems `dequeue`s are not amortized O(1) when both `unsnoc` and `uncons` are called; in fact, the underlying two lists might "oscillate" such that the operations are amortized O(n). When only one of…
-
I really wanted to implement queues and deques by close analogy to Okasaki's implicit queue and implicit deque structures, with Hinze and Paterson's strictness modification to `cons` and `snoc` to avo…