Lecture notes for csc324, Fall'97
These are copies of the lecture notes. Unless otherwise specified,
all lectures notes are in 4/page postscript.
- Lecture 1. Introduction
- Lecture 2 and 4 last slides from Lecture 1. Started Scheme.
And this is the White Knight's song.
- Lectures 3-6. Scheme. These are the notes used by
prof. Bonner during the week of Sept. 22, and finished on Sept. 29. Note
that you will need an Acrobat Reader to read those.
- Lectures 7-8. Finish memory management and start ML.
- Lecture 9. ML: intro to typechecking, string functions,
expression evaluation, variable bindings. We have covered until slide 26.
- Lecture 10-12. More ML. We have covered until slide 67.
- Lecture 13-14. Parametric and ad-hoc polymorphism,
exception handling, higher-order programming, review. Finish material
from previous lectures: slides 33-36 and 68-80 and slides 81-94.
- Lecture 15. Prolog. Slides 1-24.
- Lectures 16-17. Prolog. Slides 25-64.
- Lecture 18. Going over assignment 2B.
- Lecture 19. Midterm.
- Lecture 20. Finished slides 44-64.
- Lectures 21-23. Prolog. Slides 65-115.
- Lectures 24-26. Topics in Programming Languages.
Marsha Chechik
Last modified on November 20, 1997