We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 8035e8e commit b258a55Copy full SHA for b258a55
resources/type-system/inference.md
@@ -982,10 +982,13 @@ following recursive process:
982
983
- Otherwise, let `U` be `T`.
984
985
+_The point of bound resolution of `T` is to find a non-type-variable type which
986
+is a (minimal) supertype of `T`._
987
+
988
_Note that the spec notions of __dynamic__ boundedness and __Function__
989
boundedness can be defined in terms of bound resolution, as follows: a type is
990
__dynamic__ bounded iff its bound resolution is __dynamic__, and a type is
-__Function__ bounded if its bound resolution if __Function__._
991
+__Function__ bounded iff its bound resolution is __Function__._
992
993
# Expression inference
994
0 commit comments