Revision as of 21:00, 26 November 2006 edit Abednigo (talk \| contribs) 346 edits No edit summary ← Previous edit		Revision as of 20:45, 9 February 2007 edit undo Brighterorange (talk \| contribs) Administrators 13,302 edits programming languages are not sets, anyway, many languages do not have lexically scoped higher order functions Next edit →
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. 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.

Anonymous function: Difference between revisions