(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).

plural of alpha conversion

plural of backfile conversion

plural of conversion rate

plural of conversion van

plural of Damascene conversion

plural of deathbed conversion

plural of eta conversion

plural of Pauline conversion

(linguistics, philosophy, semantics) Either of a pair of terms that name or describe a single relationship from opposite perspectives, such as parent versus child.