The performance of F#’s Map and Set are pretty lacking for my particular application. It seems a nice prefix trie would step up performance in my interpreter a good bit, especially in terms of symbol lookups by name. The only caveats are that it must be highly efficient for add and lookup operations (especially when the keys are strings), and immutable for persistence (meaning non-destructive updates).
If no such beast is available, a reference implementation from OCaml or Haskell would help me get started on one.
Thank you very kindly!
To close this thread (see comments on question):
Haskell implementation
OCaml implementation