This package provides an implementation of a skip list in STM. A skip list is a probabilistic data structure with map-like operations. In contrast to a balanced tree, a skip list does not need any (expensive) rebalancing operation, which makes it particularly suitable for concurrent programming. See: William Pugh. Skip Lists: A Probabilistic Alternative to Balanced Trees. 1990.

Feedback appreciated!