X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=exercises%2Fassignment7.mdwn;h=029a7798c182c8c0125848c9f6e70089a4baec77;hp=f26f5d834912a1d846855645033f2514a82f3538;hb=6cd98a3939ea20a9df51a22db32042f7ad2a8218;hpb=7c6b9557ee34b8106123687679fe43092fc48103

diff --git a/exercises/assignment7.mdwn b/exercises/assignment7.mdwn
index f26f5d83..029a7798 100644
--- a/exercises/assignment7.mdwn
+++ b/exercises/assignment7.mdwn
@@ -78,7 +78,7 @@ boxed types.  Here, a "boxed type" is a type function with one unsaturated
 hole (which may have several occurrences, as in `(α,α) tree`). We can think of the box type
 as a function from a type to a type.
 
-Recall that a monad requires a singleton function <code>⇧ (* mid *) : P-> <u>P</u></code>, and a
+Recall that a monad requires a singleton function <code>⇧ (\* mid \*) : P-> <u>P</u></code>, and a
 composition operator like <code>&gt;=&gt; : (P-><u>Q</u>) -> (Q-><u>R</u>) -> (P-><u>R</u>)</code>.
 
 As we said in the notes, we'll move freely back and forth between using `>=>` and using `<=<` (aka `mcomp`), which