From 78be35a1a13e17219773f38a219144ef7172c745 Mon Sep 17 00:00:00 2001
From: jim
Date: Thu, 12 Feb 2015 13:07:49 -0500
Subject: [PATCH] add anchors
---
topics/week3_lists.mdwn | 5 +++++
1 file changed, 5 insertions(+)
diff --git a/topics/week3_lists.mdwn b/topics/week3_lists.mdwn
index 6f7c1e0f..08b35162 100644
--- a/topics/week3_lists.mdwn
+++ b/topics/week3_lists.mdwn
@@ -1,5 +1,6 @@
# More on Lists #
+
## Comprehensions ##
We know you are already familiar with the following kind of notation for designating sets:
@@ -119,6 +120,8 @@ not to:
To get the latter, you'd need to apply `join` twice.
+
+
## Tails ##
For the Lambda Calculus, we've proposed to encode lists in terms of higher-order functions that perform right-folds on (what we intuitively regard as) the real list. Thus, the list we'd write in Kapulet or Haskell as:
@@ -151,3 +154,5 @@ Try it out in the lambda evaluator. After the code above, you can write:
and the result will be `\f z. f b (f c z)`, our encoding of `[b, c]`.
+
+
--
2.11.0