Higher-order function

Known as: Functional form, Second-order function, First-order function 
In mathematics and computer science, a higher-order function (also functional, functional form or functor) is a function that does at least one of… (More)
Wikipedia

Related topics

Related topics

49 relations
APLAbstraction (software engineering)Applicative programming languageBoilerplate code
(More)

Broader (1)

Functional programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Higher-Order Threshold Implementations
Higher-order differential power analysis attacks are a serious threat for cryptographic hardware implementations. In particular… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
P³ & Beyond: Move Making Algorithms for Solving Higher Order Functions
In this paper, we extend the class of energy functions for which the optimal alpha-expansion and alphabeta-swap moves can be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Minimizing sparse higher order energy functions of discrete variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Proving and Disproving Termination of Higher-Order Functions
The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems (TRSs). We… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Contracts for higher-order functions
Assertions play an important role in the construction of robust software. Their use in programming languages dates back to the… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The Higher-Order Recursive Path Ordering
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Higher-Order Narrowing with Definitional Trees
Functional logic languages with a sound and complete opera tional semantics are mainly based on narrowing Due to the huge search… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Names and higher-order functions
Many functional programming languages rely on the elimination of ‘impure’ features: assignment to variables, exceptions and even… (More)
  • figure 3.4
  • figure 5.3
  • figure 5.7
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
The research reported in this paper is concerned with the problem of reasoning about properties of higher order functions… (More)
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Higher-Order Attribute Grammars
A new kind of attribute grammars, called higher order attribute grammars, is defined. In higher order attribute grammars the… (More)
  • figure 3
  • figure 5
  • figure 4
  • figure 6
  • figure 8
Is this relevant?