英和和英

名詞

eta conversion (countable and uncountable, plural eta conversions)

1. (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 ${\\displaystyle (\\lambda x.(fx))}$ may be rewritten as simply ${\\displaystyle f}$, provided that x does not occur freely in f (considered by itself).