SQL

SELECT girl
FROM internet
WHERE age > 18
  AND age < 20
ORDER BY beauty
LIMIT 1,10

>>40
Now I realized that classical two valued logic is enough to prove it.

Let COL(x) mean "x is a closure or a lambda", and U(x) mean "x is useful". We all know that cloures or lambdas are useful, so the implication "∀x.COL(x) → U(x)" is trivial. If, however, x is not closure of lambda, the implication still holds, because ex falso quod libet.

>>41
I don't think you really know what you're talking about

>>42
No, really?

>>35
I'm not. I'm closing some values over a function or a lambda in those examples. In all of them, it's some values being bound over some piece of code. A lambda can exist without being a closure.

You can have lambdas without closures (which are not much use)
IHBT