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

diff --git a/topics/_week5_system_F.mdwn b/topics/_week5_system_F.mdwn
index d7a2cf12..72d07b31 100644
--- a/topics/_week5_system_F.mdwn
+++ b/topics/_week5_system_F.mdwn
@@ -1,3 +1,5 @@
+[[!toc levels=2]]
+
 # System F and recursive types
 
 In the simply-typed lambda calculus, we write types like <code>&sigma;
@@ -198,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.