title: Haskell shying away from probabilistic data structures?
body: <p>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 structures would need to run in the IO monad.</p>
  
  <p>Are Haskell folks staying away from these data structures because it's not possible to implement them purely? How can Haskell deal with them? </p>