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 ?
As shown in Figure 6(b), the reconfigurable region is represented with the higher-order function recRegion, which simply applies the received function on input i of type RecIOType1 to produce an output of type RecIOType2.
The second order approximation is used most commonly [1]-[4], but it is also possible to use an approximation of a higher-order function [4].
When a function takes other functions as its arguments and (or) values, it is called a higher-order function. The lambda-calculus defines a class of higher-order and partial recursive functions.
Fatigue, anxiety, and depression commonly accompany cancer and may have an independent effect on higher-order function.
An early abstract machine for the implementation of a functional language is the SECD machine [Landin 1964], which is utilized for the eager (i.e., innermost) evaluation of higher-order function application.
He offers detailed coverage of higher-order function objects, and reveals tools and techniques for creating generic libraries.
Higher-order program verification is becoming increasingly important since the use of languages with higher-order features is rising and language versions such as Java 8 and C++11 have added support for higher-order functions. The project proposes to examine the expressive power of higher-order Horn clauses by comparing them to other formalisms of verification.
The changes were concentrated in the front and rear of the cerebral cortex, which is responsible for higher-order functions like memory, attention and cognition, and in the centrally located thalamus and putamen, which relay sensory information and coordinate movement.
* Layers 4 to 7: These serve even higher-order functions, ranging from between networks to ultimately communication with the application layer and the human-machine interface.
Function literals(the ability to use an alternate syntax for defining a function), closures, recursively-immutable objects(state of which cannot be altered between iterations) and higher-order functions are supported in D.
After [Hughes, 1990], using higher-order functions and lazy evaluation one can modularize programs in new and useful ways, gluing functions together, gluing programs together, and thus making functional programming languages appropriate for building AI applications.
Beginning with an introduction to functional JavaScript and a discussion of functional programming oriented libraries, the work discusses topics such as first-class functions and applicative programming, variable scope and closure, higher-order functions, function-building functions, recursion, purity and immutability, flow-based programming, and programming without class.

Full browser ?