This preview shows page 1. Sign up to view the full content.
Unformatted text preview: & y.y)) ( & y.y) n. ((( & x. & y.(x y))( & y.y)) w) Show that the following expression has multiple reduction sequences o. ( & x.y) (( & y.y y y) ( & x.x x x)) 2. Lambda calculus encodings Prove the following using the appropriate &-calculus encodings a. not (not true) = true b. or false true = true c. if false then x else y = y d. succ 2 = 3 e. (* 1 3) = 3 f. (+ 2 1) = 3 g. (Y fact) 2 = 2 // you do not need to expand any operators except fact & Y...
View Full Document
This note was uploaded on 01/13/2012 for the course CMSC 330 taught by Professor Staff during the Fall '08 term at Maryland.
- Fall '08