Higher order

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

takes one or more functions as arguments (i.e. procedural parameters),
returns a function as its result.All other functions are first-order functions. In mathematics higher-order functions are also termed operators or functionals. The differential operator in calculus is a common example, since it maps a function to its derivative, also a function. Higher-order functions should not be confused with other uses of the word "functor" throughout mathematics, see Functor (disambiguation).
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 that take one function as argument are values with types of the form



(

τ

1




τ

2


)


τ

3




{\displaystyle (\tau _{1}\to \tau _{2})\to \tau _{3}}
.

View More On Wikipedia.org
  • 94

    Greg Bernhardt

    A PF Singularity From USA
    • Messages
      19,451
    • Media
      227
    • Reaction score
      10,043
    • Points
      1,237
  • 1

    dmoney123

    A PF Atom
    • Messages
      32
    • Reaction score
      1
    • Points
      31
  • 1

    Adgorn

    A PF Molecule
    • Messages
      130
    • Reaction score
      18
    • Points
      63
  • 1

    nomadreid

    A PF Mountain From Israel
    • Messages
      1,677
    • Reaction score
      210
    • Points
      212
  • Back
    Top