At the core of Mathematica
's symbolic programming paradigm is the concept of transformation rules for arbitrary symbolic patterns. Mathematica
's pattern language conveniently describes a very general set of classes of expressions, making possible uniquely readable, elegant and efficient programs.
representation of replacement rule
apply replacement rules to an expression
elements of a list or expression matching a given pattern
, lhs:=rhs —
make assignments for arbitrary patterns