Higher-Order Function

Definitions

1. A function that takes one or more functions as arguments, returns a function, or both. The foundation of functional programming patterns like map, filter, reduce, and function composition.

   In plain English: A function that either accepts other functions as inputs or produces a new function as output — like a factory that customizes behavior by plugging in different worker functions.

   Example: "Array.map is a higher-order function — it takes your transformation function and applies it to every element."

Related Terms

• Syntax Sugar
• Algebraic Data Type
• Category
• Class
• Closure
• Computation Expression
• Currying
• Monad