(Note that they are different from Racket's *primitive* boolean values `#t` and `#f`.)
-<small>(I know the numbering of the homework problems will restart instead of continuing as before. It's too much of a pain to fix it right now. We'll put in a better rendering engine later that will make this work right without laborious work-arounds on our part.)</small>
+<small>(I know the numbering of the homework problems will restart instead of continuing with 8, 9, ... It's too much of a pain to fix it right now. We'll put in a better rendering engine later that will make this work right without laborious work-arounds on our part.)</small>
8. Define a `neg` operator that negates `true` and `false`.
10. Define an `xor` operator. If you haven't seen this term before, here's a truth table:
- true xor true == false
- true xor false == true
- false xor true == true
- false xor false == false
+ true xor true == false
+ true xor false == true
+ false xor true == true
+ false xor false == false