@quasi Copy pasting my pedantic response that I've written elsewhere:

AKSHUALLY...

Using "lambdas" as a noun like this is wrong to begin with. Lambda is merely the operator, whose evaluation yields a "lambda abstraction." In Scheme, we would call that a closure, but closures *are* lambda abstractions (implemented as procedures in Scheme). By definition, they capture the variables present in their lexical environment. That's an essential feature of the lambda calculus.