13:37:09	 From Alexander : Sometimes the compiler gives an error for non-exhaustive patterns, does this not happen all the time if the cases are non-exhaustive?
14:01:21	 From Lavender : Shouldn't we prove concatenation is associative first?
14:52:40	 From Lavender : Does "reverse' xs = foldl (\a x -> x:a) [] xs" have linear complexity?
14:56:29	 From Kåre : Do you have some idea of how the exam will be?
15:01:15	 From Nicholas Boyd Isacsson : See you wednesday!