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...

accumulate, aggregate, compress, or inject) refers to a family of higher-order functions that analyze a recursive data structure and through use of a given...

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...

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

Higher-order programming is a style of computer programming that uses software components, like functions, modules or objects, as values. It is usually...

a higher-order function taking or returning a function. A function type depends on the type of the parameters and the result type of the function (it...

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

f'(x)=3x^{2}-1\rightarrow f'(3)=27-1=26} . The function d is called a "higher-order function" because it accepts another function (f) as an argument. Going further...

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...

function that generates a sequence by repeated application of the function to its previous result. You begin with some value A and apply a function f...

programming portal Map (higher-order function) map from ClojureDocs map(function, iterable, ...) from section Built-in Functions from Python v2.7.2 documentation...

calculus, function types are used to express the idea of higher-order functions In programming more generally, many higher-order function concepts occur...

respectively. These are functions that operate on functions or produce other functions; see Higher order function. Examples are: Function composition. Integral...

(succ) and addition (add). A Church numeral n is a higher-order function that accepts a function f and a value x and applies f to x exactly n times....

dictionary. In mathematics and computer science, apply is a function that applies a function to arguments. It is central to programming languages derived...

combinator (or fixpoint combinator): p.26  is a higher-order function (i.e., a function which takes a function as argument) that returns some fixed point (a...

data types, pattern matching, parametric polymorphism, currying, higher-order functions, extensible records, channel and process-based concurrency, and...

families of applications[citation needed]. In functional programming higher-order functions can be used in many cases where design patterns or frameworks were...

mathematics, the moments of a function are certain quantitative measures related to the shape of the function's graph. If the function represents mass density...

square root Functional equation Higher-order function Infinite compositions of analytic functions Iterated function Lambda calculus The strict sense...

an abstract operation that accepts a function and returns another function (in the style of a higher-order function in computer science). This article considers...

function Higher-order function Homomorphism Morphism Microfunction Distribution Functor Associative array Closed-form expression Elementary function Functional...

is a higher-order function—it takes a single-argument function f, and returns another single-argument function. The Church numeral n is a function that...

"currying" is not used, while Curry is mentioned later in the context of higher-order functions. John C. Reynolds defined "currying" in a 1972 paper, but did not...

first-class functions and higher-order functions in functional programming languages. Specifically, the invoker object is a higher-order function of which...

structures, automatic storage management, dynamic typing, conditionals, higher-order functions, recursion, the self-hosting compiler, and the read–eval–print loop...