-
Notifications
You must be signed in to change notification settings - Fork 0
/
libtest.ml
1537 lines (1500 loc) · 65.2 KB
/
libtest.ml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
open Assembly
open Compile
open Runner
open Printf
open OUnit2
open Pretty
open Errors
open Phases
open Exprs
open ExtLib
let rec take ls i =
match ls with
| [] -> []
| first :: rest ->
if i > 0
then first :: take rest (i - 1)
else []
;;
let check_name (name : string) : string =
if String.contains name ' '
then failwith (sprintf "Test name cannot contain ' ': %s" name)
else name
;;
let t name program expected = name>::test_run_strats ~skip_newline:true program name expected;;
let tcontains name program expected = name>::test_run ~args:[] Naive program name expected ~cmp:(fun check result ->
match check, result with
| Ok(a), Ok(b) -> (ExtLib.String.exists b (String.strip a))
| _ -> false
);;
let ti name program input expected = (check_name name)>::test_run ~skip_newline:true ~args:[] ~std_input:input Naive program name expected;;
let ta name program_and_env expected = name>::test_run_anf program_and_env name expected;;
let te name program expected_err = name>::test_err ~vg:false Naive program name expected_err;;
(* let t name program expected = name>::test_run_valgrind program name expected;; *)
let tanf name program expected = name>::fun _ ->
assert_equal expected (anf (tag (desugar program))) ~printer:string_of_aprogram;;
(* Transforms a program into ANF, and compares the output to expected *)
let tanf_improved (name : string) (program : string) (expected : string) = name>:: fun _ ->
assert_equal (expected ^ "\n") (string_of_aprogram (anf (tag (desugar (parse_string name program))))) ~printer:(fun s->s);
(* check_scope_helper (fun _-> "ignored") (parse_string name program) []; *)
;;
let teq name actual expected = name>::fun _ ->
assert_equal expected actual ~printer:(fun s -> s);;
(* Runs a program, given as the name of a file in the input/ directory, and compares its output to expected *)
let tprog (filename : string) (expected : string) = filename>::test_run_input filename Naive expected;;
(* Runs a program, given as the name of a file in the input/ directory, and compares its error to expected *)
let teprog (filename : string) (expected : string) = filename>::test_err_input filename Naive expected;;
let tdesugar (name : string) (program : string) (expected : string) = name>:: fun _ ->
assert_equal (expected ^ "\n") (string_of_program (desugar (parse_string name program))) ~printer:(fun s->s);;
let tgc name heap_size program input expected = name>::test_run ~skip_newline:true ~args:[string_of_int heap_size] ~std_input:input Naive program name expected;;
let tvgc name heap_size program input expected = name>::test_run_valgrind ~skip_newline:true ~args:[string_of_int heap_size] ~std_input:input Naive program name expected;;
let terr name program input expected = name>::test_err ~args:[] ~std_input:input Naive program name expected;;
let tgcerr name heap_size program input expected = name>::test_err ~args:[string_of_int heap_size] ~std_input:input Naive program name expected;;
let tvg name program expected = name>::test_run_valgrind ~skip_newline:true Naive program name expected;;
let teq_notstring name actual expected = (check_name name)>::fun _ ->
assert_equal expected actual;;
let teq_num name actual expected = (check_name name)>::fun _ ->
assert_equal expected actual ~printer:(fun d -> sprintf "%d" d);;
let tfvs name ignored program expected = name>::
(fun _ ->
let ast = parse_string name program in
let anfed = anf (tag ast) in
match anfed with
| AProgram(body, _) ->
let vars = free_vars body ignored in
let str_list_print strs = "[" ^ (ExtString.String.join ", " strs) ^ "]" in
assert_equal (List.sort vars) (List.sort expected) ~printer:str_list_print)
;;
let forty = "let x = 40 in x"
let fals = "let x = false in x"
let tru = "let x = true in x"
let create_ss (file : string) (start_l : int) (start_c : int) (end_l : int) (end_c : int) : sourcespan =
({pos_fname=file; pos_lnum=start_l; pos_bol=0; pos_cnum=start_c},
{pos_fname=file; pos_lnum=end_l; pos_bol=0; pos_cnum=end_c})
;;
let print_te (exns : exn list) : string =
String.concat "\n" (print_errors exns)
;;
let terr name program input expected = (check_name name)>::test_err ~args:[] ~std_input:input Naive program name expected
;;
let arg_envt_printer args =
("[" ^
(String.concat "; "
(List.map (fun (tag, name, v) -> sprintf "(%d, %s, %s)" tag name (arg_to_asm v))
args)) ^
"]")
;;
let list_library = "def link(first, rest):
(first, rest)
def generate_helper(n):
if n == 0: nil
else:
link(n, generate_helper(n - 1))
def append(l, l2):
if l == nil: l2
else:
link(l[0], append(l[1], l2))
def reverse(l):
if l == nil: nil
else:
append(reverse(l[1]), link(l[0], nil))
def generate(n):
reverse(generate_helper(n))
def map(f, l):
if l == nil: l
else: link(f(l[0]), map(f, l[1]))"
let builtins_size = 4 (* arity + 0 vars + codeptr + padding *) * (List.length Compile.native_fun_bindings)
let old_tests =
"old_unit_tests">:::
[
t "forty" forty "40";
t "fals" fals "false";
t "tru" tru "true";
t "add1" "add1(0)" "1";
t "add1_let" "let x = add1(0) in x" "1";
t "true" "true" "true";
t "false" "false" "false";
t "not_true" "!(true)" "false";
t "not_false" "!(false)" "true";
t "print" "print(40)" "4040";
t "print2" "let _ = print(40) in 40" "4040";
t "print3" "let x = print(40) in x" "4040";
t "print4" "let x = print(40) in print(x)" "404040";
t "isbool" "isbool(40)" "false";
t "isboolT" "isbool(true)" "true";
t "isnumT" "isnum(40)" "true";
t "isnum" "isnum(false)" "false";
t "isnum_highest" "isnum(4611686018427387903)" "true";
t "isnum_lowest" "isnum(-4611686018427387904)" "true";
t "plus1" "1 + 1" "2";
t "plus2" "-1 + 5" "4";
t "plus3" "1 + -5" "-4";
t "plus4" "-1 + -5" "-6";
t "minus1" "1 - 1" "0";
t "minus2" "-1 - 5" "-6";
t "minus3" "1 - -5" "6";
t "minus4" "-1 - -5" "4";
t "times1" "2 * 5" "10";
t "times2" "2 * -5" "-10";
t "times3" "-2 * 5" "-10";
t "times4" "-2 * -5" "10";
t "and0" "false && false" "false";
t "and1" "true && false" "false";
t "and2" "false && true" "false";
t "and3" "true && true" "true";
t "or0" "false || false" "false";
t "or1" "true || false" "true";
t "or2" "false || true" "true";
t "or3" "true || true" "true";
t "andSS" "false && 1" "false";
t "orSS" "true || 1" "true";
te "andE1" "1 && true" "expected a boolean, got 1";
te "andE2" "true && 1" "expected a boolean, got 1";
te "orE1" "1 || true" "expected a boolean, got 1";
te "orE2" "false || 1" "expected a boolean, got 1";
t "notIsbool" "!(isbool(40))" "true";
t "notIsboolT" "!(isbool(true))" "false";
t "notIsnumT" "!(isnum(40))" "false";
t "notIsnum" "!(isnum(false))" "true";
te "bool_instead_of_num" "add1(true)" "arithmetic expected a number, got true";
te "bool_instead_of_num_in_if" "add1(if true: false else: 5)" "arithmetic expected a number, got false";
te "bool_instead_of_num2" "sub1(false)" "arithmetic expected a number, got false";
te "num_instead_of_bool" "!(1)" "expected a boolean, got 1";
te "num_instead_of_bool_in_if" "!(if false: false else: 5)" "expected a boolean, got 5";
te "bool_instead_of_num3" "1 < true" "comparison expected a number, got true";
te "num_instead_of_bool2" "if (1): 1 else: 0" "expected a boolean, got 1";
t "if_short_circuits1" "add1(if true: 1 else: add1(false))" "2";
t "if_short_circuits2" "add1(if false: add1(false) else: 1)" "2";
t "greater1" "1 > 1" "false";
t "greater2" "2 > 1" "true";
t "greater3" "1 > 2" "false";
t "greaterEqual1" "1 >= 1" "true";
t "greaterEqual2" "2 >= 1" "true";
t "greaterEqual3" "1 >= 2" "false";
t "less1" "1 < 1" "false";
t "less2" "2 < 1" "false";
t "less3" "1 < 2" "true";
t "lessEqual1" "1 <= 1" "true";
t "lessEqual2" "2 <= 1" "false";
t "lessEqual3" "1 <= 2" "true";
t "equal1" "1 == 1" "true";
t "equal2" "2 == 1" "false";
t "equal3" "2 == 1" "false";
t "equal4" "true == true" "true";
t "equal5" "false == false" "true";
t "equal6" "false == true" "false";
t "equal7" "true == false" "false";
t "equal8" "8 == true" "false";
t "equal9" "false == 100" "false";
t "conditional_in_let" "let x = 1 == 1 in x == true" "true";
te "greaterE1" "1 > true" "comparison expected a number, got true";
te "greaterE2" "false > 1" "comparison expected a number, got false";
te "greaterEqE1" "1 >= false" "comparison expected a number, got false";
te "greaterEqE2" "true >= 1" "comparison expected a number, got true";
te "lessE1" "1 < true" "comparison expected a number, got true";
te "lessE2" "false < 1" "comparison expected a number, got false";
te "lessEqE1" "1 <= false" "comparison expected a number, got false";
te "lessEqE2" "true <= 1" "comparison expected a number, got true";
te "lessEqE2_in_if" "1 <= (if true: false else: 5)" "comparison expected a number, got false";
te "lessEqE2_in_if_in_let" "let x = 1 <= (if true: false else: 5) in x" "comparison expected a number, got false";
t "let_typing"
"let x = isnum(5 * add1(7)), y = (if x: isnum(x) else: 10) in if (x && y): 27 else: !(x && y)"
"true";
t "let_typing_not"
"!(let x = isnum(5 * add1(7)), y = (if x: isnum(x) else: 10) in if (x && y): 27 else: !(x && y))"
"false";
t "bangbang1" "!(!(true))" "true";
t "bangbang2" "!(!(false))" "false";
te "overflow_2^62_base"
"4611686018427387904"
"The number literal 4611686018427387904, used at <overflow_2^62_base, 1:0-1:19>, is not supported in this language";
te "overflow_-2^62_base"
"-4611686018427387905"
"The number literal -4611686018427387905, used at <overflow_-2^62_base, 1:0-1:20>, is not supported in this language";
te "overflow_2^62_plus_positive"
"4611686018427387903 + 1" "Integer overflow, got -4611686018427387904";
te "overflow_2^62_plus_negative"
"-4611686018427387904 + -1" "Integer overflow, got 4611686018427387903";
te "overflow_2^62_add1"
"add1(4611686018427387903)" "Integer overflow, got -4611686018427387904";
te "overflow_-2^62_minus_positive"
"4611686018427387903 - -1" "Integer overflow, got -4611686018427387904";
te "overflow_-2^62_minus_negative"
"-4611686018427387904 - 1" "Integer overflow, got 4611686018427387903";
te "overflow_-2^62_sub1"
"sub1(-4611686018427387904)" "Integer overflow, got 4611686018427387903";
te "overflow_2^61_times_positive_1"
"4611686018427387903 * 4" "Integer overflow, got -4";
te "overflow_2^61_times_positive_2"
"-4611686018427387903 * -4" "Integer overflow, got -4";
te "overflow_2^61_times_negative_1"
"4611686018427387903 * -4" "Integer overflow, got 4";
te "overflow_2^61_times_negative_2"
"-4611686018427387903 * 4" "Integer overflow, got 4";
t "add_large_numbers_1"
"4611686018427387903 + -4511686018427387903" "100000000000000000";
t "add_large_numbers_2"
"-4511686018427387903 + 4611686018427387903" "100000000000000000";
t "sub_large_numbers_1"
"4611686018427387903 - 4511686018427387903" "100000000000000000";
t "sub_large_numbers_2"
"4511686018427387903 - 4611686018427387903" "-100000000000000000";
t "mult_large_numbers_1"
"4294967296 * 1073741823" "4611686014132420608";
t "mult_large_numbers_2"
"1073741823 * 4294967296" "4611686014132420608";
t "mult_large_numbers_3"
"-4294967296 * 1073741823" "-4611686014132420608";
t "mult_large_numbers_4"
"1073741823 * -4294967296" "-4611686014132420608";
t "add1_large_number" "add1(4611686018427387902)" "4611686018427387903";
t "sub1_large_number" "sub1(-4611686018427387902)" "-4611686018427387903";
t "greater1_large_numbers" "4611686018427387903 > 4611686018427387903" "false";
t "greater2_large_numbers" "4611686018427387903 > 4511686018427387903" "true";
t "greater3_large_numbers" "4511686018427387903 > 4611686018427387903" "false";
t "greaterEqual1_large_numbers" "4611686018427387903 >= 4611686018427387903" "true";
t "greaterEqual2_large_numbers" "4611686018427387903 >= 4511686018427387903" "true";
t "greaterEqual3_large_numbers" "4511686018427387903 >= 4611686018427387903" "false";
t "less1_large_numbers" "4611686018427387903 < 4611686018427387903" "false";
t "less2_large_numbers" "4611686018427387903 < 4511686018427387903" "false";
t "less3_large_numbers" "4511686018427387903 < 4611686018427387903" "true";
t "lessEqual1_large_numbers" "4611686018427387903 <= 4611686018427387903" "true";
t "lessEqual2_large_numbers" "4611686018427387903 <= 4511686018427387903" "false";
t "lessEqual3_large_numbers" "4511686018427387903 <= 4611686018427387903" "true";
t "equal1_large_numbers" "4611686018427387903 == 4611686018427387903" "true";
t "equal2_large_numbers" "4611686018427387903 == 4511686018427387903" "false";
t "equal3_large_numbers" "4511686018427387903 == 4611686018427387903" "false";
t "equal4_large_numbers" "4611686018427387903 == true" "false";
t "equal5_large_numbers" "false == 4611686018427387903" "false";
t "equal6_large_numbers" "4611686018427387903 == -4611686018427387903" "false";
t "greater1_negatives" "-1 > -1" "false";
t "greater2_negatives" "-2 > -1" "false";
t "greater3_negatives" "-1 > -2" "true";
t "greaterEqual1_negatives" "-1 >= -1" "true";
t "greaterEqual2_negatives" "-2 >= -1" "false";
t "greaterEqual3_negatives" "-1 >= -2" "true";
t "less1_negatives" "-1 < -1" "false";
t "less2_negatives" "-2 < -1" "true";
t "less3_negatives" "-1 < -2" "false";
t "lessEqual1_negatives" "-1 <= -1" "true";
t "lessEqual2_negatives" "-2 <= -1" "true";
t "lessEqual3_negatives" "-1 <= -2" "false";
t "equal1_negatives" "-1 == -1" "true";
t "equal2_negatives" "-2 == -1" "false";
t "equal3_negatives" "-2 == -1" "false";
t "greater1_neg_pos" "-1 > 1" "false";
t "greater2_neg_pos" "1 > -1" "true";
t "greater3_neg_pos" "5 > -1" "true";
t "greater4_neg_pos" "-5 > 1" "false";
t "greater5_neg_pos" "1 > -5" "true";
t "greater6_neg_pos" "-1 > 5" "false";
t "greaterEqual1_neg_pos" "-1 >= 1" "false";
t "greaterEqual2_neg_pos" "1 >= -1" "true";
t "greaterEqual3_neg_pos" "5 >= -1" "true";
t "greaterEqual4_neg_pos" "-5 >= 1" "false";
t "greaterEqual5_neg_pos" "1 >= -5" "true";
t "greaterEqual6_neg_pos" "-1 >= 5" "false";
t "less1_neg_pos" "-1 < 1" "true";
t "less2_neg_pos" "1 < -1" "false";
t "less3_neg_pos" "5 < -1" "false";
t "less4_neg_pos" "-5 < 1" "true";
t "less5_neg_pos" "1 < -5" "false";
t "less6_neg_pos" "-1 < 5" "true";
t "lessEqual1_neg_pos" "-1 <= 1" "true";
t "lessEqual2_neg_pos" "1 <= -1" "false";
t "lessEqual3_neg_pos" "5 <= -1" "false";
t "lessEqual4_neg_pos" "-5 <= 1" "true";
t "lessEqual5_neg_pos" "1 <= -5" "false";
t "lessEqual6_neg_pos" "-1 <= 5" "true";
t "forty_one" "41" "41";
t "basic_let" "let a = 1 in a" "1";
t "if1" "if true: 4 else: 2" "4";
t "if2" "if false: 4 else: 2" "2";
t "multi_let" "let a = 1, b = a in b" "1";
t "let_in_let_in_if_it_1"
("if (let x = 5, y = (let shadow x = sub1(x), y = (add1(x) - 10) in y) in ((y + x) == 0)): " ^
"(let abcd = 10 in add1(abcd)) " ^
"else: (let x = 0, y = sub1(if isbool(x): x else: 1) in y)")
"11";
t "let_in_let_in_if_it_2"
("if (let x = 4, y = (let shadow x = sub1(x), y = (add1(x) - 10) in y) in ((y + x) >= 0)): " ^
"(let abcd = 10 in add1(abcd)) " ^
"else: (let x = 0, y = sub1(if (x == 1): x else: 1) in y)")
"0";
t "let_in_let_in_if_it_3"
("if (let x = 5, y = (let shadow x = sub1(x), y = (add1(x) - 10) in y) in ((y + x) < -5)): " ^
"(let abcd = 10 in add1(abcd)) " ^
"else: (let x = 1, y = sub1(if isnum(x): x else: 2) in y)")
"0";
t "let_in_let_in_if_it_4"
("if (let x = 4, y = (let shadow x = sub1(x), y = (add1(x) - 10) in y) in ((y + x) < -5)): " ^
"(let abcd = 10 in add1(abcd)) " ^
"else: (let x = 0, y = sub1(if (x == 0): x else: 1) in y)")
"-1";
t "negative"
"-1" "-1";
t "if_basic"
"if (0 == 0): 0 else: 1" "0";
t "complex_conditional_it_ft"
("(let x = (if ((5 - 10) > -4): sub1(5 + 5) else: sub1(6 * 2)) in " ^
"(let y = sub1(if true: x * sub1(3) else: add1(x) + 5) in sub1(x + y)))")
"31";
t "complex_conditional_it_tt"
("(let x = (if true: sub1(5 + 5) else: sub1(6 * 2)) in " ^
"(let y = sub1(if true: x * sub1(3) else: add1(x) + 5) in sub1(x + y)))")
"25";
t "complex_conditional_it_tf"
("(let x = (if true: sub1(5 + 5) else: sub1(6 * 2)) in " ^
"(let y = sub1(if false: x * sub1(3) else: add1(x) + 5) in sub1(x + y)))")
"22";
t "complex_conditional_it_ff"
("(let x = (if false: sub1(5 + 5) else: sub1(6 * 2)) in " ^
"(let y = sub1(if isbool(x * 1): x * sub1(3) else: add1(x) + 5) in sub1(x + y)))")
"26";
t "wrapped_let_and_if"
("((let x = 10, z = (let shadow x = (x + 1), y = (x * 2) in x - y), " ^
"y = (if isnum(z): 1 else: z) in (if (sub1(sub1(y)) == sub1(y)): z else: (z - y))) - " ^
"(if (let abcd = true in abcd): 11 else: -11))") "-23";
tanf_improved "let_in_prim"
"add1(let x = 5 in x)"
"(alet x = 5 in add1(x))";
tanf_improved "let_in_prim_with_eval"
"add1(let x = 5 in add1(x))"
"(alet x = 5 in (alet unary_7 = add1(x) in add1(unary_7)))";
tanf_improved "let_in_prim2_with_eval"
"add1(let x = 5 in (x + (let x = 2 in x)))"
"(alet x = 5 in (alet x = 2 in (alet binop_7 = (x + x) in add1(binop_7))))";
tanf_improved "let_in_let_in_if"
("if (let x = 5, y = (let x = sub1(x), y = (add1(x) - 10) in y) in (y + x)): " ^
"(let abcd = 10 in add1(abcd)) " ^
"else: (let x = 0, y = sub1(if x: x else: 1) in y)")
("(alet x = 5 in (alet x = sub1(x) in (alet unary_19 = add1(x) in (alet y = (unary_19 - 10) in (alet y = y in (alet binop_23 = (y + x) in (if binop_23: (alet abcd = 10 in add1(abcd)) else: (alet x = 0 in (alet if_40 = (if x: x else: 1) in (alet y = sub1(if_40) in y))))))))))");
tanf_improved "lets_in_prim"
"(let x = 1 in x) + (let x = 2 in x)"
"(alet x = 1 in (alet x = 2 in (x + x)))";
tanf_improved "if_in_if_in_let_in_add1"
"add1(let x = (if (if 0: 0 else: 1): 2 else: 3) in (if x: 4 else: 5))"
"(alet if_7 = (if 0: 0 else: 1) in (alet x = (if if_7: 2 else: 3) in (alet if_13 = (if x: 4 else: 5) in add1(if_13))))";
tanf_improved "simple_conditional"
"(let x = (if 1: 5 + 5 else: 6 * 2) in (let y = (if 0: x * 3 else: x + 5) in x + y))"
("(alet x = (if 1: (5 + 5) else: (6 * 2)) in (alet y = (if 0: (x * 3) else: (x + 5)) in (x + y)))");
tanf_improved "complex_conditional"
("(let x = (if (5 - 10): add1(5 + 5) else: sub1(6 * 2)) in " ^
"(let y = sub1(if (x * 0): x * sub1(3) else: add1(x) + 5) in sub1(x + y)))"
)
("(alet binop_6 = (5 - 10) in (alet x = (if binop_6: (alet binop_10 = (5 + 5) in add1(binop_10)) else: (alet binop_14 = (6 * 2) in sub1(binop_14))) in (alet binop_22 = (x * 0) in (alet if_21 = (if binop_22: (alet unary_27 = sub1(3) in (x * unary_27)) else: (alet unary_30 = add1(x) in (unary_30 + 5))) in (alet y = sub1(if_21) in (alet binop_34 = (x + y) in sub1(binop_34)))))))");
tanf_improved "expr_basic"
("def f() : 1\n1")
("(aletrec f = (lam() 1) in 1)");
tanf_improved "expr_call"
("def f() : 1\nf()")
("(aletrec f = (lam() 1) in (f()))");
tanf_improved "expr_call_w_imm_args"
("def f(a, b) : 1\n(f(1, 2))")
("(aletrec f = (lam(a, b) 1) in (f(1, 2)))");
tanf_improved "multiple_expr_call_w_multiple_compound_args"
("def f(a, b) : 1\ndef g(a, b, c) : a == b\nlet c = f(add1(1), add1(1)), d = g(add1(2), add1(3), 4 + 3) in d")
("(aletrec f = (lam(a, b) 1) in (aletrec g = (lam(a, b, c) (a == b)) in (alet unary_23 = add1(1) in (alet unary_25 = add1(1) in (alet c = (f(unary_23, unary_25)) in (alet unary_32 = add1(2) in (alet unary_34 = add1(3) in (alet binop_36 = (4 + 3) in (alet d = (g(unary_32, unary_34, binop_36)) in d)))))))))");
tanf_improved "expr_within_expr"
("def f(a) : a\ndef g(b) : add1(b)\nf(g(1))")
("(aletrec f = (lam(a) a) in (aletrec g = (lam(b) add1(b)) in (alet app_16 = (g(1)) in (f(app_16)))))");
tanf_improved "expr_within_expr_within_expr"
("def f(a) : a\ndef g(b) : add1(b)\ndef h(b) : b\nh(f(g(1)))")
("(aletrec f = (lam(a) a) in (aletrec g = (lam(b) add1(b)) in (aletrec h = (lam(b) b) in (alet app_23 = (g(1)) in (alet app_22 = (f(app_23)) in (h(app_22)))))))");
tanf_improved "infinite_loop_anf"
("def f(a) : g(a)\ndef g(a) : f(a)\ng(1)")
("(aletrec f = (lam(a) (g(a))) in (aletrec g = (lam(a) (f(a))) in (g(1))))");
te "basic" "f()" "The identifier f, used at <basic, 1:0-1:1>, is not in scope";
te "dup_fun"
"def test(): 1
def test(): 2
test()"
(print_te
[DuplicateFun("test",
(create_ss "dup_fun" 2 0 2 13),
(create_ss "dup_fun" 1 0 1 13))]);
te "dup_binds_fun"
"def test(x, x): x
test(1, 2)"
(print_te
[DuplicateId("x",
create_ss "dup_binds_fun" 1 12 1 13,
create_ss "dup_binds_fun" 1 9 1 10)]);
te "unbound_id"
"def test(): x test()"
(print_te [UnboundId("x", create_ss "unbound_id" 1 12 1 13)]);
te "dup_binds_let"
"let x = 5, x = 6 in x"
(print_te
[DuplicateId("x",
(create_ss "dup_binds_let" 1 11 1 12),
(create_ss "dup_binds_let" 1 4 1 5))]);
te "unbound_fun"
"test()"
"The identifier test, used at <unbound_fun, 1:0-1:4>, is not in scope";
tcontains "function_as_arg"
"def a(b):
b
def b(a):
a
b(a)"
"function";
te "let_call"
"let a = 1 in a(1)"
"tried to call a non-closure value: 1";
te "arity_less"
"def test(x): x test()"
"expected an arity of 1, but received 0 arguments";
te "arity_more"
"def test(x, y): x + y test(1)"
"expected an arity of 2, but received 1 arguments";
te "arity_and_dup_correct"
"def test(x): x def test(x, y): x + y test(1)"
(print_te
[DuplicateFun("test",
(create_ss "arity_and_dup_correct" 1 15 1 36),
(create_ss "arity_and_dup_correct" 1 0 1 14))]);
te "arity_and_dup_incorrect"
"def test(x, y): x + y def test(x): x test(1)"
(print_te
[DuplicateFun("test",
(create_ss "arity_and_dup_incorrect" 1 22 1 36),
(create_ss "arity_and_dup_incorrect" 1 0 1 21));
Arity(2, 1, create_ss "arity_and_dup_incorrect" 1 37 1 44)];);
te "overflow"
"4611686018427387904"
(print_te [Overflow(4611686018427387904L,
(create_ss "overflow" 1 0 1 19))]);
te "underflow"
"-4611686018427387905"
(print_te [Overflow(-4611686018427387905L,
(create_ss "underflow" 1 0 1 20))]);
t "ocsh_dup"
"def our_code_starts_here():
5
our_code_starts_here()"
"5";
te "func_invalid_bind"
"def test(1):
1
test(2)"
(print_te [ParseError("Parse error at line 1, col 10: token `1`")]);
te "nested_errors"
"def test(abc):
if add1(a * b):
a
else:
b
let a = test(1, a) in hello(b)"
(print_te [
UnboundId("a", create_ss "nested_errors" 2 14 2 15);
UnboundId("b", create_ss "nested_errors" 2 18 2 19);
UnboundId("a", create_ss "nested_errors" 3 8 3 9);
UnboundId("b", create_ss "nested_errors" 5 8 5 9);
Arity(1, 2, create_ss "nested_errors" 6 12 6 22);
UnboundId("a", create_ss "nested_errors" 6 20 6 21);
UnboundId("hello", create_ss "nested_errors" 6 26 6 31);
UnboundId("b", create_ss "nested_errors" 6 32 6 33);
]);
t "call_func"
"def double_print(val):
print(print(val))
double_print(123)"
"123123123";
t "recursion"
"def print_dec(x):
if x <= 0:
print(0)
else:
print_dec(sub1(print(x)))
print_dec(7)"
"765432100";
t "recursion-2"
"def print_dec(x):
if x <= 0:
0
else:
print_dec(sub1(x))
print_dec(7)"
"0";
t "if_print_stmts"
"if print(true): print(true) else: print(false)"
"truetruetrue";
t "mutually_recursive"
"def abs_dec(num):
if num == 0:
0
else:
if num < 0:
num + 1
else:
num - 1
def t1(print_neg, num):
if print_neg:
t2(print(num * -1))
else:
t2(print(num))
and def t2(val):
let dec_num = abs_dec(val) in
if dec_num == 0:
val > 0
else:
let neg = t1(true, dec_num),
pos = t1(false, dec_num) in
neg || pos
t1(false, 4)"
"4-32-11-21-13-21-12-11true";
te "eventual_error"
"def abs_dec(num):
if num == 0:
0
else:
if num < 0:
num + 1
else:
num - 1
def t1(print_neg, num):
if print_neg:
t2(print(num * -1))
else:
t2(print(num))
and def t2(val):
let dec_num = abs_dec(val) in
if dec_num == 0:
0
else:
let neg = t1(true, dec_num),
pos = t1(false, dec_num)
in neg && pos
t1(false, 4)"
"expected a boolean, got 0";
t "reuse_reg_args_not_tail_recursive"
"def f1(b, n):
let x = print(b),
y = print(n) in
isnum(n) && isbool(b)
&& isnum(y) && isbool(x)
and def f2(n, b):
let x = print(f1(b, n)),
y = print(n),
z = print(b) in
x && isnum(y) && isbool(z)
&& isnum(n) && isbool(b)
f2(5, false)"
"false5true5falsetrue";
t "mutual_recursion_swap_args_and_counter"
"def f1(b, n, i):
if i == 10:
isbool(b) && isnum(n)
else:
let a = print(i) in
f2(n, b, i + 1)
and def f2(n, b, i):
f1(b, n, i)
f2(5, false, 0)"
"0123456789true";
tvg "valgrind_mutual"
"def f1(b, n, i):
if i == 10:
isbool(b) && isnum(n)
else:
let a = print(i) in
f2(n, b, i + 1)
and def f2(n, b, i):
f1(b, n, i)
f2(5, false, 0)"
"0123456789true";
tvg "valgrind_swap_tail_recursive"
"def f1(a, b, c, i):
if (a == 10) && (b == a) && (c == a):
i
else:
if (a > 10) || (b > 10) || (c > 10):
let x = print(a),
y = print(b),
z = print(c) in
print(print(i) || 2)
else:
f1(b, c, a + 1, i + 1)
f1(0, 0, 0, 0)"
"30";
te "function_def_in_let"
"def run(val):
let shadow run = val in print(run)
let shadow run = 5 in run(run)"
"tried to call a non-closure value: 5";
t "short_circuit_def_1"
"def run(run): print(run)
false && run(6)"
"false";
t "short_circuit_def_2"
"def run(run): print(run)
true || run(6)"
"true";
t "short_circuit_and"
"false && print(6)"
"false";
t "short_circuit_or"
"true || print(6)"
"true";
t "short_circuit_let_and"
"let x = print(6) in false && x"
"6false";
t "short_circuit_let_or"
"let x = print(6) in true || x"
"6true";
t "short_circuit_def_and"
"def run(run): print(run)
false && run(6)"
"false";
t "short_circuit_def_or"
"def run(run): print(run)
true || run(6)"
"true";
"get_func_call_params_1">::(fun _ ->
assert_equal [] (get_func_call_params [] [] 0)
~printer:arg_envt_printer);
"get_func_call_params_2">::(fun _ ->
assert_equal [(0, "first", Reg(RDI))] (get_func_call_params ["first"] [] 0)
~printer:arg_envt_printer);
"get_func_call_params_3">::(fun _ ->
assert_equal [
(0, "1", Reg(RDI));
(0, "2", Reg(RSI));
(0, "3", Reg(RDX));
(0, "4", Reg(RCX));
(0, "5", Reg(R8));
(0, "6", Reg(R9));
] (get_func_call_params
["1"; "2"; "3"; "4"; "5"; "6"] [] 0)
~printer:arg_envt_printer);
"get_func_call_params_4">::(fun _ ->
assert_equal [
(0, "1", Reg(RDI));
(0, "2", Reg(RSI));
(0, "3", Reg(RDX));
(0, "4", Reg(RCX));
(0, "5", Reg(R8));
(0, "6", Reg(R9));
(0, "7", RegOffset(16, RBP));
] (get_func_call_params
["1"; "2"; "3"; "4"; "5"; "6"; "7"] [] 0)
~printer:arg_envt_printer);
"get_func_call_params_5">::(fun _ ->
assert_equal [
(0, "1", Reg(RDI));
(0, "2", Reg(RSI));
(0, "3", Reg(RDX));
(0, "4", Reg(RCX));
(0, "5", Reg(R8));
(0, "6", Reg(R9));
(0, "7", RegOffset(16, RBP));
(0, "8", RegOffset(24, RBP));
(0, "9", RegOffset(32, RBP));
]
(get_func_call_params
["1"; "2"; "3"; "4"; "5"; "6"; "7"; "8"; "9"] [] 0)
~printer:arg_envt_printer);
tdesugar "desugar_and"
"true && false"
"\n(if true: (if false: true else: false) else: false)";
tdesugar "desugar_or"
"true || false"
"\n(if true: true else: (if false: true else: false))";
tdesugar "desugar_nested_or"
"true || true || false"
"\n(if (if true: true else: (if true: true else: false)): true else: (if false: true else: false))";
tdesugar "desugar_nested_and"
"true && true && false"
"\n(if (if true: (if true: true else: false) else: false): (if false: true else: false) else: false)";
tdesugar "desugar_print"
"true || print(1)"
"\n(if true: true else: (if print(1): true else: false))";
terr "wf_tuple" "(a, 1, 2, 3)" "" "The identifier a, used at <wf_tuple, 1:1-1:2>, is not in scope";
terr "wf_tuple_in_tuple" "((a,), 1, 2, 3)" "" "The identifier a, used at <wf_tuple_in_tuple, 1:2-1:3>, is not in scope";
terr "wf_tuple_get" "(a, 1, 2, 3)[0]" "" "The identifier a, used at <wf_tuple_get, 1:1-1:2>, is not in scope";
terr "wf_tuple_get_arg" "(1, 2, 3)[a]" "" "The identifier a, used at <wf_tuple_get_arg, 1:10-1:11>, is not in scope";
terr "wf_tuple_set" "(a, 1, 2, 3)[0] := 0" "" "The identifier a, used at <wf_tuple_set, 1:1-1:2>, is not in scope";
terr "wf_tuple_set_arg" "(1, 2, 3)[a] := 0" "" "The identifier a, used at <wf_tuple_set_arg, 1:10-1:11>, is not in scope";
terr "wf_tuple_set_set" "(1, 2, 3)[0] := a" "" "The identifier a, used at <wf_tuple_set_set, 1:16-1:17>, is not in scope";
te "wf_rebind_fun" "def a(): true\nand def a(): true\n1" (print_te
[DuplicateFun("a",
(create_ss "wf_rebind_fun" 2 4 2 17),
(create_ss "wf_rebind_fun" 1 0 1 13))]);
terr "wf_sequence_1" "a; a" "" "The identifier a, used at <wf_sequence_1, 1:0-1:1>, is not in scope\nThe identifier a, used at <wf_sequence_1, 1:3-1:4>, is not in scope";
te "wf_let_tuple_repeats" "let (a, a) = (1, 2) in true"
(print_te
[DuplicateId("a",
(create_ss "wf_let_tuple_repeats" 1 8 1 9),
(create_ss "wf_let_tuple_repeats" 1 5 1 6))]);
te "wf_let_tuple_repeats_non_tuple" "let (a, b) = (1, 2), a = true in true"
(print_te
[DuplicateId("a",
(create_ss "wf_let_tuple_repeats_non_tuple" 1 21 1 22),
(create_ss "wf_let_tuple_repeats_non_tuple" 1 5 1 6))]);
te "wf_let_tuple_repeats_nested" "let (a, (b, a)) = (1, (2, 3)) in true"
(print_te
[DuplicateId("a",
(create_ss "wf_let_tuple_repeats_nested" 1 12 1 13),
(create_ss "wf_let_tuple_repeats_nested" 1 5 1 6))]);
te "wf_let_nested_tuple_repeats_non_tuple" "let (c, (b, a)) = (1, (2, 3)), b = true in true"
(print_te
[DuplicateId("b",
(create_ss "wf_let_nested_tuple_repeats_non_tuple" 1 31 1 32),
(create_ss "wf_let_nested_tuple_repeats_non_tuple" 1 9 1 10))]);
tdesugar "desugar_seq_basic"
"true; false"
"\n(let _ = true in false)";
tdesugar "desugar_seq_nested"
"true; false; true"
"\n(let _ = true in (let _ = false in true))";
tdesugar "desugar_seq_complex"
"true; true && true; true"
"\n(let _ = true in (let _ = (if true: (if true: true else: false) else: false) in true))";
tdesugar "desugar_destructure_basic"
"let (a, b, c) = (1, 2, 3) in (a, b, c)"
"\n(let tup_1 = (1, 2, 3), _ = (tup_1 check_size 3), a = tup_1[0], b = tup_1[1], c = tup_1[2] in (a, b, c))";
tdesugar "desugar_destructure_nested"
"let (a, (b, c), d) = (1, (2, 3), 4) in (a, (b, c), d)"
"\n(let tup_1 = (1, (2, 3), 4), _ = (tup_1 check_size 3), a = tup_1[0], tup_2 = tup_1[1], _ = (tup_2 check_size 2), b = tup_2[0], c = tup_2[1], d = tup_1[2] in (a, (b, c), d))";
tdesugar "desugar_destructure_nested_w_blanks"
"let (a, (b, _), _) = (1, (2, 3), 4) in (a, (b, c), d)"
"\n(let tup_1 = (1, (2, 3), 4), _ = (tup_1 check_size 3), a = tup_1[0], tup_2 = tup_1[1], _ = (tup_2 check_size 2), b = tup_2[0] in (a, (b, c), d))";
tdesugar "desugar_decl_with_destructure"
"def f((a, b), c): ((a, b), c)\nf((1, 2), 3)"
"\n(let-rec f = (lam(argtup_1, c) (let _ = (argtup_1 check_size 2), a = argtup_1[0], b = argtup_1[1] in ((a, b), c))) in (?f((1, 2), 3)))";
tdesugar "desugar_decl_with_destructure_and_blank"
"def f((a, _), c): ((a,), c)\nf((1, 2), 3)"
"\n(let-rec f = (lam(argtup_1, c) (let _ = (argtup_1 check_size 2), a = argtup_1[0] in ((a,), c))) in (?f((1, 2), 3)))";
tdesugar "desugar_destructure_not_nested"
"let (a, b, c) = (1, (2, 3), ()) in (a, b, c)"
"\n(let tup_1 = (1, (2, 3), ()), _ = (tup_1 check_size 3), a = tup_1[0], b = tup_1[1], c = tup_1[2] in (a, b, c))";
tanf_improved "tuple"
("(1, 2, 3)")
("(1, 2, 3)");
tanf_improved "get_tuple"
("(1, 2, 3)[0]")
("(alet tup_4 = (1, 2, 3) in tup_4[0])");
tanf_improved "set_tuple"
("(1, 2, 3)[0] := 2")
("(alet tup_5 = (1, 2, 3) in tup_5[0] := 2 )");
ti "empty_pair" "()" "" "()";
ti "single_pair" "(5,)" "" "(5, )";
ti "double_pair" "(5, 6)" "" "(5, 6)";
ti "long_pair" "(5, 6, 7, 8, 9, 10, 100)" "" "(5, 6, 7, 8, 9, 10, 100)";
ti "tuple_within_tuple" "((5, 6), (7, 8))" "" "((5, 6), (7, 8))";
ti "tuple_within_tuple_2" "((5, 6), (7, 8, 9))" "" "((5, 6), (7, 8, 9))";
ti "tuple_within_tuple_3" "((5, 6, 9), (7, 8))" "" "((5, 6, 9), (7, 8))";
ti "tuple_within_tuple_complex" "((5, 6, (7, 8, (9, 10, (11, (12, 13)))), 14), (15, 16))" ""
"((5, 6, (7, 8, (9, 10, (11, (12, 13)))), 14), (15, 16))";
ti "expr_within_tuple" "(1 + 1, 2)" ""
"(2, 2)";
ti "expr_within_tuple_2" "(1 + 1, add1(2))" ""
"(2, 3)";
ti "print_within_tuple" "(print(2), add1(2))" ""
"2(2, 3)";
ti "print_of_tuple_within_tuple" "(print((2, 3)), add1(2))" ""
"(2, 3)((2, 3), 3)";
ti "get_value_from_tuple_0" "(1, 2, 3, 4, 5)[0]" "" "1";
ti "get_value_from_tuple_1" "(1, 2, 3, 4, 5)[1]" "" "2";
ti "get_value_from_tuple_2" "(1, 2, 3, 4, 5)[2]" "" "3";
ti "get_value_from_tuple_3" "(1, 2, 3, 4, 5)[3]" "" "4";
ti "get_value_from_tuple_4" "(1, 2, 3, 4, 5)[4]" "" "5";
ti "get_value_from_tuple_5_tuple" "(1, (1, 2, 3), 3, 4, 5)[1]" "" "(1, 2, 3)";
ti "get_value_from_tuple_expr" "(1, 2, 3, 4, 5)[add1(3)]" "" "5";
ti "get_value_from_tuple_expr2" "(1, 2, 3, 4, 5)[sub1(1)]" "" "1";
terr "get_value_from_tuple_low_idx" "(1, 2, 3, 4, 5)[-1]" "" "index too small to get, got -1";
terr "get_value_from_tuple_low_idx_expr" "(1, 2, 3, 4, 5)[sub1(0)]" "" "index too small to get, got -1";
terr "get_value_from_tuple_high_idx" "(1, 2, 3, 4, 5)[5]" "" "index too large to get, got 5";
terr "get_value_from_tuple_high_idx_expr" "(1, 2, 3, 4, 5)[add1(4)]" "" "index too large to get, got 5";
terr "tuple_access_wrong_type" "1[5]" "" "get expected tuple, got 1";
terr "tuple_access_idx_wrong_type" "(1, 2)[true]" "" "get tuple not number";
ti "nil_list_1" "(1, nil)" "" "(1, nil)";
ti "nil_list_2" "(1, (2, nil))" "" "(1, (2, nil))";
terr "tuple_access_idx_wrong_type_nil_access" "nil[true]" "" "tried to access component of nil";
terr "tuple_access_idx_wrong_type_nil_idx" "(1, 2)[nil]" "" "get tuple not number";
ti "get_value_from_tuple_0_set" "(1, 2, 3, 4, 5)[0] := 3" "" "3";
ti "get_value_from_tuple_4_set" "(1, 2, 3, 4, 5)[4] := 3" "" "3";
ti "get_value_from_tuple_expr_set" "(1, 2, 3, 4, 5)[add1(3)] := 3" "" "3";
ti "get_value_from_tuple_expr2_set" "(1, 2, 3, 4, 5)[sub1(1)] := 3" "" "3";
ti "get_value_from_tuple_expr2_set_tuple" "(1, 2, 3, 4, 5)[sub1(1)] := (1, 2, 3)" "" "(1, 2, 3)";
ti "unchanged_modify_new_tuples" "print((1, 2, 3, 4, 5)); (1, 2, 3, 4, 5)[sub1(1)] := (1, 2, 3); (1, 2, 3, 4, 5)" "" "(1, 2, 3, 4, 5)(1, 2, 3, 4, 5)";
terr "get_value_from_tuple_low_idx_set" "(1, 2, 3, 4, 5)[-1] := 3" "" "index too small to get, got -1";
terr "get_value_from_tuple_low_idx_expr_set" "(1, 2, 3, 4, 5)[sub1(0)] := 3" "" "index too small to get, got -1";
terr "get_value_from_tuple_high_idx_set" "(1, 2, 3, 4, 5)[5] := 3" "" "index too large to get, got 5";
terr "get_value_from_tuple_high_idx_expr_set" "(1, 2, 3, 4, 5)[add1(4)] := 3" "" "index too large to get, got 5";
terr "tuple_access_wrong_type_set" "1[5] := 3" "" "get expected tuple, got 1";
terr "tuple_access_idx_wrong_type_set" "(1, 2)[true] := 3" "" "get tuple not number";
terr "tuple_unary_type" "add1((1, 2))" "" "arithmetic expected a number, got (1, 2)";
terr "tuple_binary_type_l" "(1, 2) + 1" "" "arithmetic expected a number, got (1, 2)";
terr "tuple_binary_type_r" "1 + (1, 2)" "" "arithmetic expected a number, got (1, 2)";
ti "equality_ref" "(1, 2, 3) == (1, 2, 3)" "" "false";
ti "equality_ref_true" "let x = (1, 2, 3) in x == x" "" "true";
ti "equality_equal_ref" "let x = (1, 2, 3) in equal(x, x)" "" "true";
ti "equality_equal_structural" "equal((1, 2, 3), (1, 2, 3))" "" "true";
ti "equality_equal_structural_nest" "equal(((1, 2, 3), 2, 3), ((1, 2, 3), 2, 3))" "" "true";
ti "equality_equal_structural_prims" "equal(((add1(1), 2, 3), 2, 3), ((2, 2, 3), 2, 3))" "" "true";
ti "equality_notequal_structural_prims" "equal(((add1(1), 2, 3), 2, 3), ((2, 2, 4), 2, 3))" "" "false";
(* ti "equality_equal_infinite_loop" "let f = (1,), g = (f,) in f[0] := g; equal(f, g)" "" "true"; *)
ti "equality_notequal_infinite_loop" "let f = (1,), g = (f, 1) in f[0] := g; equal(f, g)" "" "false";
ti "istuple_tuple" "istuple((1, 2, 3))" "" "true";
ti "istuple_nil" "istuple(())" "" "true";
ti "istuple_num" "istuple(5)" "" "false";
ti "istuple_bool" "istuple(false)" "" "false";
ti "isbool_tuple" "isbool((1, 2))" "" "false";
ti "isbool_nil" "isbool(())" "" "false";
ti "isnum_tuple" "isnum((1, 2))" "" "false";
ti "isnum_nil" "isnum(())" "" "false";
ti "input1" "let x = tonum(input()) in x + 2" "123" "125";
ti "input_print_int" "print(input())" "5" "55";
ti "tup1" "let t = (4, (5, 6)) in
t[0] := 7;
t" "" "(7, (5, 6))";
ti "tup2" "let t = (4, (5, nil)) in
begin
t[1] := nil;
t
end" "" "(4, nil)";
ti "tup_cycle" "let t = (4, (5, nil)) in
begin
t[1] := t;
t
end" "" "(4, <cyclic tuple 1>)";
ti "tup_cycle_bigger" "let t = (4, (5, nil)), g = (t, 5), h = (g, 6), k = (10, h) in
begin
t[1] := k;
(t, g, h, k)
end" ""
"((4, (10, ((<cyclic tuple 2>, 5), 6))), ((4, (10, (<cyclic tuple 6>, 6))), 5), (((4, (10, <cyclic tuple 10>)), 5), 6), (10, (((4, <cyclic tuple 14>), 5), 6)))";
ti "infinite_loop" "let t = (1,), g = (t,) in
begin
t[0] := g;
(t, g)
end" "" "(((<cyclic tuple 2>, ), ), ((<cyclic tuple 4>, ), ))";
ti "infinite_loop_is_tuple" "let t = (1,), g = (t,) in
begin
t[0] := g;
istuple(t)
end" "" "true";
ti "nil_is_tuple" "istuple(nil)" "" "true";
ti "tup4" "let t = (4, 6) in
(t, t)"
""
"((4, 6), (4, 6))";
ti "tuple_empty_access" "((),)[0]" "" "()";
terr "tuple_destructure_invalid" "let temp = (1, 2), (a, b, c) = temp in true"
"" "unable to destructure tuple with incorrect length, got (1, 2)";
terr "tuple_destructure_invalid_2" "let (a, b) = (1, 2, 3) in (a, b)" "" "";
terr "tuple_destructure_invalid_3" "let temp = (1, 2, 3), (a, b) = temp in (a, b)" "" "";
ti "let_blank" "let _ = print(5 * 5) in print(3)" "" "2533";
ti "tuple_modification"
"let t = (1, 2, 3, 4),
a = t[1],
b = t[1] := t[a],
_ = t[0] := a in
print(t); print(a); print(b)" ""
"(2, 3, 3, 4)233";
ti "tuple_double_modify"
"let t = (1, 2, 3, 4) in
t[0] := t[1];
t[1] := t[0];
t" ""
"(2, 2, 3, 4)";
ti "destructure_basic"
"let (a, b, c) = (1, 2, 3) in (a, c, b)"
""
"(1, 3, 2)";
ti "destructure_complex"
"let (a, b, (c, d), e) = (1, 2, (3, 4), 5) in (a, b, (d, c), e)"
""
"(1, 2, (4, 3), 5)";
ti "destructure_expr"
"let (a, b, (c, d), e) = (1, 2, (add1(3), add1(4)), 5) in (a, b, (d, c), e)"
""
"(1, 2, (5, 4), 5)";
ti "destructure_print"
"let (a, _, c) = (1, print(2), 5) in (a, c)"
""
"2(1, 5)";
ti "destructure_print_nested"
"let (a, (b, _), c) = (1, (2, print(2)), 5) in (a, c)"
""
"2(1, 5)";
ti "destructure_not_nested"
"let (a, b, c, d) = (1, (2, 3), (4, 5, 6), ()) in
print(a); print(b); print(c); d"
""
"1(2, 3)(4, 5, 6)()";
ti "let_empty_pair"
"let a = () in a"
""
"()";
ti "let_empty_pair_pair"
"let a = ((), ()) in a[0]"
""
"()";
ti "print_cyclic_tuple_1"
"let a = (1, nil) in
a[1] := a; a"
""
"(1, <cyclic tuple 1>)";
ti "print_cyclic_tuple_2"
"let a = (1, nil, 3),
b = (a, 2, 3) in
a[1] := b; print(b); a"
""
"((1, <cyclic tuple 1>, 3), 2, 3)(1, (<cyclic tuple 3>, 2, 3), 3)";
ti "print_cyclic_tuple_3"
"let a = (nil, nil, nil),
b = (nil, nil, a),
c = (nil, a, b) in
a[0] := a; a[1] := b; a[2] := c;
b[0] := b; b[1] := c;
c[0] := c;
a"
""
"(<cyclic tuple 1>, (<cyclic tuple 2>, (<cyclic tuple 3>, <cyclic tuple 1>, <cyclic tuple 2>), <cyclic tuple 1>), (<cyclic tuple 4>, <cyclic tuple 1>, (<cyclic tuple 5>, <cyclic tuple 4>, <cyclic tuple 1>)))";
ti "deep_equal"
"let a = (nil, nil, 1),
b = (a, nil, 1) in
a[0] := a; a[1] := b;
b[1] := b;
equal(a, b)"
""
"true";
ti "deep_equal_tuple_len"
"equal((1, 2, 3, (4, 5)), (1, 2, 3, (4, 5, 6)))"
""
"false";
ti "deep_equal_tuple_values"
"equal((1, 2, 3, (4, 5)), (1, 2, 3, (4, 4)))"
""