Experiment: chain up cache lookups
If lookup(t1) -> t2, then we should check lookup(t2) (and so on)
This is important for the Equation cache, not the LLVM cache (which will always have unmodified terms or constructor-like ones)
We have to
avoid loops by checking prior results.
catch case of unmodified term in cache
possibly we can update the cache after looking up a value in a chain
first implement a naive version to find out how many times this is actually happening and how long the chains are
Experiment: chain up cache lookups If
lookup(t1) -> t2, then we should checklookup(t2)(and so on) This is important for the Equation cache, not the LLVM cache (which will always have unmodified terms or constructor-like ones) We have to