Function Composition
Function Composition is a fundamental construct in functional programming that denotes the operation of combining two or more functions such that the output of one function serves as the input to the next, thereby producing a new function that represents the sequential application of the original functions.
138
Publications
6.8K
Citations
262
Authors
138
Institutions
Publications per year
2017–2026
28
138
Imperative functional programming
Simon Jones, Philip Wadler · 1993 · 1.2K citations · Full text
Tomas Sander, Christian Tschudin · 2002 · 254 citations
Negative weights make adversaries stronger
Troy Lee, Robert Špalek · 2007 · 222 citations · Full text
Binary Operations Applied to Functions
Andrzej Trybulec · 1990 · 218 citations
1–5 of 138
262
3
h-index
3
h-index
3
h-index
2
h-index
German Research Centre for Artificial Intelligence, Germany
2 publications · 219 citations
2
h-index
1–5 of 262
138
National University of Singapore
Singapore, Singapore
5 h-index
7 publications
379 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
3 publications
135 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
3 h-index
4 publications
99 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
115 citations

Harvard University Press
Cambridge, United States
2 h-index
4 publications
230 citations

Rice University
Houston, United States
2 h-index
2 publications
103 citations

Pennsylvania State University
State College, United States
2 h-index
3 publications
39 citations
University College London
London, United Kingdom
2 h-index
2 publications
115 citations
1–8 of 138
Repository · 5 publications · 124 citations
5
h-index
3 publications · 97 citations
3
h-index
TRAN · 3 publications · 640 citations
3
h-index
AEM · 2 publications · 29 citations
2
h-index
2 publications · 57 citations
2
h-index
1–5