CS 6520 Homework 22
, suppose we replace the [
] rule in the operational semantics (Figure 8) with the following rule, which more closely approximates Java:
P |- < E[view t null], S > -> < E[null], S >
The language is still sound.
Explain how the proofs in Appendix A must be changed to prove soundness for the revised language. (Lemmas 5 and 6 each need to be changed in one place.)
Last update: Wednesday, April 12th, 2000