Com S 641 Semantic Models for Programming Languages Homework: 10 Wim Hesselink. Programs, Recursion and Unbounded Choice. Cambridge, 1992. and summary review exercises. We'll do as much of this as we have time for (I'll let you know the details), but in any case we'll have the review exercises (t and u) due on December 7. (Chapter 4) This chapter gives the main technical definition and ideas in the book: the semantics of recursion. Section 4.1 gives the basics of complete lattices, etc. Section 4.2 gives the Knaster-Tarski theorem, which is used to guarantee the existence of least-fixedpoints. (section 4.1) a. Give examples of a complete lattice and a complete lattice of functions that different than any discussed in class. (Small simple examples would be helpful for visualizing the ideas.) b. Do Hesselink's 4.1.0 c. Do Hesselink's 4.1.1 d. Do Hesselink's 4.1.2 e. Do Hesselink's 4.1.3 f. (extra credit only) Do Hesselink's 4.1.5 (section 4.2) g. Do Hesselink's 4.2.0 h. (extra credit only) Do Hesselink's 4.2.1 (section 4.3) i. Do one of Hesselink's 4.3.0, 4.3.1, or 4.3.2 exercises (your choice). j. (extra credit only) Do one or more of the other 4.3 exercises. (section 4.4) k. Do Hesselink's 4.4.0 l. (extra credit only) Do Hesselink's 4.4.1 m. Do one of Hesselink's 4.4.2 or 4.4.3 exercises (your choice). (section 4.5) n. Do Hesselink's 4.5.0 o. Show that wp is not in (H -> MU). (section 4.6) p. Do Hesselink's 4.6.0 q. (extra credit only) Do Hesselink's 4.6.1 r. Do Hesselink's 4.6.2 (section 4.9) s. (extra credit only) Do Hesselink's 4.9.1 REVIEW EXERCISES (If you haven't yet scheduled your final oral exam, do so now.) t. Write up an outline of the major topics discussed in class. u. Make up some final exam questions that might be used at your final oral exam. These should be broad questions that integrate the material in the course and its significance. You may also include some more detailed questions, but consider those as follow-up questions to the more general ones.