Unicode: F51F. Alias: Esc :> Esc. Infix operator with built-in evaluation rules. x  y is by default interpreted as x:>y or RuleDelayed[x,y]. x  y  z groups as x  (y  z).

Packed into functions like Solve and Reduce are a wealth of sophisticated algorithms, many created specifically for Mathematica. Routinely handling both dense and sparse ...

At the core of Mathematica's symbolic programming paradigm is the concept of transformation rules for arbitrary symbolic patterns. Mathematica's pattern language conveniently ...

Module and With allow you to give a specific list of symbols whose names you want to treat as local. In some situations, however, you want to automatically treat certain ...

You can manipulate lists of transformation rules in Mathematica just like other symbolic expressions. It is common to assign a name to a rule or set of rules. This assigns ...

ToRules[eqns] takes logical combinations of equations, in the form generated by Roots and Reduce, and converts them to lists of rules, of the form produced by Solve.

Applying transformation rules. The replacement operator /. (pronounced "slash-dot") applies rules to expressions. You can give a list of rules to apply. Each rule will be ...

Transformation rules in Mathematica let you set local values for symbols, functions, and all other types of expressions. Using rules provides a powerful and extensible method ...

Polynomial algorithms are at the core of classical "computer algebra". Incorporating methods that span from antiquity to the latest cutting-edge research at Wolfram Research, ...

"Values for Symbols" discussed how you can use transformation rules of the form x->value to replace symbols by values. The notion of transformation rules in Mathematica is, ...