From cff9857e52ac59c4905efeb80fcf8a91c2fd1ed8 Mon Sep 17 00:00:00 2001
From: jim
Date: Mon, 23 Feb 2015 13:32:57 -0500
Subject: [PATCH] fix link
---
exercises/assignment3_answers.mdwn | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)
diff --git a/exercises/assignment3_answers.mdwn b/exercises/assignment3_answers.mdwn
index 1fe4baf3..7530534f 100644
--- a/exercises/assignment3_answers.mdwn
+++ b/exercises/assignment3_answers.mdwn
@@ -43,7 +43,7 @@
> let left_head = \xs. (xs f I) I err in
> ...
- > Here's another, more straightforward answer. We [[observed before|where?]] that left-folding the `cons` function over a list reverses it. Hence, it is easy to reverse a list defined in terms of its left-fold:
+ > Here's another, more straightforward answer. We [[observed before|/topics/week2_encodings#flipped-cons]] that left-folding the `cons` function over a list reverses it. Hence, it is easy to reverse a list defined in terms of its left-fold:
> let left_empty = \f z. z in ; this the same as for the right-fold encoding of lists
> let flipped_left_cons = \xs x. \f z. xs f (f z x) in ; left-folding supplies arguments in a different order than cons expects
--
2.11.0