Interprocedural reaching definitions proved intractable and isnt really required for type inference as long as we work with the calling conventions correctly. The domain of reaching definitions is too large on a big binary. With O(SN^3) where N is the number of defining terms in the worst case, and since we cannot utilize widening, this becomes very expensive.
Interprocedural reaching definitions proved intractable and isnt really required for type inference as long as we work with the calling conventions correctly. The domain of reaching definitions is too large on a big binary. With O(SN^3) where N is the number of defining terms in the worst case, and since we cannot utilize widening, this becomes very expensive.