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.
If |- c : C, then either c is a value or c --> c' from some c'.
Reduction rules:
o.li --> bi{xi<-o} where o = [l0=(x0 : A0)b0 ... ln=(xn : An)bn] and i is in [0, n]
o.li <= (x : A)b --> o' where
o = [l0=(x0 : A0)b0 ... li=(xi : Ai)bi ... ln=(xn : An)bn] and
o' = [l0=(x0 : A0)b0 ... li=(x : Ai)b ... ln=(xn : An)bn] and
i is in [0, n]
a.l --> a'.l if a --> a'
a.l <= (x : A)b --> a'.l <= (x : A)b if a --> a'
Last update: Tuesday, April 4th, 2000mflatt@cs.utah.edu