catflap.org Online Dictionary Query

  alpha conversion
       
           In lambda-calculus and reduction, the renaming of
          a formal parameter in a lambda abstraction.  This does not
          change the meaning of the abstraction.  For example:
       
          	\ x . x+1  <-->  \ y . y+1
       
          If the actual argument to a lambda abstraction contains
          instances of the abstraction's formal parameter then it is
          necessary to rename the parameter before applying the
          abstraction to avoid name capture.
       
          (1995-05-10)
       
       

  alpha conversion
     n.
     (label en 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 <math>(lambda x. t)</math> and it is desired to
  have ''x'' replaced with ''y'', then the rewritten lambda term would
  have the form <math>(lambda y. t[y/x])</math> where
  <math>t[y/x]</math>, "''t'' with ''y'' instead of
  ''x''", has had all free instances of ''x'' in ''t'' replaced with
  ''y''.

  alpha conversion
     n.
     (label en 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 <math>(lambda x. t)</math> and it is desired to
  have ''x'' replaced with ''y'', then the rewritten lambda term would
  have the form <math>(lambda y. t[y/x])</math> where
  <math>t[y/x]</math>, "''t'' with ''y'' instead of
  ''x''", has had all free instances of ''x'' in ''t'' replaced with
  ''y''.

  alpha conversion
     n.
     (label en 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 <math>(lambda x. t)</math> and it is desired to
  have ''x'' replaced with ''y'', then the rewritten lambda term would
  have the form <math>(lambda y. t[y/x])</math> where
  <math>t[y/x]</math>, "''t'' with ''y'' instead of
  ''x''", has had all free instances of ''x'' in ''t'' replaced with
  ''y''.

  alpha conversion
     n.
     (label en 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 <math>(lambda x. t)</math> and it is desired to
  have ''x'' replaced with ''y'', then the rewritten lambda term would
  have the form <math>(lambda y. t[y/x])</math> where
  <math>t[y/x]</math>, "''t'' with ''y'' instead of
  ''x''", has had all free instances of ''x'' in ''t'' replaced with
  ''y''.