Update docs/_posts/2022-10-31-luau-semantic-subtyping.md

Co-authored-by: Alexander McCord <11488393+alexmccord@users.noreply.github.com>
This commit is contained in:
Alan Jeffrey 2022-10-13 15:05:36 -05:00 committed by GitHub
parent 7b1553d5dc
commit 5a0fc8a946
Signed by: DevComp
GPG key ID: 4AEE18F83AFDEB23

View file

@ -55,7 +55,7 @@ AKA “what we did before.”
Syntactic subtyping is a syntax-directed recursive algorithm. The interesting cases to deal with intersection and union types are:
i* Reflexivity: `T` is a subtype of `T`
* Reflexivity: `T` is a subtype of `T`
* Intersection L: `(T₁ & … & Tⱼ)` is a subtype of `U` whenever some of the `Tᵢ` are subtypes of `U`
* Union L: `(T₁ | … | Tⱼ)` is a subtype of `U` whenever all of the `Tᵢ` are subtypes of `U`
* Intersection R: `T` is a subtype of `(U₁ & … & Uⱼ)` whenever `T` is a subtype of some of the `Uᵢ`