X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=exercises%2Fassignment3_answers.mdwn;h=ae35731b0333982c915d357e9ed1d4bd92225848;hb=de74e6bac683afd7a0d6c64716814ac6c4942c6b;hp=781649ce504096c76f81ad7a6745eb535c26256b;hpb=422bf1f49096fad4e372d80b7bab3432e4165d60;p=lambda.git

diff --git a/exercises/assignment3_answers.mdwn b/exercises/assignment3_answers.mdwn
index 781649ce..ae35731b 100644
--- a/exercises/assignment3_answers.mdwn
+++ b/exercises/assignment3_answers.mdwn
@@ -167,7 +167,7 @@ where `one` abbreviates `succ zero`, and `two` abbreviates `succ (succ zero)`.
     >      let leq? = \l r. zero? (sub l r) in
     >      ...
 
-    > Here is another solution. Jim crafted this particular implementation, but like a great deal of the CS knowledge he's gained over the past eight years, Oleg Kiselyov pointed the way.
+    > Here is another solution. Jim crafted this particular implementation, but like a great deal of the CS knowledge he's gained over the past eight years, Oleg Kiselyov pointed the way. <!-- see "lambda-calc-opposites.txt" at http://okmij.org/ftp/Computation/lambda-calc.html#neg -->
 
     >     let leq? = (\base build consume. \l r. r consume (l build base) fst)
     >             ; where base is