From 124b42efaaafa38c66aa37968aa0d7e108c28268 Mon Sep 17 00:00:00 2001 From: Jim Pryor Date: Sun, 3 Oct 2010 02:06:42 -0400 Subject: [PATCH] tweak advanced Signed-off-by: Jim Pryor --- miscellaneous_lambda_challenges_and_advanced_topics.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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 Θ. 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 Y′ and Θ′. But even with them, evaluation order still matters: for some (admittedly unusual) evaluation strategies, expressions using them will also be non-terminating. -- 2.11.0