proposition: Lemma refine_For_rev {ResultT} (bod : Comp (list ResultT)) : refine (Query_For bod) (res <- Query_For bod; ret (rev res)).
proof: Proof. unfold Query_For; intros v Comp_v; computes_to_inv. subst; computes_to_econstructor; eauto. computes_to_econstructor. setoid_rewrite Comp_v'0. apply Permutation_rev. Qed.
imports: Coq.Arith.Arith Coq.ZArith.ZArith Coq.NArith.NArith Coq.ZArith.ZArith Coq.Strings.String Coq.Lists.List Coq.Sorting.Permutation Coq.Bool.Bool Coq.Sets.Ensembles Coq.Logic.FunctionalExtensionality Fiat.ADTNotation Fiat.Common Fiat.Common.ilist2 Fiat.Common.List.ListFacts Fiat.Common.Ensembles.IndexedEnsembles Fiat.Common.DecideableEnsembles Fiat.Computation Fiat.ADTRefinement.BuildADTRefinements Fiat.QueryStructure.Specification.Representation.QueryStructureSchema Fiat.QueryStructure.Specification.Operations.FlattenCompList Fiat.QueryStructure.Specification.Operations.Query Fiat.QueryStructure.Specification.Representation.QueryStructure