[lambda-calculus] The application of a {lambda abstraction} to an argument expression. A copy of the body of the lambda abstraction is made and occurrences of the {bound variable} being replaced by the argument. E.g. ( x . x+1) 4 --> 4+1 Beta reduction is the only kind of reduction in the {pure lambda-calculus}. The opposite of beta reduction is {beta abstraction}. These are the two kinds of {beta conversion}. See also name capture.

In addition suitable contents:
[ = ] [ abstraction ] [ ad ] [ al ] [ am ] [ an ] [ app ] [ application ] [ ar ] [ arc ] [ arg ] [ argument ] [ at ] [ B ] [ b ] [ bd ] [ be ] [ beta ] [ beta abstraction ] [ beta conversion ] [ bo ] [ bound variable ] [ bs ] [ by ] [ ca ] [ cat ] [ cc ] [ ch ] [ co ] [ con ] [ cu ] [ de ] [ du ] [ E ] [ ed ] [ edu ] [ ee ] [ er ] [ es ] [ et ] [ eta abstraction ] [ eta conversion ] [ eta reduction ] [ expression ] [ fi ] [ file ] [ gu ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ io ] [ is ] [ it ] [ ki ] [ la ] [ lambda abstraction ] [ lambda-calculus ] [ lc ] [ Lex ] [ li ] [ ls ] [ lu ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ na ] [ name capture ] [ nc ] [ ng ] [ nl ] [ op ] [ ph ] [ pl ] [ pr ] [ pt ] [ pure lambda-calculus ] [ py ] [ query ] [ rc ] [ re ] [ reduction ] [ S ] [ se ] [ si ] [ sit ] [ so ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ tw ] [ um ] [ us ] [ va ] [ var ] [ variable ] [ ve ] [ version ]