summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--lec04/notes.md2
-rw-r--r--lec05/notes.md2
2 files changed, 2 insertions, 2 deletions
diff --git a/lec04/notes.md b/lec04/notes.md
index 3448a8c..df4b4e4 100644
--- a/lec04/notes.md
+++ b/lec04/notes.md
@@ -1,4 +1,4 @@
-# Higher-order programming and type inference
+# Lecture 4: Higher-order programming and type inference
## Anonymous functions
diff --git a/lec05/notes.md b/lec05/notes.md
index 700fa23..94287f7 100644
--- a/lec05/notes.md
+++ b/lec05/notes.md
@@ -1,4 +1,4 @@
-# More Polymorphism and type classes
+# Lecture 5: More Polymorphism and type classes
Haskell's polymorphism, which we've seen in previous lectures, is known as *parametric polymorphism* and requires that polymorphic functions must work uniformly for any input type. This requirement has interesting implications.