Live briefing
Everything about Higher-order function
Function that takes one or more functions as an input or that outputs a function
In mathematics and computer science, a higher-order function (HOF) is a function that does at least one of the following:takes one or more functions as arguments, returns a function as its result. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Higher-order functionA 5-minute orientation
- Skim a recent paper: Higher order information volume of mass functionInfluential work since 2022
- Pick up a classic book: Advances in Harmonic Analysis and Partial Differential EquationsThe most-reprinted book on the subject
- Read the landmark paper: EFFICIENT HIGHER-ORDER NEURAL NETWORKS FOR CLASSIFICATION AND FUNCTION APPROXIMATIONCited 116 times
- Go sideways: Examples of anonymous functionsA closely related topic
- Go sideways: Variadic templateA closely related topic
📖 Definitions
Noun A function that takes one or more functions as an input, and returns a function as a result.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
EFFICIENT HIGHER-ORDER NEURAL NETWORKS FOR CLASSIFICATION AND FUNCTION APPROXIMATION
Barrier function-based adaptive higher order sliding mode controllers
Higher-Order Chromosomal Structures Mediate Genome Function
Higher order Turán inequalities for the partition function
Spectral shift function of higher order
Higher-order awareness, misrepresentation and function
Higher-order molecular organization as a source of biological function
Partial and Nested Recursive Function Definitions in Higher-order Logic
🆕 Influential since 2022
Higher order information volume of mass function
Higher order Turán inequalities for the distinct partition function
Green's function approach to interacting higher-order topological insulators
Diversity of function and higher-order structure within HWE sensor histidine kinases
Higher order Laguerre inequalities for the partition function
📚 Books worth reading
- 📕Advances in Harmonic Analysis and Partial Differential EquationsDonatella Danielli, Irina Mitrea · 2020
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Examples of anonymous functions In computer programming, an anonymous function (function literal, lambda function, or block) is a function definition that is not bound to an identifier…
- Variadic template In computer programming, variadic templates or variation generics are templates that take a variable number of type parameters. They exist in several programmin…
- Variadic function In mathematics and in computer programming, a variadic function is a function of indefinite arity, i.e., one which accepts a variable number of arguments…
- Function composition (computer science) In computer science, function composition is an act or mechanism to combine simple functions to build more complex ones. Like the usual composition of…
- Callback (computer programming) In computer programming, a callback is a programming pattern in which a function reference is passed from one context (consumer) to another (provider)…
- Template (C++) Templates are a feature of the C++ programming language that allow functions and classes to operate with generic types. This allows a function or class…
- Variable shadowing In computer programming, variable shadowing occurs when a variable declared within a certain scope (decision block, method, or inner class) has the same…
- Partial application In computer science, partial application (or partial function application) refers to the process of fixing a number of arguments of a function, producing…