Wasm-DSL · rossberg · Jan 22, 2025 · Mar 1, 2023 · Sep 3, 2024 · Sep 3, 2024
diff --git a/.github/workflows/ci-spec.yml b/.github/workflows/ci-spec.yml
@@ -35,7 +35,7 @@ jobs:
       - name: Setup TexLive
         run: sudo apt-get update -y && sudo apt-get install -y latexmk texlive-latex-recommended texlive-latex-extra texlive-fonts-recommended
       - name: Setup Sphinx
-        run: pip install six && pip install sphinx==8.0.0
+        run: pip install six && pip install sphinx==8.1.3
       - name: Build SpecTec
         run: cd spectec && opam exec make
       - name: Build main spec
@@ -83,13 +83,13 @@ jobs:
     needs: [build-core-spec]
     steps:
       - name: Checkout repo
-        uses: actions/checkout@v2
+        uses: actions/checkout@v4
         with:
           submodules: "recursive"
       - name: Setup TexLive
         run: sudo apt-get update -y && sudo apt-get install -y latexmk texlive-latex-recommended texlive-latex-extra texlive-fonts-recommended
       - name: Setup Sphinx
-        run: pip install six && pip install sphinx==8.0.0
+        run: pip install six && pip install sphinx==8.1.3
       - name: Build main spec
         run: cd document/metadata/code && make main
       - name: Upload artifact
@@ -102,13 +102,13 @@ jobs:
     runs-on: ubuntu-latest
     steps:
       - name: Checkout repo
-        uses: actions/checkout@v2
+        uses: actions/checkout@v4
         with:
           submodules: "recursive"
       - name: Setup TexLive
         run: sudo apt-get update -y && sudo apt-get install -y latexmk texlive-latex-recommended texlive-latex-extra texlive-fonts-recommended
       - name: Setup Sphinx
-        run: pip install six && pip install sphinx==8.0.0
+        run: pip install six && pip install sphinx==8.1.3
       - name: Build main spec
         run: cd document/legacy/exceptions/core && make main
       - name: Upload artifact
@@ -121,7 +121,7 @@ jobs:
     runs-on: ubuntu-latest
     steps:
       - name: Checkout repo
-        uses: actions/checkout@v2
+        uses: actions/checkout@v4
       - name: Setup Bikeshed
         run: pip install bikeshed && bikeshed update
       - name: Run Bikeshed

diff --git a/.github/workflows/ci-spectec.yml b/.github/workflows/ci-spectec.yml
@@ -27,6 +27,6 @@ jobs:
       - name: Setup Latex
         run: sudo apt-get update -y && sudo apt-get install -y latexmk texlive-latex-recommended texlive-latex-extra texlive-fonts-recommended
       - name: Setup Sphinx
-        run: pip install six && pip install sphinx==8.0.0
+        run: pip install six && pip install sphinx==8.1.3
       - name: Build and test
         run: cd spectec && opam exec make ci
diff --git a/document/core/appendix/changes.rst b/document/core/appendix/changes.rst
@@ -308,7 +308,7 @@ Allowed basic numeric computations in constant expressions. [#proposal-extconst]
   - |GLOBALGET| for any previously declared immutable :ref:`global <syntax-global>`
 
 .. note::
-   The :ref:`garbage collection <extension-gc>` added further constant instructions.
+   The :ref:`garbage collection <extension-gc>` extension added further constant instructions.
 
 
 .. index:: instruction, function, call
@@ -462,6 +462,8 @@ Added more precise types for references. [#proposal-typedref]_
 
 * Refined typing of :ref:`local instructions <valid-instr-variable>` and :ref:`instruction sequences <valid-instrs>` to track the :ref:`initialization status <syntax-init>` of :ref:`locals <syntax-local>` with non-defaultable type
 
+* Refined decoding of :ref:`active <syntax-elemmode>` :ref:`element segments <binary-elem>` with implicit element type and plain function indices (opcode :math:`0`) to produce :ref:`non-nullable <syntax-nullable>` :ref:`reference type <syntax-reftype>`.
+
 * Extended :ref:`table definitions <syntax-table>` with optional initializer expression
 
 
@@ -622,7 +624,7 @@ mirroring the role of custom sections in the binary format. [#proposal-annot]_
 
 
 .. [#proposal-extconst]
-   https://github.com/WebAssembly/spec/blob/main/proposals/extended-const/
+   https://github.com/WebAssembly/spec/tree/main/proposals/extended-const/
 
 .. [#proposal-tailcall]
    https://github.com/WebAssembly/spec/tree/main/proposals/tail-call/
@@ -631,10 +633,10 @@ mirroring the role of custom sections in the binary format. [#proposal-annot]_
    https://github.com/WebAssembly/spec/tree/main/proposals/exception-handling/
 
 .. [#proposal-multimem]
-   https://github.com/WebAssembly/spec/blob/main/proposals/multi-memory/
+   https://github.com/WebAssembly/spec/tree/main/proposals/multi-memory/
 
 .. [#proposal-addr64]
-   https://github.com/WebAssembly/spec/blob/main/proposals/memory64/
+   https://github.com/WebAssembly/spec/tree/main/proposals/memory64/
 
 .. [#proposal-typedref]
    https://github.com/WebAssembly/spec/tree/main/proposals/function-references/
@@ -646,4 +648,4 @@ mirroring the role of custom sections in the binary format. [#proposal-annot]_
    https://github.com/WebAssembly/spec/tree/main/proposals/relaxed-simd/
 
 .. [#proposal-annot]
-   https://github.com/WebAssembly/annotations/tree/main/proposals/annotations/
+   https://github.com/WebAssembly/spec/tree/main/proposals/annotations/
diff --git a/document/core/appendix/index-instructions.py b/document/core/appendix/index-instructions.py
@@ -334,7 +334,7 @@ def Instruction(version, name, opcode, type=None, validation=None, execution=Non
     Instruction(3.0, r'\STRUCTGETS~x~y', r'\hex{FB}~\hex{03}', r'[(\REF~\NULL~x)] \to [\I32]', r'valid-struct.get', r'exec-struct.get'),
     Instruction(3.0, r'\STRUCTGETU~x~y', r'\hex{FB}~\hex{04}', r'[(\REF~\NULL~x)] \to [\I32]', r'valid-struct.get', r'exec-struct.get'),
     Instruction(3.0, r'\STRUCTSET~x~y', r'\hex{FB}~\hex{05}', r'[(\REF~\NULL~x)~t] \to []', r'valid-struct.set', r'exec-struct.set'),
-    Instruction(3.0, r'\ARRAYNEW~x', r'\hex{FB}~\hex{06}', r'[t] \to [(\REF~x)]', r'valid-array.new', r'exec-array.new'),
+    Instruction(3.0, r'\ARRAYNEW~x', r'\hex{FB}~\hex{06}', r'[t~\I32] \to [(\REF~x)]', r'valid-array.new', r'exec-array.new'),
     Instruction(3.0, r'\ARRAYNEWDEFAULT~x', r'\hex{FB}~\hex{07}', r'[\I32] \to [(\REF~x)]', r'valid-array.new', r'exec-array.new'),
     Instruction(3.0, r'\ARRAYNEWFIXED~x~n', r'\hex{FB}~\hex{08}', r'[t^n] \to [(\REF~x)]', r'valid-array.new_fixed', r'exec-array.new_fixed'),
     Instruction(3.0, r'\ARRAYNEWDATA~x~y', r'\hex{FB}~\hex{09}', r'[\I32~\I32] \to [(\REF~x)]', r'valid-array.new_data', r'exec-array.new_data'),

diff --git a/document/core/exec/instructions.rst b/document/core/exec/instructions.rst
@@ -196,9 +196,8 @@ $${rule: {Step_pure/ref.eq-*}}
 
 $${rule-prose: Step_read/ref.test}
 
-.. todo::
-   Below is the actual prose. 
-   (9) Need to handle RulePr s \|- ref : rt properly in prose instead of $ref_type_of
+.. todo:: (9) Need to handle RulePr s \|- ref : rt properly in prose instead of $ref_type_of
+   Below is the actual prose.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -229,9 +228,8 @@ $${rule: {Step_read/ref.test-*}}
 
 $${rule-prose: Step_read/ref.cast}
 
-.. todo::
+.. todo:: (9) Need to handle RulePr s \|- ref : rt properly in prose instead of $ref_type_of
    Below is the actual prose. 
-   (9) Need to handle RulePr s \|- ref : rt properly in prose instead of $ref_type_of
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -269,10 +267,8 @@ $${rule: {Step_pure/ref.i31}}
 
 $${rule-prose: Step_pure/i31.get}
 
-.. todo::
+.. todo:: (3) Introduce if-let instruction instead of "is of the case". (4) Guarantees from validation can help simplify the prose.
    Below is the actual prose.
-   (3) Introduce if-let instruction instead of "is of the case".
-   (4) Guarantees from validation can help simplify the prose.
 
 1. Assert: due to :ref:`validation <valid-i31.get_sx>`, a :ref:`value <syntax-val>` of :ref:`type <syntax-valtype>` :math:`(\REF~\NULL~\I31)` is on the top of the stack.
 
@@ -297,10 +293,8 @@ $${rule: {Step_pure/i31.get-*}}
 
 $${rule-prose: Step/struct.new}
 
-.. todo::
+.. todo:: (3') Introduce let binding instead of "is of the case". (5) Use "the expansion of" instead of $expand function application.
    Below is the actual prose.
-   (3') Introduce let binding instead of "is of the case".
-   (5) Use "the expansion of" instead of $expand function application.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -339,10 +333,8 @@ $${rule: {Step/struct.new}}
 
 $${rule-prose: Step_read/struct.new_default}
 
-.. todo::
+.. todo:: (3') Introduce let binding instead of "is of the case". (5) Use "the expansion of" instead of $expand function application.
    Below is the actual prose.
-   (3') Introduce let binding instead of "is of the case".
-   (5) Use "the expansion of" instead of $expand function application.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -374,10 +366,8 @@ $${rule: {Step_read/struct.new_default}}
 
 $${rule-prose: Step_read/struct.get}
 
-.. todo::
+.. todo:: (3) Introduce if-let instruction instead of "is of the case". (5) Use "the expansion of" instead of $expand function application.
    Below is the actual prose.
-   (3) Introduce if-let instruction instead of "is of the case".
-   (5) Use "the expansion of" instead of $expand function application.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -418,10 +408,8 @@ $${rule: {Step_read/struct.get-*}}
 
 $${rule-prose: Step/struct.set}
 
-.. todo::
+.. todo:: (3) Introduce if-let instruction instead of "is of the case". (5) Use "the expansion of" instead of $expand function application.
    Below is the actual prose.
-   (3) Introduce if-let instruction instead of "is of the case".
-   (5) Use "the expansion of" instead of $expand function application.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -471,10 +459,8 @@ $${rule: {Step_pure/array.new}}
 
 $${rule-prose: Step_read/array.new_default}
 
-.. todo::
+.. todo:: (3') Introduce let binding instead of "is of the case". (5) Use "the expansion of" instead of $expand function application.
    Below is the actual prose.
-   (3') Introduce let binding instead of "is of the case".
-   (5) Use "the expansion of" instead of $expand function application.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -505,10 +491,8 @@ $${rule: {Step_read/array.new_default}}
 
 $${rule-prose: Step/array.new_fixed}
 
-.. todo::
+.. todo:: (3') Introduce let binding instead of "is of the case". (5) Use "the expansion of" instead of $expand function application.
    Below is the actual prose.
-   (3') Introduce let binding instead of "is of the case".
-   (5) Use "the expansion of" instead of $expand function application.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -545,9 +529,8 @@ $${rule: {Step/array.new_fixed}}
 
 $${rule-prose: Step_read/array.new_data}
 
-.. todo::
+.. todo:: (7) Render $inverse_ with display hint.
    Below is the actual prose.
-   (7) Render $inverse_ with display hint.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -610,10 +593,8 @@ $${rule: {Step_read/array.new_elem-*}}
 
 $${rule-prose: Step_read/array.get}
 
-.. todo::
+.. todo:: (3) Introduce if-let instruction instead of "is of the case". (5) Use "the expansion of" instead of $expand function application.
    Below is the actual prose.
-   (3) Introduce if-let instruction instead of "is of the case".
-   (5) Use "the expansion of" instead of $expand function application.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -660,10 +641,8 @@ $${rule: {Step_read/array.get-*}}
 
 $${rule-prose: Step/array.set}
 
-.. todo::
+.. todo:: (3) Introduce if-let instruction instead of "is of the case". (5) Use "the expansion of" instead of $expand function application.
    Below is the actual prose.
-   (3) Introduce if-let instruction instead of "is of the case".
-   (5) Use "the expansion of" instead of $expand function application.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -728,11 +707,8 @@ $${rule: {Step_read/array.fill-*}}
 
 .. _exec-array.copy:
 
-.. todo::
+.. todo:: (3) Introduce if-let instruction instead of "is of the case". (5) Use "the expansion of" instead of $expand function application. + Too deeply nested
    Below is the actual prose.
-   (3) Introduce if-let instruction instead of "is of the case".
-   (5) Use "the expansion of" instead of $expand function application.
-   + Too deeply nested
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -864,9 +840,8 @@ $${definition: sx}
 
 $${rule-prose: Step_read/array.init_data}
 
-.. todo::
+.. todo:: (7) Render $inverse_ with display hint.
    Below is the actual prose.
-   (7) Render $inverse_ with display hint.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -1322,9 +1297,8 @@ Memory Instructions
 
 $${rule-prose: Step_read/load}
 
-.. todo::
+.. todo:: (7) Render $inverse_of_nbytes with display hint.
    Below is the actual prose.
-   (7) Render $inverse_of_nbytes with display hint.
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -1816,9 +1790,8 @@ $${rule: {Step_pure/br_on_non_null-*}}
 
 $${rule-prose: Step_read/br_on_cast}
 
-.. todo::
+.. todo:: (9) Need to handle RulePr s \|- ref : rt properly in prose instead of $ref_type_of
    Below is the acutal prose.
-   (9) Need to handle RulePr s \|- ref : rt properly in prose instead of $ref_type_of
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -1847,9 +1820,8 @@ $${rule: {Step_read/br_on_cast-*}}
 
 $${rule-prose: Step_read/br_on_cast_fail}
 
-.. todo::
+.. todo:: (9) Need to handle RulePr s \|- ref : rt properly in prose instead of $ref_type_of
    Below is the actual prose.
-   (9) Need to handle RulePr s \|- ref : rt properly in prose instead of $ref_type_of
 
 1. Let :math:`F` be the :ref:`current <exec-notation-textual>` :ref:`frame <syntax-frame>`.
 
@@ -1934,8 +1906,7 @@ $${rule: {Step_read/return_call}}
 :math:`\RETURNCALLREF~x`
 ........................
 
-.. todo::
-   (*) Prose not spliced, Sphinx cannot build the document with deeply nested ordered list. (mainly caused by spurious conditions that should be assertions)
+.. todo:: (*) Prose not spliced, Sphinx cannot build the document with deeply nested ordered list. (mainly caused by spurious conditions that should be assertions)
 
 1. Assert: due to :ref:`validation <valid-return_call_ref>`, a :ref:`function reference <syntax-ref>` is on the top of the stack.
 

diff --git a/document/core/exec/modules.rst b/document/core/exec/modules.rst
@@ -200,7 +200,7 @@ and list of :ref:`reference <syntax-ref>` lists for the module's :ref:`element s
 
 8. For each :ref:`element segment <syntax-elem>` :math:`\elem_i` in :math:`\module.\MELEMS`, do:
 
-   a. Let :math:`\reftype_i` be the element :ref:`reference type <syntax-reftype>` obtained by `instantiating <type-inst>` :math:`\elem_i.\ETYPE` in :math:`\moduleinst` defined below.
+   a. Let :math:`\reftype_i` be the element :ref:`reference type <syntax-reftype>` obtained by :ref:`instantiating <type-inst>` :math:`\elem_i.\ETYPE` in :math:`\moduleinst` defined below.
 
    b. Let :math:`\elemaddr_i` be the :ref:`element address <syntax-elemaddr>` resulting from :ref:`allocating <alloc-elem>` a :ref:`element instance <syntax-eleminst>` of :ref:`reference type <syntax-reftype>` :math:`\reftype_i` with contents :math:`(\reff_{\F{e}}^\ast)^\ast[i]`.
 

diff --git a/document/core/syntax/types.rst b/document/core/syntax/types.rst
@@ -404,6 +404,26 @@ Global Types
 $${syntax: globaltype}
 
 
+.. index:: ! tag type, function type, defined type, exception
+   pair: abstract syntax; tag type
+   pair: tag; type
+.. _syntax-tagtype:
+
+Tag Types
+~~~~~~~~~
+
+*Tag types* classify the signature of :ref:`tags <syntax-tag>` with a defined type |deftype|, which expands to a function type |functype|.
+
+$${syntax: tagtype}
+
+Tags are used for categorizing exceptions.
+The parameters of |functype| define the list of values associated with the exception thrown with this tag.
+Furthermore, it is an invariant of the semantics that every |functype| in a :ref:`valid <valid-tagtype>` tag type for an exception has an empty result type.
+
+.. note::
+   Future versions of WebAssembly may have additional uses for tags, and may allow non-empty result types in the function types of tags.
+
+
 .. index:: ! element type, reference type, table, element
    pair: abstract syntax; element type
    pair: element; type

diff --git a/document/core/valid/matching.rst b/document/core/valid/matching.rst
@@ -38,8 +38,7 @@ Heap Types
 
 $${rule-prose: Heaptype_sub}
 
-.. todo::
- below is the official specification
+.. todo:: below is the official specification
 
 A :ref:`heap type <syntax-heaptype>` ${:heaptype_1} matches a :ref:`heap type <syntax-heaptype>` ${:heaptype_2} if and only if:
 
@@ -90,8 +89,8 @@ Reference Types
 ~~~~~~~~~~~~~~~
 
 $${rule-prose: Reftype_sub}
-.. todo::
- below is the official specification
+
+.. todo:: below is the official specification
 
 A :ref:`reference type <syntax-reftype>` ${reftype: REF nul1 heaptype_1} matches a :ref:`reference type <syntax-reftype>` ${reftype: REF nul2 heaptype_2} if and only if:
 
@@ -264,6 +263,12 @@ $${rule-prose: Tagtype_sub}
 
 $${rule: {Tagtype_sub}}
 
+.. note::
+   Although the conclusion of this rule looks identical to its premise,
+   they in fact describe different relations:
+   the premise invokes subtyping on defined types,
+   while the conclusion defines it on tag types that happen to be expressed as defined types.
+
 
 .. index:: external type, function type, table type, memory type, global type
 .. _match-externtype: