CS 3110 Spring 2017 Lecture 25 : Course Review and Final Exam Coverage

Lecture 3: More reduction rules, the notion of Currying and Uncurrying, and typing rules for some of the constructs. A key signature idea of the ML family of languages is introduced, the polymorphic types which in this version of the course are written with both the standard OCaml syntax ‘a, ‘b, ‘c, ... and with Greek letters as in the original articles on ML, e.g. α, β, γ, .... It would be good to know how to curry and uncurry functions.