Mike Gordon Twelve lectures beginning on Friday January 19, 1996 Syllabus: Practice. Introduction to ML: basic types, functions, polymorphism, recursion, equality types, structured types, pattern matching, exceptions. datatypes, abstract types, references and iteration. Theory. Introduction to the lambda-calculus: syntax and informal semantics, conversion rules, representation of numbers and data-structures, combinators and combinator-reduction as an implementation technique. Case studies. Lexical analysis, parsing, representing the lambda-calculus, the SECD machine (maybe others, if time permits).