**Table of Contents**

We illustrate the methods presented in the previous sections through some solved exercises.

Exercise 1.Let . Let . Present at least five steps of the computation in the operational semantics starting from the configuration . In the second member of the configurations below, the tuples stand for the values , and , in this order.

Exercise 2.Let be the factorial program as in the previous exercise. Construct the set in the style of Definition 12. We preserve the notation of the previous exercise concerning the subparts of programC.

Exercise 3.Construct a computational (transitional) sequence forCin Exercise 1 starting from making use of the operational semantics defined in the previous exercise.

Exercise 4.Let . Let , assume , . Present a computation in the operational semantics starting from the configuration . In the second member of the configurations below, the tuples stand for the values , , in this order.

Exercise 5.LetCbe as in Exercise 4. Let us keep the notation for the labels ofCof the above exercise. Formulate the operational semantics ofCon the pattern of 12. Let and as before.

Exercise 6.Construct a computational (transitional) sequence forC, ifCis as in Exercise 4, starting from making use of the operational semantics defined in the previous exercise. Assume and .