This commit is contained in:
François Pottier 2022-04-01 17:38:28 +02:00
parent 3f3e8002a4
commit 595419e7d9
1 changed files with 2 additions and 2 deletions

View File

@ -498,7 +498,7 @@ let rec solve : type a . range -> a co -> a on_sol =
(* Warn the generalization engine that we are entering the left-hand
side of a [let] construct. *)
G.enter();
(* Register the rigid prefix [rs] with th generalization engine. *)
(* Register the rigid prefix [rs] with the generalization engine. *)
let urs = List.map (fun v -> ubind v G.Rigid None) rs in
(* Register the variables [vs] with the generalization engine, just as
if they were existentially bound in [c1]. This is what they are,
@ -514,7 +514,7 @@ let rec solve : type a . range -> a co -> a on_sol =
[generalizable] of the young variables that should be universally
quantified here. *)
let generalizable, ss = exit range ~rectypes vs in
(* All rigid variables of [rs] must be generalizable *)
(* All rigid variables of [rs] must be generalizable. *)
assert (urs |> List.for_all (fun r -> List.mem r generalizable));
List.iter (fun (_, v) -> uunbind v) xvs;
(* Extend the environment [env] and compute the type schemes [xss]. *)