projects
/
lambda.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
(from parent 1:
dc05050
)
merge
author
Chris
<chris.barker@nyu.edu>
Tue, 24 Feb 2015 22:25:52 +0000
(17:25 -0500)
committer
Chris
<chris.barker@nyu.edu>
Tue, 24 Feb 2015 22:25:52 +0000
(17:25 -0500)
topics/_week5_system_F.mdwn
patch
|
blob
|
history
diff --git
a/topics/_week5_system_F.mdwn
b/topics/_week5_system_F.mdwn
index
d7a2cf1
..
72d07b3
100644
(file)
--- 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>σ
@@
-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.