-
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…
-
-
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:…
-
There is an ongoing effort to reduce the reliance of Phobos on the GC
but the GC is not going anywhere given that it has many advantages over
manual memory management. The community would greatly be…
-
Java uses a ConcurrentSkipListMap, whose salient characteristics are:
1) It's threadsafe in that multiple threads can update it without significant contention
2) It is ordered - we can efficiently i…
-
Using your code as listed I get:
1 ]=> (dijkstra2 c)
;The procedure #[compiled-procedure 16 ("vector" #xa) #x1a #xbd14fa] has been called with 4 arguments; it requires exactly 3 arguments.
;To …
-
I'm pretty new to Haskell. It'd be nice to see a small application and get a sense for how it's structured.
-
Please attach complete source files that exhibit the issue in addition
to quoting from them here.
# Steps to Reproduce
```
interface Queue (q : Type -> Type) where
||| An empty queue
Empty…
-
I'm really not sure it's worth the trouble, but we could improve the amortized times to worst-case using scheduling. Okasaki's scheme uses a separate schedule, which doesn't seem terribly compact, and…
-
Hi.
I came here from your message https://mail.haskell.org/pipermail/haskell-cafe/2020-August/132593.html
Could you please add (in the README) a few words on this data structure(s) and their us…