@@ -167,7+167,7 @@ where `one` abbreviates `succ zero`, and `two` abbreviates `succ (succ zero)`.
> let leq? = \l r. zero? (sub l r) in
> ...
> 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
> let leq? = (\base build consume. \l r. r consume (l build base) fst)