#spr labels a reentrancy between the values of two  The parsing and generation algorithms require that the type hierarchy be a bounded complete partial order (BCPO), i.e., for any two types that share subtypes, there must be one unique most general such type, called the 'greatest lower bound (glb)'.
the LKB uses numbers to assign each added glb-type a unique name.