Programming Language Theory ConceptNormal orderProperties 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]t1t1→t1′t1 t2→t1′ t2(t1 is not a λ)t2→t2′t1 t2→t1 t2′(t1 in normal form)t→t′λx. t→λx. t′ Previous in ConceptsNormal form valueNext in Concepts Object