X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=topics%2Fweek3_church_arithmetic.mdwn;h=17d38b08c0d26dd454aa52f8ce6e63bc254f93bc;hp=8907c12ac01bb3b2287280a4c2741e5c0e0c7459;hb=6c54c58a75ebe803e5cacb16f97357b3121d86e2;hpb=f41c2c72434b36288f17c652f010cb6e29e56f73 diff --git a/topics/week3_church_arithmetic.mdwn b/topics/week3_church_arithmetic.mdwn index 8907c12a..17d38b08 100644 --- a/topics/week3_church_arithmetic.mdwn +++ b/topics/week3_church_arithmetic.mdwn @@ -72,4 +72,4 @@ If we continue in this direction, we end up defining `l^r` (where `2^5` is `32`) Not all of the arithmetic encodings are so neat and elegant, however. As we mentioned, `pred` takes some ingenuity. We'll also have you define `zero?` and ≤ for homework. -Here is an example of [some programmers having fun with Church numbers](http://www.schemers.org/Miscellaneous/imagine.txt). +Here is an example of [some programmers having fun with Church numbers](http://www.schemers.org/Miscellaneous/imagine.txt). A tiny glossary: FORTRAN is a very old imperatival language that Scheme hoped to replace; SML is a sister language to OCaml; Chez is one Scheme implementation (like Racket and Chicken); and you will learn about "Y" next week. You should be able to figure out what the refrain means.