PRINCIPLES OF PROGRAMMING LANGUAGES
	CMSC  631      		FALL 1996
	TR 5:30-6:45		Prof Mark E Woodcock 
	ECS 233B, x2587	        859-6483 (work)
	         woodcock@cs.umbc.edu

September
 3  intro	IMP (syntax) (1 & 2)
10  IMP eval rules; op semantics (2)
17  ML -extended            (see ML Web link)
24  Induction               (3 & 4.4)
October
 1  Induction & Least fixed point
 8  Denotational Semantics (5.1-3)
15  D-Sem      "Lambda CBT Module"
22  representations  Y combinator, recursion
29  MIDTERM
November
 5  normal forms,Church-Rosser  (11th: DROP DAY, fyi)
12  Floyd-Hoare		   (6)
19  Soundess & Completeness (7)	
26 				(28th: TURKEY)  
December  
 3  Lisp & Meta-Ciruclarity
10 				(12th: NO CLASS)

FINAL	 The final will be held as scheduled by the registrar, on Tuesday
December 17, from 6:00 till 8:00 P.M.
All exams will be comprehensive, closed-note, closed calculator and
closed-book. 

PROGRAMS  Programs will be developed for grading on the university
Unix machines (i.e. develop 'em where you like, just make sure they
run here at school so they can be graded).  Programs & homeworks may
be discussed, but the work should be that of the submitter in all
cases.  Late submissions will be discounted 10% per school day.

GRADES Grades will be computed from the following components, using the
following weights:  	
		Midterm       		30
		Homework & Programs	30
		Final			40

The instructor expects this to result in a normal (boring) Bell Curve,
however the instructor reserves the right to construct one, to consider
relative improvement and class participation, to give all A's or flunk
the whole class (where appropriate).

OFFICE HOURS  Immediately (1845-1930) after class.  I will probably be
in my office later than that at least one night per week.

TA   Hua Yuan (yuan@cs.umbc.edu).