Reduction
---------
-Find "normal forms" for the following (that is, reduce them as far as it's possible to reduce
-them):
+Find "normal forms" for the following (that is, reduce them until no more reductions are possible):
1. (\x \y. y x) z
2. (\x (x x)) z
p (\fst \snd. fst)
-Here are some defintions in Racket:
+Here are some definitions in Racket:
(define make-pair (lambda (fst) (lambda (snd) (lambda (f) ((f fst) snd)))))
(define get-first (lambda (fst) (lambda (snd) fst)))
(((make-triple M) N) P)
-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.
+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 extract 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.
* 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.