lowarity

Lowarity is a term used in discussions of function arity, referring to functions or operators that require only a small, fixed number of arguments. Arity is the count of inputs a function takes, and lowarity contrasts with high arity, where a function accepts many inputs. The boundary is not fixed, but common references consider arity of one or two as low, with zero-argument functions called nullary.

In programming and formal languages, lowarity facilitates readability and composition. Unary operations (one argument) and binary operations (two arguments) are classic examples. Nullary constants or zero-argument functions supply a value without inputs. Languages with currying or partial application can often convert higher-arity constructions into a sequence of low-arity steps, influencing both syntax and semantics.

Advantages and trade-offs: lowarity supports simple calling conventions and easier optimization by compilers, but relying exclusively on low-arity operations can reduce expressiveness or lead to verbose code when many inputs are semantically needed. It interacts with variadic functions, higher-order functions, and currying in different ways across languages.

Usage and examples: In mathematics, operations like addition are binary; in logic, negation is unary. In a formal language, a constant true can be seen as a nullary operator; a function f(x) is unary; a function g(x, y) is binary. Some languages expose many variadic or high-arity constructs, while others emphasize fixed low arity for core operators.