From: jim Date: Sun, 22 Feb 2015 21:52:49 +0000 (-0500) Subject: missing paren X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=0f8d7ba70113fa833fe275b47b11e7527205eed8 missing paren --- 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 ##