Department of
Computer Science

CS 410/510 Advanced Programming

Lecture Notes

Lecture 1: 6 January 2009

• Introduction to the Course. Slides available in pdf (for on-screen viewing), or in 6-up (for printing).
• An Introduction to Programming in Haskell. Slides available in pdf (for on-screen viewing), or in 6-up (for printing).

Lecture 2: 8 January 2009

• Introduction to Object-Oriented Programming in Smalltalk. Slides available in pdf (for on-screen viewing), or in 6-up (for printing).

Lecture 3: 13 January 2009

• Continuing from previous lecture.
• Smalltalk Collection classes, SUnit. Slides available in pdf (for on-screen viewing), or in 6-up (for printing).

Lecture 4: 15 January 2009

• Continue with Smalltalk Collections
• Haskell: Lists, Tests, and Laws. Slides available in pdf (for on-screen viewing), or in 6-up (for printing).

Lecture 5: 20 January 2009

• Finishing up material on QuickCheck testing

Lecture 6: 22 January 2009

• The Hamming set, test-driven development, and pair programming. (In-class demos and discussion)

Lecture 7: 27 January 2009

• Hamming, Closures, Laziness. Slides available in pdf (for on-screen viewing), or in 6-up (for printing).
• Listy Things in Smalltalk. Slides available in pdf (for on-screen viewing), or in 6-up (for printing).

Lecture 8: 29 January 2009

• Regular Expressions in Haskell. Code available in literate Haskell; not for credit assignment: complete the definition of reAsPred!
• Regular Expressions in Smalltalk. Slides available in pdf (for on-screen viewing), or in 6-up (for printing).

Lecture 9: 3 February 2009

• Continuing Regular Expressions in Haskell. Full code available in literate Haskell, Homework 3 assignment, also in literate Haskell format.

Lecture 10: 5 February 2009

• Finite State Machines in Smalltalk.

Lecture 11: 10 February 2009

• Finite State Machines in Haskell. Full code available in literate Haskell.

Lecture 12: 12 February 2009

• Introduction to Monads in Haskell. (Using code from previous lecture)
• The visitor Pattern (pdf, pdf-6up). Meta-programming techniques in Smalltalk (pdf, pdf-6up).

Lecture 13: 17 February 2009

• Sweet Talk: challenging the tyranny of the dominant decomposition. Slides in 6-up format for printing.

Lecture 14: 19 February 2009

• Folds in Haskell. Slides available in pdf (for on-screen viewing), or in 6-up (for printing).

Lecture 15: 24 February 2009

• ADTs, Monads, Functions as Data, and Parser Combinators. Slides available in pdf (for on-screen viewing), or in 6-up (for printing). Literate Haskell code is also available.

Lecture 16: 26 February 2009

• Parsers in Smalltalk. Slides (part 1 and part 2)

Lecture 17: 3 March 2009

• Notes on building a DFSM. Profiling in Smalltalk. slides

Lecture 18: 5 March 2009

• Profiling in Haskell. Slides available in pdf (for on-screen viewing), or in 6-up (for printing). Literate Haskell code is also available.

Lecture 19: 10 March 2009

• Continuations ... Slides available in pdf (for on-screen viewing), or in 6-up (for printing). Haskell source code is also available.

Lecture 20: 12 March 2009

• Web Applications, Continuations, and Seaside. Squeak by Example Book 2 chapter on Seaside. slides (pdf, keynote)