3 Find "normal forms" for the following (that is, reduce them as far as it's possible to reduce
10 5. (\x (x (\y y))) (\z (z z))
11 6. (\x (x x)) (\x (x x))
12 7. (\x (x x x)) (\x (x x x))
17 Recall our definitions of true and false.
19 "true" defined to be `\t \f. t`
20 "false" defined to be `\t \f. f`
22 In Racket, these can be defined like this:
24 (define true (lambda (t) (lambda (f) t)))
25 (define false (lambda (t) (lambda (f) f)))
27 * 8. Define a "neg" operator that negates "true" and "false".
38 * 9. Define an "and" operator.
40 * 10. Define an "xor" operator. (If you haven't seen this term before, here's a truth table:
45 false xor false = false
49 * 11. Inspired by our definition of boolean values, propose a data structure
50 capable of representing one of the two values "black" or "white". If we have
51 one of those values, call it a black-or-white-value, we should be able to
54 the-black-or-white-value if-black if-white
56 (where if-black and if-white are anything), and get back one of if-black or
57 if-white, depending on which of the black-or-white values we started with. Give
58 a definition for each of "black" and "white". (Do it in both lambda calculus
61 12. Now propose a data structure capable of representing one of the three values
62 "red" "green" or "blue," based on the same model. (Do it in both lambda
63 calculus and also in Racket.)
70 Recall our definitions of ordered pairs.
72 the pair (x,y) is defined as `\f. f x y`
74 To extract the first element of a pair p, you write:
78 Here are some defintions in Racket:
80 (define make-pair (lambda (fst) (lambda (snd) (lambda (f) ((f fst) snd)))))
81 (define get-first (lamda (fst) (lambda (snd) fst)))
82 (define get-second (lamda (fst) (lambda (snd) snd)))
86 (define p ((make-pair 10) 20))
87 (p get-first) ; will evaluate to 10
88 (p get-second) ; will evaluate to 20
90 If you're bothered by having the pair to the left and the function that operates on it come second, think about why it's being done this way: the pair is a package that takes a function for operating on its elements as an argument, and returns the result of operating on its elemens with that function. In other words, the pair is also a function.
92 If you like, you can disguise what's going on like this:
94 (define lifted-get-first (lambda (p) (p get-first)))
95 (define lifted-get-second (lambda (p) (p get-second)))
105 However, the latter is still what's going on under the hood.
108 13. Define a "swap" function that reverses the elements of a pair.
111 (define p ((make-pair 10) 20))
112 ((p swap) get-first) ; evaluates to 20
113 ((p swap) get-second) ; evaluates to 10
115 Write out the definition of swap in Racket.
118 14. Define a "dup" function that duplicates its argument to form a pair
119 whose elements are the same.
122 ((dup 10) get-first) ; evaluates to 10
123 ((dup 10) get-second) ; evaluates to 10
125 15. Define a "sixteen" function that makes
126 sixteen copies of its argument (and stores them in a data structure of
129 16. Inspired by our definition of ordered pairs, propose a data structure capable of representing ordered tripes. That is,
131 (((make-triple M) N) P)
133 should return an object that behaves in a reasonable way to serve as a triple. In addition to defining the make-triple function, you have to show how to extraxt elements of your triple. Write a get-first-of-triple function, that does for triples what get-first does for pairs. Also write get-second-of-triple and get-third-of-triple functions.
135 17. Write a function second-plus-third that when given to your triple, returns the result of adding the second and third members of the triple.
137 You can help yourself to the following definition:
139 (define add (lambda (x) (lambda (y) (+ x y))))
141 18. [Super hard, unless you have lots of experience programming] Write a function that reverses the order of the elements in a list.