(computing theory) One of the three rewrite rules of lambda calculus, in which a bound variable of a lambda term is replaced by another variable across its entire scope. So if there is a lambda term of the form (𝜆x.t) and it is desired to have x replaced with y, then the rewritten lambda term would have the form (𝜆y.t[y/x]) where t[y/x], "t with y instead of x", has had all free instances of x in t replaced with y.

(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