Set data type implemented in Haskell using a Red-Black BST

This program uses red-black binary trees to efficiently perform set operations including insert, member, union, intersection, difference, cardinality, setmap, setfoldr, removeset and powerset.