QUESTION 2 - Match each A-expression with its matching set of free variables (a given set may be used 0 or more times).

[answerhappygod]

Question 2 Match Each A Expression With Its Matching Set Of Free Variables A Given Set May Be Used 0 Or More Times 1 (42.23 KiB) Viewed 25 times

QUESTION 2 - Match each A-expression with its matching set of free variables (a given set may be used 0 or more times). (Ax.x x) (4x.xx) 1. {a,b,x,y} (Ax.y) (Ay.x) 2. (a, b) (Aw.dx.wy Ay.y) (4a.a) 3. (a,x) (Aa.Ab.Ax.x y) a y Ax.x 4. {a,y} 5. {b, x) (Aa.Ab.a b) (x.xx) (ay.ba) 6. {by} 7. {x,y} 8. {x} 9. {y} 10.{}(the empty set) QUESTION 3 Consider a h-expression containing a single redex. Which of the following may be true? Applying a B-reduction to the expression gives us an expression in normal form. Applying a B-reduction to the expression results in an expression with two or more redexes. Applying a B-reduction to the expression results in the same expression. Applying a B-reduction to the expression results in variable capture.