X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=week3a.mdwn;h=3ed45aef92854f0072de68899319c25e5cbdaba5;hp=892a055a39fa4b193c91914bd8442de1c0c0eac9;hb=1d29453465d5f709699abd2adeb2b75ad6695a7f;hpb=2dc9b679fbe5f9dadb336e15fc62d4ddf2b2fdc9 diff --git a/week3a.mdwn b/week3a.mdwn index 892a055a..3ed45aef 100644 --- a/week3a.mdwn +++ b/week3a.mdwn @@ -211,7 +211,9 @@ Instead of writing out a long formula twice, we could write: and the initial `(\x. x x)` is just what we earlier called the ω combinator (lower-case omega, not the non-terminating Ω). So the self-application of `H` can be written: -
ω (\h \lst. (isempty lst) zero (add one ((h h) (extract-tail lst))))
+
ω (\h \lst. (isempty lst) zero (add one ((h h) (extract-tail lst))))
+
+ and this will indeed implement the recursive function we couldn't earlier figure out how to define.