beta reduction

You are here: irt.org | FOLDOC | beta reduction

[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.

Nearby terms: beta abstraction « beta conversion « Betamaxed « beta reduction » beta test » beta testing » beta version

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL

©2018 Martin Webb