eta conversion

英語（米国） (en-US) 英語（イギリス） (en-GB)

名詞

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

日本語の意味

ラムダ計算における書き換えルールの一つ。具体的には、（𝜆x.(fx)) の形のラムダ抽象が、もし x が f に自由に現れなければ、単に f に変換できるという性質を持つ。

英語の意味

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

このボタンはなに？

Understanding eta conversion is essential for optimizing compilers that manipulate lambda expressions.

ラムダ式を操作するコンパイラの最適化には、η変換の理解が不可欠だ。

詳細

意味（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 (𝜆x.(fx)) may be rewritten as simply f, provided that x does not occur freely in f (considered by itself).

eta conversions （ plural ）