An expression combines numbers, operators, and/or variables. Expressions may be evaluated to values, and may be said to represent those values. The evaluation of an expression is dependent on the definition of the mathematical operators and system of values that forms the context of an expression.

Expressions may have "free variables" that are not defined in the expression, but taken from the context.

Two expressions are said to be equivalent if they can be evaluated to the same value.

Expressions and their evaluation were formalised by Alonzo Church and Stephen Kleene in the 1930s in their lambda calculus. The lambda calculus has been a major influence in the development of modern mathematics and computer programming languages.

One of the more interesting results of the lambda calculus is that the equivalence of two expressions in the lambda calculus is in some cases undecidable. This is also true of any expression in any system that has power equivalent to the lambda calculus.

See also

• expression (programming)
• algebraic closure
• combinator
• evaluation
• functional programming