First steps in narrow sparseness.
Bug in GC. Needed to calculate reachable addresses.
Sparse narrow implementation needed to separate fn lookup and fn call. Currently slow. Needs GC and maybe subsumption.
Fixing cons limit logic.
Removing old files.
Added bitvector representation of sets for fast set operations. Working on a heap datastructure that minimizes redundant computation.
Rtree and bv with intervals implemented. Still have no-action bug.
Rtree with bitvectors working, but not as fast as I'd hoped.