The Standard Evaluation Procedure
Here we describe the standard procedure used by Mathematica
to evaluate expressions. This procedure is the one followed for most kinds of expression. There are however some kinds of expressions, such as those used to represent Mathematica
programs and control structures, which are evaluated in a nonstandard way.
In the standard evaluation procedure, Mathematica
first evaluates the head of an expression, and then evaluates each element of the expressions. These elements are in general themselves expressions, to which the same evaluation procedure is recursively applied.
The three Print
functions are evaluated in turn, each printing its argument, then returning the value Null
This assigns the symbol ps
to be Plus
The head ps
is evaluated first, so this expression behaves just like a sum of terms.
As soon as Mathematica
has evaluated the head of an expression, it sees whether the head is a symbol that has attributes. If the symbol has the attributes Orderless
, then immediately after evaluating the elements of the expression Mathematica
performs the transformations associated with these attributes.
The next step in the standard evaluation procedure is to use definitions that Mathematica
knows for the expression it is evaluating. Mathematica
first tries to use definitions that you have made, and if there are none that apply, it tries built-in definitions.
finds a definition that applies, it performs the corresponding transformation on the expression. The result is another expression, which must then in turn be evaluated according to the standard evaluation procedure.
|• Evaluate the head of the expression.|
|• Evaluate each element in turn.|
|• Apply transformations associated with the attributes Orderless, Listable and Flat.|
|• Apply any definitions that you have given.|
|• Apply any built-in definitions.|
|• Evaluate the result.|
The standard evaluation procedure.
As discussed in "Principles of Evaluation"
follows the principle that each expression is evaluated until no further definitions apply. This means that Mathematica
must continue re-evaluating results until it gets an expression which remains unchanged through the evaluation procedure.
Here is an example that shows how the standard evaluation procedure works on a simple expression. We assume that a=7
|2ax+a^2+1||here is the original expression|
|this is the internal form|
|Times[2,a,x]||this is evaluated first|
|Times[2,7,x]||a is evaluated to give 7|
|Times[14,x]||built-in definitions for Times give this result|
|Power[a,2]||this is evaluated next|
|Power[7,2]||here is the result after evaluating a|
|49||built-in definitions for Power give this result|
|Plus[Times[14,x],49,1]||here is the result after the arguments of Plus have been evaluated|
|Plus[50,Times[14,x]]||built-in definitions for Plus give this result|
|50+14x||the result is printed like this|
A simple example of evaluation in Mathematica.
provides various ways to "trace" the evaluation process, as discussed in "Tracing Evaluation"
. The function Trace[expr]
gives a nested list showing each subexpression generated during evaluation. (Note that the standard evaluation traverses the expression tree in a depth-first way, so that the smallest subparts of the expression appear first in the results of Trace
This gives a nested list of all the subexpressions generated during the evaluation of the expression.
The order in which Mathematica
applies different kinds of definitions is important. The fact that Mathematica
applies definitions you have given before it applies built-in definitions means that you can give definitions which override the built-in ones, as discussed in "Modifying Built-in Functions"
This expression is evaluated using the built-in definition for ArcSin
You can give your own definitions for ArcSin
. You need to remove the protection attribute first.
Your definition is used before the one that is built in.
As discussed in "Associating Definitions with Different Symbols"
, you can associate definitions with symbols either as upvalues or downvalues. Mathematica
always tries upvalue definitions before downvalue ones.
If you have an expression like f[g[x]]
, there are in general two sets of definitions that could apply: downvalues associated with f
, and upvalues associated with g
tries the definitions associated with g
before those associated with f
This ordering follows the general strategy of trying specific definitions before more general ones. By applying upvalues associated with arguments before applying downvalues associated with a function, Mathematica
allows you to make definitions for special arguments which override the general definitions for the function with any arguments.
This defines a rule for f[g[x_]]
, to be associated with f
This defines a rule for f[g[x_]]
, to be associated with g
The rule associated with g
is tried before the rule associated with f
If you remove rules associated with g
, the rule associated with f
|• Definitions associated with g are applied before definitions associated with f in the expression f[g[x]].|
The order in which definitions are applied.
Most functions such as Plus
that are built into Mathematica
have downvalues. There are, however, some objects in Mathematica
which have built-in upvalues. For example, SeriesData
objects, which represent power series, have built-in upvalues with respect to various mathematical operations.
For an expression like f[g[x]]
, the complete sequence of definitions that are tried in the standard evaluation procedure is:
- Definitions you have given associated with g;
- Built-in definitions associated with g;
- Definitions you have given associated with f;
- Built-in definitions associated with f.
The fact that upvalues are used before downvalues is important in many situations. In a typical case, you might want to define an operation such as composition. If you give upvalues for various objects with respect to composition, these upvalues will be used whenever such objects appear. However, you can also give a general procedure for composition, to be used if no special objects are present. You can give this procedure as a downvalue for composition. Since downvalues are tried after upvalues, the general procedure will be used only if no objects with upvalues are present.
Here is a definition associated with q
for composition of "q
Here is a general rule for composition, associated with comp
If you compose two q
objects, the rule associated with q
If you compose r
objects, the general rule associated with comp
In general, there can be several objects that have upvalues in a particular expression. Mathematica
first looks at the head of the expression, and tries any upvalues associated with it. Then it successively looks at each element of the expression, trying any upvalues that exist. Mathematica
performs this procedure first for upvalues that you have explicitly defined, and then for upvalues that are built-in. The procedure means that in a sequence of elements, upvalues associated with earlier elements take precedence over those associated with later elements.
This defines an upvalue for p
with respect to c
This defines an upvalue for q
Which upvalue is used depends on which occurs first in the sequence of arguments to c