University of
Victoria
Computer Science
Programming Languages
CSC 330 2004
George Tzanetakis
| Lecture Notes | ||||
| Number | Title | Slides | ||
| 1 | Introduction & History | Lecture01.pdf | ||
| 2 | First stab at syntax & semantics | Lecture02.pdf | ||
| 3 | Introduction to functional programming | Lecture03.pdf | ||
| 4 | Why SML ? Basic values and operators | Lecture04.sml | ||
| 5 | SML Tuples and Records | Lecture05.sml | ||
| 6 | SML -- Lists | Lecture06.sml | ||
| 7 | Higher Order Functions | Lecture07.sml | ||
| 8 | Logo I | (to be posted) | ||
| 9 | Logo II | (to be posted) | ||
| 10 | SML -- Datatypes | Lecture10.sml | ||
| 11 | SML -- More Datatypes - Finite Trees | Lecture11.sml | ||
| 12 | Foldl, Foldr and some turtle | Lecture12.sml | ||
| 13 | Impcore introduction | Lecture13.imp | ||
| 14 | Operational Semantics | Lecture14.pdf | ||
| 15 | Operational Semantics II | Lecture15.pdf | ||
| 16 | Introduction to Scheme | intro.scm | ||
| 17 | More Scheme | more.scm | ||
| 18 | Louden Chapter 5 | louden5.pdf | ||
| 19 | Scheme Operational Semantics | operational3.pdf | ||
| 20 | Imperative Programming in SML Louden Chapter 7,8 |
sml_imperative.sml louden78.pdf | ||
| 21 | Lazy Evaluation | lazy.pdf | ||
| 22 | Infinite Lists in ML Haskell |
infiniteML.sml learning.hs | ||
| 23 | ML Module System | modules.sml | ||
| 24 | Types |
types.pdf | ||
| 25 | Object-Oriented Programming Intro | objectsHistory.pdf | ||
| 26 | Intro to Smalltalk |
smalltalk.stk | ||
| 27 | Intro to C++ | c++.pdf | ||
| 28 | Constructors and Destructors |
cons_dest.pdf | ||
| 29 | Standard Template Library and Streams | stl_streams.pdf | ||
| 30 | Prolog |
prolog1.pdf | ||
| 31 | Prolog II | prolog2.pdf | ||
| 32 | Simulating paradigms | simulating.pdf | ||