Design a method of storing symbols beating our current O(log n) time.

[raeez]

Candidates
* use a container (http://hackage.haskell.org/package/hashmap or http://hackage.haskell.org/package/unordered-containers)

Confirmed: Hash Maps are the current "industry standard" solution to fast lookups (as opposed to our current [SymbolRecord].