Torbjörn Lager, 2001
This course presents a smorgasbord of computationally relevant mathematical tools for linguists: set theory, logic, lambda calculus, regular expressions, grammars, finitestate machines, etc. The course is given in parallel with an introductory course in programming, for which it also provides examples.
Mathematical Methods in Linguistics

Programming

sets, relations, functions

programming with lists 
logic

programming in logic

regular expressions 
programming in logic

lambda calculus and compositional semantics

higherorder functional programming

feature structures

programming with records

This is the first assignment for this course, due 12/11 2001. It consists of three pages, and is available in three formats: *.prn,*.doc and a zipped version of the *.doc document.
assignment1.prn
assignment1.doc
assignment1.zip
Good luck!
This is the second assignment for this course, due 26/11 2001. It consists of two pages, and is available in three formats: *.prn,*.doc and a zipped version of the *.doc document.
assignment2.prn
assignment2.doc
assignment2.zip
Good luck!