DescriptionEstablish distributivity for type union & intersection
This requires introducing proper bounds on all leaf types, so that intersection between bitsets and these types can be accurately represented. Extending a union also becomes more involved.
(On the upside, the modified union/intersect algorithm would now allow support for proper variance for function types.)
Not sure if it is worth landing this. Distributivity isn't really a crucial property for our use cases. It seems fine if intersection is slightly lossy.
R=bmeurer@chromium.org, jarin@chromium.org
BUG=
Committed: https://code.google.com/p/v8/source/detail?r=21528
Patch Set 1 #Patch Set 2 : Eps #
Total comments: 2
Patch Set 3 : Accurate representation glb & intersection; renaming #
Total comments: 2
Messages
Total messages: 8 (0 generated)
|