Solutions in F#
Posted: Mon Mar 21, 2022 4:45 pm
Solutions in F#
1. Normalize the following lambda-calculus terms, giving all of the reduction steps you make. Make sure you avoid variable capture. You may use any evaluation strategy you wish, and you may rename bound variables (but not free variables). (i) (^f. (1x. f(fx))) (\y. y) z (ii) (^g.g 2) (Az.z) z (iii) (Ah.h (Ak.kz)) (Ay. yy) z
(* ANSWER 1 HERE: (i) (\f. (\x. f (f x))) (\y. y) z (ii) (\g. g z) (\z. z) z ( (iii) (\h. h (lk. k z)) (\y. yy) z *)
- Solutions In F 1 (87.85 KiB) Viewed 59 times
- Solutions In F 2 (15.37 KiB) Viewed 59 times
(* ANSWER 1 HERE: (i) (\f. (\x. f (f x))) (\y. y) z (ii) (\g. g z) (\z. z) z ( (iii) (\h. h (lk. k z)) (\y. yy) z *)