Pure Expressions
Pure functions are required to construct pure expressions. Constant expressions are pure by definition. An expression consisting of a function subexpression applied to one or more argument subexpressions is pure if both these statements about the subexpressions hold:
- The function and argument subexpressions are pure expressions.
- The function subexpression yields a pure function.
Typically the function subexpression is simply a function identifier. Pure expressions are often referred to as being referentially transparent.
Evaluation of a given pure expression will yield the same result regardless of when or how many times evaluation occurs during program execution. This property is what makes it meaningful to talk about an expression's "value". It also makes it possible to replace an expression with the corresponding value (or it with an equivalent alternative expression) without changing the meaning of a program.
Read more about this topic: Pure Function
Famous quotes containing the words pure and/or expressions:
“Teenage girls are extremists who see the world in black-and- white terms, missing shades of gray. Life is either marvelous or not worth living. School is either pure torment or is going fantastically. Other people are either great or horrible, and they themselves are wonderful or pathetic failures. One day a girl will refer to herself as “the goddess of social life” and the next day she’ll regret that she’s the “ultimate in nerdosity.””
—Mary Pipher (20th century)
“Those expressions are omitted which can not with propriety be read aloud in the family.”
—Thomas Bowdler (1754–1825)