From dd911c78a79577243800cafec55f75ef9d76d63a Mon Sep 17 00:00:00 2001
From: jim <jim@web>
Date: Tue, 24 Feb 2015 08:57:45 -0500
Subject: [PATCH] add comment

---
 exercises/assignment3_answers.mdwn | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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
-- 
2.11.0