From 7a4c7045825cda0f1974ff3a8bb8d1c7e46d3d14 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Tue, 14 Sep 2010 11:48:49 -0400 Subject: [PATCH] more assignment1 tweaks Signed-off-by: Jim Pryor --- assignment1.mdwn | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/assignment1.mdwn b/assignment1.mdwn index 9bb65b38..a8981cf2 100644 --- a/assignment1.mdwn +++ b/assignment1.mdwn @@ -17,8 +17,8 @@ Booleans Recall our definitions of true and false. -> "true" defined to be `\t \f. t` -> "false" defined to be `\t \f. f` +> `true` defined to be `\t \f. t` +> `false` defined to be `\t \f. f` In Racket, these can be defined like this: @@ -26,7 +26,7 @@ In Racket, these can be defined like this: (define false (lambda (t) (lambda (f) f)))
    -
  1. Define a "neg" operator that negates "true" and "false". +
  2. Define a `neg` operator that negates `true` and `false`. Expected behavior: @@ -38,9 +38,9 @@ evaluates to 20, and evaluates to 10. -
  3. Define an "and" operator. +
  4. Define an `and` operator. -
  5. Define an "xor" operator. +
  6. Define an `xor` operator. (If you haven't seen this term before, here's a truth table: -- 2.11.0