Midterm 2

CSc 330 F01 1
Midterm 2
NAME: STUDENT NO:
1. (25%) For each of the following type construction methods, give a simple type declaration
in Ada that illustrates the concept:
(a) (6%) subset
(b) (6%) product
(c) (7%) sum
(d) (6%) function
2. (25%) Given the following language for specifying types:
::= Int | Bool | | -> |
x | array of

CSc 330 F01 2
What are the most general types of h, f, a, l and k? Explain.
procedure h ( f : __ ; a : __ ; l : __ ; k : __ ) is
begin
for i in a’range do
k[i] := k[i] + f( a[i], l[i] );
end;
end;
3. (25%)
(a) (15%) Given two abstract data types DQueue (double-ended queues) and Queue
(single-ended queues), how are they related by subtyping and subclassing? Explain.

CSc 330 F01 3
(b) (10%) Discuss the difference between strong and weak substitutibility.
4. (25%) Reduce the following lambda expression into normal form. Show all your steps.
( (λf.λx.f(fx)) (λf.λx.f(fx)) ) x y