From 8eb66bfd3d6eec21e1a4d31a244200e80e73e888 Mon Sep 17 00:00:00 2001 From: Chris Barker Date: Sat, 2 Oct 2010 15:39:51 -0400 Subject: [PATCH] edits --- week4.mdwn | 5 +---- 1 file changed, 1 insertion(+), 4 deletions(-) diff --git a/week4.mdwn b/week4.mdwn index aa0fcf74..2fa501c6 100644 --- a/week4.mdwn +++ b/week4.mdwn @@ -1,9 +1,6 @@ [[!toc]] -#These notes return to the topic of fixed point combiantors for one more return to the topic of fixed point combinators# - -#Q: How do you know that every term in the untyped lambda calculus has -a fixed point?# +#Q: How do you know that every term in the untyped lambda calculus has a fixed point?# A: That's easy: let `T` be an arbitrary term in the lambda calculus. If `T` has a fixed point, then there exists some `X` such that `X <~~> -- 2.11.0