higher-order function


Also found in: Acronyms, Wikipedia.

higher-order function

(HOF) A function that can take one or more functions as argument and/or return a function as its value. E.g. map in (map f l) which returns the list of results of applying function f to each of the elements of list l. See also curried function.
References in periodicals archive ?
There is a rich set of ordering relations among higher-order functions, and therefore also among the terms in a database.
We will see in Section 5 that EP terms are homomorphic to higher-order functions.
Viewing an EP database as a finite set of higher-order functions, in addition to the built-in operators in Section 2.
every thing is modeled as higher-order functions without a user-defined type.
ordering relations among higher-order functions, offers a novel approach to preserve naturally the similarities among recipes.
In addition, the EP data model has the built-in operators such as {+ which are in correspondence with a relation among the higher-order functions in the applicative structure.
To maximize the flexibility higher-order functions can provides, however, a language system shall define that higher-order functions is untyped.

Full browser ?