In computer programming, an anonymous function (function literal, lambda abstraction, lambda function, lambda expression or block) is a function definition that is not bound to an identifier. Anonymous functions are often arguments being passed to higher-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 in functional programming languages and other languages with first-class functions, where they fulfil the same role for the function type as literals do for other data types.
Anonymous functions originate in the work of Alonzo Church in his invention of the lambda calculus, in which all functions are anonymous, in 1936, before electronic computers. In several programming languages, anonymous functions are introduced using the keyword lambda, and anonymous functions are often referred to as lambdas or lambda abstractions. Anonymous functions have been a feature of programming languages since Lisp 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 function would be written, and where is an expression that uses . Compare to the Python syntax of
The name "arrow function" refers to the mathematical "maps to" symbol, . Compare to the JavaScript syntax of
Anonymous functions can be used for containing functionality that need not be named and possibly for short-term use. Some notable examples include closures and currying.
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 a descriptive 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 a Dynamic 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 a sort 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:
The anonymous function in this example is the lambda expression:x, and returns the length of its argument, which is then used by the sort method as the criteria for sorting.
Basic syntax of a lambda function in Python is
Another example would be sorting items in a list by the name of their class (in Python, everything has a class):
Note that 11.2 has class name "float", 10 has class name "int", and 'number' has class name "str". The sorted order is "float", "int", then "str".
See main article: Closure (computer programming).
Closures are functions evaluated in an environment containing bound variables. The following example binds the variable "threshold" in an anonymous function that compares the input to the threshold.
This can be used as a sort of generator of comparison functions:
>>> print(func_a(5), func_a(8), func_a(13), func_a(21))True True False False
>>> print(func_b(5), func_b(8), func_b(13), func_b(21))True True True False
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.
See main article: currying.
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 performs division by any integer is transformed into one that performs division by a set integer.
>>> def divisor(d):... return lambda x: divide(x, d)
>>> half = divisor(2)>>> third = divisor(3)
>>> print(half(32), third(32))16.0 10.666666666666666
>>> print(half(40), third(40))20.0 13.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 variable d.
A higher-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.
See main article: Map (higher-order function).
The map function performs a function call on each element of a list. The following example squares every element in an array with an anonymous function.
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:
See main article: Filter (higher-order function).
The filter function returns all elements from a list that evaluate True when passed to a certain function.
The anonymous function checks if the argument passed to it is even. The same as with map, the form below is considered more appropriate:
See main article: Fold (higher-order function).
A fold function runs over all elements in a structure (for lists usually left-to-right, a "left fold", called reduce in Python), accumulating a value as it goes. This can be used to combine all elements of a structure into one value, for example:
This performs
\left(\left(\left(1 x 2 \right) x 3 \right) x 4 \right) x 5 =120.
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 of programming 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 all statically typed languages. However, statically typed languages can support anonymous functions. For example, the ML languages are statically typed and fundamentally include anonymous functions, and Delphi, a dialect of Object Pascal, has been extended to support anonymous functions, as has C++ (by the C++11 standard). Second, the languages that treat functions as first-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 | |||
| Ada | Expression functions are a part of Ada2012, access-to-subprogram[3] | ||
| ALGOL 68 | |||
| APL | Dyalog, ngn and dzaima APL fully support both dfns and tacit functions. GNU APL has rather limited support for dfns. | ||
| Assembly languages | |||
| AHK | Since AutoHotkey V2 anonymous functions are supported with a syntax similar to JavaScript. | ||
| Bash | A library has been made to support anonymous functions in Bash.[4] | ||
| C | Support is provided in Clang and along with the LLVM compiler-rt lib. GCC support is given for a macro implementation which enables the possibility of use. See below for more details. | ||
| C# | [5] | ||
| C++ | As of the C++11 standard | ||
| CFML | As of Railo 4,[6] ColdFusion 10[7] | ||
| Clojure | [8] | ||
| COBOL | Micro Focus's non-standard Managed COBOL dialect supports lambdas, which are called anonymous delegates/methods.[9] | ||
| Curl | |||
| D | [10] | ||
| Dart | [11] | ||
| Delphi | [12] | ||
| Dylan | [13] | ||
| Eiffel | |||
| Elm | [14] | ||
| Elixir | [15] | ||
| Erlang | [16] | ||
| F# | [17] | ||
| Excel | Excel worksheet function, 2021 beta release[18] | ||
| Factor | "Quotations" support this[19] | ||
| Fortran | |||
| Frink | [20] | ||
| Go | [21] | ||
| Gosu | [22] | ||
| Groovy | [23] | ||
| Haskell | [24] | ||
| Haxe | [25] | ||
| Java | Supported in Java 8. See the Java limitations section below for details. | ||
| JavaScript | [26] | ||
| Julia | [27] | ||
| Kotlin | [28] | ||
| Lisp | |||
| Logtalk | |||
| Lua | [29] | ||
| MUMPS | |||
| Maple | [30] | ||
| MATLAB | [31] | ||
| Maxima | [32] | ||
| Nim | [33] | ||
| OCaml | [34] | ||
| Octave | [35] | ||
| Object Pascal | Delphi, a dialect of Object Pascal, supports anonymous functions (formally, anonymous methods) natively since Delphi 2009. The Oxygene Object Pascal dialect also supports them. | ||
| Objective-C (Mac OS X 10.6+) | Called blocks; in addition to Objective-C, blocks can also be used on C and C++ when programming on Apple's platform. | ||
| Function Literal support was introduced with version 2021.01.[36] | |||
| Pascal | |||
| Perl | [37] | ||
| PHP | As of PHP 5.3.0, true anonymous functions are supported.[38] Formerly, only partial anonymous functions were supported, which worked much like C#'s implementation. | ||
| PL/I | |||
| Python | Python supports anonymous functions through the lambda syntax,[39] which supports only expressions, not statements. | ||
| R | |||
| Racket | [40] | ||
| Raku | [41] | ||
| Rexx | |||
| RPG | |||
| Ruby | Ruby's anonymous functions, inherited from Smalltalk, are called blocks. | ||
| Rust | [42] | ||
| Scala | [43] | ||
| Scheme | |||
| Smalltalk | Smalltalk's anonymous functions are called blocks. | ||
| Standard ML | [44] | ||
| Swift | Swift's anonymous functions are called Closures. | ||
| TypeScript | [45] | ||
| Tcl | [46] | ||
| Vala | |||
| Visual Basic .NET v9 | [47] | ||
| Visual Prolog v 7.2 | [48] | ||
| Wolfram Language | [49] | ||
| Zig | [50] |
Numerous languages support anonymous functions, or something similar.
Only some dialects support anonymous functions, either as dfns, in the tacit style or a combination of both.
The anonymous function is not supported by standard C programming language, but supported by some C dialects, such as GCC[51] and Clang.
The GNU Compiler Collection (GCC) supports anonymous functions, mixed by nested functions and statement expressions. It has the form:
The following example works only with GCC. Because of how macros are expanded, the l_body cannot contain any commas outside of parentheses; GCC treats the comma as a delimiter between macro arguments.The argument l_ret_type can be removed if __typeof__ is available; in the example below using __typeof__ on array would return testtype *, which can be dereferenced for the actual value if needed.
//* this is the definition of the anonymous function */
typedef struct testtype;
void printout(const testtype * array)
int main(void)
Clang supports anonymous functions, called blocks,[52] which have the form:
The type of the blocks above is return_type (^)(parameters).
Using the aforementioned blocks extension and Grand Central Dispatch (libdispatch), the code could look simpler:
int main(void)
The code with blocks should be compiled with -fblocks and linked with -lBlocksRuntime
C++11 supports anonymous functions (technically function objects), called lambda expressions,[53] which have the form:specs" is of the form "specifiers exception [[C++11#Attributes|attr]] [[C++11#Alternative function syntax|trailing-return-type]] in that order; each of these components is optional". If it is absent, the return type is deduced from return statements as if for a function with declared return type auto.
This is an example lambda expression:
C++11 also supports closures, here called captures. Captures are defined between square brackets [and ] in the declaration of lambda expression. The mechanism allows these variables to be captured by value or by reference. The following table demonstrates this:
Variables captured by value are constant by default. Adding mutable after the parameter list makes them non-constant.
C++14 and newer versions support init-capture, for example:
auto counter = [i = 0] mutable ; // mutable is required to modify 'i'counter; // 0counter; // 1counter; // 2
The following two examples demonstrate use of a lambda expression:
This computes the total of all elements in the list. The variable total is stored as a part of the lambda function's closure. Since it is a reference to the stack variable total, it can change its value.
This will cause total to be stored as a reference, but value will be stored as a copy.
The capture of this is special. It can only be captured by value, not by reference. However in C++17, the current object can be captured by value (denoted by *this), or can be captured by reference (denoted by this). this can only be captured if the closest enclosing function is a non-static member function. The lambda will have the same access as the member that created it, in terms of protected/private members.
If this is captured, either explicitly or implicitly, then the scope of the enclosed class members is also tested. Accessing members of this does not need explicit use of this-> syntax.
The specific internal implementation can vary, but the expectation is that a lambda function that captures everything by reference will store the actual stack pointer of the function it is created in, rather than individual references to stack variables. However, because most lambda functions are small and local in scope, they are likely candidates for inlining, and thus need no added storage for references.
If a closure object containing references to local variables is invoked after the innermost block scope of its creation, the behaviour is undefined.
Lambda functions are function objects of an implementation-dependent type; this type's name is only available to the compiler. If the user wishes to take a lambda function as a parameter, the parameter type must be a template type, or they must create a std::function or a similar object to capture the lambda value. The use of the auto keyword can help store the lambda function,
Here is an example of storing anonymous functions in variables, vectors, and arrays; and passing them as named parameters:
double eval(std::function
int main A lambda expression with an empty capture specification ([]) can be implicitly converted into a function pointer with the same type as the lambda was declared with. So this is legal:
Since C++17, a lambda can be declared [[constexpr]], and since C++20, [[consteval]] with the usual semantics. These specifiers go after the parameter list, like mutable. Starting from C++23, the lambda can also be [[static member function|static]] if it has no captures. The static and mutable specifiers are not allowed to be combined.
Also since C++23 a lambda expression can be recursive through explicit this as first parameter:
In addition to that, C++23 modified the syntax so that the parentheses can be omitted in the case of a lambda that takes no arguments even if the lambda has a specifier. It also made it so that an attribute specifier sequence that appears before the parameter list, lambda specifiers, or noexcept specifier (there must be one of them) applies to the function call operator or operator template of the closure type. Otherwise, it applies to the type of the function call operator or operator template. Previously, such a sequence always applied to the type of the function call operator or operator template of the closure type making e.g the [<nowiki/>[noreturn]] attribute impossible to use with lambdas.
The Boost library provides its own syntax for lambda functions as well, using the following syntax:[54]
Since C++14, the function parameters of a lambda can be declared with auto. The resulting lambda is called a generic lambda and is essentially an anonymous function template since the rules for type deduction of the auto parameters are the rules of template argument deduction. As of C++20, template parameters can also be declared explicitly with the following syntax:
In C#, support for anonymous functions has deepened through the various versions of the language compiler. The language v3.0, released in November 2007 with .NET Framework v3.5, has full support of anonymous functions.[55] [56] C# names them lambda expressions, following the original version of anonymous functions, the lambda calculus.[57] [55] [56]
// the first int is the x' type // the second int is the return type //
While the function is anonymous, it cannot be assigned to an implicitly typed variable, because the lambda syntax may be used for denoting an anonymous function or an expression tree, and the choice cannot automatically be decided by the compiler.[55] E.g., this does not work:
However, a lambda expression can take part in type inference and can be used as a method argument, e.g. to use anonymous functions with the Map capability available with System.Collections.Generic.List (in the ConvertAll method):
Prior versions of C# had more limited support for anonymous functions. C# v1.0, introduced in February 2002 with the .NET Framework v1.0, provided partial anonymous function support through the use of delegates.[55] C# names them lambda expressions, following the original version of anonymous functions, the lambda calculus.[55] This construct is somewhat similar to PHP delegates. In C# 1.0, delegates are like function pointers that refer to an explicitly named method within a class. (But unlike PHP, the name is unneeded at the time the delegate is used.) C# v2.0, released in November 2005 with the .NET Framework v2.0, introduced the concept of anonymous methods as a way to write unnamed inline statement blocks that can be executed in a delegate invocation.[55] C# 3.0 continues to support these constructs, but also supports the lambda expression construct.
This example will compile in C# 3.0, and exhibits the three forms:
In the case of the C# 2.0 version, the C# compiler takes the code block of the anonymous function and creates a static private function. Internally, the function gets a generated name, of course; this generated name is based on the name of the method in which the Delegate is declared. But the name is not exposed to application code except by using reflection.[55] In the case of the C# 3.0 version, the same mechanism applies.
Using the keyword:
Or using an arrow function:
fn = => singleExpression // singleExpression is implicitly returned. There is no need for the braces or the return keyword
fn = singleParam =>
fn = (x, y) =>
CFML supports any statements within the function's definition, not simply expressions.
CFML supports recursive anonymous functions:
D uses inline delegates to implement anonymous functions. The full syntax for an inline delegate isscope keyword can be used for forcing stack allocation.Since version 2.058, it is possible to use shorthand notation:
Dart supports anonymous functions.
Delphi introduced anonymous functions in version 2009.
type TSimpleProcedure = reference to procedure; TSimpleFunction = reference to function(const x: string): Integer;
var x1: TSimpleProcedure; y1: TSimpleFunction;
begin x1 := procedure begin Writeln('Hello World'); end; x1; //invoke anonymous method just defined
y1 := function(const x: string): Integer begin Result := Length(x); end; Writeln(y1('bar')); end.
PascalABC.NET supports anonymous functions using lambda syntax
Elixir uses the closure fn for anonymous functions.
square = fn(x) -> x * x endEnum.map [1, 2, 3, 4], square
Erlang uses a syntax for anonymous functions similar to that of named functions.
% Named function with the same functionalitysquare(X) -> X * X.
Go supports anonymous functions.
Haskell uses a concise syntax for anonymous functions (lambda expressions). The backslash is supposed to resemble λ.
The following are all equivalent:
In Haxe, anonymous functions are called lambda, and use the syntax function(argument-list) expression; .
(function(x,y) return x+y)(5,6); // 11
Java supports anonymous functions, named Lambda Expressions, starting with JDK 8.[58]
A lambda expression consists of a comma separated list of the formal parameters enclosed in parentheses, an arrow token (->), and a body. Data types of the parameters can always be omitted, as can the parentheses if there is only one parameter. The body can consist of one statement or a statement block.
// with one parameter (this example is an identity function).a -> a
// with one expression(a, b) -> a + b
// with explicit type information(long id, String name) -> "id: " + id + ", name:" + name
// with a code block(a, b) ->
// with multiple statements in the lambda body. It needs a code block.// This example also includes two nested lambda expressions (the first one is also a closure).(id, defaultPrice) ->
Lambda expressions are converted to "functional interfaces" (defined as interfaces that contain only one abstract method in addition to one or more default or static methods),[59] as in the following example:
In this example, a functional interface called IntegerMath is declared. Lambda expressions that implement IntegerMath are passed to the apply method to be executed. Default methods like swap define methods on functions.
Java 8 introduced another mechanism named method reference (the :: operator) to create a lambda on an existing method. A method reference does not indicate the number or types of arguments because those are extracted from the abstract method of the functional interface.IntBinaryOperator declares an abstract method int applyAsInt(int, int), so the compiler looks for a method int sum(int, int) in the class java.lang.Integer.
Anonymous classes of lambda-compatible interfaces are similar, but not exactly equivalent, to lambda expressions.To illustrate, in the following example, and are both instances of that add their two parameters:
The main difference here is that the lambda expression does not necessarily need to allocate a new instance for the, and can return the same instance every time this code is run.[60] Additionally, in the OpenJDK implementation at least, lambdas are compiled to instructions, with the lambda body inserted as a static method into the surrounding class,[61] rather than generating a new class file entirely.
Java 8 lambdas have the following limitations:
JavaScript/ECMAScript supports anonymous functions.
ES6 supports "arrow function" syntax, where a => symbol separates the anonymous function's parameter list from the body:
This construct is often used in Bookmarklets. For example, to change the title of the current document (visible in its window's title bar) to its URL, the following bookmarklet may seem to work.
Instead, an anonymous function, that does not return a value, can be used:
The function statement in the first (outer) pair of parentheses declares an anonymous function, which is then executed when used with the last pair of parentheses. This is almost equivalent to the following, which populates the environment with f unlike an anonymous function.
Use void to avoid new pages for arbitrary anonymous functions:
JavaScript has syntactic subtleties for the semantics of defining, invoking and evaluating anonymous functions. These subliminal nuances are a direct consequence of the evaluation of parenthetical expressions. The following constructs which are called immediately-invoked function expression illustrate this:function{ ... }" by f, the form of the constructs are a parenthetical within a parenthetical (f) and a parenthetical applied to a parenthetical (f).
Note the general syntactic ambiguity of a parenthetical expression, parenthesized arguments to a function and the parentheses around the formal parameters in a function definition. In particular, JavaScript defines a , (comma) operator in the context of a parenthetical expression. It is no mere coincidence that the syntactic forms coincide for an expression and a function's arguments (ignoring the function formal parameter syntax)! If f is not identified in the constructs above, they become and . The first provides no syntactic hint of any resident function but the second MUST evaluate the first parenthetical as a function to be legal JavaScript. (Aside: for instance, the 's could be ([],,42,"abc",function) as long as the expression evaluates to a function.)
Also, a function is an Object instance (likewise objects are Function instances) and the object literal notation brackets, {} for braced code, are used when defining a function this way (as opposed to using new Function(...)). In a very broad non-rigorous sense (especially since global bindings are compromised), an arbitrary sequence of braced JavaScript statements, {stuff}, can be considered to be a fixed point of
Note the implications of the anonymous function in the JavaScript fragments that follow:
function{ ... } without surrounding (f=function{ ... }) does not "forget" f globally unlike (function f{ ... })Performance metrics to analyze the space and time complexities of function calls, call stack, etc. in a JavaScript interpreter engine implement easily with these last anonymous function constructs. From the implications of the results, it is possible to deduce some of an engine's recursive versus iterative implementation details, especially tail-recursion.
In Julia anonymous functions are defined using the syntax (arguments)->(expression),
Kotlin supports anonymous functions with the syntax {arguments -> expression},
Lisp and Scheme support anonymous functions using the "lambda" construct, which is a reference to lambda calculus. Clojure supports anonymous functions with the "fn" special form and # reader syntax.
Common Lisp has the concept of lambda expressions. A lambda expression is written as a list with the symbol "lambda" as its first element. The list then contains the argument list, documentation or declarations and a function body. Lambda expressions can be used inside lambda forms and with the special operator "function".
"function" can be abbreviated as #'. Also, macro lambda exists, which expands into a function form:
One typical use of anonymous functions in Common Lisp is to pass them to higher-order functions like mapcar, which applies a function to each element of a list and returns a list of the results.
The lambda form in Common Lisp allows a lambda expression to be written in a function call:
Anonymous functions in Common Lisp can also later be given global names:
Scheme's named functions is simply syntactic sugar for anonymous functions bound to names:
Clojure supports anonymous functions through the "fn" special form:
Like Scheme, Clojure's "named functions" are simply syntactic sugar for lambdas bound to names:
In Lua (much as in Scheme) all functions are anonymous. A named function in Lua is simply a variable holding a reference to a function object.[62]
Thus, in Lua
An example of using anonymous functions for reverse-order sorting:
The Wolfram Language is the programming language of Mathematica. Anonymous functions are important in programming the latter. There are several ways to create them. Below are a few anonymous functions that increment a number. The first is the most common. #1 refers to the first argument and & marks the end of the anonymous function.
So, for instance:
Also, Mathematica has an added construct to make recursive anonymous functions. The symbol '#0' refers to the entire function. The following function calculates the factorial of its input:
Anonymous functions in MATLAB or Octave are defined using the syntax @(argument-list)expression. Any variables that are not found in the argument list are inherited from the enclosing scope and are captured by value.
In Maxima anonymous functions are defined using the syntax lambda(argument-list,expression),
lambda([x,y],x+y)(5,6);11
The various dialects of ML support anonymous functions.
Anonymous functions in OCaml are functions without a declared name. Here is an example of an anonymous function that multiplies its input by two:
In the example, fun is a keyword indicating that the function is an anonymous function. We are passing in an argument x and -> to separate the argument from the body.[63]
F# supports anonymous functions, as follows:
Standard ML supports anonymous functions, as follows:
fn arg => arg * arg
Nim supports multi-line multi-expression anonymous functions. [33]
Multi-line example:
assert anon(9)
Anonymous functions may be passed as input parameters of other functions:
cities.sort(proc (x, y: string): int = cmp(x.len, y.len))
An anonymous function is basically a function without a name.
Perl 5 supports anonymous functions, as follows:
my $squarer = sub ; # 2. assigned to a variable
sub curry
sub sum # returns the sum of its argumentsmy $curried = curry \&sum, 5, 7, 9;print $curried->(1,2,3), "\n"; # prints 27 (= 5 + 7 + 9 + 1 + 2 + 3)
Other constructs take bare blocks as arguments, which serve a function similar to lambda functions of one parameter, but do not have the same parameter-passing convention as functions -- @_ is not set.
my @bad_example = map 1..10; # values not passed like normal Perl function
Before 4.0.1, PHP had no anonymous function support.[64]
PHP 4.0.1 introduced the create_function which was the initial anonymous function support. This function call makes a new randomly named function and returns its name (as a string)
The argument list and function body must be in single quotes, or the dollar signs must be escaped.Otherwise, PHP assumes "$x" means the variable $x and will substitute it into the string (despite possibly not existing) instead of leaving "$x" in the string.For functions with quotes or functions with many variables, it can get quite tedious to ensure the intended function body is what PHP interprets.
Each invocation of create_function makes a new function, which exists for the rest of the program, and cannot be garbage collected, using memory in the program irreversibly. If this is used to create anonymous functions many times, e.g., in a loop, it can cause problems such as memory bloat.
PHP 5.3 added a new class called Closure and magic method __invoke that makes a class instance invocable.[65]
In this example, $func is an instance of Closure and echo $func($x) is equivalent to echo $func->__invoke($x).PHP 5.3 mimics anonymous functions but it does not support true anonymous functions because PHP functions are still not first-class objects.
PHP 5.3 does support closures but the variables must be explicitly indicated as such:
The variable $x is bound by reference so the invocation of $func modifies it and the changes are visible outside of the function.
Arrow functions were introduced in PHP 7.4
Logtalk uses the following syntax for anonymous predicates (lambda expressions):
Anonymous functions (in general anonymous predicates) were introduced in Visual Prolog in version 7.2.[66] Anonymous predicates can capture values from the context. If created in an object member, it can also access the object state (by capturing This).
mkAdder returns an anonymous function, which has captured the argument X in the closure. The returned function is a function that adds X to its argument:
Python supports simple anonymous functions through the lambda form. The executable body of the lambda must be an expression and can't be a statement, which is a restriction that limits its utility. The value returned by the lambda is the value of the contained expression. Lambda forms can be used anywhere ordinary functions can. However these restrictions make it a very limited version of a normal function. Here is an example:
In general, the Python convention encourages the use of named functions defined in the same scope as one might typically use an anonymous function in other languages. This is acceptable as locally defined functions implement the full power of closures and are almost as efficient as the use of a lambda in Python. In this example, the built-in power function can be said to have been curried:
In R the anonymous functions are defined using the syntax function(argument-list)expression, which has shorthand since version 4.1.0 \, akin to Haskell.
In Raku, all blocks (even those associated with if, while, etc.) are anonymous functions. A block that is not used as an rvalue is executed immediately.
Ruby supports anonymous functions by using a syntactical structure called block. There are two data types for blocks in Ruby. Procs behave similarly to closures, whereas lambdas behave more analogous to an anonymous function.[67] When passed to a method, a block is converted into a Proc in some circumstances.
ex = [16.2, 24.1, 48.3, 32.4, 8.5]=> [16.2, 24.1, 48.3, 32.4, 8.5]ex.sort_by # Sort by fractional part, ignoring integer part.=> [24.1, 16.2, 48.3, 32.4, 8.5]
ex = Proc.new => #
def multiple_of?(n) lambda
x % n 0 |
In Rust, anonymous functions are called closures.[68] They are defined using the following syntax:
For example:
With type inference, however, the compiler is able to infer the type of each parameter and the return type, so the above form can be written as:
With closures with a single expression (i.e. a body with one line) and implicit return type, the curly braces may be omitted:
Closures with no input parameter are written like so:
Closures may be passed as input parameters of functions that expect a function pointer:
fn main
However, one may need complex rules to describe how values in the body of the closure are captured. They are implemented using the Fn, FnMut, and FnOnce traits:[69]
Fn: the closure captures by reference (&T). They are used for functions that can still be called if they only have reference access (with &) to their environment.FnMut: the closure captures by mutable reference (&mut T). They are used for functions that can be called if they have mutable reference access (with &mut) to their environment.FnOnce: the closure captures by value (T). They are used for functions that are only called once.With these traits, the compiler will capture variables in the least restrictive manner possible.[69] They help govern how values are moved around between scopes, which is largely important since Rust follows a lifetime construct to ensure values are "borrowed" and moved in a predictable and explicit manner.[70]
The following demonstrates how one may pass a closure as an input parameter using the Fn trait:
fn main
// ~~ Program output ~~// I got the value: 5// 5 * 2 = 10
The previous function definition can also be shortened for convenience as follows:
In Scala, anonymous functions use the following syntax:[71]
In certain contexts, like when an anonymous function is a parameter being passed to another function, the compiler can infer the types of the parameters of the anonymous function and they can be omitted in the syntax. In such contexts, it is also possible to use a shorthand for anonymous functions using the underscore character to introduce unnamed parameters.
list.reduceLeft(_ + _) // Each underscore stands for a new unnamed parameter in the anonymous function. // This results in an even shorter equivalent to the anonymous function above.
In Smalltalk anonymous functions are called blocks and they are invoked (called) by sending them a "value" message. If several arguments are to be passed, a "value:...value:" message with a corresponding number of value arguments must be used.
For example, in GNU Smalltalk,
In Swift, anonymous functions are called closures.[72] The syntax has following form:
For sake of brevity and expressiveness, the parameter types and return type can be omitted if these can be inferred:
In Tcl, applying the anonymous squaring function to 2 looks as follows:[73]
This example involves two candidates for what it means to be a function in Tcl. The most generic is usually called a command prefix, and if the variable f holds such a function, then the way to perform the function application f(x) would be{*} is the expansion prefix (new in Tcl 8.5). The command prefix in the above example is apply {x {expr {$x*$x}}}
Command names can be bound to command prefixes by means of the interp alias command. Command prefixes support currying. Command prefixes are very common in Tcl APIs.
The other candidate for "function" in Tcl is usually called a lambda, and appears as the {x {expr {$x*$x}}} part of the above example. This is the part which caches the compiled form of the anonymous function, but it can only be invoked by being passed to the apply command. Lambdas do not support currying, unless paired with an apply to form a command prefix. Lambdas are rare in Tcl APIs.
In Vala, anonymous functions are supported as lambda expressions.[74]
void main
Visual Basic .NET 2008 introduced anonymous functions through the lambda form. Combined with implicit typing, VB provides an economical syntax for anonymous functions. As with Python, in VB.NET, anonymous functions must be defined on one line; they cannot be compound statements. Further, an anonymous function in VB.NET must truly be a VB.NET Function - it must return a value.