1 Early TFS-based parsing systems like ALE (Carpenter and Penn, 1996) required that every pair of unifiable types have a least common supertype, i.e., joins are uniquely defined wherever they need to be defined.
from (i) and (ii), if m is even then n ≥ 2p + 1, and if m is odd then n ≥ 3p + 2.