{{Short description|Property of accepting a variable number of arguments}}
In computer science, a '''variadic''' function, operator, or other construct is one that accepts a variable number of arguments; that is, its arity is not fixed. Variadic constructs are commonly used in programming languages to provide flexible interfaces that can operate on varying numbers of inputs.
The term ''variadic'' is a neologism, dating back to 1936/1937.<ref>Henry S. Leonard and H. N. Goodman, ''A calculus of individuals''. Abstract of a talk given at the Second Meeting of the Association for Symbolic Logic, held in Cambridge MA on December 28–30, 1936, [https://www.jstor.org/stable/2268861], ''Journal of Symbolic Logic'' '''2'''(1) 1937, 63.</ref> The term was not widely used until the 1970s.
==See also== * {{Annotated link |Variadic function}} * {{Annotated link |Variadic macro}} * {{Annotated link |Variadic template}} * {{Annotated link |Arity}}
==References== {{Reflist}}
Category:Programming language theory
{{Comp-sci-stub}}