Last Updated：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.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
alpha conversion
Edit Histories（0）
Source Word
alpha conversion
Noun
countable
uncountable
(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.
Japanese Meaning
ラムダ計算における書き換え規則の一つで、束縛変数を他の変数に一貫して変更する操作。
Sense（1）
(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.
（ plural ）
