In mathematics and computer science, higher-order functions, functional forms, or functionals are functions which do at least one of the following:take one or more functions as an input, output a function. In mathematics these are also known as operators or functionals. The derivative in calculus is a common example, since it maps a function to another function.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 are generally those with types containing more than one arrow. In functional programming, higher-order functions that return other functions are said to be curried.The map function found in many functional programming languages is one example of a higher-order function. It takes as arguments a function f and a list of elements, and as result, returns a new list with f applied to each element from the list.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.