最終更新日:2025/11/30

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

音声機能が動作しない場合はこちらをご確認ください
正解を見る

alpha conversion

編集履歴(0)
元となった辞書の項目

alpha conversion

項を代入する際に変数捕獲を避けるため、代入を適用する前にラムダ抽象の束縛変数の名前を変更します。

plural

Dictionary quizzes to help you remember vocabulary

編集履歴(0)

ログイン / 新規登録

 

アプリをダウンロード!
DiQt

DiQt(ディクト)

無料

★★★★★★★★★★