(no commit message)

[lambda.git] / topics / _week5_system_F.mdwn

diff --git a/topics/_week5_system_F.mdwn b/topics/_week5_system_F.mdwn
index b8c6bf3..72d07b3 100644 (file)
--- 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
 
 
 # System F and recursive types
 


@@ -200,8 +200,8 @@ be strongly normalizing, from which it follows that System F is not
 Turing complete.
 
 
 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.
 
 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.