From 96449acecbb1b59728f2d29d1e8aef0a3a2bc8ef Mon Sep 17 00:00:00 2001 From: Andy Friesen Date: Thu, 24 Mar 2022 14:18:57 -0700 Subject: [PATCH] Forgot two important words. --- rfcs/lower-bounds-calculation.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/rfcs/lower-bounds-calculation.md b/rfcs/lower-bounds-calculation.md index 13f44c27..22445fc3 100644 --- a/rfcs/lower-bounds-calculation.md +++ b/rfcs/lower-bounds-calculation.md @@ -168,7 +168,7 @@ So, we propose some different inference rules for functions: 1. The AST fragment `function(arg0..argN) ... end` is typed `(T0..TN, any...) -> R` where `arg0..argN : T0..TN` and `R` is the inferred return type of the function body. Function statements are inferred the same way. 1. Type annotations are unchanged. `() -> ()` is still a nullary function. -For reference, the subtyping rules for unions are unchanged. We include them here for clarity. +For reference, the subtyping rules for unions and functions are unchanged. We include them here for clarity. 1. `A <: A | B` 1. `B <: A | B`