In the C# 4.0 Spec 7.5.2.9:

A lower-bound inference from a type U to a type V is made as follows:

  • If V is one of the unfixed Xi, then U is added to the set of lower bounds for Xi.
  • [...]

I've gone over this section many times. Lacking a section reference, this definition reads like a circular reference. So, I expect to find a grammer production or section reference nearby to clarify..which I do not. This section also ties in Fixing which suffers from similar definition issues.

What is an upper-bound inference vs a lower-bound inference?

c#
Edit
Report