# beta reduction

2. (computing theory) One of the three rewrite rules of the lambda calculus, which states that the application of a lambda abstraction ${\displaystyle (\lambda x.t)}$ to a term ${\displaystyle s}$ yields an expression ${\displaystyle t[s/x]}$, "t with s instead of x", where all free instances of x in t have been replaced by s.