X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=miscellaneous_lambda_challenges_and_advanced_topics.mdwn;h=7d006286f0cc476e07bd6fb0a9aa1d17a496c944;hp=f69335a0727dc7c2019707db7f8597f0390633ac;hb=124b42efaaafa38c66aa37968aa0d7e108c28268;hpb=01d9a7d26a9b1e6c6e5fbb2b85db321eb31289bc

diff --git a/miscellaneous_lambda_challenges_and_advanced_topics.mdwn b/miscellaneous_lambda_challenges_and_advanced_topics.mdwn
index f69335a0..7d006286 100644
--- a/miscellaneous_lambda_challenges_and_advanced_topics.mdwn
+++ b/miscellaneous_lambda_challenges_and_advanced_topics.mdwn
@@ -17,7 +17,7 @@ can use.
 	native `let rec` or `define`, then you can't use the fixed-point combinators
 	`Y` or <code>&Theta;</code>. Expressions using them will have non-terminating
 	reductions, with Scheme's eager/call-by-value strategy. There are other
-	fixed-point combinators you can use with Scheme (in the [[week3]] notes they
+	fixed-point combinators you can use with Scheme (in the [week 3 notes](/week3/#index7h2) they
 	were <code>Y&prime;</code> and <code>&Theta;&prime;</code>. But even with
 	them, evaluation order still matters: for some (admittedly unusual)
 	evaluation strategies, expressions using them will also be non-terminating.