catflap.org Online Dictionary Query

  beta reduction
       
          [{lambda-calculus] The application of a lambda
          abstraction to an argument expression.  A copy of the body of
          the lambda abstraction is made and occurrences of the bound
          variable being replaced by the argument.  E.g.
       
          	(\ x . x+1) 4  -->  4+1
       
          Beta reduction is the only kind of reduction in the pure
          lambda-calculus.  The opposite of beta reduction is beta
          abstraction.  These are the two kinds of beta conversion.
       
          See also name capture.
       
       

  beta reduction
     n.
     1 The act of beta reduce, an instance of replacing a function call by
  the result of calling a function.
     2 (label en computing theory) One of the three rewrite rules of the
  lambda calculus, which states that the application of a lambda
  abstraction <math>(lambda x. t) </math> to a term
  <math>s</math> yields an expression
  <math>t[s/x]</math>, "''t'' with ''s'' instead of
  ''x''", where all free instances of ''x'' in ''t'' have been
  replaced by ''s''.

  beta reduction
     n.
     1 The act of beta reduce, an instance of replacing a function call by
  the result of calling a function.
     2 (label en computing theory) One of the three rewrite rules of the
  lambda calculus, which states that the application of a lambda
  abstraction <math>(lambda x. t) </math> to a term
  <math>s</math> yields an expression
  <math>t[s/x]</math>, "''t'' with ''s'' instead of
  ''x''", where all free instances of ''x'' in ''t'' have been
  replaced by ''s''.

  beta reduction
     n.
     1 The act of beta reduce, an instance of replacing a function call by
  the result of calling a function.
     2 (label en computing theory) One of the three rewrite rules of the
  lambda calculus, which states that the application of a lambda
  abstraction <math>(lambda x. t) </math> to a term
  <math>s</math> yields an expression
  <math>t[s/x]</math>, "''t'' with ''s'' instead of
  ''x''", where all free instances of ''x'' in ''t'' have been
  replaced by ''s''.

  beta reduction
     n.
     1 The act of beta reduce, an instance of replacing a function call by
  the result of calling a function.
     2 (label en computing theory) One of the three rewrite rules of the
  lambda calculus, which states that the application of a lambda
  abstraction <math>(lambda x. t) </math> to a term
  <math>s</math> yields an expression
  <math>t[s/x]</math>, "''t'' with ''s'' instead of
  ''x''", where all free instances of ''x'' in ''t'' have been
  replaced by ''s''.