ConceptNormal orderModified just nowProperties 4Hide BooksChapter 5. The untyped/pure lambda-calculus JourneyProgramming Language Theory Statusmastered TagssemanticsIn pure lambda calculus, this strategy is defined by the following rules:(λx. t1) t2→[x↦t2] t1(\lambda x.\ t_1)\ t_2 \to [x \mapsto t_2]\, t_1(λx. t1) t2→[x↦t2]t1t1→t1′t1 t2→t1′ t2(t1 is not a λ)\displaystyle \frac{t_1 \to t_1'}{t_1\ t_2 \to t_1'\ t_2} \quad (t_1 \text{ is not a } \lambda)t1 t2→t1′ t2t1→t1′(t1 is not a λ)t2→t2′t1 t2→t1 t2′(t1 in normal form)\displaystyle \frac{t_2 \to t_2'}{t_1\ t_2 \to t_1\ t_2'} \quad (t_1 \text{ in normal form})t1 t2→t1 t2′t2→t2′(t1 in normal form)t→t′λx. t→λx. t′\displaystyle \frac{t \to t'}{\lambda x.\ t \to \lambda x.\ t'}λx. t→λx. t′t→t′ Previous in ConceptsNormal form valueNext in Concepts Object