From: Chris <chris.barker@nyu.edu>
Date: Tue, 24 Feb 2015 22:25:52 +0000 (-0500)
Subject: merge
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=c55a7320fe75884e8fda7f7785b68194ac9554b5;hp=dc050505ac301a699d841e6dd6fe0173a2c6b6fc

merge
---

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.