eta conversion

(computing theory) One of the three rewrite rules of lambda calculus, which expresses a sort of tautology about function application. The rule says that a lambda abstraction of the form (𝜆x.(fx)) may be rewritten as simply f, provided that x does not occur freely in f (considered by itself).