Haskell:
\x y -> x * y
or \x -> x *
or (x *)
Almost all descendants of Lisp and ISWIM (ML, Haskell, etc.) support some kind of terse syntax for lambda expressions. The latter family also generally allows automatic currying, which means that instead of writing x => (y => f(x, y))
you can write f(x,)
and the language will automatically interpret this as a sort of lambda expression.
In some languages this even extends to binary operators. In Haskell, for example, (* 2)
is a valid (and commonplace) expression for an anonymous function that multiplies its argument by two.
Historically, descendants of Algol and Fortran (including the entire C and Pascal family) have not supported any kind of lambda expression until very recently. Languages with some degree of OOP support (including C++ and Java) allow you to write "functor objects," but that's usually much more verbose and a bit less flexible than "real" lambda expressions.