𝐖ell-𝚻yped 𝐑eflections

As one can observe, the basic MLsub type inference algorithm is actually quite similar to the traditional Algorithm J for HM-style type inference, and is not complicated at all! First, note that type variable bounds, which are updated using mutable variables, may very well form cycles as type inference progresses.