X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=topics%2F_week5_system_F.mdwn;h=72d07b318daec8fd4905bcc117bf32b963f14aec;hp=b8c6bf3da6d93c05a1e16ea6ef7ec94528ea3f60;hb=ff25a9d147e987d8529b371ac71984d0e85216ef;hpb=ecea9a7ecaae77c1da240a683caca592b909e32c

diff --git a/topics/_week5_system_F.mdwn b/topics/_week5_system_F.mdwn
index b8c6bf3d..72d07b31 100644
--- a/topics/_week5_system_F.mdwn
+++ b/topics/_week5_system_F.mdwn
@@ -1,4 +1,4 @@
-[[!toc]]
+[[!toc levels=2]]
 
 # System F and recursive types
 
@@ -200,8 +200,8 @@ be strongly normalizing, from which it follows that System F is not
 Turing complete.
 
 
-Types in OCaml
---------------
+#Types in OCaml
+
 
 OCaml has type inference: the system can often infer what the type of
 an expression must be, based on the type of other known expressions.