How would you evaluate $\lambda x.\lambda x.\lambda x.x 1 2 3$? I cant figure out if the first lambda takes the 1 beta reduces, then the second lambda takes the 2 then beta reduces and finally the third lambda takes the 3 and beta reduces or if it goes the opposite way around. Pretty much my question is which lambda takes in which number and would the answer to this be 1 or 3?
2026-03-25 20:39:57.1774471197
Brackets in Lambda Calculus with multiple lambdas
322 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?
That depends on your bracketing conventions, but I suppose that by
$$\lambda x. \lambda x. \lambda x.x123$$ you mean $$(\lambda x. \lambda x. \lambda x.x)123$$ which is shorthand for $$(\lambda x. (\lambda x. (\lambda x.x)))123$$ which is, with a leftmost bracketing convention, to be read as $$(((\lambda x. (\lambda x. (\lambda x. x)))1)2)3$$
In this term, the first redex is $$(\lambda x. (\lambda x. (\lambda x.x)))1$$ which beta-reduces to $$(\lambda x. (\lambda x.x))[1/x]$$ i.e. $1$ is substituted for each free occurence of $x$ in $(\lambda x. (\lambda x.x))$. Since $x$ is already by another $\lambda$-abstraction (in fact two), there is no free occurrence of $x$. Hence, nothing is substituted.
In general, new abstractions in some inner subterm "overwrite" abstractions in a further outwards term. The first two $\lambda x$'s do not effectively bind anything. Here is why.
So in the first reduction, $1$ is not substiuted into anywhere and just disappears. The same happens for the second $\lambda x$ abstraction, which is "overwritten" by the innermost one and hence does nothing to the term $2$. So we have
$$(((\lambda x. (\lambda x. (\lambda x. x)))1)2)3 \rhd_\beta ((\lambda x. (\lambda x. x))2)3 \rhd_\beta (\lambda x.x)3$$
Now we have just one redex left, and in the subterm $x$, $x$ is free to be substitued by $3$, so we end up with
$$(\lambda x.x)3 \rhd_\beta 3$$
That is, the result (the $\beta$-normal form) of your term is $3$, because only the innermost abstraction (which forms a redex with $3$) takes precedence in binding the variable $x$, and the outer two are empty abstractions, making the terms $1$ and $2$ disappear.