Initial commit
a bunch of interesting functions and combinators
start graphs -- with Dijkstra's algorithm
start figuring out folds
split out set and examples into separate modules; add queue and stack; implement breadth-first and depth-first search
linked and doubly-linked lists
list and sortedlist