Use Wikipedia with dynamical search help in all languages ...

Look up in Wiktionary, the free dictionary.apply |

In mathematics and computer science, **apply** is a function that applies a function to arguments. It is central to programming languages derived from lambda calculus, such as LISP and Scheme, and also in functional languages. It has a role in the study of the denotational semantics of computer programs, because it is a continuous function on complete partial orders. **Apply** is also a continuous function in homotopy theory, and, indeed underpins the entire theory: it allows a homotopy deformation to be viewed as a continuous path in the space of functions. Likewise, valid mutations (refactorings) of computer programs can be seen as those that are "continuous" in the Scott topology.

The most general setting for **apply** is in category theory, where it is right adjoint to currying in closed monoidal categories. A special case of this are the Cartesian closed categories, whose internal language is simply typed lambda calculus.

In computer programming, **apply** applies a function to a list of arguments. *Eval* and *apply* are the two interdependent components of the *eval-apply cycle*, which is the essence of evaluating Lisp, described in SICP.^{[1]} Function application corresponds to beta reduction in lambda calculus.

Apply is also the name of a special function in many languages, which takes a function and a list, and uses the list as the function's own argument list, as if the function were called with the elements of the list as the arguments. This is important in languages with variadic functions, because this is the only way to call a function with an indeterminate (at compile time) number of arguments.

In Common Lisp **apply** is a function that applies a function to a list of arguments (note here that "+" is a variadic function that takes any number of arguments):

```
(apply #'+ (list 1 2))
```

Similarly in Scheme:

```
(apply + (list 1 2))
```

In C++, Bind ^{[2]} is used either via the std namespace or via the boost namespace.

In C# and Java, variadic arguments are simply collected in an array. Caller can explicitly pass in an array in place of the variadic arguments. This can only be done for a variadic parameter. It is not possible to apply an array of arguments to non-variadic parameter without using reflection. An ambiguous case arises should the caller want to pass an array itself as one of the arguments rather than using the array as a *list* of arguments. In this case, the caller should cast the array to `Object`

to prevent the compiler from using the *apply* interpretation.

```
variadicFunc(arrayOfArgs);
```

With version 8 lambda expressions were introduced. Functions are implemented as objects with a functional interface, an interface with only one non-static method. The standard interface

```
Function<T,R>
```

consist of the method (plus some static utility functions):

```
R apply(T para)
```

In Go, typed variadic arguments are simply collected in a slice. The caller can explicitly pass in a slice in place of the variadic arguments, by appending a `...`

to the slice argument. This can only be done for a variadic parameter. The caller can not apply an array of arguments to non-variadic parameters, without using reflection..

s := []string{"foo", "bar"} variadicFunc(s...)

In Haskell, functions may be applied by simple juxtaposition:

```
func param1 param2 ...
```

In Haskell, the syntax may also be interpreted that each parameter curries its function in turn. In the above example, "func param1" returns another function accepting one fewer parameters, that is then applied to param2, and so on, until the function has no more parameters.

In JavaScript, function objects have an `apply`

method, the first argument is the value of the `this`

keyword inside the function; the second is the list of arguments:

```
func.apply(null, args);
```

ES6 adds the spread operator `func(...args)`

^{[3]} which may be used instead of `apply`

.

In Lua, apply can be written this way:

```
function apply(f,...)
return f(...)
end
```

In Perl, arrays, hashes and expressions are automatically "flattened" into a single list when evaluated in a list context, such as in the argument list of a function

```
# Equivalent subroutine calls:
@args = (@some_args, @more_args);
func(@args);
func(@some_args, @more_args);
```

In PHP, `apply`

is called `call_user_func_array`

:

```
call_user_func_array('func_name', $args);
```

In Python and Ruby, the same asterisk notation used in defining variadic functions is used for calling a function on a sequence and array respectively:

```
func(*args)
```

Python originally had an apply function, but this was deprecated in favour of the asterisk in 2.3 and removed in 3.0.^{[4]}

In R, `do.call`

constructs and executes a function call from a name or a function and a list of arguments to be passed to it:

```
f(x1, x2)
# can also be performed via
do.call(what = f, args = list(x1, x2))
```

In Smalltalk, block (function) objects have a `valueWithArguments:`

method which takes an array of arguments:

```
aBlock valueWithArguments: args
```

Since Tcl 8.5,^{[5]} a function can be applied to arguments with the `apply`

command

```
apply func ?arg1 arg2 ...?
```

where the function is a two element list {args body} or a three element list {args body namespace}.

Consider a function , that is, where the bracket notation denotes the space of functions from *A* to *B*. By means of currying, there is a unique function .
Then **Apply** provides the universal morphism

- ,

so that

or, equivalently one has the commuting diagram

More precisely, curry and apply are adjoint functors.

The notation for the space of functions from *A* to *B* occurs more commonly in computer science. In category theory, however, is known as the exponential object, and is written as . There are other common notational differences as well; for example *Apply* is often called *Eval*,^{[6]} even though in computer science, these are not the same thing, with eval distinguished from *Apply*, as being the evaluation of the quoted string form of a function with its arguments, rather than the application of a function to some arguments.

Also, in category theory, *curry* is commonly denoted by , so that is written for *curry*(*g*). This notation is in conflict with the use of in lambda calculus, where lambda is used to denote bound variables. With all of these notational changes accounted for, the adjointness of *Apply* and *curry* is then expressed in the commuting diagram

The articles on exponential object and Cartesian closed category provide a more precise discussion of the category-theoretic formulation of this idea. Thus use of lambda here is not accidental; the internal language of Cartesian closed categories is simply-typed lambda calculus. The most general possible setting for *Apply* are the closed monoidal categories, of which the cartesian closed categories are an example. In homological algebra, the adjointness of curry and apply is known as tensor-hom adjunction.

In order theory, in the category of complete partial orders endowed with the Scott topology, both *curry* and *apply* are continuous functions (that is, they are Scott continuous).^{[7]} This property helps establish the foundational validity of the study of the denotational semantics of computer programs.

In algebraic geometry and homotopy theory, *curry* and *apply* are both continuous functions when the space of continuous functions from to is given the compact open topology, and is locally compact Hausdorff. This result is very important, in that it underpins homotopy theory, allowing homotopic deformations to be understood as continuous paths in the space of functions.

**^**Harold Abelson, Gerald Jay Sussman, Julie Sussman,*Structure and Interpretation of Computer Programs*, (1996) MIT Press, ISBN 0-262-01153-0.*See Section 4.1, The Metacircular Evaluator***^**http://www.boost.org/doc/libs/1_49_0/libs/bind/bind.html#with_functions&lang=en**^**"Spread syntax - JavaScript | MDN". Retrieved 2017-04-20.**^**"Non-essential built-in functions".*Python Library Reference*. 8 February 2005. Retrieved 19 May 2013.**^**"apply".*Tcl documentation*. 2006. Retrieved 23 June 2014.**^**Saunders Mac Lane,*Category Theory***^**H.P. Barendregt,*The Lambda Calculus*, (1984) North-Holland ISBN 0-444-87508-5

This page is funded by cryptomining