Jump to content

Anonymous function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Abednigo (talk | contribs) at 17:03, 16 September 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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. Some object-oriented programming languages have anonymous classes, which are a similar concept.

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Anonymous_function&oldid=76074092"