Requirements are stated in terms of well-defined expressions that define valid terms of
the types that satisfy the requirements.
For every set of well-defined expression
requirements there is a table that specifies an initial set of the valid expressions and
their semantics.
Any generic algorithm (Clause [algorithms]) that uses the
well-defined expression requirements is described in terms of the valid expressions for
its template type parameters.
In some cases the semantic requirements are presented as C++ code.
Such code is intended as a
specification of equivalence of a construct to another construct, not
necessarily as the way the construct
must be implemented.156