proposition: Lemma init_value_not_ref: forall f r, init_value (FIELDSIGNATURE.type (FIELD.signature f)) <> Ref r.
proof: Proof. intros. intro. unfold init_value in H. destruct (FIELDSIGNATURE.type (FIELD.signature f)). discriminate H. destruct pt; discriminate H. Qed.
imports: Coq(List) JML(Stack) Coq(ListSet) Coq(Bool) Coq(ZArith) Coq(Relation_Operators) JML(ListHelpers) Coq(Classical)