Last Updated :2025/11/30

Quizzes for review

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

音声機能が動作しない場合はこちらをご確認ください
See correct answer

alpha conversion

To avoid variable capture when substituting terms, we perform an alpha conversion on the lambda abstraction before applying the substitution.

See correct answer

To avoid variable capture when substituting terms, we perform an alpha conversion on the lambda abstraction before applying the substitution.

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

English - English

Word Edit Setting
  • Users who have edit permission for words - All Users
  • Screen new word creation
  • Screen word edits
  • Screen word deletion
  • Screen the creation of new headword that may be duplicates
  • Screen changing entry name
  • Users authorized to vote on judging - Editor
  • Number of votes required for decision - 1
Sentence Edit Setting
  • Users who have edit permission for sentences - All Users
  • Screen sentence deletion
  • Users authorized to vote on judging - Editor
  • Number of votes required for decision - 1
Quiz Edit Setting
  • Users who have edit permission for quizzes - All Users
  • Users authorized to vote on judging - Editor
  • Number of votes required for decision - 1
Editing Guideline

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★