Friday, HW4
Posted April 3, 2009 Due Tuesday, April 14, 2009 Borrow a textbook if you don't have one already.
Problem 1 (25pts). Exercise 10.7 in Scott's book (page 553). Problem 2 (15pts). Exercise 7.24 in Scott's book (page 402). Draw the type trees as we did in class. Problem 3 (10pts). Exercise 8.14 in Scott's book (page 463). Draw the type tree. Problem 4 (25pts). [From Sethi]. Verify the following equalities: a) SIII = I, where S is xyz.(xz)(yz) and I is x.x. b) twice f (twice) x = f (f (f (f x))), where twice is f x.f (f x) Problem 5 (15pts). Assume that your programming language allows array declarations of the form: [1..10] [1..5,1..5] int a; (a is an array of 10 two dimensional arrays of integers). Assume that arrays are stored in column major order. Show the formula for the address of element a[j][k,l]. State any assumptions that you make to obtain this formula. Problem 6 (10pts). Exercise 7.19 in Scott's book (page 401).
1