proposition: Lemma fold_harray: forall L arr, data_at Tsh (tarray t_item (Zlength L)) (map heap_item_rep L) arr = harray L arr.
proof: Proof. reflexivity. Qed.
imports: VST.floyd.proofauto CertiGraph.binheap.binary_heap CertiGraph.binheap.binary_heap_model CertiGraph.binheap.binary_heap_Zmodel RelationClasses