An anonymous function is a function (or a subroutine) defined, and possibly called, without being bound to a name. In the lambda calculus, of which most programming languages are a superset, all functions are anonymous. The Y combinator can be utilised in these circumstances to provide anonymous recursion. Certain programming languages also provide support for both named and anonymous functions. The lambda calculus without anonymous function definition forms a combinatory logic.
Some object-oriented programming languages have anonymous classes, which are a similar concept. Java is such a language.
 | This computer-programming-related article is a stub. You can help Wikipedia by expanding it. |