tweak advanced

Signed-off-by: Jim Pryor <profjim@jimpryor.net>

diff --git a/miscellaneous_lambda_challenges_and_advanced_topics.mdwn b/miscellaneous_lambda_challenges_and_advanced_topics.mdwn
index f69335a..7d00628 100644 (file)
--- 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.