proposition: Lemma CompilePush {idx} : forall vret vhd vlst fpointer (env: Env ADTValue) ext tenv h (t: list (RealElemType idx)), GLabelMap.find fpointer env = Some (Axiomatic Push) -> Lifted_MapsTo ext tenv vhd (wrap h) -> Lifted_MapsTo ext tenv vlst (wrap t) -> Lifted_not_mapsto_adt ext tenv vret -> vret <> vlst -> vret <> vhd -> vhd <> vlst -> vhd ∉ ext -> vlst ∉ ext -> vret ∉ ext -> {{ tenv }} Call vret fpointer (vlst :: vhd :: nil) {{ [[ `vret ->> Word.wzero 32 as _ ]] :: [[ `vlst ->> h :: t as _ ]] :: DropName vlst (DropName vret (DropName vhd tenv)) }} ∪ {{ ext }} // env.
proof: Proof. repeat (SameValues_Facade_t_step || facade_cleanup_call || LiftPropertyToTelescope_t || injections). facade_eauto. facade_eauto. facade_eauto. repeat apply DropName_remove; congruence. Qed.
imports: CertifiedExtraction.Extraction.QueryStructures.CallRules.Core CertifiedExtraction.Extraction.External.Loops CertifiedExtraction.Extraction.External.FacadeLoops CertifiedExtraction.Extraction.External.Lists