Persistent List, Set, and Map

[BosqueLanguage]

We would like to have the executable implementations of List, Set, and Map<K,V> implemented in Bosque itself. There is some state of the art code for this (which is quite complex) as well as simpler versions that are just based on a Red-Black Tree.

I would be super happy with the simpler version to start with -- and being able to get rid of the immutable.js dependency. If needed we can break this out into issues per data structure as well.

• List
• Set
• Map<K, V>

I marked this as a good first issue as you don't need to get too much into the internals of the compiler to implement this and it is a nice self contained algorithmic item. However, it is definitely non-trivial code and you will be on the leading edge of bugs!