Haskell shying away from probabilistic data structures?

Question

If you search for skips lists implemented in Haskell, you won\'t find many. It is a probabilistic data structure needing a random number generator, meaning that any of these str

Answer 1

There is a new skip list implementation based on STM for haskell, see tskiplist on hackage.