From ff25a9d147e987d8529b371ac71984d0e85216ef Mon Sep 17 00:00:00 2001
From: chris <chris@web>
Date: Tue, 24 Feb 2015 16:45:46 -0500
Subject: [PATCH 1/1]

---
 topics/_week5_system_F.mdwn | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/topics/_week5_system_F.mdwn b/topics/_week5_system_F.mdwn
index 150794e5..72d07b31 100644
--- a/topics/_week5_system_F.mdwn
+++ b/topics/_week5_system_F.mdwn
@@ -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.
-- 
2.11.0