Incomputer programming, ananonymous function (function literal,expression orblock) is afunction definition that is notbound to anidentifier. Anonymous functions are often arguments being passed tohigher-order functions or used for constructing the result of a higher-order function that needs to return a function.[1]If the function is only used once, or a limited number of times, an anonymous function may be syntactically lighter than using a named function. Anonymous functions are ubiquitous infunctional programming languages and other languages withfirst-class functions, where they fulfil the same role for thefunction type asliterals do for otherdata types.
Anonymous functions originate in the work ofAlonzo Church in his invention of thelambda calculus, in which all functions are anonymous, in 1936, before electronic computers.[2] In several programming languages, anonymous functions are introduced using the keywordlambda, and anonymous functions are often referred to as lambdas or lambda abstractions. Anonymous functions have been a feature ofprogramming languages sinceLisp in 1958, and a growing number of modern programming languages support anonymous functions.
The names "lambda abstraction", "lambda function", and "lambda expression" refer to the notation of function abstraction in lambda calculus, where the usual functionf(x) =M would be written(λx.M), and whereM is an expression that usesx. Compare to the Python syntax oflambdax:M.
The name "arrow function" refers to the mathematical "maps to" symbol,x ↦M. Compare to the JavaScript syntax ofx=>M.[3]
 | This sectiondoes notcite anysources. Please helpimprove this section byadding citations to reliable sources. Unsourced material may be challenged andremoved.(February 2018) (Learn how and when to remove this message) |
Anonymous functions can be used for containing functionality that need not be named and possibly for short-term use. Some notable examples includeclosures andcurrying.
The use of anonymous functions is a matter of style. Using them is never the only way to solve a problem; each anonymous function could instead be defined as a named function and called by name. Anonymous functions often provide a briefer notation than defining named functions. In languages that do not permit the definition of named functions in local scopes, anonymous functions may provide encapsulation via localized scope, however the code in the body of such anonymous function may not be re-usable, or amenable to separate testing. Short/simple anonymous functions used in expressions may be easier to read and understand than separately defined named functions, though without adescriptive name they may be more difficult to understand.
In some programming languages, anonymous functions are commonly implemented for very specific purposes such as binding events to callbacks or instantiating the function for particular values, which may be more efficient in aDynamic programming language, more readable, and less error-prone than calling a named function.
The following examples are written in Python 3.
When attempting to sort in a non-standard way, it may be easier to contain the sorting logic as an anonymous function instead of creating a named function.Most languages provide a generic sort function that implements asort algorithm that will sort arbitrary objects.This function usually accepts an arbitrary function that determines how to compare whether two elements are equal or if one is greater or less than the other.
Consider this Python code sorting a list of strings by length of the string:
>>>a=['house','car','bike']>>>a.sort(key=lambdax:len(x))>>>a['car','bike','house']
The anonymous function in this example is the lambda expression:
lambdax:len(x)
The anonymous function accepts one argument,x, and returns the length of its argument, which is then used by thesort() method as the criteria for sorting.
Basic syntax of a lambda function in Python is
lambdaarg1,arg2,arg3,...:<operationontheargumentsreturningavalue>
The expression returned by the lambda function can be assigned to a variable and used in the code at multiple places.
>>>add=lambdaa:a+a>>>add(20)40
Another example would be sorting items in a list by the name of their class (in Python, everything has a class):
>>>a=[10,'number',11.2]>>>a.sort(key=lambdax:x.__class__.__name__)>>>a[11.2,10,'number']
Note that11.2 has class name "float",10 has class name "int", and'number' has class name "str". The sorted order is "float", "int", then "str".
Closures are functions evaluated in an environment containingbound variables. The following example binds the variable "threshold" in an anonymous function that compares the input to the threshold.
defcomp(threshold):returnlambdax:x<threshold
This can be used as a sort of generator of comparison functions:
>>>func_a=comp(10)>>>func_b=comp(20)>>>print(func_a(5),func_a(8),func_a(13),func_a(21))TrueTrueFalseFalse>>>print(func_b(5),func_b(8),func_b(13),func_b(21))TrueTrueTrueFalse
It would be impractical to create a function for every possible comparison function and may be too inconvenient to keep the threshold around for further use. Regardless of the reason why a closure is used, the anonymous function is the entity that contains the functionality that does the comparing.
Currying is the process of changing a function so that rather than taking multiple inputs, it takes a single input and returns a function which accepts the second input, and so forth. In this example, a function that performsdivision by any integer is transformed into one that performs division by a set integer.
>>>defdivide(x,y):...returnx/y>>>defdivisor(d):...returnlambdax:divide(x,d)>>>half=divisor(2)>>>third=divisor(3)>>>print(half(32),third(32))16.010.666666666666666>>>print(half(40),third(40))20.013.333333333333334
While the use of anonymous functions is perhaps not common with currying, it still can be used. In the above example, the function divisor generates functions with a specified divisor. The functions half and third curry the divide function with a fixed divisor.
The divisor function also forms a closure by binding the variabled.
Ahigher-order function is a function that takes a function as an argument or returns one as a result. This is commonly used to customize the behavior of a generically defined function, often a looping construct or recursion scheme. Anonymous functions are a convenient way to specify such function arguments. The following examples are in Python 3.
The map function performs a function call on each element of a list. The following examplesquares every element in an array with an anonymous function.
>>>a=[1,2,3,4,5,6]>>>list(map(lambdax:x*x,a))[1,4,9,16,25,36]
The anonymous function accepts an argument and multiplies it by itself (squares it). The above form is discouraged by the creators of the language, who maintain that the form presented below has the same meaning and is more aligned with the philosophy of the language:
>>>a=[1,2,3,4,5,6]>>>[x*xforxina][1,4,9,16,25,36]
The filter function returns all elements from a list that evaluate True when passed to a certain function.
>>>a=[1,2,3,4,5,6]>>>list(filter(lambdax:x%2==0,a))[2,4,6]
The anonymous function checks if the argument passed to it is even. The same as with map, the form below is considered more appropriate:
>>>a=[1,2,3,4,5,6]>>>[xforxinaifx%2==0][2,4,6]
A fold function runs over all elements in a structure (for lists usually left-to-right, a "left fold", calledreduce in Python), accumulating a value as it goes. This can be used to combine all elements of a structure into one value, for example:
>>>fromfunctoolsimportreduce>>>a=[1,2,3,4,5]>>>reduce(lambdax,y:x*y,a)120
This performs
The anonymous function here is the multiplication of the two arguments.
The result of a fold need not be one value. Instead, both map and filter can be created using fold. In map, the value that is accumulated is a new list, containing the results of applying a function to each element of the original list. In filter, the value that is accumulated is a new list containing only those elements that match the given condition.
The following is a list ofprogramming languages that support unnamed anonymous functions fully, or partly as some variant, or not at all.
This table shows some general trends. First, the languages that do not support anonymous functions (C,Pascal,Object Pascal) are allstatically typed languages. However, statically typed languages can support anonymous functions. For example, theML languages are statically typed and fundamentally include anonymous functions, andDelphi, a dialect ofObject Pascal, has been extended to support anonymous functions, as hasC++ (by theC++11 standard). Second, the languages that treat functions asfirst-class functions (Dylan,Haskell,JavaScript,Lisp,ML,Perl,Python,Ruby,Scheme) generally have anonymous function support so that functions can be defined and passed around as easily as other data types.
 |
| Language | Support | Notes |
|---|---|---|
| ActionScript |  Y | |
| Ada | Y | Expression functions are a part of Ada2012, access-to-subprogram[4] |
| ALGOL 68 | Y | |
| APL | Y | Dyalog, ngn and dzaima APL fully support both dfns and tacit functions. GNU APL has rather limited support for dfns. |
| Assembly languages |  N | |
| AHK | Y | Since AutoHotkey V2 anonymous functions are supported with a syntax similar to JavaScript. |
| Bash | Y | A library has been made to support anonymous functions in Bash.[5] |
| C | N | Support is provided inClang and along with theLLVM compiler-rt lib. GCC support is given for a macro implementation which enables the possibility of use. Seebelow for more details. |
| C# | Y | [6] |
| C++ | Y | As of theC++11 standard |
| CFML | Y | As ofRailo 4,[7]ColdFusion 10[8] |
| Clojure | Y | [9] |
| COBOL | N | Micro Focus's non-standard Managed COBOL dialect supports lambdas, which are called anonymous delegates/methods.[10] |
| Curl | Y | |
| D | Y | [11] |
| Dart | Y | [12] |
| Delphi | Y | [13] |
| Dylan | Y | [14] |
| Eiffel | Y | |
| Elm | Y | [15] |
| Elixir | Y | [16] |
| Erlang | Y | [17] |
| F# | Y | [18] |
| Excel | Y | Excel worksheet function, 2021 beta release[19] |
| Factor | Y | "Quotations" support this[20] |
| Fortran | N | |
| Frink | Y | [21] |
| Go | Y | [22] |
| Gosu | Y | [23] |
| Groovy | Y | [24] |
| Haskell | Y | [25] |
| Haxe | Y | [26] |
| Java | Y | Supported sinceJava 8. |
| JavaScript | Y | [27] |
| Julia | Y | [28] |
| Kotlin | Y | [29] |
| Lisp | Y | |
| Logtalk | Y | |
| Lua | Y | [30] |
| MUMPS | N | |
| Maple | Y | [31] |
| MATLAB | Y | [32] |
| Maxima | Y | [33] |
| Nim | Y | [34] |
| OCaml | Y | [35] |
| Octave | Y | [36] |
| Object Pascal | Y | Delphi, a dialect of Object Pascal, supports anonymous functions (formally,anonymous methods) natively since Delphi 2009. TheOxygene Object Pascal dialect also supports them. |
| Objective-C (Mac OS X 10.6+) | Y | Calledblocks; in addition to Objective-C, blocks can also be used on C and C++ when programming on Apple's platform. |
| OpenSCAD | Y | Function Literal support was introduced with version 2021.01.[37] |
| Pascal | N | |
| Perl | Y | [38] |
| PHP | Y | As of PHP 5.3.0, true anonymous functions are supported.[39] Formerly, only partial anonymous functions were supported, which worked much like C#'s implementation. |
| PL/I | N | |
| Python | Y | Python supports anonymous functions through the lambda syntax,[40] which supports only expressions, not statements. |
| R | Y | |
| Racket | Y | [41] |
| Raku | Y | [42] |
| Rexx | N | |
| RPG | N | |
| Ruby | Y | Ruby's anonymous functions, inherited fromSmalltalk, are calledblocks.[43] |
| Rust | Y | [44] |
| Scala | Y | [45] |
| Scheme | Y | |
| Smalltalk | Y | Smalltalk's anonymous functions are calledblocks. |
| Standard ML | Y | [46] |
| Swift | Y | Swift's anonymous functions are called Closures.[47] |
| TypeScript | Y | [48] |
| Typst | Y | [49] |
| Tcl | Y | [50] |
| Vala | Y | [50] |
| Visual Basic .NET v9 | Y | [51] |
| Visual Prolog v 7.2 | Y | [52] |
| Wolfram Language | Y | [53] |
| Zig | N | [54] |
The Lambda calculus ... was introduced by Alonzo Church in the 1930s as a precise notation for a theory of anonymous functions
A quotation is an anonymous function (a value denoting a snippet of code) which can be used as a value and called using the Fundamental combinators.
