higher-order function

edit

principle

In mathematics and computer science, a higher-order function is a function that meets at least one of the following conditions:

Accepts one or more functions as input.

Output function

In mathematics, they are also called operators or functionals. The derivative in calculus is a common example because it maps one function to another.

In untyped? λ calculus, all functions are of high order; Is there a type? In lambda calculus (most functional programming languages are developed from lambda calculus), high-order functions are usually those whose function types contain more than one arrow. In functional programming, a higher-order function that returns another function is called a Corinti function.

Mapping function is an example of higher-order function, which can be found in many functional programming languages. It takes the function f as a parameter and returns an accept list and applies f to each of its elements. [ 1]?

model

Other examples of higher-order functions include function synthesis, integration and constant function λ x λ y x

This is an example of Python. The function g () has one parameter and returns a function. This example will print 100 (g(f, 7)= (7+3)×(7+3)).

12345 def？ F(x): return? x？ +? 3def？ G (function,? X): return? Function (x)? *? Function (x) print? g(f，？ 7)