[Haskell-cafe] STM Skip list implementation

Peter Robinson thaldyron at gmail.com
Wed Mar 17 11:05:26 EDT 2010

I've implemented a skip list that works in the STM monad. A skip list is a
probabilistic data structure similar to a balanced tree. The main advantage
of a skip list is that it doesn't require rebalancing, making it particularly
suitable for concurrent programming.

Here are the docs:

It's not yet on hackage as the implementation is very incomplete and mostly
untested. However, you can download a cabalized package from here:

Darcs repository:


More information about the Haskell-Cafe mailing list