On the first day we distributed the syllabus and discussed several programming paradigms with demonstrations of using ml and prolog on paprika.umw.edu. All of this is available through links on the web page for January 12, 2002 on the accessible from the CPSC 401 home page.

We won’t have class on Thursday, January 14, 2010. I will be a Higher Education Advocacy Day in Richmond, VA.

For next Tuesday, read Chapters 1 through 4 of the text. You’ll find that the material in Chapters 2 and 3 is very similar to the concepts we discussed in CPSC 336 regarding grammars, syntax, and semantics. Turn in solutions to the following exercises. Send them to Ackermann by email.

- Page 24. Exercise 1. h,i,j,k
- Page 25. Exercise 2 corresponding to h,i,j,k of Exercise 1
- Page 25. Exercise 3 corresponding to h,i,j,k of Exercise 1
- Page 39 and 40. Exercise 1
- Page 40. Exercise 3
- page 40. Exercise 4.

Finally, please read Chapter 4 for class on Tuesday so that you are prepared to discuss IDEs for two different languages, the terms:

- virtual machine
- delayed linking
- profiling
- dynamic compilation,

and so that we can go over answers to exercises 2 and 3 of Chapter 4.

As always, send me you comments and questions.

The effective exploitation of his powers of abstraction must be regarded as one of the most vital activities of a competent programmer.

- Edsger W. Dijkstra,
*The Humble Programmer*, 1972 Turing Award Lecture,*Communications of the ACM***15**(10), (October 1972): pp. 859–866