Noun
lambda abstraction (plural lambda abstractions)
(computing theory) A lambda term of the form
(
λ
x
.
t
)
{\displaystyle (\lambda x.t)}
where x is a variable and t another lambda term. Any free instance of x within t (considered by itself) then becomes bound by the
λ
x
.
{\displaystyle \lambda x.}
prefix. It is meant to represent an anonymous function.