Higher-order function

computer science, a higher-order function (HOF) is a function that does at least one of the following: takes one or more functions as arguments (i.e. a...

In functional programming, a fold is a higher-order function that analyzes a recursive data structure and, through use of a given combining operation...

In many programming languages, map is a higher-order function that applies a given function to each element of a collection, e.g. a list or set, returning...

functional programming, filter is a higher-order function that processes a data structure (usually a list) in some order to produce a new data structure containing...

additional natural transformations. So to begin, a structure requires a higher-order function (or "functional") named map to qualify as a functor: map : (a →...

passed to higher-order functions or used for constructing the result of a higher-order function that needs to return a function. If the function is only...

mid-1960s. First-class functions are a necessity for the functional programming style, in which the use of higher-order functions is a standard practice...

interval. Higher-order derivatives are the result of differentiating a function repeatedly. Given that f {\displaystyle f} is a differentiable function, the...

is a higher-order function that accepts several parsers as input and returns a new parser as its output. In this context, a parser is a function accepting...

Higher-order functions are closely related to first-class functions in that higher-order functions and first-class functions both allow functions as arguments...