XGitUrl: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=exercises%2Fassignment5.mdwn;h=73889482c1999d37564b214af2e9419da50d9d7f;hp=7bcbbee0a716388961f007d9ee65019a137e5a53;hb=436617710a6cbfdf5a14be46281f20894ae76e50;hpb=eff268fb93d6caecb49638c23d54241f48dabc77
diff git a/exercises/assignment5.mdwn b/exercises/assignment5.mdwn
index 7bcbbee0..73889482 100644
 a/exercises/assignment5.mdwn
+++ b/exercises/assignment5.mdwn
@@ 329,9 +329,7 @@ any type `Î±`, as long as your function is of type `Î± > Î±` and you have a bas
 Or this:
let sysf_true = (\y n > y) :: Sysf_bool a
 Note that in both OCaml and the Haskell code, the generalization `â'a` on the free type variable `'a` is implicit. If you really want to, you can supply it explicitly in Haskell by saying:

 :set XExplicitForAll
+ :set XExplicitForAll
let { sysf_true :: forall a. Sysf_bool a; ... }
 or
let { sysf_true :: forall a. a > a > a; ... }
@@ 408,7 +406,7 @@ Be sure to test your proposals with simple lists. (You'll have to `sysf_cons` up
# k 1 true ;;
 : int = 1
 If you can't understand how one term can have several types, recall our discussion in this week's notes of "principal types". (WHERE?)
+ If you can't understand how one term can have several types, recall our discussion in this week's notes of "principal types".