Foundations of Computer Science
2009–10

Principal lecturer: Prof Larry Paulson
Taken by: Part IA CST, Part IA NST, Part I PPS
Syllabus
Past exam questions
Information for supervisors (Solution notes for past exam questions) (contact lecturer for access permission)

Course notes

Exercises for practical questions 1–5 and 6

Sample ML programs

• introductory examples
• list examples
• sorting
• examples of datatypes
• dictionaries
• queues and search strategies
• functions as values
• polynomials
• lazy lists
• procedural programming

Useful reference material

• Obtaining and using ML on your own computer
• Full syntax of Standard ML
• predefined identifiers: the most important built-in types, functions, exceptions, etc.