X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?a=blobdiff_plain;f=topics%2Fweek4_fixed_point_combinators.mdwn;h=74b32bebda58fa4aa61204b46525c80d736c2fa3;hb=02087e04c3c2ff53ec2e292d69ae2e1e6511af09;hp=c904bdc837a9a84233f3ac517c49b298c2d9d13e;hpb=ce10606b3b1de35a37d4f4df12eeedd1e434b0e1;p=lambda.git

diff --git a/topics/week4_fixed_point_combinators.mdwn b/topics/week4_fixed_point_combinators.mdwn
index c904bdc8..74b32beb 100644
--- a/topics/week4_fixed_point_combinators.mdwn
+++ b/topics/week4_fixed_point_combinators.mdwn
@@ -186,7 +186,7 @@ returns `#t`, because if we follow the path from the head of the list argument,
 
     (looking '(6 2 grits caviar 5 7 3))
 
-our path will take us from `6` to `7` to `3` to `grits`, which is not a number but not the `'caviar` we were looking for either. So this returns `#f`. It would be very difficult to define these functions without recourse to something like `letrec` or `define`, or the techniques developed below (and also in that chapter of *The Little Schemer*.
+our path will take us from `6` to `7` to `3` to `grits`, which is not a number but not the `'caviar` we were looking for either. So this returns `#f`. It would be very difficult to define these functions without recourse to something like `letrec` or `define`, or the techniques developed below (and also in that chapter of *The Little Schemer*).
 
 
 ## Using fixed-point combinators to define recursive functions ##