Higher-order function

In mathematics and computer science, a higher-order function is a function that does at least one of the following: * takes one or more functions as arguments (i.e. procedural parameters), * returns a function as its result. In the untyped lambda calculus, all functions are higher-order; in a typed lambda calculus, from which most functional programming languages are derived, higher-order functions that take one function as argument are values with types of the form .

Higher-order function

In mathematics and computer science, a higher-order function is a function that does at least one of the following: * takes one or more functions as arguments (i.e. procedural parameters), * returns a function as its result. In the untyped lambda calculus, all functions are higher-order; in a typed lambda calculus, from which most functional programming languages are derived, higher-order functions that take one function as argument are values with types of the form .