X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;ds=sidebyside;f=src%2FHaskProofToStrong.v;h=6ba094e9fe98e7e3c373a86d1cf281b18e0ca532;hb=b83e779e742413ca84df565263dafbdf9f79920a;hp=3aee2197d4534b90b053b68160dbd3338141b16a;hpb=1cfe65d4e2d3292cc038882d8518dd7a48e2c40a;p=coq-hetmet.git diff --git a/src/HaskProofToStrong.v b/src/HaskProofToStrong.v index 3aee219..6ba094e 100644 --- a/src/HaskProofToStrong.v +++ b/src/HaskProofToStrong.v @@ -239,6 +239,7 @@ Section HaskProofToStrong. with | RLeft h c ctx r => let case_RLeft := tt in (fun e => _) (urule2expr _ _ _ r) | RRight h c ctx r => let case_RRight := tt in (fun e => _) (urule2expr _ _ _ r) + | RId a => let case_RId := tt in _ | RCanL a => let case_RCanL := tt in _ | RCanR a => let case_RCanR := tt in _ | RuCanL a => let case_RuCanL := tt in _ @@ -251,6 +252,9 @@ Section HaskProofToStrong. | RComp a b c f g => let case_RComp := tt in (fun e1 e2 => _) (urule2expr _ _ _ f) (urule2expr _ _ _ g) end); clear urule2expr; intros. + destruct case_RId. + apply X. + destruct case_RCanL. simpl; unfold ujudg2exprType; intros. simpl in X. @@ -520,8 +524,9 @@ Section HaskProofToStrong. | RAbsCo Γ Δ Σ κ σ σ₁ σ₂ y => let case_RAbsCo := tt in _ | RApp Γ Δ Σ₁ Σ₂ tx te p => let case_RApp := tt in _ | RLet Γ Δ Σ₁ Σ₂ σ₁ σ₂ p => let case_RLet := tt in _ - | RJoin Γ p lri m x q => let case_RJoin := tt in _ - | RVoid _ _ => let case_RVoid := tt in _ + | RWhere Γ Δ Σ₁ Σ₂ Σ₃ σ₁ σ₂ p => let case_RWhere := tt in _ + | RJoin Γ p lri m x q => let case_RJoin := tt in _ + | RVoid _ _ => let case_RVoid := tt in _ | RBrak Σ a b c n m => let case_RBrak := tt in _ | REsc Σ a b c n m => let case_REsc := tt in _ | RCase Γ Δ lev tc Σ avars tbranches alts => let case_RCase := tt in _ @@ -569,7 +574,6 @@ Section HaskProofToStrong. destruct case_RGlobal. apply ILeaf; simpl; intros; refine (return ILeaf _ _). apply EGlobal. - apply wev. destruct case_RLam. apply ILeaf. @@ -639,36 +643,78 @@ Section HaskProofToStrong. apply ILeaf. simpl in *; intros. destruct vars; try destruct o; inversion H. - refine (fresh_lemma _ ξ vars1 _ σ₂ p H1 >>>= (fun pf => _)). + + refine (fresh_lemma _ ξ _ _ σ₁ p H2 >>>= (fun pf => _)). apply FreshMon. + destruct pf as [ vnew [ pf1 pf2 ]]. - set (update_ξ ξ p (((vnew, σ₂ )) :: nil)) as ξ' in *. + set (update_ξ ξ p (((vnew, σ₁ )) :: nil)) as ξ' in *. inversion X_. apply ileaf in X. apply ileaf in X0. simpl in *. - refine (X ξ vars2 _ >>>= fun X0' => _). + + refine (X ξ vars1 _ >>>= fun X0' => _). apply FreshMon. + simpl. auto. - refine (X0 ξ' (vars1,,[vnew]) _ >>>= fun X1' => _). + refine (X0 ξ' ([vnew],,vars2) _ >>>= fun X1' => _). apply FreshMon. - rewrite H1. simpl. rewrite pf2. rewrite pf1. - rewrite H1. reflexivity. + apply FreshMon. - refine (return _). apply ILeaf. - apply ileaf in X0'. apply ileaf in X1'. + apply ileaf in X0'. simpl in *. - apply ELet with (ev:=vnew)(tv:=σ₂). + apply ELet with (ev:=vnew)(tv:=σ₁). apply X0'. apply X1'. + destruct case_RWhere. + apply ILeaf. + simpl in *; intros. + destruct vars; try destruct o; inversion H. + destruct vars2; try destruct o; inversion H2. + clear H2. + + assert ((Σ₁,,Σ₃) = mapOptionTree ξ (vars1,,vars2_2)) as H13; simpl; subst; auto. + refine (fresh_lemma _ ξ _ _ σ₁ p H13 >>>= (fun pf => _)). + apply FreshMon. + + destruct pf as [ vnew [ pf1 pf2 ]]. + set (update_ξ ξ p (((vnew, σ₁ )) :: nil)) as ξ' in *. + inversion X_. + apply ileaf in X. + apply ileaf in X0. + simpl in *. + + refine (X ξ' (vars1,,([vnew],,vars2_2)) _ >>>= fun X0' => _). + apply FreshMon. + simpl. + inversion pf1. + rewrite H3. + rewrite H4. + rewrite pf2. + reflexivity. + + refine (X0 ξ vars2_1 _ >>>= fun X1' => _). + apply FreshMon. + reflexivity. + apply FreshMon. + + apply ILeaf. + apply ileaf in X0'. + apply ileaf in X1'. + simpl in *. + apply ELet with (ev:=vnew)(tv:=σ₁). + apply X1'. + apply X0'. + destruct case_RVoid. apply ILeaf; simpl; intros. refine (return _). @@ -717,11 +763,11 @@ Section HaskProofToStrong. apply (@ELetRec _ _ _ _ _ _ _ varstypes). auto. apply (@letrec_helper Γ Δ t varstypes). - rewrite <- pf2 in X1. + rewrite <- pf2 in X0. rewrite mapOptionTree_compose. - apply X1. - apply ileaf in X0. apply X0. + apply ileaf in X1. + apply X1. destruct case_RCase. apply ILeaf; simpl; intros.