@@ -233,8 +233,6 @@ let check_stack (c : context) ts1 ts2 at =
233
233
" but stack has " ^ string_of_result_type ts1)
234
234
235
235
let pop c (ell1 , ts1 ) (ell2 , ts2 ) at =
236
- Printf. eprintf " [pop] %s\n %!"
237
- (String. concat " " (List. map string_of_val_type ts1));
238
236
let n1 = List. length ts1 in
239
237
let n2 = List. length ts2 in
240
238
let n = min n1 n2 in
@@ -243,8 +241,6 @@ Printf.eprintf "[pop] %s\n%!"
243
241
(ell2, if ell1 = Ellipses then [] else Lib.List. take (n2 - n) ts2)
244
242
245
243
let push c (ell1 , ts1 ) (ell2 , ts2 ) =
246
- Printf. eprintf " [push] %s\n %!"
247
- (String. concat " " (List. map string_of_val_type ts1));
248
244
assert (ell1 = NoEllipses || ts2 = [] );
249
245
(if ell1 = Ellipses || ell2 = Ellipses then Ellipses else NoEllipses ),
250
246
ts2 @ ts1
@@ -895,14 +891,12 @@ and check_seq (c : context) (s : infer_result_type) (es : instr list)
895
891
s, []
896
892
897
893
| e ::es' ->
898
- Printf. eprintf " ---- %s%!" (Sexpr. to_string 80 (Arrange. instr e));
899
894
let {ins; outs}, xs = check_instr c e s in
900
895
check_seq (init_locals c xs) (push c outs (pop c ins s e.at)) es'
901
896
902
897
and check_block (c : context ) (es : instr list ) (it : instr_type ) at =
903
898
let InstrT (ts1, ts2, _xs) = it in
904
899
let s, xs' = check_seq c (stack ts1) es in
905
- Printf. eprintf " ---- end\n %!" ;
906
900
let s' = pop c (stack ts2) s at in
907
901
require (snd s' = [] ) at
908
902
(" type mismatch: block requires " ^ string_of_result_type ts2 ^
0 commit comments