We speak of F-bounded quantification or recursively bounded quantification if the subtype constraint itself is parametrized by one of the binders occurring on the left-hand side. This notion was first explained in 1989. [1]

Here is an application of this idiom in Java for a well-typed clone method: