From 18249c1fe8e2c49440f26029b2a8e1416f9a15ed Mon Sep 17 00:00:00 2001 From: jim Date: Fri, 20 Feb 2015 12:58:55 -0500 Subject: [PATCH] markup --- exercises/_assignment4.mdwn | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/exercises/_assignment4.mdwn b/exercises/_assignment4.mdwn index 7c01388b..589932e2 100644 --- a/exercises/_assignment4.mdwn +++ b/exercises/_assignment4.mdwn @@ -18,7 +18,7 @@ points.) 4. Assume that `Ψ` is some fixed point combinator; we're not telling you which one. (You can just write `Psi` in your homework if you don't know how to generate the symbol `Ψ`.) Prove that `Ψ Ψ` is a fixed point of itself, that is, that `Ψ Ψ <~~> Ψ Ψ (Ψ Ψ)`. - Y(YY) --> YY(Y(YY)); YY(YY) --> YY(Y(YY)) --> + ## Writing recursive functions ## -- 2.11.0