Fixpoints in Complete Partial Orders
Jacques Loeckx, Kurt Sieber · Plenum series in computer science · 1987
In the previous chapter operational semantics for various programming languages were introduced. All these operational semantics had something in common: the meaning M F (S) of a program S (in an interpretation F) was defined algorithmically, namely with help of computation sequences. In other words, to each program an algorithm was associated which computes the function M F (S) or, more precisely, which computes the value of M F (S) (called output value) for any argument (called input value).