Currently, AndNodes only calculate a resulting type if one of the inputs is a positive constant C, returning the type [0, C]. Otherwise, it just returns the integer bottom type. However, this can be generalized to any type [L, C], where the lower bound L matches 0 <= L <= C. Since this is a very common pattern, it'll let us propagate more precise types through the ideal graph.