Lecture notes for csc324, Fall'98

Copies of the lectures notes will be available here. All lecture notes are in 4/page postscript and PDF.

Lecture 1. [St.George - Postscript].[St.George - PDF] [Erindale - Postscript] [Erindale - PDF].

Lectures 2-3. Scheme. [Postscript]. [PDF].

Lecture 4. Recursive programming in Scheme. [Postscript]. [PDF].

Lectures 5-6. More Scheme. Higher-order programming and proving programs correct. [Postscript]. [PDF].

Lectures 7-8. Catch-up, memory management in Scheme, summary. [Postscript]. [PDF].

Lecture 9. Introduction to ML. [Postscript]. [PDF]

Lecture 10. More ML. Expression evaluation, notion of scoping. [Postscript]. [PDF].

Lectures 11-13. Yet more ML. Programming with datatypes. Pattern-matching. Equtypes. Parametric polymorphism. Higher-order programming. [Postscript]. [PDF].

Lecture 14. Exception handling. ML module system. Review. [Postscript]. [PDF]

Lecture 15. Midterm.

Lecture 16. Finish ML module system

Lecture 17. Start Prolog. [Postscript]. [PDF]

Lecture 18. Unification and resolution in Prolog. [Postscript] [PDF]

Lectures 19-20. Prolog inference engine. Handling arithmetic. [Postscript] [PDF]

Lectures 21-22. Programming in Prolog. [Postscript] [PDF]

Lecture 23. Catchup.

Lectures 24-26. Topics in Programming Languages: grammars, parameter-passing mechanisms, scoping rules. [Postscript] [PDF]

Marsha Chechik

Last modified on November 30, 1998