In this lecture we introduce, semi-formally, the semantics of a language we call IfArith using a technique named textual reduction. Textual reduction semantics allow defining the meaning of a program by means of a series of small local "reductions" as computation progresses to arrive (finally) at a value.
