Lambda Calculus - Formal Definition - Free and Bound Variables

Free and Bound Variables

The abstraction operator, λ, is said to bind its variable wherever it occurs in the body of the abstraction. Variables that fall within the scope of a lambda are said to be bound. All other variables are called free. For example in the following expression y is a bound variable and x is free: λy.x x y. Also note that a variable binds to its "nearest" lambda. In the following expression one single occurrence of x is bound by the second lambda: λx.yx.z x)

The set of free variables of a lambda expression, M, is denoted as FV(M) and is defined by recursion on the structure of the terms, as follows:

  1. FV(x) = {x}, where x is a variable
  2. FV(λx.M) = FV(M) \ {x}
  3. FV(M N) = FV(M) ∪ FV(N)

An expression that contains no free variables is said to be closed. Closed lambda expressions are also known as combinators and are equivalent to terms in combinatory logic.

Read more about this topic:  Lambda Calculus, Formal Definition

Famous quotes containing the words free, bound and/or variables:

    Man is a masterpiece of creation if for no other reason than that, all the weight of evidence for determinism notwithstanding, he believes he has free will.
    —G.C. (Georg Christoph)

    Successful socialism depends on the perfectibility of man. Unless all, or nearly all, men are high-minded and clear-sighted, it is bound to be a rotten failure in any but a physical sense. Even through it is altruism, socialism means materialism. You can guarantee the things of the body to every one, but you cannot guarantee the things of the spirit to every one; you can guarantee only that the opportunity to seek them shall not be denied to any one who chooses to seek them.
    Katharine Fullerton Gerould (1879–1944)

    The variables of quantification, ‘something,’ ‘nothing,’ ‘everything,’ range over our whole ontology, whatever it may be; and we are convicted of a particular ontological presupposition if, and only if, the alleged presuppositum has to be reckoned among the entities over which our variables range in order to render one of our affirmations true.
    Willard Van Orman Quine (b. 1908)