ConceptFull beta reductionModified just nowProperties 4Hide BooksChapter 5. The untyped/pure lambda-calculus JourneyProgramming Language Theory Statusmastered TagssemanticsIn Pure/Untyped lambda calculus, this strategy is defined by the following rules:t1→t1′t1 t2→t1′ t2\displaystyle \frac{t_1 \to t_1'}{t_1\ t_2 \to t_1'\ t_2}t1 t2→t1′ t2t1→t1′t2→t2′t1 t2→t1 t2′\displaystyle \frac{t_2 \to t_2'}{t_1\ t_2 \to t_1\ t_2'}t1 t2→t1 t2′t2→t2′t2→t2′λx. t2→λx. t2′\displaystyle \frac{t_2 \to t_2'}{\lambda x.\ t_2 \to \lambda x.\ t_2' }λx. t2→λx. t2′t2→t2′(λx. t1) t2→[x→t2]t1(\lambda x.\ t_1)\ t_2 \to [x \to t_2] t_1(λx. t1) t2→[x→t2]t1 Previous in ConceptsFresh variable abstract syntax tree astNext in Concepts Function