In this lecture we learn about the special forms cond , trace . We learn also about the useful built-in functions append , member map , example and list . We also write our own version of member, member? . These built-in functions will help us implement algorithms on finite sets.
(cons '(1 2 3) '(4 5 6)) ==> ((1 2 3) 4 5 6) (append '((1 2) 3) '(4 (5 6))) |