Anonymous function: Difference between revisions

Revision as of 18:32, 16 September 2006

Revision as of 21:00, 26 November 2006

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]], of which most [[programming language]]s 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. SomeThe [[object-oriented]]lambda programmingcalculus languageswithout have [[anonymous class]]es,function whichdefinition areforms a similar[[combinatory conceptlogic]].

Some [[object-oriented]] programming languages have [[anonymous class]]es, which are a similar concept. [[Java (programming language)|Java]] is such a language.

{{compu-prog-stub}}