Insertion and removal from the start is very fast, one of the fastest data structures for insertion in Haskell. While keeping lazyness and persistency. Making t

Insertion and removal from the start is very fast, one of the fastest data structures for insertion in Haskell. While keeping lazyness and persistency. Making them appropriate for a bunch of common use cases in functional programming/recursion/logging/timetraveling/etc... The author somehow forgot to mention that.