@@ -607,7 +607,7 @@ Table Instructions
607
607
\begin {array}[t]{@{}r@{~}l@{}}
608
608
(\iff & F.\AMODULE .\MITABLES [x] = a \\
609
609
\wedge & \X {sz} = |S.\STABLES [a].\TIELEM | \\
610
- \wedge & S' = S \with \STABLES [a] = \growtable (S.\STABLES [a], n, \val )) \\
610
+ \wedge & S' = S \with \STABLES [a] = \growtable (S.\STABLES [a], n, \val )) \\[ 1 ex]
611
611
\end {array}
612
612
\\[ 1 ex]
613
613
\begin {array}{lcl@{\qquad }l}
@@ -659,17 +659,17 @@ Table Instructions
659
659
660
660
a. Return.
661
661
662
- 13. Push the value :math: `\I32 .CONST~i` to the stack.
662
+ 13. Push the value :math: `\I32 .\ CONST ~i` to the stack.
663
663
664
664
14. Push the value :math: `\val ` to the stack.
665
665
666
666
15. Execute the instruction :math: `\TABLESET ~x`.
667
667
668
- 16. Push the value :math: `\I32 .CONST~(i+1 )` to the stack.
668
+ 16. Push the value :math: `\I32 .\ CONST ~(i+1 )` to the stack.
669
669
670
670
17. Push the value :math: `\val ` to the stack.
671
671
672
- 18. Push the value :math: `\I32 .CONST~(n-1 )` to the stack.
672
+ 18. Push the value :math: `\I32 .\ CONST ~(n-1 )` to the stack.
673
673
674
674
19. Execute the instruction :math: `\TABLEFILL ~x`.
675
675
@@ -679,7 +679,7 @@ Table Instructions
679
679
\quad\stepto\quad S; F; \TRAP
680
680
\\ \qquad
681
681
\begin {array}[t]{@{}r@{~}l@{}}
682
- (\iff & i + n > |S.\STABLES [F.\AMODULE .\MITABLES [x]].\TIELEM |) \\
682
+ (\iff & i + n > |S.\STABLES [F.\AMODULE .\MITABLES [x]].\TIELEM |) \\[ 1 ex]
683
683
\end {array}
684
684
\\[ 1 ex]
685
685
S; F; (\I32 .\CONST ~i)~\val ~(\I32 .\CONST ~0 )~(\TABLEFILL ~x)
@@ -688,7 +688,8 @@ Table Instructions
688
688
(\otherwise )
689
689
\\[ 1 ex]
690
690
S; F; (\I32 .\CONST ~i)~\val ~(\I32 .\CONST ~n+1 )~(\TABLEFILL ~x)
691
- \quad\stepto\quad S; F;
691
+ \quad\stepto
692
+ \\ \qquad S; F;
692
693
\begin {array}[t]{@{}l@{}}
693
694
(\I32 .\CONST ~i)~\val ~(\TABLESET ~x) \\
694
695
(\I32 .\CONST ~i+1 )~\val ~(\I32 .\CONST ~n)~(\TABLEFILL ~x) \\
@@ -789,7 +790,7 @@ Table Instructions
789
790
\\ \qquad
790
791
\begin {array}[t]{@{}r@{~}l@{}}
791
792
(\iff & s + n > |S.\STABLES [F.\AMODULE .\MITABLES [y]].\TIELEM | \\
792
- \vee & d + n > |S.\STABLES [F.\AMODULE .\MITABLES [x]].\TIELEM |) \\
793
+ \vee & d + n > |S.\STABLES [F.\AMODULE .\MITABLES [x]].\TIELEM |) \\[ 1 ex]
793
794
\end {array}
794
795
\\[ 1 ex]
795
796
S; F; (\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~0 )~(\TABLECOPY ~x~y)
@@ -798,7 +799,8 @@ Table Instructions
798
799
(\otherwise )
799
800
\\[ 1 ex]
800
801
S; F; (\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~n+1 )~(\TABLECOPY ~x~y)
801
- \quad\stepto\quad S; F;
802
+ \quad\stepto
803
+ \\ \qquad S; F;
802
804
\begin {array}[t]{@{}l@{}}
803
805
(\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\TABLEGET ~y)~(\TABLESET ~x) \\
804
806
(\I32 .\CONST ~d+1 )~(\I32 .\CONST ~s+1 )~(\I32 .\CONST ~n)~(\TABLECOPY ~x~y) \\
@@ -807,7 +809,8 @@ Table Instructions
807
809
(\otherwise , \iff d \leq s)
808
810
\\[ 1 ex]
809
811
S; F; (\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~n+1 )~(\TABLECOPY ~x~y)
810
- \quad\stepto\quad S; F;
812
+ \quad\stepto
813
+ \\ \qquad S; F;
811
814
\begin {array}[t]{@{}l@{}}
812
815
(\I32 .\CONST ~d+n-1 )~(\I32 .\CONST ~s+n-1 )~(\TABLEGET ~y)~(\TABLESET ~x) \\
813
816
(\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~n)~(\TABLECOPY ~x~y) \\
@@ -888,7 +891,7 @@ Table Instructions
888
891
\\ \qquad
889
892
\begin {array}[t]{@{}r@{~}l@{}}
890
893
(\iff & s + n > |S.\SELEMS [F.\AMODULE .\MIELEMS [y]].\EIELEM | \\
891
- \vee & d + n > |S.\STABLES [F.\AMODULE .\MITABLES [x]].\TIELEM |) \\
894
+ \vee & d + n > |S.\STABLES [F.\AMODULE .\MITABLES [x]].\TIELEM |) \\[ 1 ex]
892
895
\end {array}
893
896
\\[ 1 ex]
894
897
S; F; (\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~0 )~(\TABLEINIT ~x~y)
@@ -897,7 +900,8 @@ Table Instructions
897
900
(\otherwise )
898
901
\\[ 1 ex]
899
902
S; F; (\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~n+1 )~(\TABLEINIT ~x~y)
900
- \quad\stepto\quad S; F;
903
+ \quad\stepto
904
+ \\ \qquad S; F;
901
905
\begin {array}[t]{@{}l@{}}
902
906
(\I32 .\CONST ~d)~\val ~(\TABLESET ~x) \\
903
907
(\I32 .\CONST ~d+1 )~(\I32 .\CONST ~s+1 )~(\I32 .\CONST ~n)~(\TABLEINIT ~x~y) \\
@@ -1004,7 +1008,7 @@ Memory Instructions
1004
1008
\begin {array}[t]{@{}r@{~}l@{}}
1005
1009
(\iff & \X {ea} = i + \memarg .\OFFSET \\
1006
1010
\wedge & \X {ea} + |t|/8 \leq |S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA | \\
1007
- \wedge & \bytes _t(c) = S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA [\X {ea} \slice |t|/8 ])
1011
+ \wedge & \bytes _t(c) = S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA [\X {ea} \slice |t|/8 ]) \ \[ 1 ex]
1008
1012
\end {array}
1009
1013
\\[ 1 ex]
1010
1014
\begin {array}{lcl@{\qquad }l}
@@ -1015,7 +1019,7 @@ Memory Instructions
1015
1019
\begin {array}[t]{@{}r@{~}l@{}}
1016
1020
(\iff & \X {ea} = i + \memarg .\OFFSET \\
1017
1021
\wedge & \X {ea} + N/8 \leq |S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA | \\
1018
- \wedge & \bytes _{\iN }(n) = S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA [\X {ea} \slice N/8 ])
1022
+ \wedge & \bytes _{\iN }(n) = S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA [\X {ea} \slice N/8 ]) \ \[ 1 ex]
1019
1023
\end {array}
1020
1024
\\[ 1 ex]
1021
1025
\begin {array}{lcl@{\qquad }l}
@@ -1082,7 +1086,7 @@ Memory Instructions
1082
1086
\begin {array}[t]{@{}r@{~}l@{}}
1083
1087
(\iff & \X {ea} = i + \memarg .\OFFSET \\
1084
1088
\wedge & \X {ea} + |t|/8 \leq |S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA | \\
1085
- \wedge & S' = S \with \SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA [\X {ea} \slice |t|/8 ] = \bytes _t(c))
1089
+ \wedge & S' = S \with \SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA [\X {ea} \slice |t|/8 ] = \bytes _t(c)) \ \[ 1 ex]
1086
1090
\end {array}
1087
1091
\\[ 1 ex]
1088
1092
\begin {array}{lcl@{\qquad }l}
@@ -1092,7 +1096,7 @@ Memory Instructions
1092
1096
\begin {array}[t]{@{}r@{~}l@{}}
1093
1097
(\iff & \X {ea} = i + \memarg .\OFFSET \\
1094
1098
\wedge & \X {ea} + N/8 \leq |S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA | \\
1095
- \wedge & S' = S \with \SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA [\X {ea} \slice N/8 ] = \bytes _{\iN }(\wrap _{|t|,N}(c))
1099
+ \wedge & S' = S \with \SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA [\X {ea} \slice N/8 ] = \bytes _{\iN }(\wrap _{|t|,N}(c)) \ \[ 1 ex]
1096
1100
\end {array}
1097
1101
\\[ 1 ex]
1098
1102
\begin {array}{lcl@{\qquad }l}
@@ -1173,7 +1177,7 @@ Memory Instructions
1173
1177
\begin {array}[t]{@{}r@{~}l@{}}
1174
1178
(\iff & F.\AMODULE .\MIMEMS [0 ] = a \\
1175
1179
\wedge & \X {sz} = |S.\SMEMS [a].\MIDATA |/64 \,\F {Ki} \\
1176
- \wedge & S' = S \with \SMEMS [a] = \growmem (S.\SMEMS [a], n)) \\
1180
+ \wedge & S' = S \with \SMEMS [a] = \growmem (S.\SMEMS [a], n)) \\[ 1 ex]
1177
1181
\end {array}
1178
1182
\\[ 1 ex]
1179
1183
\begin {array}{lcl@{\qquad }l}
@@ -1247,15 +1251,16 @@ Memory Instructions
1247
1251
S; F; (\I32 .\CONST ~d)~\val ~(\I32 .\CONST ~n)~\MEMORYFILL
1248
1252
\quad\stepto\quad S; F; \TRAP
1249
1253
\\ \qquad
1250
- (\iff d + n > |S.\SMEMS [F.\AMODULE .\MIMEMS [x]].\MIDATA |) \\
1254
+ (\iff d + n > |S.\SMEMS [F.\AMODULE .\MIMEMS [x]].\MIDATA |)
1251
1255
\\[ 1 ex]
1252
1256
S; F; (\I32 .\CONST ~d)~\val ~(\I32 .\CONST ~0 )~\MEMORYFILL
1253
1257
\quad\stepto\quad S; F; \epsilon
1254
1258
\\ \qquad
1255
1259
(\otherwise )
1256
1260
\\[ 1 ex]
1257
1261
S; F; (\I32 .\CONST ~d)~\val ~(\I32 .\CONST ~n+1 )~\MEMORYFILL
1258
- \quad\stepto\quad S; F;
1262
+ \quad\stepto
1263
+ \\ \qquad S; F;
1259
1264
\begin {array}[t]{@{}l@{}}
1260
1265
(\I32 .\CONST ~d)~\val ~(\I32 \K {.}\STORE\K {8 }~\{ \OFFSET ~0 , \ALIGN ~0 \}) \\
1261
1266
(\I32 .\CONST ~d+1 )~\val ~(\I32 .\CONST ~n)~\MEMORYFILL \\
@@ -1348,7 +1353,7 @@ Memory Instructions
1348
1353
\\ \qquad
1349
1354
\begin {array}[t]{@{}r@{~}l@{}}
1350
1355
(\iff & s + n > |S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA | \\
1351
- \vee & d + n > |S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA |) \\
1356
+ \vee & d + n > |S.\SMEMS [F.\AMODULE .\MIMEMS [0 ]].\MIDATA |) \\[ 1 ex]
1352
1357
\end {array}
1353
1358
\\[ 1 ex]
1354
1359
S; F; (\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~0 )~\MEMORYCOPY
@@ -1357,7 +1362,8 @@ Memory Instructions
1357
1362
(\otherwise )
1358
1363
\\[ 1 ex]
1359
1364
S; F; (\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~n+1 )~\MEMORYCOPY
1360
- \quad\stepto\quad S; F;
1365
+ \quad\stepto
1366
+ \\ \qquad S; F;
1361
1367
\begin {array}[t]{@{}l@{}}
1362
1368
(\I32 .\CONST ~d) \\
1363
1369
(\I32 .\CONST ~s)~(\I32 \K {.}\LOAD\K {8 \_u}~\{ \OFFSET ~0 , \ALIGN ~0 \}) \\
@@ -1368,7 +1374,8 @@ Memory Instructions
1368
1374
(\otherwise , \iff d \leq s)
1369
1375
\\[ 1 ex]
1370
1376
S; F; (\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~n+1 )~\MEMORYCOPY
1371
- \quad\stepto\quad S; F;
1377
+ \quad\stepto
1378
+ \\ \qquad S; F;
1372
1379
\begin {array}[t]{@{}l@{}}
1373
1380
(\I32 .\CONST ~d+n-1 ) \\
1374
1381
(\I32 .\CONST ~s+n-1 )~(\I32 \K {.}\LOAD\K {8 \_u}~\{ \OFFSET ~0 , \ALIGN ~0 \}) \\
@@ -1451,7 +1458,7 @@ Memory Instructions
1451
1458
\\ \qquad
1452
1459
\begin {array}[t]{@{}r@{~}l@{}}
1453
1460
(\iff & s + n > |S.\SDATAS [F.\AMODULE .\MIDATAS [x]].\DIDATA | \\
1454
- \vee & d + n > |S.\SMEMS [F.\AMODULE .\MIMEMS [x]].\MIDATA |) \\
1461
+ \vee & d + n > |S.\SMEMS [F.\AMODULE .\MIMEMS [x]].\MIDATA |) \\[ 1 ex]
1455
1462
\end {array}
1456
1463
\\[ 1 ex]
1457
1464
S; F; (\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~0 )~(\MEMORYINIT ~x)
@@ -1460,7 +1467,8 @@ Memory Instructions
1460
1467
(\otherwise )
1461
1468
\\[ 1 ex]
1462
1469
S; F; (\I32 .\CONST ~d)~(\I32 .\CONST ~s)~(\I32 .\CONST ~n+1 )~(\MEMORYINIT ~x)
1463
- \quad\stepto\quad S; F;
1470
+ \quad\stepto
1471
+ \\ \qquad S; F;
1464
1472
\begin {array}[t]{@{}l@{}}
1465
1473
(\I32 .\CONST ~d)~(\I32 .\CONST ~b)~(\I32 \K {.}\STORE\K {8 }~\{ \OFFSET ~0 , \ALIGN ~0 \}) \\
1466
1474
(\I32 .\CONST ~d+1 )~(\I32 .\CONST ~s+1 )~(\I32 .\CONST ~n)~(\MEMORYINIT ~x) \\
@@ -1550,10 +1558,10 @@ Control Instructions
1550
1558
1551
1559
.. math ::
1552
1560
~\\[-1 ex]
1553
- \begin {array}{lcl@{ \qquad }l }
1561
+ \begin {array}{lcl}
1554
1562
F; \val ^m~\BLOCK ~\X {bt}~\instr ^\ast ~\END &\stepto &
1555
1563
F; \LABEL _n\{\epsilon \}~\val ^m~\instr ^\ast ~\END
1556
- & (\iff \expand _F(\X {bt}) = [t_1 ^m] \to [t_2 ^n])
1564
+ \\&& \quad (\iff \expand _F(\X {bt}) = [t_1 ^m] \to [t_2 ^n])
1557
1565
\end {array}
1558
1566
1559
1567
@@ -1576,10 +1584,10 @@ Control Instructions
1576
1584
1577
1585
.. math ::
1578
1586
~\\[-1 ex]
1579
- \begin {array}{lcl@{ \qquad }l }
1587
+ \begin {array}{lcl}
1580
1588
F; \val ^m~\LOOP ~\X {bt}~\instr ^\ast ~\END &\stepto &
1581
1589
F; \LABEL _m\{\LOOP ~\X {bt}~\instr ^\ast ~\END \}~\val ^m~\instr ^\ast ~\END
1582
- & (\iff \expand _F(\X {bt}) = [t_1 ^m] \to [t_2 ^n])
1590
+ \\&& \quad (\iff \expand _F(\X {bt}) = [t_1 ^m] \to [t_2 ^n])
1583
1591
\end {array}
1584
1592
1585
1593
@@ -1612,13 +1620,13 @@ Control Instructions
1612
1620
1613
1621
.. math ::
1614
1622
~\\[-1 ex]
1615
- \begin {array}{lcl@{ \qquad }l }
1623
+ \begin {array}{lcl}
1616
1624
F; \val ^m~(\I32 .\CONST ~c)~\IF ~\X {bt}~\instr _1 ^\ast ~\ELSE ~\instr _2 ^\ast ~\END &\stepto &
1617
1625
F; \LABEL _n\{\epsilon \}~\val ^m~\instr _1 ^\ast ~\END
1618
- & (\iff c \neq 0 \wedge \expand _F(\X {bt}) = [t_1 ^m] \to [t_2 ^n]) \\
1626
+ \\&& \quad (\iff c \neq 0 \wedge \expand _F(\X {bt}) = [t_1 ^m] \to [t_2 ^n]) \\
1619
1627
F; \val ^m~(\I32 .\CONST ~c)~\IF ~\X {bt}~\instr _1 ^\ast ~\ELSE ~\instr _2 ^\ast ~\END &\stepto &
1620
1628
F; \LABEL _n\{\epsilon \}~\val ^m~\instr _2 ^\ast ~\END
1621
- & (\iff c = 0 \wedge \expand _F(\X {bt}) = [t_1 ^m] \to [t_2 ^n]) \\
1629
+ \\&& \quad (\iff c = 0 \wedge \expand _F(\X {bt}) = [t_1 ^m] \to [t_2 ^n]) \\
1622
1630
\end {array}
1623
1631
1624
1632
0 commit comments