Anonymous function: Difference between revisions

Revision as of 14:21, 23 April 2007

Revision as of 19:05, 30 January 2008

Line 1:

An '''anonymous function''' is a [[function (mathematics)|function]] (or a [[subroutine]]) defined, and possibly called, without being bound to a name. In the [[lambda calculus]], 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 class]]es, which are a similar concept. [[Java (programming language)|Java]] is such a language.