You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Assume PML learns f = g prior to the creation of the term "f x", without loss of generality, let us assume that f points to g in the union find map. Then, forming the term "f x" (or "g x"), we will only compute "g x".
In PML one, abstraction nodes were carying a list of functions, just to compute both f x and g x and call "union" on the result.
When we learn that functions are equal, we should keep that information:
VN_LAbs should contain a list of functions.
This would allow to always deduce f x = g x from f = g
The text was updated successfully, but these errors were encountered: