 Upper type bound

An upper type bound $A<:B$ requires the type argument assigned to $A$ to be a subtype of $B$. Two independently bounded parameters can retain different precise component types while sharing the same upper bound. Bounds and type variance answer different questions: admissible arguments versus subtyping between instantiations.