Higher-order Functions
Higher-Order Functions is a programming construct in functional programming that refers to a function which either takes one or more functions as arguments or returns a function as its result, thereby enabling abstraction over computation patterns.
866
Publications
49.7K
Citations
1.9K
Authors
856
Institutions
Publications per year
2017–2026
165
Variants
Higher-order Function
Parents
866
Minoru Kanehisa · Novartis Foundation symposium · 2002 · 1.4K citations
Why Functional Programming Matters
John Hughes · The Computer Journal · 1989 · 739 citations · Full text
1–5 of 866
1.9K
7
h-index
6
h-index
6
h-index
6
h-index
6
h-index
1–5 of 1.9K
856
University of Cambridge
Cambridge, United Kingdom
15 h-index
27 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
13 h-index
23 publications
774 citations
University of Oxford
Oxford, United Kingdom
13 h-index
30 publications
1.5K citations
Yale University
New Haven, United States
12 h-index
23 publications
1K citations

Imperial College London
London, United Kingdom
12 h-index
17 publications
812 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
11 h-index
13 publications
1.3K citations
University of California, Berkeley
Berkeley, United States
11 h-index
27 publications
1.4K citations
Northeastern University
Boston, United States
10 h-index
17 publications
1.7K citations
1–8 of 856
20 publications · 1.2K citations
18
h-index
PACMPL · 17 publications · 438 citations
15
h-index
19 publications · 948 citations
14
h-index
14 publications · 1.3K citations
14
h-index
Repository · 14 publications · 331 citations
11
h-index
1–5