apfelmus - Monoids and Finger TreesIn this article, we explain how monoids enable one and the same data structure, the finger tree, to implement virtually any other data structure; they arise by different choices of monoids. The technique is discussed using the examples of a list with random access and a priority queue. This post grew out of the big monoid discussion on the haskell-cafe mailing list. Introduction A very powerful ap
