COMP 302 Lecture Notes - Lecture 19: Type Inference, Type System, Empty Set
20 Feb 2017
School
Department
Course
Professor
Document Summary
Contents (3 questions): higher-order function, answer is like 3 lines long. It has some recursion: recursive function on lists. One double sided sheet of notes -- can be written however small we want but no magnifying glass. To prepare, look at the solutions for assignments 1 and 2. We learned about type variables and type inference. We learnt how to figure out the types of variable with unannotated code. To goal was to make the most general guess consistent with the constraints. The same flexibility in the type system that allows you to have polymorphism is the same thing that lets you do type inference. We did the map example, though it was kind of confusing, as he wrote it like this: map = fun f -> fun l -> As we are more used to seeing stuff like this: map f l = The latter one is just training wheels" for those not used to seeing functions.
