From: jim <jim@web>
Date: Fri, 20 Feb 2015 17:58:55 +0000 (-0500)
Subject: markup
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=18249c1fe8e2c49440f26029b2a8e1416f9a15ed

markup
---

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 `Ψ Ψ <~~> Ψ Ψ (Ψ Ψ)`.
 
-<!-- Proof: YY --> Y(YY) --> YY(Y(YY)); YY(YY) --> YY(Y(YY)) -->
+<!-- Proof: YY ~~> Y(YY) ~~> YY(Y(YY)); YY(YY) ~~> YY(Y(YY)) -->
 
 
 ## Writing recursive functions ##