In the lambda expression $(λx. (λy. (x y)) y) z$, the body of the abstraction is taken as $(λy. (x y))y$ and not just $(λy. (x y))$. Why isn't $(λy. (x y))$ considered as the body and the following $y$ as an argument to it instead of $z$ being an argument to the body $(λy. (x y))y$?
2026-03-25 17:39:33.1774460373
Use of parenthesis in the body of abstraction in lambda expression
106 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in LAMBDA-CALCULUS
- Finding a term $s$ such that for all terms $t$, $st$ = $ss$
- 'Logically symmetric' expressions in lambda calculus
- Who introduced the Kite to Smullyan's combinator birds?
- Can F be diverging in "forall M FM = F"?
- First-Order Logic: Simplifying $\exists x. (P(x))\,(\lambda y.see(y,x))$
- Encoding of booleans in lambda calculus
- parentheses in free and bound variable in lambda calculus
- Define lambda calculus encoding for boolean implication (⇒)
- Beta reduction in Lambda-Calculus
- Normative vs applicative order in reduction in the Lambda Calculus
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
First, let us rename some variables in the lambda term. It's generally bad form to have a bound variable and an unbound variable in a lambda term both with the same variable name, simple because it makes the term harder to read. Hence your term $(\lambda x . (\lambda y . (xy) y )) z$ becomes $(\lambda x . (\lambda w . (xw) y )) z$. They are still semantically the same term, but we have just changed the bound $y$ to be a $w$.
Now to answer the question. The answer unfortunately is that it doesn't actually matter what order you perform the reductions in; due to the Church-Rosser theorem, any lambda-term that eventually reaches some beta-normal form will always reduce to the same final term, no matter which reductions are performed. Beta-reduction is non-deterministic, but by the Church-Rosser Theorem, any term with a beta-normal form will reach this form through repeated beta-reduction no matter which reductions are made.
To see this, observe that we can either perform a beta-reduction converting $(\lambda x . (\lambda w . (xw) y )) z$ to $\lambda w. (zw) y$ (taking $\lambda w . (xw) y$ as the body), or we can beta-reduce $(\lambda x . (\lambda w . (xw) y )) z$ to $(\lambda x . xy)z$ (taking $(\lambda w . (xw) y ))$ as the body).
Then we have the two terms $\lambda w. (zw) y$ and $(\lambda x . xy)z$, which we non-deterministically beta-reduced to from the original term. Happily, these both reduce to the final term $zy$.