OCaml library with various functional data structures.
Partial laziness-based amortization; I am planning on covering at least Okasaki's textbook.
For sorting, BottomUpMergeSort collections are about as efficient as the standard library's List.sort.