Denotational Semantics
Jacques Loeckx, Kurt Sieber · Plenum series in computer science · 1987
Now it is time to give denotational semantics to two of the programming languages introduced in Chapter 3. These descriptions will be facilitated by the use of the so-called λ-notation which is the subject of the first section. The denotational semantics of the language .ℒ 3 of recursive programs, being very straightforward, is given first. The question of the equivalence to the operational semantics is answered affirmatively. The last section introduces the denotational semantics of the language .ℒ 2 of while-programs. The denotational semantics for the language ℒ 1 of flowchart programs is omitted; one of the problems related to making denotational semantics for flowchart programs will be briefly mentioned in Section 11.1.