University of Virginia, Department of Computer Science
CS655: Programming Languages, Spring 2001

Manifest: Thursday 25 January 2001
Thursday, 1 February (in class) Problem Set 1


Read before 30 January:

Method overloading (e.g s) and n)) is part of the AP CS subset. However, there will be no "trick questions" that test an understanding of the subtleties of the overloading resolution mechanism.

Excerpt from The Java AP CS Subset, point 16.

Students should know how to write and interpret any computable algorithm in Scheme. All questions are trick questions if you don't know the answer.

The entire proposed (but never-to-be-approved) Scheme AP CS Subset.

A final hint: listen carefully to what language users say they really want, until you have an understanding of what they really want. Then find some way of achieving the latter at a small fraction of the cost of the former.

C. A. R. Hoare, Hints on Programming Language Design, 1973.

CS 655 University of Virginia
Department of Computer Science
CS 655: Programming Languages
David Evans