Combinator

Part of speech: noun

Definitions

1. A mathematical entity that combines elements in a specific way to analyze groups or arrangements
2. a term in computer science referring to functions that combine or manipulate data structures
3. an algebraic object used in combinatorial formulations to count combinations or selections of items

Etymology: Within computing, "combinator" was borrowed from the older mathematical and logical sense of the word, which in turn comes from "combine" with the agentive suffix "-or", meaning one that performs the action. The mathematical use is the older one: combinators are functions that take other functions as input and build new ones from them without naming any variables. Moses Schönfinkel introduced the idea in 1924, and Haskell Curry developed it in the 1930s, so the term was in use among logicians long before programmers adopted it. In programming, especially functional programming, the word now mostly describes higher-order functions that combine other functions or values in a general way, such as the classic "fold" or "map" patterns. The term's sense has shifted from abstract logic toward practical code, but the core idea of combining things into something new remains.

Synonyms: combiner, assembler, aggregator, mixer, unifier