WebAssembly Specification
Release 1.0 (Draft, last updated Dec 13, 2018)
1. Introduction
1.1. Introduction
WebAssembly (abbreviated Wasm [1]) is a safe, portable, lowlevel code format designed for efficient execution and compact representation. Its main goal is to enable high performance applications on the Web, but it does not make any Webspecific assumptions or provide Webspecific features, so it can be employed in other environments as well.
WebAssembly is an open standard developed by a W3C Community Group.
This document describes version 1.0 of the core WebAssembly standard. It is intended that it will be superseded by new incremental releases with additional features in the future.
1.1.1. Design Goals
The design goals of WebAssembly are the following:

Fast, safe, and portable semantics:
 Fast: executes with near native code performance, taking advantage of capabilities common to all contemporary hardware.
 Safe: code is validated and executes in a memorysafe [2], sandboxed environment preventing data corruption or security breaches.
 Welldefined: fully and precisely defines valid programs and their behavior in a way that is easy to reason about informally and formally.
 Hardwareindependent: can be compiled on all modern architectures, desktop or mobile devices and embedded systems alike.
 Languageindependent: does not privilege any particular language, programming model, or object model.
 Platformindependent: can be embedded in browsers, run as a standalone VM, or integrated in other environments.
 Open: programs can interoperate with their environment in a simple and universal manner.

Efficient and portable representation:
 Compact: has a binary format that is fast to transmit by being smaller than typical text or native code formats.
 Modular: programs can be split up in smaller parts that can be transmitted, cached, and consumed separately.
 Efficient: can be decoded, validated, and compiled in a fast single pass, equally with either justintime (JIT) or aheadoftime (AOT) compilation.
 Streamable: allows decoding, validation, and compilation to begin as soon as possible, before all data has been seen.
 Parallelizable: allows decoding, validation, and compilation to be split into many independent parallel tasks.
 Portable: makes no architectural assumptions that are not broadly supported across modern hardware.
WebAssembly code is also intended to be easy to inspect and debug, especially in environments like web browsers, but such features are beyond the scope of this specification.
[1]  A contraction of “WebAssembly”, not an acronym, hence not using allcaps. 
[2]  No program can break WebAssembly’s memory model. Of course, it cannot guarantee that an unsafe language compiling to WebAssembly does not corrupt its own memory layout, e.g. inside WebAssembly’s linear memory. 
1.1.2. Scope
At its core, WebAssembly is a virtual instruction set architecture (virtual ISA). As such, it has many use cases and can be embedded in many different environments. To encompass their variety and enable maximum reuse, the WebAssembly specification is split and layered into several documents.
This document is concerned with the core ISA layer of WebAssembly. It defines the instruction set, binary encoding, validation, and execution semantics, as well as a textual representation. It does not, however, define how WebAssembly programs can interact with a specific environment they execute in, nor how they are invoked from such an environment.
Instead, this specification is complemented by additional documents defining interfaces to specific embedding environments such as the Web. These will each define a WebAssembly application programming interface (API) suitable for a given environment.
1.1.3. Dependencies
WebAssembly depends on two existing standards:
 IEEE 7542008, for the representation of floatingpoint data and the semantics of respective numeric operations.
 Unicode, for the representation of import/export names and the text format.
However, to make this specification selfcontained, relevant aspects of the aforementioned standards are defined and formalized as part of this specification, such as the binary representation and rounding of floatingpoint values, and the value range and UTF8 encoding of Unicode characters.
Note
The aforementioned standards are the authoritative source of all respective definitions. Formalizations given in this specification are intended to match these definitions. Any discrepancy in the syntax or semantics described is to be considered an error.
1.2. Overview
1.2.1. Concepts
WebAssembly encodes a lowlevel, assemblylike programming language. This language is structured around the following concepts.
 Values
 WebAssembly provides only four basic value types. These are integers and IEEE 7542008 numbers, each in 32 and 64 bit width. 32 bit integers also serve as Booleans and as memory addresses. The usual operations on these types are available, including the full matrix of conversions between them. There is no distinction between signed and unsigned integer types. Instead, integers are interpreted by respective operations as either unsigned or signed in two’s complement representation.
 Instructions
 The computational model of WebAssembly is based on a stack machine. Code consists of sequences of instructions that are executed in order. Instructions manipulate values on an implicit operand stack [1] and fall into two main categories. Simple instructions perform basic operations on data. They pop arguments from the operand stack and push results back to it. Control instructions alter control flow. Control flow is structured, meaning it is expressed with wellnested constructs such as blocks, loops, and conditionals. Branches can only target such constructs.
 Traps
 Under some conditions, certain instructions may produce a trap, which immediately aborts execution. Traps cannot be handled by WebAssembly code, but are reported to the outside environment, where they typically can be caught.
 Functions
 Code is organized into separate functions. Each function takes a sequence of values as parameters and returns a sequence of values as results. [2] Functions can call each other, including recursively, resulting in an implicit call stack that cannot be accessed directly. Functions may also declare mutable local variables that are usable as virtual registers.
 Tables
 A table is an array of opaque values of a particular element type. It allows programs to select such values indirectly through a dynamic index operand. Currently, the only available element type is an untyped function reference. Thereby, a program can call functions indirectly through a dynamic index into a table. For example, this allows emulating function pointers by way of table indices.
 Linear Memory
 A linear memory is a contiguous, mutable array of raw bytes. Such a memory is created with an initial size but can be grown dynamically. A program can load and store values from/to a linear memory at any byte address (including unaligned). Integer loads and stores can specify a storage size which is smaller than the size of the respective value type. A trap occurs if an access is not within the bounds of the current memory size.
 Modules
 A WebAssembly binary takes the form of a module that contains definitions for functions, tables, and linear memories, as well as mutable or immutable global variables. Definitions can also be imported, specifying a module/name pair and a suitable type. Each definition can optionally be exported under one or more names. In addition to definitions, modules can define initialization data for their memories or tables that takes the form of segments copied to given offsets. They can also define a start function that is automatically executed.
 Embedder
 A WebAssembly implementation will typically be embedded into a host environment. This environment defines how loading of modules is initiated, how imports are provided (including hostside definitions), and how exports can be accessed. However, the details of any particular embedding are beyond the scope of this specification, and will instead be provided by complementary, environmentspecific API definitions.
[1]  In practice, implementations need not maintain an actual operand stack. Instead, the stack can be viewed as a set of anonymous registers that are implicitly referenced by instructions. The type system ensures that the stack height, and thus any referenced register, is always known statically. 
[2]  In the current version of WebAssembly, there may be at most one result value. 
1.2.2. Semantic Phases
Conceptually, the semantics of WebAssembly is divided into three phases. For each part of the language, the specification specifies each of them.
 Decoding
 WebAssembly modules are distributed in a binary format. Decoding processes that format and converts it into an internal representation of a module. In this specification, this representation is modelled by abstract syntax, but a real implementation could compile directly to machine code instead.
 Validation
 A decoded module has to be valid. Validation checks a number of wellformedness conditions to guarantee that the module is meaningful and safe. In particular, it performs type checking of functions and the instruction sequences in their bodies, ensuring for example that the operand stack is used consistently.
 Execution

Finally, a valid module can be executed. Execution can be further divided into two phases:
Instantiation. A module instance is the dynamic representation of a module, complete with its own state and execution stack. Instantiation executes the module body itself, given definitions for all its imports. It initializes globals, memories and tables and invokes the module’s start function if defined. It returns the instances of the module’s exports.
Invocation. Once instantiated, further WebAssembly computations can be initiated by invoking an exported function on a module instance. Given the required arguments, that executes the respective function and returns its results.
Instantiation and invocation are operations within the embedding environment.
2. Structure
2.1. Conventions
WebAssembly is a programming language that has multiple concrete representations (its binary format and the text format). Both map to a common structure. For conciseness, this structure is described in the form of an abstract syntax. All parts of this specification are defined in terms of this abstract syntax.
2.1.1. Grammar Notation
The following conventions are adopted in defining grammar rules for abstract syntax.
 Terminal symbols (atoms) are written in sansserif font: $i32,end$.
 Nonterminal symbols are written in italic font: $valtype,instr$.
 $A_{n}$ is a sequence of $n≥0$ iterations of $A$.
 $A_{∗}$ is a possibly empty sequence of iterations of $A$. (This is a shorthand for $A_{n}$ used where $n$ is not relevant.)
 $A_{+}$ is a nonempty sequence of iterations of $A$. (This is a shorthand for $A_{n}$ where $n≥1$.)
 $A_{?}$ is an optional occurrence of $A$. (This is a shorthand for $A_{n}$ where $n≤1$.)
 Productions are written $sym::=A_{1}∣…∣A_{n}$.
 Large productions may be split into multiple definitions, indicated by ending the first one with explicit ellipses, $sym::=A_{1}∣…$, and starting continuations with ellipses, $sym::=…∣A_{2}$.
 Some productions are augmented with side conditions in parentheses, “$(ifcondition)$”, that provide a shorthand for a combinatorial expansion of the production into many separate cases.
2.1.2. Auxiliary Notation
When dealing with syntactic constructs the following notation is also used:
 $ϵ$ denotes the empty sequence.
 $∣s∣$ denotes the length of a sequence $s$.
 $s[i]$ denotes the $i$th element of a sequence $s$, starting from $0$.
 $s[in]$ denotes the subsequence $s[i]…s[i+n−1]$ of a sequence $s$.
 $s[i]=A$ denotes the same sequence as $s$, except that the $i$th element is replaced with $A$.
 $s[in]=A_{n}$ denotes the same sequence as $s$, except that the subsequence $s[in]$ is replaced with $A_{n}$.
 $(s_{∗})$ denotes the flat sequence formed by concatenating all sequences $s_{i}$ in $s_{∗}$.
Moreover, the following conventions are employed:
 The notation $x_{n}$, where $x$ is a nonterminal symbol, is treated as a meta variable ranging over respective sequences of $x$ (similarly for $x_{∗}$, $x_{+}$, $x_{?}$).
 When given a sequence $x_{n}$, then the occurrences of $x$ in a sequence written $(A_{1}xA_{2})_{n}$ are assumed to be in pointwise correspondence with $x_{n}$ (similarly for $x_{∗}$, $x_{+}$, $x_{?}$). This implicitly expresses a form of mapping syntactic constructions over a sequence.
Productions of the following form are interpreted as records that map a fixed set of fields $field_{i}$ to “values” $A_{i}$, respectively:
The following notation is adopted for manipulating such records:

$r.field$ denotes the contents of the $field$ component of $r$.

$rfield=A$ denotes the same record as $r$, except that the contents of the $field$ component is replaced with $A$.

$r_{1}r_{2}$ denotes the composition of two records with the same fields of sequences by appending each sequence pointwise:
${field_{1}A_{1},field_{2}A_{2},…}{field_{1}B_{1},field_{2}B_{2},…}={field_{1}A_{1}B_{1},field_{2}A_{2}B_{2},…}$ 
$r_{∗}$ denotes the composition of a sequence of records, respectively; if the sequence is empty, then all fields of the resulting record are empty.
The update notation for sequences and records generalizes recursively to nested components accessed by “paths” $pth::=([…]∣.field)_{+}$:
 $s[i]pth=A$ is short for $s[i]=(s[i]pth=A)$.
 $rfieldpth=A$ is short for $rfield=(r.fieldpth=A)$.
where $r.field=A$ is shortened to $rfield=A$.
2.2. Values
WebAssembly programs operate on primitive numeric values. Moreover, in the definition of programs, immutable sequences of values occur to represent more complex data, such as text strings or other vectors.
2.2.1. Bytes
The simplest form of value are raw uninterpreted bytes. In the abstract syntax they are represented as hexadecimal literals.
2.2.2. Integers
Different classes of integers with different value ranges are distinguished by their bit width $N$ and by whether they are unsigned or signed.
The latter class defines uninterpreted integers, whose signedness interpretation can vary depending on context. In the abstract syntax, they are represented as unsigned values. However, some operations convert them to signed based on a two’s complement interpretation.
Note
The main integer types occurring in this specification are $u32$, $u64$, $s32$, $s64$, $i8$, $i16$, $i32$, $i64$. However, other sizes occur as auxiliary constructions, e.g., in the definition of floatingpoint numbers.
2.2.3. FloatingPoint
Floatingpoint data represents 32 or 64 bit values that correspond to the respective binary formats of the IEEE 7542008 standard (Section 3.3).
Every value has a sign and a magnitude. Magnitudes can either be expressed as normal numbers of the form $m_{0}.m_{1}m_{2}…m_{M}⋅2_{e}$, where $e$ is the exponent and $m$ is the significand whose most signifcant bit $m_{0}$ is $1$, or as a subnormal number where the exponent is fixed to the smallest possible value and $m_{0}$ is $0$; among the subnormals are positive and negative zero values. Since the significands are binary values, normals are represented in the form $(1+m⋅2_{−M})⋅2_{e}$, where $M$ is the bit width of $m$; similarly for subnormals.
Possible magnitudes also include the special values $∞$ (infinity) and $nan$ (NaN, not a number). NaN values have a payload that describes the mantissa bits in the underlying binary representation. No distinction is made between signalling and quiet NaNs.
where $M=(N)$ and $E=(N)$ with
A canonical NaN is a floatingpoint value $±(_{N})$ where $_{N}$ is a payload whose most significant bit is $1$ while all others are $0$:
An arithmetic NaN is a floatingpoint value $±(n)$ with $n≥_{N}$, such that the most significant bit is $1$ while all others are arbitrary.
Note
In the abstract syntax, subnormals are distinguished by the leading 0 of the significand. The exponent of subnormals has the same value as the smallest possible exponent of a normal number. Only in the binary representation the exponent of a subnormal is encoded differently than the exponent of any normal number.
2.2.4. Names
Names are sequences of scalar code points as defined by Unicode (Section 2.4).
Due to the limitations of the binary format, the length of a name is bounded by the length of its UTF8 encoding.
2.3. Types
Various entities in WebAssembly are classified by types. Types are checked during validation, instantiation, and possibly execution.
2.3.1. Value Types
Value types classify the individual values that WebAssembly code can compute with and the values that a variable accepts.
The types $i32$ and $i64$ classify 32 and 64 bit integers, respectively. Integers are not inherently signed or unsigned, their interpretation is determined by individual operations.
The types $f32$ and $f64$ classify 32 and 64 bit floatingpoint data, respectively. They correspond to the respective binary floatingpoint representations, also known as single and double precision, as defined by the IEEE 7542008 standard (Section 3.3).
2.3.2. Result Types
Result types classify the result of executing instructions or blocks, which is a sequence of values written with brackets.
Note
In the current version of WebAssembly, at most one value is allowed as a result. However, this may be generalized to sequences of values in future versions.
2.3.3. Function Types
Function types classify the signature of functions, mapping a vector of parameters to a vector of results, written as follows.
Note
In the current version of WebAssembly, the length of the result type vector of a valid function type may be at most $1$. This restriction may be removed in future versions.
2.3.4. Limits
Limits classify the size range of resizeable storage associated with memory types and table types.
If no maximum is given, the respective storage can grow to any size.
2.3.5. Memory Types
Memory types classify linear memories and their size range.
The limits constrain the minimum and optionally the maximum size of a memory. The limits are given in units of page size.
2.3.6. Table Types
Table types classify tables over elements of element types within a size range.
Like memories, tables are constrained by limits for their minimum and optionally maximum size. The limits are given in numbers of entries.
The element type $funcref$ is the infinite union of all function types. A table of that type thus contains references to functions of heterogeneous type.
Note
In future versions of WebAssembly, additional element types may be introduced.
2.3.7. Global Types
Global types classify global variables, which hold a value and can either be mutable or immutable.
2.3.8. External Types
External types classify imports and external values with their respective types.
2.4. Instructions
WebAssembly code consists of sequences of instructions. Its computational model is based on a stack machine in that instructions manipulate values on an implicit operand stack, consuming (popping) argument values and producing or returning (pushing) result values.
Note
In the current version of WebAssembly, at most one result value can be pushed by a single instruction. This restriction may be lifted in future versions.
In addition to dynamic operands from the stack, some instructions also have static immediate arguments, typically indices or type annotations, which are part of the instruction itself.
Some instructions are structured in that they bracket nested sequences of instructions.
The following sections group instructions into a number of different categories.
2.4.1. Numeric Instructions
Numeric instructions provide basic operations over numeric values of specific type. These operations closely match respective operations available in hardware.
Numeric instructions are divided by value type. For each type, several subcategories can be distinguished:
 Constants: return a static constant.
 Unary Operators: consume one operand and produce one result of the respective type.
 Binary Operators: consume two operands and produce one result of the respective type.
 Tests: consume one operand of the respective type and produce a Boolean integer result.
 Comparisons: consume two operands of the respective type and produce a Boolean integer result.
 Conversions: consume a value of one type and produce a result of another (the source type of the conversion is the one after the “$/$”).
Some integer instructions come in two flavors, where a signedness annotation $sx$ distinguishes whether the operands are to be interpreted as unsigned or signed integers. For the other integer instructions, the use of two’s complement for the signed interpretation means that they behave the same regardless of signedness.
2.4.2. Parametric Instructions
Instructions in this group can operate on operands of any value type.
The $drop$ operator simply throws away a single operand.
The $select$ operator selects one of its first two operands based on whether its third operand is zero or not.
2.4.3. Variable Instructions
Variable instructions are concerned with access to local or global variables.
These instructions get or set the values of variables, respectively. The $local.tee$ instruction is like $local.set$ but also returns its argument.
2.4.4. Memory Instructions
Instructions in this group are concerned with linear memory.
Memory is accessed with $load$ and $store$ instructions for the different value types. They all take a memory immediate $memarg$ that contains an address offset and an alignment hint (in base 2 logarithmic representation). Integer loads and stores can optionally specify a storage size that is smaller than the bit width of the respective value type. In the case of loads, a sign extension mode $sx$ is then required to select appropriate behavior.
The static address offset is added to the dynamic address operand, yielding a 33 bit effective address that is the zerobased index at which the memory is accessed. All values are read and written in little endian byte order. A trap results if any of the accessed memory bytes lies outside the address range implied by the memory’s current size.
Note
Future version of WebAssembly might provide memory instructions with 64 bit address ranges.
The $memory.size$ instruction returns the current size of a memory. The $memory.grow$ instruction grows memory by a given delta and returns the previous size, or $−1$ if enough memory cannot be allocated. Both instructions operate in units of page size.
2.4.5. Control Instructions
Instructions in this group affect the flow of control.
The $nop$ instruction does nothing.
The $unreachable$ instruction causes an unconditional trap.
The $block$, $loop$ and $if$ instructions are structured instructions. They bracket nested sequences of instructions, called blocks, terminated with, or separated by, $end$ or $else$ pseudoinstructions. As the grammar prescribes, they must be wellnested. A structured instruction can produce a value as described by the annotated result type.
Each structured control instruction introduces an implicit label. Labels are targets for branch instructions that reference them with label indices. Unlike with other index spaces, indexing of labels is relative by nesting depth, that is, label $0$ refers to the innermost structured control instruction enclosing the referring branch instruction, while increasing indices refer to those farther out. Consequently, labels can only be referenced from within the associated structured control instruction. This also implies that branches can only be directed outwards, “breaking” from the block of the control construct they target. The exact effect depends on that control construct. In case of $block$ or $if$ it is a forward jump, resuming execution after the matching $end$. In case of $loop$ it is a backward jump to the beginning of the loop.
Note
This enforces structured control flow. Intuitively, a branch targeting a $block$ or $if$ behaves like a $break$ statement, while a branch targeting a $loop$ behaves like a $continue$ statement.
Branch instructions come in several flavors: $br$ performs an unconditional branch, $br_if$ performs a conditional branch, and $br_table$ performs an indirect branch through an operand indexing into the label vector that is an immediate to the instruction, or to a default target if the operand is out of bounds. The $return$ instruction is a shortcut for an unconditional branch to the outermost block, which implicitly is the body of the current function. Taking a branch unwinds the operand stack up to the height where the targeted structured control instruction was entered. However, forward branches that target a control instruction with a nonempty result type consume matching operands first and push them back on the operand stack after unwinding, as a result for the terminated structured instruction.
The $call$ instruction invokes another function, consuming the necessary arguments from the stack and returning the result values of the call. The $call_indirect$ instruction calls a function indirectly through an operand indexing into a table. Since tables may contain function elements of heterogeneous type $funcref$, the callee is dynamically checked against the function type indexed by the instruction’s immediate, and the call aborted with a trap if it does not match.
2.4.6. Expressions
Function bodies, initialization values for globals, and offsets of element or data segments are given as expressions, which are sequences of instructions terminated by an $end$ marker.
In some places, validation restricts expressions to be constant, which limits the set of allowable instructions.
2.5. Modules
WebAssembly programs are organized into modules, which are the unit of deployment, loading, and compilation. A module collects definitions for types, functions, tables, memories, and globals. In addition, it can declare imports and exports and provide initialization logic in the form of data and element segments or a start function.
Each of the vectors – and thus the entire module – may be empty.
2.5.1. Indices
Definitions are referenced with zerobased indices. Each class of definition has its own index space, as distinguished by the following classes.
The index space for functions, tables, memories and globals includes respective imports declared in the same module. The indices of these imports precede the indices of other definitions in the same index space.
The index space for locals is only accessible inside a function and includes the parameters of that function, which precede the local variables.
Label indices reference structured control instructions inside an instruction sequence.
2.5.2. Types
The $types$ component of a module defines a vector of function types.
All function types used in a module must be defined in this component. They are referenced by type indices.
Note
Future versions of WebAssembly may add additional forms of type definitions.
2.5.3. Functions
The $funcs$ component of a module defines a vector of functions with the following structure:
The $type$ of a function declares its signature by reference to a type defined in the module. The parameters of the function are referenced through 0based local indices in the function’s body; they are mutable.
The $locals$ declare a vector of mutable local variables and their types. These variables are referenced through local indices in the function’s body. The index of the first local is the smallest index not referencing a parameter.
The $body$ is an instruction sequence that upon termination must produce a stack matching the function type’s result type.
Functions are referenced through function indices, starting with the smallest index not referencing a function import.
2.5.4. Tables
The $tables$ component of a module defines a vector of tables described by their table type:
A table is a vector of opaque values of a particular table element type. The $min$ size in the limits of the table type specifies the initial size of that table, while its $max$, if present, restricts the size to which it can grow later.
Tables can be initialized through element segments.
Tables are referenced through table indices, starting with the smallest index not referencing a table import. Most constructs implicitly reference table index $0$.
Note
In the current version of WebAssembly, at most one table may be defined or imported in a single module, and all constructs implicitly reference this table $0$. This restriction may be lifted in future versions.
2.5.5. Memories
The $mems$ component of a module defines a vector of linear memories (or memories for short) as described by their memory type:
A memory is a vector of raw uninterpreted bytes. The $min$ size in the limits of the memory type specifies the initial size of that memory, while its $max$, if present, restricts the size to which it can grow later. Both are in units of page size.
Memories can be initialized through data segments.
Memories are referenced through memory indices, starting with the smallest index not referencing a memory import. Most constructs implicitly reference memory index $0$.
Note
In the current version of WebAssembly, at most one memory may be defined or imported in a single module, and all constructs implicitly reference this memory $0$. This restriction may be lifted in future versions.
2.5.6. Globals
The $globals$ component of a module defines a vector of global variables (or globals for short):
Each global stores a single value of the given global type. Its $type$ also specifies whether a global is immutable or mutable. Moreover, each global is initialized with an $init$ value given by a constant initializer expression.
Globals are referenced through global indices, starting with the smallest index not referencing a global import.
2.5.7. Element Segments
The initial contents of a table is uninitialized. The $elem$ component of a module defines a vector of element segments that initialize a subrange of a table, at a given offset, from a static vector of elements.
The $offset$ is given by a constant expression.
Note
In the current version of WebAssembly, at most one table is allowed in a module. Consequently, the only valid $tableidx$ is $0$.
2.5.8. Data Segments
The initial contents of a memory are zerovalued bytes. The $data$ component of a module defines a vector of data segments that initialize a range of memory, at a given offset, with a static vector of bytes.
The $offset$ is given by a constant expression.
Note
In the current version of WebAssembly, at most one memory is allowed in a module. Consequently, the only valid $memidx$ is $0$.
2.5.9. Start Function
The $start$ component of a module declares the function index of a start function that is automatically invoked when the module is instantiated, after tables and memories have been initialized.
2.5.10. Exports
The $exports$ component of a module defines a set of exports that become accessible to the host environment once the module has been instantiated.
Each export is labeled by a unique name. Exportable definitions are functions, tables, memories, and globals, which are referenced through a respective descriptor.
2.5.11. Imports
The $imports$ component of a module defines a set of imports that are required for instantiation.
Each import is labeled by a twolevel name space, consisting of a $module$ name and a $name$ for an entity within that module. Importable definitions are functions, tables, memories, and globals. Each import is specified by a descriptor with a respective type that a definition provided during instantiation is required to match.
Every import defines an index in the respective index space. In each index space, the indices of imports go before the first index of any definition contained in the module itself.
Note
Unlike export names, import names are not necessarily unique. It is possible to import the same $module$/$name$ pair multiple times; such imports may even have different type descriptions, including different kinds of entities. A module with such imports can still be instantiated depending on the specifics of how an embedder allows resolving and supplying imports. However, embedders are not required to support such overloading, and a WebAssembly module itself cannot implement an overloaded name.
3. Validation
3.1. Conventions
Validation checks that a WebAssembly module is wellformed. Only valid modules can be instantiated.
Validity is defined by a type system over the abstract syntax of a module and its contents. For each piece of abstract syntax, there is a typing rule that specifies the constraints that apply to it. All rules are given in two equivalent forms:
 In prose, describing the meaning in intuitive form.
 In formal notation, describing the rule in mathematical form. [1]
Note
The prose and formal rules are equivalent, so that understanding of the formal notation is not required to read this specification. The formalism offers a more concise description in notation that is used widely in programming languages semantics and is readily amenable to mathematical proof.
In both cases, the rules are formulated in a declarative manner. That is, they only formulate the constraints, they do not define an algorithm. The skeleton of a sound and complete algorithm for typechecking instruction sequences according to this specification is provided in the appendix.
3.1.1. Contexts
Validity of an individual definition is specified relative to a context, which collects relevant information about the surrounding module and the definitions in scope:
 Types: the list of types defined in the current module.
 Functions: the list of functions declared in the current module, represented by their function type.
 Tables: the list of tables declared in the current module, represented by their table type.
 Memories: the list of memories declared in the current module, represented by their memory type.
 Globals: the list of globals declared in the current module, represented by their global type.
 Locals: the list of locals declared in the current function (including parameters), represented by their value type.
 Labels: the stack of labels accessible from the current position, represented by their result type.
 Return: the return type of the current function, represented as an optional result type that is absent when no return is allowed, as in freestanding expressions.
In other words, a context contains a sequence of suitable types for each index space, describing each defined entry in that space. Locals, labels and return type are only used for validating instructions in function bodies, and are left empty elsewhere. The label stack is the only part of the context that changes as validation of an instruction sequence proceeds.
More concretely, contexts are defined as records $C$ with abstract syntax:
In addition to field access written $C.field$ the following notation is adopted for manipulating contexts:
 When spelling out a context, empty fields are omitted.
 $C,fieldA_{∗}$ denotes the same context as $C$ but with the elements $A_{∗}$ prepended to its $field$ component sequence.
Note
We use indexing notation like $C.[i]$ to look up indices in their respective index space in the context. Context extension notation $C,fieldA$ is primarily used to locally extend relative index spaces, such as label indices. Accordingly, the notation is defined to append at the front of the respective sequence, introducing a new relative index $0$ and shifting the existing ones.
3.1.2. Prose Notation
Validation is specified by stylised rules for each relevant part of the abstract syntax. The rules not only state constraints defining when a phrase is valid, they also classify it with a type. The following conventions are adopted in stating these rules.

A phrase $A$ is said to be “valid with type $T$” if and only if all constraints expressed by the respective rules are met. The form of $T$ depends on what $A$ is.
Note
For example, if $A$ is a function, then $T$ is a function type; for an $A$ that is a global, $T$ is a global type; and so on.

The rules implicitly assume a given context $C$.

In some places, this context is locally extended to a context $C_{′}$ with additional entries. The formulation “Under context $C_{′}$, … statement …” is adopted to express that the following statement must apply under the assumptions embodied in the extended context.
3.1.3. Formal Notation
Note
This section gives a brief explanation of the notation for specifying typing rules formally. For the interested reader, a more thorough introduction can be found in respective text books. [2]
The proposition that a phrase $A$ has a respective type $T$ is written $A:T$. In general, however, typing is dependent on a context $C$. To express this explicitly, the complete form is a judgement $C⊢A:T$, which says that $A:T$ holds under the assumptions encoded in $C$.
The formal typing rules use a standard approach for specifying type systems, rendering them into deduction rules. Every rule has the following general form:
Such a rule is read as a big implication: if all premises hold, then the conclusion holds. Some rules have no premises; they are axioms whose conclusion holds unconditionally. The conclusion always is a judgment $C⊢A:T$, and there is one respective rule for each relevant construct $A$ of the abstract syntax.
Note
For example, the typing rule for the $.$ instruction can be given as an axiom:
The instruction is always valid with type $[][$] (saying that it consumes two $i32$ values and produces one), independent of any side conditions.
An instruction like $local.get$ can be typed as follows:
Here, the premise enforces that the immediate local index $x$ exists in the context. The instruction produces a value of its respective type $t$ (and does not consume any values). If $C.[x]$ does not exist then the premise does not hold, and the instruction is illtyped.
Finally, a structured instruction requires a recursive rule, where the premise is itself a typing judgement:
A $block$ instruction is only valid when the instruction sequence in its body is. Moreover, the result type must match the block’s annotation $[t_{?}]$. If so, then the $block$ instruction has the same type as the body. Inside the body an additional label of the same type is available, which is expressed by extending the context $C$ with the additional label information for the premise.
[1]  The semantics is derived from the following article: Andreas Haas, Andreas Rossberg, Derek Schuff, Ben Titzer, Dan Gohman, Luke Wagner, Alon Zakai, JF Bastien, Michael Holman. Bringing the Web up to Speed with WebAssembly. Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2017). ACM 2017. 
[2]  For example: Benjamin Pierce. Types and Programming Languages. The MIT Press 2002 
3.2. Types
Most types are universally valid. However, restrictions apply to function types as well as the limits of table types and memory types, which must be checked during validation.
3.2.1. Limits
Limits must have meaningful bounds that are within a given range.
3.2.2. Function Types
Function types may not specify more than one result.
3.2.3. Table Types
3.2.3.1. $limits elemtype$
 The limits $limits$ must be valid within range $2_{32}$.
 Then the table type is valid.
3.2.4. Memory Types
3.2.4.1. $limits$
 The limits $limits$ must be valid within range $2_{16}$.
 Then the memory type is valid.
3.3. Instructions
Instructions are classified by function types $[t_{1}][t_{2}]$ that describe how they manipulate the operand stack. The types describe the required input stack with argument values of types $t_{1}$ that an instruction pops off and the provided output stack with result values of types $t_{2}$ that it pushes back.
Note
For example, the instruction $.$ has type $[][]$, consuming two $i32$ values and producing one.
Typing extends to instruction sequences $_{∗}$. Such a sequence has a function type $[t_{1}][t_{2}]$ if the accumulative effect of executing the instructions is consuming values of types $t_{1}$ off the operand stack and pushing new values of types $t_{2}$.
For some instructions, the typing rules do not fully constrain the type, and therefore allow for multiple types. Such instructions are called polymorphic. Two degrees of polymorphism can be distinguished:
 valuepolymorphic: the value type $t$ of one or several individual operands is unconstrained. That is the case for all parametric instructions like $drop$ and $select$.
 stackpolymorphic: the entire (or most of the) function type $[t_{1}][t_{2}]$ of the instruction is unconstrained. That is the case for all control instructions that perform an unconditional control transfer, such as $unreachable$, $br$, $br_table$, and $return$.
In both cases, the unconstrained types or type sequences can be chosen arbitrarily, as long as they meet the constraints imposed for the surrounding parts of the program.
Note
For example, the $select$ instruction is valid with type $[tt][t]$, for any possible value type $t$. Consequently, both instruction sequences
and
are valid, with $t$ in the typing of $select$ being instantiated to $i32$ or $f64$, respectively.
The $unreachable$ instruction is valid with type $[t_{1}][t_{2}]$ for any possible sequences of value types $t_{1}$ and $t_{2}$. Consequently,
is valid by assuming type $[][]$ for the $unreachable$ instruction. In contrast,
is invalid, because there is no possible type to pick for the $unreachable$ instruction that would make the sequence welltyped.
3.3.2. Parametric Instructions
3.3.2.2. $select$
 The instruction is valid with type $[tt][t]$, for any value type $t$.
Note
Both $drop$ and $select$ are valuepolymorphic instructions.
3.3.3. Variable Instructions
3.3.3.1. $x$
 The local $C.[x]$ must be defined in the context.
 Let $t$ be the value type $C.[x]$.
 Then the instruction is valid with type $[][t]$.
3.3.3.2. $x$
 The local $C.[x]$ must be defined in the context.
 Let $t$ be the value type $C.[x]$.
 Then the instruction is valid with type $[t][]$.
3.3.3.3. $x$
 The local $C.[x]$ must be defined in the context.
 Let $t$ be the value type $C.[x]$.
 Then the instruction is valid with type $[t][t]$.
3.3.3.4. $x$
 The global $C.[x]$ must be defined in the context.
 Let $t$ be the global type $C.[x]$.
 Then the instruction is valid with type $[][t]$.
3.3.3.5. $x$
 The global $C.[x]$ must be defined in the context.
 Let $t$ be the global type $C.[x]$.
 The mutability $mut$ must be $var$.
 Then the instruction is valid with type $[t][]$.
3.3.4. Memory Instructions
3.3.4.1. $t.$
 The memory $C.[0]$ must be defined in the context.
 The alignment $2_{.}$ must not be larger than the bit width of $t$ divided by $8$.
 Then the instruction is valid with type $[][t]$.
3.3.4.2. $t.N_$
 The memory $C.[0]$ must be defined in the context.
 The alignment $2_{.}$ must not be larger than $N/8$.
 Then the instruction is valid with type $[][t]$.
3.3.4.3. $t.$
 The memory $C.[0]$ must be defined in the context.
 The alignment $2_{.}$ must not be larger than the bit width of $t$ divided by $8$.
 Then the instruction is valid with type $[t][]$.
3.3.4.4. $t.N$
 The memory $C.[0]$ must be defined in the context.
 The alignment $2_{.}$ must not be larger than $N/8$.
 Then the instruction is valid with type $[t][]$.
3.3.5. Control Instructions
3.3.5.2. $unreachable$
 The instruction is valid with type $[t_{1}][t_{2}]$, for any sequences of value types $t_{1}$ and $t_{2}$.
Note
The $unreachable$ instruction is stackpolymorphic.
3.3.5.3. $[t_{?}]_{∗}$
 Let $C_{′}$ be the same context as $C$, but with the result type $[t_{?}]$ prepended to the $labels$ vector.
 Under context $C_{′}$, the instruction sequence $_{∗}$ must be valid with type $[][t_{?}]$.
 Then the compound instruction is valid with type $[][t_{?}]$.
Note
The notation $C,[t_{?}]$ inserts the new label type at index $0$, shifting all others.
The fact that the nested instruction sequence $_{∗}$ must have type $[][t_{?}]$ implies that it cannot access operands that have been pushed on the stack before the block was entered. This may be generalized in future versions of WebAssembly.
3.3.5.4. $[t_{?}]_{∗}$
 Let $C_{′}$ be the same context as $C$, but with the empty result type $[]$ prepended to the $labels$ vector.
 Under context $C_{′}$, the instruction sequence $_{∗}$ must be valid with type $[][t_{?}]$.
 Then the compound instruction is valid with type $[][t_{?}]$.
Note
The notation $C,[]$ inserts the new label type at index $0$, shifting all others.
The fact that the nested instruction sequence $_{∗}$ must have type $[][t_{?}]$ implies that it cannot access operands that have been pushed on the stack before the loop was entered. This may be generalized in future versions of WebAssembly.
3.3.5.5. $[t_{?}]_{1}_{2}$
 Let $C_{′}$ be the same context as $C$, but with the result type $[t_{?}]$ prepended to the $labels$ vector.
 Under context $C_{′}$, the instruction sequence $_{1}$ must be valid with type $[][t_{?}]$.
 Under context $C_{′}$, the instruction sequence $_{2}$ must be valid with type $[][t_{?}]$.
 Then the compound instruction is valid with type $[][t_{?}]$.
Note
The notation $C,[t_{?}]$ inserts the new label type at index $0$, shifting all others.
The fact that the nested instruction sequence $_{∗}$ must have type $[][t_{?}]$ implies that it cannot access operands that have been pushed on the stack before the conditional was entered. This may be generalized in future versions of WebAssembly.
3.3.5.6. $l$
 The label $C.[l]$ must be defined in the context.
 Let $[t_{?}]$ be the result type $C.[l]$.
 Then the instruction is valid with type $[t_{1}t_{?}][t_{2}]$, for any sequences of value types $t_{1}$ and $t_{2}$.
Note
The label index space in the context $C$ contains the most recent label first, so that $C.[l]$ performs a relative lookup as expected.
The $br$ instruction is stackpolymorphic.
3.3.5.7. $l$
 The label $C.[l]$ must be defined in the context.
 Let $[t_{?}]$ be the result type $C.[l]$.
 Then the instruction is valid with type $[t_{?}][t_{?}]$.
Note
The label index space in the context $C$ contains the most recent label first, so that $C.[l]$ performs a relative lookup as expected.
3.3.5.8. $l_{∗}l_{N}$
 The label $C.[l_{N}]$ must be defined in the context.
 Let $[t_{?}]$ be the result type $C.[l_{N}]$.
 For all $l_{i}$ in $l_{∗}$, the label $C.[l_{i}]$ must be defined in the context.
 For all $l_{i}$ in $l_{∗}$, $C.[l_{i}]$ must be $[t_{?}]$.
 Then the instruction is valid with type $[t_{1}t_{?}][t_{2}]$, for any sequences of value types $t_{1}$ and $t_{2}$.
Note
The label index space in the context $C$ contains the most recent label first, so that $C.[l_{i}]$ performs a relative lookup as expected.
The $br_table$ instruction is stackpolymorphic.
3.3.5.9. $return$
 The return type $C.$ must not be absent in the context.
 Let $[t_{?}]$ be the result type of $C.$.
 Then the instruction is valid with type $[t_{1}t_{?}][t_{2}]$, for any sequences of value types $t_{1}$ and $t_{2}$.
Note
The $return$ instruction is stackpolymorphic.
$C.$ is absent (set to $ϵ$) when validating an expression that is not a function body. This differs from it being set to the empty result type ($[ϵ]$), which is the case for functions not returning anything.
3.3.5.10. $x$
 The function $C.[x]$ must be defined in the context.
 Then the instruction is valid with type $C.[x]$.
3.3.5.11. $x$
 The table $C.[0]$ must be defined in the context.
 Let $limits elemtype$ be the table type $C.[0]$.
 The element type $elemtype$ must be $funcref$.
 The type $C.[x]$ must be defined in the context.
 Let $[t_{1}][t_{2}]$ be the function type $C.[x]$.
 Then the instruction is valid with type $[t_{1}][t_{2}]$.
3.3.6. Instruction Sequences
Typing of instruction sequences is defined recursively.
3.3.6.1. Empty Instruction Sequence: $ϵ$
 The empty instruction sequence is valid with type $[t_{∗}][t_{∗}]$, for any sequence of value types $t_{∗}$.
3.3.6.2. Nonempty Instruction Sequence: $_{∗}_{N}$
 The instruction sequence $_{∗}$ must be valid with type $[t_{1}][t_{2}]$, for some sequences of value types $t_{1}$ and $t_{2}$.
 The instruction $_{N}$ must be valid with type $[t_{∗}][t_{3}]$, for some sequences of value types $t_{∗}$ and $t_{3}$.
 There must be a sequence of value types $t_{0}$, such that $t_{2}=t_{0}t_{∗}$.
 Then the combined instruction sequence is valid with type $[t_{1}][t_{0}t_{3}]$.
3.3.7. Expressions
Expressions $expr$ are classified by result types of the form $[t_{?}]$.
3.3.7.1. $_{∗}$
 The instruction sequence $_{∗}$ must be valid with type $[][t_{?}]$, for some optional value type $t_{?}$.
 Then the expression is valid with result type $[t_{?}]$.