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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
open Tools
module M = Michelson
type stack1 = M.type_ [@@deriving show {with_path = false}]
type arg1 = [
| `Int of int
| `Code of M.code list
| `Type of M.type_
]
type stack = stack1 list [@@deriving show {with_path = false}]
type args = arg1 list
type s_Int = SInt
type s_Code = SCode
type s_Type = SType
type _ targ1 =
| TInt : int -> s_Int targ1
| TCode : M.code list -> s_Code targ1
| TType : M.type_ -> s_Type targ1
exception MichelsonTypingError
module Ty : sig
val check_eq : stack1 -> stack1 -> unit
val check_address : stack1 -> unit
val check_bls12_381_g1 : stack1 -> unit
val check_bls12_381_g2 : stack1 -> unit
val check_bool : stack1 -> unit
val check_bytes : stack1 -> unit
val check_contract : stack1 -> stack1
val check_int : stack1 -> unit
val check_key : stack1 -> unit
val check_key_hash : stack1 -> unit
val check_lambda : stack1 -> stack1 * stack1
val check_list : stack1 -> stack1
val check_mutez : stack1 -> unit
val check_nat : stack1 -> unit
val check_option : stack1 -> stack1
val check_or : stack1 -> stack1 * stack1
val check_pair : stack1 -> stack1 * stack1
val check_set : stack1 -> stack1
val check_sapling_tx : stack1 -> int
val check_sapling_st : stack1 -> int
val check_signature : stack1 -> unit
val check_ticket : stack1 -> stack1
end = struct
let check_eq (ty1 : stack1) (ty2 : stack1) =
if not (M.cmp_type ty1 ty2) then
raise MichelsonTypingError
let check_address (ty : stack1) =
match ty.node with
| M.Taddress -> ()
| _ -> raise MichelsonTypingError
let check_bls12_381_g1 (ty : stack1) =
match ty.node with
| M.Tbls12_381_g1 -> ()
| _ -> raise MichelsonTypingError
let check_bls12_381_g2 (ty : stack1) =
match ty.node with
| M.Tbls12_381_g2 -> ()
| _ -> raise MichelsonTypingError
let check_bool (ty : stack1) =
match ty.node with
| M.Tbool -> ()
| _ -> raise MichelsonTypingError
let check_bytes (ty : stack1) =
match ty.node with
| M.Tbytes -> ()
| _ -> raise MichelsonTypingError
let check_contract (ty : stack1) =
match ty.node with
| M.Tcontract ty -> ty
| _ -> raise MichelsonTypingError
let check_int (ty : stack1) =
match ty.node with
| M.Tint -> ()
| _ -> raise MichelsonTypingError
let check_key (ty : stack1) =
match ty.node with
| M.Tkey -> ()
| _ -> raise MichelsonTypingError
let check_key_hash (ty : stack1) =
match ty.node with
| M.Tkey_hash -> ()
| _ -> raise MichelsonTypingError
let check_lambda (ty : stack1) =
match ty.node with
| M.Tlambda (dom, codom) -> (dom, codom)
| _ -> raise MichelsonTypingError
let check_list (ty : stack1) =
match ty.node with
| M.Tlist ty -> ty
| _ -> raise MichelsonTypingError
let check_mutez (ty : stack1) =
match ty.node with
| M.Tmutez -> ()
| _ -> raise MichelsonTypingError
let check_nat (ty : stack1) =
match ty.node with
| M.Tnat -> ()
| _ -> raise MichelsonTypingError
let check_or (ty : stack1) =
match ty.node with
| M.Tor (tyl, tyr) -> (tyl, tyr)
| _ -> raise MichelsonTypingError
let check_option (ty : stack1) =
match ty.node with
| M.Toption ty -> ty
| _ -> raise MichelsonTypingError
let check_pair (ty : stack1) =
match ty.node with
| M.Tpair (ty1, ty2) -> (ty1, ty2)
| _ -> raise MichelsonTypingError
let check_sapling_tx (ty : stack1) =
match ty.node with
| M.Tsapling_transaction ms -> ms
| _ -> raise MichelsonTypingError
let check_sapling_st (ty : stack1) =
match ty.node with
| M.Tsapling_state ms -> ms
| _ -> raise MichelsonTypingError
let check_set (ty : stack1) =
match ty.node with
| M.Tset ty -> ty
| _ -> raise MichelsonTypingError
let check_signature (ty : stack1) =
match ty.node with
| M.Tsignature -> ()
| _ -> raise MichelsonTypingError
let check_ticket (ty : stack1) =
match ty.node with
| M.Tticket ty -> ty
| _ -> raise MichelsonTypingError
end
module Stack : sig
val pop : stack -> stack1 * stack
val pop2 : stack -> (stack1 * stack1) * stack
val pop3 : stack -> (stack1 * stack1 * stack1) * stack
val merge : stack option -> stack option -> stack option
val split : int -> stack -> stack * stack
end = struct
let pop (stack : stack) =
match stack with
| ty :: stack -> (ty, stack)
| _ -> assert false
let pop2 (stack : stack) =
match stack with
| ty1 :: ty2 :: stack -> ((ty1, ty2), stack)
| _ -> assert false
let pop3 (stack : stack) =
match stack with
| ty1 :: ty2 :: ty3 :: stack -> ((ty1, ty2, ty3), stack)
| _ -> assert false
let merge (stk1 : stack option) (stk2 : stack option) =
match stk1, stk2 with
| None, None ->
None
| Some stk1, None ->
Some stk1
| None, Some stk2 ->
Some stk2
| Some stk1, Some stk2 ->
if List.length stk1 <> List.length stk2 then
raise MichelsonTypingError;
let () = List.iter2 Ty.check_eq stk1 stk2 in
Some stk2
let split n stack =
if List.length stack < n then
raise MichelsonTypingError;
List.split_at n stack
end
let rec op_ABS (stack : stack) =
let ty, stack = Stack.pop stack in
let _ = Ty.check_int ty in
Some (M.tnat :: stack)
and op_ADD (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let aout =
match ty1.node, ty2.node with
| M.Tnat, M.Tnat -> M.Tnat
| M.Tnat, M.Tint -> M.Tint
| M.Tint, M.Tnat -> M.Tint
| M.Tint, M.Tint -> M.Tint
| M.Tint, M.Ttimestamp -> M.Ttimestamp
| M.Ttimestamp, M.Tint -> M.Ttimestamp
| M.Tmutez, M.Tmutez -> M.Tmutez
| M.Tbls12_381_g1, M.Tbls12_381_g1 -> M.Tbls12_381_g1
| M.Tbls12_381_g2, M.Tbls12_381_g2 -> M.Tbls12_381_g2
| M.Tbls12_381_fr, M.Tbls12_381_fr -> M.Tbls12_381_fr
| _, _ -> raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and op_ADDRESS (stack : stack) =
let cty, stack = Stack.pop stack in
let _ = Ty.check_contract cty in
Some (M.taddress :: stack)
and op_AMOUNT (stack : stack) =
Some (M.tmutez :: stack)
and op_AND (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let aout =
match ty1.node, ty2.node with
| M.Tbool, M.Tbool -> M.Tbool
| M.Tnat , M.Tnat -> M.Tnat
| M.Tint , M.Tnat -> M.Tnat
| _, _ -> raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and op_APPLY (stack : stack) =
let (ty, lty), stack = Stack.pop2 stack in
let dom, codom = Ty.check_lambda lty in
let ty1, ty2 = Ty.check_pair dom in
let () = Ty.check_eq ty ty1 in
Some (M.mk_type (M.Tlambda (ty2, codom)) :: stack)
and op_BALANCE (stack : stack) =
Some (M.tmutez :: stack)
and op_BLAKE2B (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_bytes ty in
Some (M.tbytes :: stack)
and op_CAR (stack : stack) =
let value, stack = Stack.pop stack in
let ty1, _ty2 = Ty.check_pair value in
Some (ty1 :: stack)
and op_CDR (stack : stack) =
let value, stack = Stack.pop stack in
let _ty1, ty2 = Ty.check_pair value in
Some (ty2 :: stack)
and op_CHAIN_ID (stack : stack) =
Some (M.tchain_id :: stack)
and op_CHECK_SIGNATURE (stack : stack) =
let (kty, sty, bty), stack = Stack.pop3 stack in
let () = Ty.check_key kty in
let () = Ty.check_signature sty in
let () = Ty.check_bytes bty in
Some (M.tbool :: stack)
and op_COMPARE (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let () = Ty.check_eq ty1 ty2 in
Some (M.tint :: stack)
and op_CONCAT (stack : stack) =
let ty, stack = Stack.pop stack in
let aout, stack =
match ty.node with
| M.Tlist ({ node = (M.Tstring | M.Tbytes) as aout }) ->
aout, stack
| (M.Tstring | M.Tbytes) as aout ->
let ty2, stack = Stack.pop stack in
let () = Ty.check_eq ty ty2 in
aout, stack
| _ -> raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and op_CONS (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let ty2 = Ty.check_list ty2 in
let () = Ty.check_eq ty1 ty2 in
Some (M.tlist ty1 :: stack)
and op_CONTRACT (stack : stack) (cty : stack1) =
let aty, stack = Stack.pop stack in
let () = Ty.check_address aty in
Some (M.toption (M.tcontract cty) :: stack)
and op_DIG (stack : stack) (n : int) =
let pre, post = Stack.split n stack in
let x, post = Stack.pop post in
Some (x :: (pre @ post))
and op_DIP (stack : stack) (n : int) (code : M.code list) =
let pre, stack = Stack.split n stack in
match tycheck stack (M.cseq code) with
| None -> None
| Some substack -> Some (pre @ substack)
and op_DROP (stack : stack) (n : int) =
let _, stack = Stack.split n stack in
Some stack
and op_DUG (stack : stack) (n : int) =
let x, stack = Stack.pop stack in
let pre, post = Stack.split n stack in
Some (pre @ x :: post)
and op_DUP (stack : stack) =
let x, stack = Stack.pop stack in
Some (x :: x :: stack)
and op_DUP_N (stack : stack) (n : int) =
if n < 1 then raise MichelsonTypingError;
let pre, stack = Stack.split (n-1) stack in
let x, stack = Stack.pop stack in
Some (x :: pre @ x :: stack)
and op_EDIV (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let aout1, aout2 =
match ty1.node, ty2.node with
| M.Tnat, M.Tnat -> M.Tnat, M.Tnat
| M.Tnat, M.Tint -> M.Tint, M.Tnat
| M.Tint, M.Tnat -> M.Tint, M.Tnat
| M.Tint, M.Tint -> M.Tint, M.Tnat
| M.Tmutez, M.Tnat -> M.Tmutez, M.Tmutez
| M.Tmutez, M.Tmutez -> M.Tnat , M.Tmutez
| _, _ -> raise MichelsonTypingError in
Some (M.toption (M.tpair (M.mk_type aout1) (M.mk_type aout2)) :: stack)
and op_EMPTY_BIG_MAP (stack : stack) (kty : stack1) (vty : stack1) =
Some (M.mk_type (M.Tbig_map (kty, vty)) :: stack)
and op_EMPTY_MAP (stack : stack) (kty : stack1) (vty : stack1) =
Some (M.mk_type (M.Tmap (kty, vty)) :: stack)
and op_EQ (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_int ty in
Some (M.tbool :: stack)
and op_EXEC (stack : stack) =
let (ty, lty), stack = Stack.pop2 stack in
let dom, codom = Ty.check_lambda lty in
let () = Ty.check_eq ty dom in
Some (codom :: stack)
and op_FAILWITH (stack : stack) =
let _ty, _stack = Stack.pop stack in
None
and op_GE (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_int ty in
Some (M.tbool :: stack)
and op_GET (stack : stack) =
let (kty, mty), stack = Stack.pop2 stack in
let kty', vty =
match mty.node with
| M.Tmap (kty, vty) -> (kty, vty)
| M.Tbig_map (kty, vty) -> (kty, vty)
| _ -> raise MichelsonTypingError in
let () = Ty.check_eq kty kty' in
Some (M.toption vty :: stack)
and op_GET_N (stack : stack) (n : int) =
let ty, stack = Stack.pop stack in
let rec unpairR n ty =
if n <= 0
then ty
else unpairR (n-1) (snd (Ty.check_pair ty)) in
let ty = unpairR (n / 2) ty in
let ty = if n mod 2 <> 0 then fst (Ty.check_pair ty) else ty in
Some (ty :: stack)
and op_GT (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_int ty in
Some (M.tbool :: stack)
and op_HASH_KEY (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_key ty in
Some (M.tkey_hash :: stack)
and op_IF (stack : stack) (ct : M.code list) (ce : M.code list) =
let cond, stack = Stack.pop stack in
Ty.check_bool cond;
let stt = tycheck stack (M.cseq ct) in
let ste = tycheck stack (M.cseq ce) in
Stack.merge stt ste
and op_IF_CONS (stack : stack) (ccons : M.code list) (cnil : M.code list) =
let cond, stack = Stack.pop stack in
let ty = Ty.check_list cond in
let scons = tycheck (ty :: M.tlist ty :: stack) (M.cseq ccons) in
let snil = tycheck stack (M.cseq cnil) in
Stack.merge scons snil
and op_IF_LEFT (stack : stack) (cl : M.code list) (cr : M.code list) =
let cond, stack = Stack.pop stack in
let tyl, tyr = Ty.check_or cond in
let sl = tycheck (tyl :: stack) (M.cseq cl) in
let sr = tycheck (tyr :: stack) (M.cseq cr) in
Stack.merge sl sr
and op_IF_NONE (stack : stack) (cnone : M.code list) (csome : M.code list) =
let cond, stack = Stack.pop stack in
let ty = Ty.check_option cond in
let snone = tycheck stack (M.cseq cnone) in
let ssome = tycheck (ty :: stack) (M.cseq csome) in
Stack.merge snone ssome
and op_IMPLICIT_ACCOUNT (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_key_hash ty in
Some (M.tcontract M.tunit :: stack)
and op_INT (stack : stack) =
let ty, stack = Stack.pop stack in
begin match ty.node with
| M.Tnat | M.Tbls12_381_fr -> ()
| _ -> raise MichelsonTypingError end;
Some (M.tint :: stack)
and op_ISNAT (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_int ty in
Some (M.toption M.tnat :: stack)
and op_ITER (stack : stack) (code : M.code list) =
let ty, stack = Stack.pop stack in
let inty =
match ty.node with
| M.Tlist ty ->
ty
| M.Tset kty ->
kty
| M.Tmap (kty, vty) ->
M.tpair kty vty
| _ -> raise MichelsonTypingError in
let substack = tycheck (inty :: stack) (M.cseq code) in
Stack.merge (Some stack) substack
and op_JOIN_TICKETS (stack : stack) =
let ty, stack = Stack.pop stack in
let ty1, ty2 = Ty.check_pair ty in
let ty1 = Ty.check_ticket ty1 in
let ty2 = Ty.check_ticket ty2 in
let () = Ty.check_eq ty1 ty2 in
Some (M.toption (M.tticket ty1) :: stack)
and op_KECCAK (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_bytes ty in
Some (M.tbytes :: stack)
and op_LAMBDA
(stack : stack) (dom : stack1) (codom : stack1) (code : M.code list)
=
let substack = tycheck [dom] (M.cseq code) in
begin match substack with
| Some [codom'] -> Ty.check_eq codom codom'
| _ -> raise MichelsonTypingError end;
Some (M.mk_type (M.Tlambda (dom, codom)) :: stack)
and op_LE (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_int ty in
Some (M.tbool :: stack)
and op_LT (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_int ty in
Some (M.tbool :: stack)
and op_LEFT (stack : stack) (tyr : stack1) =
let tyl, stack = Stack.pop stack in
Some (M.tor tyl tyr :: stack)
and op_LEVEL (stack : stack) =
Some (M.tnat :: stack)
and op_LOOP (stack : stack) (code : M.code list) =
let cond, stack = Stack.pop stack in
let () = Ty.check_bool cond in
let substack = tycheck stack (M.cseq code) in
let substack =
match substack with
| None -> None
| Some substack ->
let cond2, substack = Stack.pop substack in
let () = Ty.check_bool cond2 in
Some substack in
Stack.merge (Some stack) substack
and op_LOOP_LEFT (stack : stack) (code : M.code list) =
let cond, stack = Stack.pop stack in
let ty1, ty2 = Ty.check_or cond in
let substack = tycheck (ty1 :: stack) (M.cseq code) in
let substack =
match substack with
| None -> None
| Some substack ->
let cond2, substack = Stack.pop substack in
let () = Ty.check_eq cond cond2 in
Some (ty2 :: substack) in
Stack.merge (Some (ty2 :: stack)) substack
and op_LSL (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let () = Ty.check_nat ty1 in
let () = Ty.check_nat ty2 in
Some (M.tnat :: stack)
and op_LSR (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let () = Ty.check_nat ty1 in
let () = Ty.check_nat ty2 in
Some (M.tnat :: stack)
and op_MAP (stack : stack) (code : M.code list) =
let ty, stack = Stack.pop stack in
let inty, mkaout =
match ty.node with
| M.Tlist ty ->
(ty, M.tlist)
| M.Tmap (kty, vty) ->
(M.tpair kty vty, (M.tmap kty))
| _ -> raise MichelsonTypingError in
let substack = tycheck (inty :: stack) (M.cseq code) in
let outty, substack =
match substack with
| None -> raise MichelsonTypingError
| Some substack -> Stack.pop substack in
Stack.merge
(Some (mkaout outty :: stack ))
(Some (mkaout outty :: substack))
and op_MEM (stack : stack) =
let (kty, mty), stack = Stack.pop2 stack in
let kty' =
match mty.node with
| M.Tmap (kty, _) -> kty
| M.Tbig_map (kty, _) -> kty
| M.Tset kty -> kty
| _ -> raise MichelsonTypingError in
let () = Ty.check_eq kty kty' in
Some (M.tbool :: stack)
and op_MUL (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let aout =
match ty1.node, ty2.node with
| M.Tnat, M.Tnat -> M.Tnat
| M.Tnat, M.Tint -> M.Tint
| M.Tint, M.Tnat -> M.Tint
| M.Tint, M.Tint -> M.Tint
| M.Tmutez, M.Tnat -> M.Tmutez
| M.Tnat, M.Tmutez -> M.Tmutez
| M.Tbls12_381_g1, M.Tbls12_381_fr -> M.Tbls12_381_g1
| M.Tbls12_381_g2, M.Tbls12_381_fr -> M.Tbls12_381_g2
| M.Tbls12_381_fr, M.Tbls12_381_fr -> M.Tbls12_381_fr
| M.Tnat, M.Tbls12_381_fr -> M.Tbls12_381_fr
| M.Tint, M.Tbls12_381_fr -> M.Tbls12_381_fr
| M.Tbls12_381_fr, M.Tnat -> M.Tbls12_381_fr
| M.Tbls12_381_fr, M.Tint -> M.Tbls12_381_fr
| _, _ -> raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and op_NIL (stack : stack) (ty : stack1) =
Some (M.tlist ty :: stack)
and op_NEG (stack : stack) =
let ty, stack = Stack.pop stack in
let aout =
match ty.node with
| M.Tnat -> M.Tint
| M.Tint -> M.Tint
| M.Tbls12_381_g1 -> M.Tbls12_381_g1
| M.Tbls12_381_g2 -> M.Tbls12_381_g2
| M.Tbls12_381_fr -> M.Tbls12_381_fr
| _ -> raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and op_NEQ (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_int ty in
Some (M.tbool :: stack)
and op_NONE (stack : stack) (ty : stack1) =
Some (M.toption ty :: stack)
and op_NOT (stack : stack) =
let ty, stack = Stack.pop stack in
let aout =
match ty.node with
| M.Tbool -> M.Tbool
| M.Tnat -> M.Tnat
| M.Tint -> M.Tint
| _ -> raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and op_NOW (stack : stack) =
Some (M.ttimestamp :: stack)
and op_OR (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let aout =
match ty1.node, ty2.node with
| M.Tbool, M.Tbool -> M.Tbool
| M.Tnat , M.Tnat -> M.Tnat
| _, _ -> raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and op_PACK (stack : stack) =
let _ty, stack = Stack.pop stack in
Some (M.tbytes :: stack)
and op_PAIR (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
Some (M.tpair ty1 ty2 :: stack)
and op_PAIR_N (stack : stack) (n : int) =
if n <= 1 then raise MichelsonTypingError;
let tys, stack = Stack.split n stack in
let aout =
match List.rev tys with
| [] -> assert false
| ty :: tys -> List.fold_right M.tpair (List.rev tys) ty in
Some (aout :: stack)
and op_PAIRING_CHECK (stack : stack) =
let ty, stack = Stack.pop stack in
let ty1, ty2 = Ty.check_pair ty in
let () = Ty.check_bls12_381_g1 ty1 in
let () = Ty.check_bls12_381_g2 ty2 in
Some (M.tbool :: stack)
and op_PUSH (stack : stack) ((ty, _): stack1 * M.data) =
Some (ty :: stack)
and op_READ_TICKET (stack : stack) =
let ty, stack = Stack.pop stack in
let ty = Ty.check_ticket ty in
Some (
M.tpair M.taddress (M.tpair ty M.tnat)
:: M.tticket ty :: stack)
and op_RIGHT (stack : stack) (tyl : stack1) =
let tyr, stack = Stack.pop stack in
Some (M.tor tyl tyr :: stack)
and op_SAPLING_EMPTY_STATE (stack : stack) (ms : int) =
Some (M.mk_type (M.Tsapling_state ms) :: stack)
and op_SAPLING_VERIFY_UPDATE (stack : stack) =
let (tx, st), stack = Stack.pop2 stack in
let ms1 = Ty.check_sapling_tx tx in
let ms2 = Ty.check_sapling_st st in
if ms1 <> ms2 then
raise MichelsonTypingError;
Some (M.toption (M.tpair M.tint st) :: stack)
and op_SELF_ADDRESS (stack : stack) =
Some (M.taddress :: stack)
and op_SENDER (stack : stack) =
Some (M.taddress :: stack)
and op_SET (stack : stack) (ty : stack1) =
Some (M.tset ty :: stack)
and op_SET_DELEGATE (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_key_hash (Ty.check_option ty) in
Some (M.toperation :: stack)
and op_SHA256 (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_bytes ty in
Some (M.tbytes :: stack)
and op_SHA512 (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_bytes ty in
Some (M.tbytes :: stack)
and op_SHA3 (stack : stack) =
let ty, stack = Stack.pop stack in
let () = Ty.check_bytes ty in
Some (M.tbytes :: stack)
and op_SIZE (stack : stack) =
let ty, stack = Stack.pop stack in
begin match ty.node with
| M.Tset _ | M.Tmap _ | M.Tlist _ | M.Tstring | M.Tbytes -> ()
| _ -> raise MichelsonTypingError end;
Some (M.tnat :: stack)
and op_SLICE (stack : stack) =
let (i1, i2, ty), stack = Stack.pop3 stack in
let () = Ty.check_nat i1 in
let () = Ty.check_nat i2 in
begin match ty.node with
| M.Tstring | M.Tbytes -> ()
| _ -> raise MichelsonTypingError end;
Some (M.toption ty :: stack)
and op_SOME (stack : stack) =
let ty, stack = Stack.pop stack in
Some (M.toption ty :: stack)
and op_SOURCE (stack : stack) =
Some (M.taddress :: stack)
and op_SPLIT_TICKET (stack : stack) =
let (ty, typ), stack = Stack.pop2 stack in
let ty = Ty.check_ticket ty in
let typ1, typ2 = Ty.check_pair typ in
let () = Ty.check_nat typ1 in
let () = Ty.check_nat typ2 in
Some (M.toption (M.tpair (M.tticket ty) (M.tticket ty)) :: stack)
and op_SWAP (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
Some (ty2 :: ty1 :: stack)
and op_SUB (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let aout =
match ty1.node, ty2.node with
| M.Tnat, M.Tnat -> M.Tint
| M.Tnat, M.Tint -> M.Tint
| M.Tint, M.Tnat -> M.Tint
| M.Tint, M.Tint -> M.Tint
| M.Ttimestamp, M.Tint -> M.Ttimestamp
| M.Ttimestamp, M.Ttimestamp -> M.Tint
| M.Tmutez, M.Tmutez -> M.Tmutez
| _, _ -> raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and op_SUB_MUTEZ (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let aout =
match ty1.node, ty2.node with
| M.Tmutez, M.Tmutez -> M.Toption M.tmutez
| _, _ -> raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and op_TICKET (stack : stack) =
let (ty, tl), stack = Stack.pop2 stack in
let () = Ty.check_nat tl in
Some (M.tticket ty :: stack)
and op_TOTAL_VOTING_POWER (stack : stack) =
Some (M.tnat :: stack)
and op_TRANSFER_TOKENS (stack : stack) =
let (ty, mty, cty), stack = Stack.pop3 stack in
let () = Ty.check_mutez mty in
let cty = Ty.check_contract cty in
let () = Ty.check_eq ty cty in
Some (M.toperation :: stack)
and op_UNIT (stack : stack) =
Some (M.tunit :: stack)
and op_UNPACK (stack : stack) (ty : stack1) =
Some (M.toption ty :: stack)
and op_UNPAIR (stack : stack) =
let ty, stack = Stack.pop stack in
let ty1, ty2 = Ty.check_pair ty in
Some (ty1 :: ty2 :: stack)
and op_UNPAIR_N (stack : stack) (n : int) =
if n < 2 then raise MichelsonTypingError;
let ty, stack = Stack.pop stack in
let rec doit acc ty n =
if n <= 1 then
List.rev acc @ [ty]
else
let ty1, ty = Ty.check_pair ty in
doit (ty1::acc) ty (n-1) in
Some (doit [] ty n @ stack)
and op_UPDATE (stack : stack) =
let kty, stack = Stack.pop stack in
let aout, stack =
match kty.node with
| M.Tbool ->
let cty, stack = Stack.pop stack in
let _ : stack1 = Ty.check_set cty in
cty.node, stack
| M.Toption kty -> begin
let mty, stack = Stack.pop stack in
match mty.node with
| M.Tmap (kty', _)
| M.Tbig_map (kty', _) ->
let () = Ty.check_eq kty kty' in
mty.node, stack
| _ -> raise MichelsonTypingError
end
| _ ->
raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and op_UPDATE_N (stack : stack) (n : int) =
let (tys, tyd), stack = Stack.pop2 stack in
let aout = tyd :: stack in
let rec unpairR n tyd =
if n <= 0
then tyd
else unpairR (n-1) (snd (Ty.check_pair tyd)) in
let tyd = unpairR (n / 2) tyd in
let tyd = if n mod 2 <> 0 then fst (Ty.check_pair tyd) else tyd in
Ty.check_eq tys tyd; Some aout
and op_VOTING_POWER (stack : stack) =
let kty, stack = Stack.pop stack in
let () = Ty.check_key_hash kty in
Some (M.tnat :: stack)
and op_XOR (stack : stack) =
let (ty1, ty2), stack = Stack.pop2 stack in
let aout =
match ty1.node, ty2.node with
| M.Tbool, M.Tbool -> M.Tbool
| M.Tnat , M.Tnat -> M.Tnat
| _, _ -> raise MichelsonTypingError in
Some (M.mk_type aout :: stack)
and tycheck_r (stack : stack) (code : M.code_node) : stack option =
match code with
| SEQ cs ->
List.fold_left (fun stack c ->
match stack with
| None -> None
| Some stack -> tycheck stack c) (Some stack) cs
| APPLY ->
op_APPLY stack
| EXEC ->
op_EXEC stack
| FAILWITH ->
op_FAILWITH stack
| IF (ct, ce) ->
op_IF stack ct ce
| IF_CONS (ccons, cnil) ->
op_IF_CONS stack ccons cnil
| IF_LEFT (cl, cr) ->
op_IF_LEFT stack cl cr
| IF_NONE (cnone, csome) ->
op_IF_NONE stack cnone csome
| ITER c ->
op_ITER stack c
| LAMBDA (dom, codom, c) ->
op_LAMBDA stack dom codom c
| LOOP c ->
op_LOOP stack c
| LOOP_LEFT c ->
op_LOOP_LEFT stack c
| DIG n ->
op_DIG stack n
| DIP (n, c) ->
op_DIP stack n c
| DROP n ->
op_DROP stack n
| DUG n ->
op_DUG stack n
| DUP ->
op_DUP stack
| DUP_N n ->
op_DUP_N stack n
| PUSH (ty, v) ->
op_PUSH stack (ty, v)
| SWAP ->
op_SWAP stack
| ABS ->
op_ABS stack
| ADD ->
op_ADD stack
| COMPARE ->
op_COMPARE stack
| EDIV ->
op_EDIV stack
| EQ ->
op_EQ stack
| GE ->
op_GE stack
| GT ->
op_GT stack
| INT ->
op_INT stack
| ISNAT ->
op_ISNAT stack
| LE ->
op_LE stack
| LSL ->
op_LSL stack
| LSR ->
op_LSR stack
| LT ->
op_LT stack
| MUL ->
op_MUL stack
| NEG ->
op_NEG stack
| NEQ ->
op_NEQ stack
| SUB ->
op_SUB stack
| SUB_MUTEZ ->
op_SUB_MUTEZ stack
| AND ->
op_AND stack
| NOT ->
op_NOT stack
| OR ->
op_OR stack
| XOR ->
op_XOR stack
| BLAKE2B ->
op_BLAKE2B stack
| CHECK_SIGNATURE ->
op_CHECK_SIGNATURE stack
| HASH_KEY ->
op_HASH_KEY stack
| SHA256 ->
op_SHA256 stack
| SHA512 ->
op_SHA512 stack
| KECCAK ->
op_KECCAK stack
| SHA3 ->
op_SHA3 stack
| PAIRING_CHECK ->
op_PAIRING_CHECK stack
| SAPLING_EMPTY_STATE ty ->
op_SAPLING_EMPTY_STATE stack ty
| SAPLING_VERIFY_UPDATE ->
op_SAPLING_VERIFY_UPDATE stack
| ADDRESS ->
op_ADDRESS stack
| AMOUNT ->
op_AMOUNT stack
| BALANCE ->
op_BALANCE stack
| CHAIN_ID ->
op_CHAIN_ID stack
| CONTRACT (ty, _) ->
op_CONTRACT stack ty
| CREATE_CONTRACT _ ->
assert false
| IMPLICIT_ACCOUNT ->
op_IMPLICIT_ACCOUNT stack
| LEVEL ->
op_LEVEL stack
| NOW ->
op_NOW stack
| SELF _ ->
assert false
| SELF_ADDRESS ->
op_SELF_ADDRESS stack
| SENDER ->
op_SENDER stack
| SET_DELEGATE ->
op_SET_DELEGATE stack
| SOURCE ->
op_SOURCE stack
| TOTAL_VOTING_POWER ->
op_TOTAL_VOTING_POWER stack
| TRANSFER_TOKENS ->
op_TRANSFER_TOKENS stack
| VOTING_POWER ->
op_VOTING_POWER stack
| CAR ->
op_CAR stack
| CDR ->
op_CDR stack
| CONCAT ->
op_CONCAT stack
| CONS ->
op_CONS stack
| EMPTY_BIG_MAP (kty, vty) ->
op_EMPTY_BIG_MAP stack kty vty
| EMPTY_MAP (kty, vty) ->
op_EMPTY_MAP stack kty vty
| EMPTY_SET ty ->
op_SET stack ty
| GET ->
op_GET stack
| GET_N n ->
op_GET_N stack n
| GET_AND_UPDATE -> assert false
| LEFT tyr ->
op_LEFT stack tyr
| MAP c ->
op_MAP stack c
| MEM ->
op_MEM stack
| NEVER ->
None
| NIL ty ->
op_NIL stack ty
| NONE ty ->
op_NONE stack ty
| PACK ->
op_PACK stack
| PAIR ->
op_PAIR stack
| PAIR_N n ->
op_PAIR_N stack n
| RIGHT tyl ->
op_RIGHT stack tyl
| SIZE ->
op_SIZE stack
| SLICE ->
op_SLICE stack
| SOME ->
op_SOME stack
| UNIT ->
op_UNIT stack
| UNPACK ty ->
op_UNPACK stack ty
| UNPAIR ->
op_UNPAIR stack
| UNPAIR_N n ->
op_UNPAIR_N stack n
| UPDATE ->
op_UPDATE stack
| UPDATE_N n ->
op_UPDATE_N stack n
| JOIN_TICKETS ->
op_JOIN_TICKETS stack
| READ_TICKET ->
op_READ_TICKET stack
| SPLIT_TICKET ->
op_SPLIT_TICKET stack
| TICKET ->
op_TICKET stack
| CAST _ ->
Some stack
| VIEW (_, _) -> assert false
| OPEN_CHEST -> assert false
| CAR_N _ -> assert false
| CDR_N _ -> assert false
| RENAME -> assert false
and tycheck (stack : stack) (code : M.code) : stack option =
let stk = tycheck_r stack code.node in
let stk = Stack.merge stk !(code.type_) in
code.type_ := stk; stk