CS 6520 Homework 19

Exercise 19.1

Prove Proposition 3.2.1-1 (Unique Types) in Abadi and Cardelli.

Exercise 19.2

For a language defined by the type rules in section 3.1 of Abadi and Cardelli plus the small-step reduction rules below, prove the following progress lemma.

Reduction rules:

Last update: Tuesday, April 4th, 2000