Manifest: Tuesday 21 March 2000

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

Manifest: Tuesday 21 March 2000

Assignments Due

Today, 5pm Trial Depositions (attorneys and witnesses only)

Thursday, 23 Mar (11:59pm) Project Prelminary Report

Monday, 3 April (11:59pm) Position Paper 4 (Trial Verdicts) - Jurors Only

Tuesday, 11 April (in class) Problem Set 3

Readings

No new readings.

Read before Thursday 23 March (handed out 7 March):

· Alex Aiken and Brian Murphy. Static Type Inference in a Dynamically Typed Language.

The authors present a system for type inference for FL using an operational semantics. Try to see through the complex notation and understand what is really going on, but don't worry if you can't make sense of all the details.

Questions

What is a fixed point?
How to find the fixed point of a function.
How to understand a recursive definition using a generating function.
How to determine if (D, <=) is a partial order.
What is a bottom in a partial order?
What is a least fixed point?
How to find a fixed point of any lambda term.

I never comment on referees and I'm not going to break the habit of a lifetime for that prat.
Ron Atkinson

University of Virginia
CS 655: Programming Languages

cs655-staff@cs.virginia.edu
Last modified: Mon Feb 26 12:48:21 2001

Assignments Due
Today, 5pm	Trial Depositions (attorneys and witnesses only)
Thursday, 23 Mar (11:59pm)	Project Prelminary Report
Monday, 3 April (11:59pm)	Position Paper 4 (Trial Verdicts) - Jurors Only
Tuesday, 11 April (in class)	Problem Set 3

·	Alex Aiken and Brian Murphy. Static Type Inference in a Dynamically Typed Language.
		The authors present a system for type inference for FL using an operational semantics. Try to see through the complex notation and understand what is really going on, but don't worry if you can't make sense of all the details.