Lecture plan

Note: All students are expected to start reading the textbook and slides before the lectures.

At the beginning of a lecture, you should have identified an issue which you do not understand, and formulated a question about it.

Slides for lectures 3 and 4 are preliminary and may be changed.

Note that the slides come in two formats:

You read the slides with Adobe Acrobat Reader.

Lecture 1

13-17, 27 October 2006.

Hansen: 1-3
Paulson: 1, 2.1-2.19, 2.23
Ullman: 1-3, 5-9

Introduction (updated 061026)

pdf, 4pdf,

SML

pdf, 4pdf, programs.

Lecture 2

13-17, 10 November 2006

Hansen: 5
Paulson: 2.14-2.16, 3
Ullman: 4, 5, 10

Programming with recursion

pdf, 4pdf, programs.

Lists

pdf, 4pdf, programs.

Lecture 3:

13-17, 17 November 2006

Hansen: 4, 7
Paulson: 3, 4.1-4.4, 4.10-4.13
Ullman: 12, 13

Type declarations

pdf, 4pdf, programs.

Abstract datatypes

pdf, 4pdf, programs.

Lecture 4:

13-17, 1 December 2006

Hansen: 9, 11
Paulson: 5.1-5.11, 7
Ullman: 11, 15

Sorting in a functional language

pdf, 4pdf, programs.

Higher-order functions

pdf, 4pdf, programs.

Example: Representing infinite sequences using higher-order functions

Harper, chapter 30 programs

Lecture 5

13-17, 8 December 2006

Continuations to implement lazy sequences

Text file.

Modules

pdf, 4pdf, programs.

Continuations

Harper, chapter 29 programs

Success continuations (text file)


Last modified: Fri Dec 8 17:01:57 MET 2006