X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=matita%2Fmatita%2Flib%2Fturing%2Fmulti_universal%2Fmatch.ma;h=9cd11f61007dce904310557b583ee95ba990e41c;hb=d6b8021e8c83eb19033cad0aeaeebf95b327e78a;hp=38dba8d729e416420c4ed6450884a7448e4689a1;hpb=30f12b94fb7f9f201fb092a1b25a1c7e2f9b4564;p=helm.git diff --git a/matita/matita/lib/turing/multi_universal/match.ma b/matita/matita/lib/turing/multi_universal/match.ma index 38dba8d72..9cd11f610 100644 --- a/matita/matita/lib/turing/multi_universal/match.ma +++ b/matita/matita/lib/turing/multi_universal/match.ma @@ -12,107 +12,13 @@ (* *) (**************************************************************************) -include "turing/multi_universal/compare.ma". -include "turing/multi_universal/par_test.ma". -include "turing/multi_universal/moves_2.ma". +include "turing/auxiliary_multi_machines.ma". -definition Rtc_multi_true ≝ - λalpha,test,n,i.λt1,t2:Vector ? (S n). - (∃c. current alpha (nth i ? t1 (niltape ?)) = Some ? c ∧ test c = true) ∧ t2 = t1. - -definition Rtc_multi_false ≝ - λalpha,test,n,i.λt1,t2:Vector ? (S n). - (∀c. current alpha (nth i ? t1 (niltape ?)) = Some ? c → test c = false) ∧ t2 = t1. - -lemma sem_test_char_multi : - ∀alpha,test,n,i.i ≤ n → - inject_TM ? (test_char ? test) n i ⊨ - [ tc_true : Rtc_multi_true alpha test n i, Rtc_multi_false alpha test n i ]. -#alpha #test #n #i #Hin #int -cases (acc_sem_inject … Hin (sem_test_char alpha test) int) -#k * #outc * * #Hloop #Htrue #Hfalse %{k} %{outc} % [ % -[ @Hloop -| #Hqtrue lapply (Htrue Hqtrue) * * * #c * - #Hcur #Htestc #Hnth_i #Hnth_j % - [ %{c} % // - | @(eq_vec … (niltape ?)) #i0 #Hi0 - cases (decidable_eq_nat i0 i) #Hi0i - [ >Hi0i @Hnth_i - | @sym_eq @Hnth_j @sym_not_eq // ] ] ] -| #Hqfalse lapply (Hfalse Hqfalse) * * #Htestc #Hnth_i #Hnth_j % - [ @Htestc - | @(eq_vec … (niltape ?)) #i0 #Hi0 - cases (decidable_eq_nat i0 i) #Hi0i - [ >Hi0i @Hnth_i - | @sym_eq @Hnth_j @sym_not_eq // ] ] ] -qed. - -definition Rm_test_null_true ≝ - λalpha,n,i.λt1,t2:Vector ? (S n). - current alpha (nth i ? t1 (niltape ?)) ≠ None ? ∧ t2 = t1. - -definition Rm_test_null_false ≝ - λalpha,n,i.λt1,t2:Vector ? (S n). - current alpha (nth i ? t1 (niltape ?)) = None ? ∧ t2 = t1. - -lemma sem_test_null_multi : ∀alpha,n,i.i ≤ n → - inject_TM ? (test_null ?) n i ⊨ - [ tc_true : Rm_test_null_true alpha n i, Rm_test_null_false alpha n i ]. -#alpha #n #i #Hin #int -cases (acc_sem_inject … Hin (sem_test_null alpha) int) -#k * #outc * * #Hloop #Htrue #Hfalse %{k} %{outc} % [ % -[ @Hloop -| #Hqtrue lapply (Htrue Hqtrue) * * #Hcur #Hnth_i #Hnth_j % // - @(eq_vec … (niltape ?)) #i0 #Hi0 cases (decidable_eq_nat i0 i) #Hi0i - [ >Hi0i @sym_eq @Hnth_i | @sym_eq @Hnth_j @sym_not_eq // ] ] -| #Hqfalse lapply (Hfalse Hqfalse) * * #Hcur #Hnth_i #Hnth_j % - [ @Hcur - | @(eq_vec … (niltape ?)) #i0 #Hi0 cases (decidable_eq_nat i0 i) // - #Hi0i @sym_eq @Hnth_j @sym_not_eq // ] ] -qed. - -definition match_test ≝ λsrc,dst.λsig:DeqSet.λn.λv:Vector ? n. - match (nth src (option sig) v (None ?)) with - [ None ⇒ false - | Some x ⇒ notb (nth dst (DeqOption sig) v (None ?) == None ?) ]. - -definition mmove_states ≝ initN 2. - -definition mmove0 : mmove_states ≝ mk_Sig ?? 0 (leb_true_to_le 1 2 (refl …)). -definition mmove1 : mmove_states ≝ mk_Sig ?? 1 (leb_true_to_le 2 2 (refl …)). - -definition trans_mmove ≝ - λi,sig,n,D. - λp:mmove_states × (Vector (option sig) (S n)). - let 〈q,a〉 ≝ p in match (pi1 … q) with - [ O ⇒ 〈mmove1,change_vec ? (S n) (null_action ? n) (〈None ?,D〉) i〉 - | S _ ⇒ 〈mmove1,null_action sig n〉 ]. - -definition mmove ≝ - λi,sig,n,D. - mk_mTM sig n mmove_states (trans_mmove i sig n D) - mmove0 (λq.q == mmove1). - -definition Rm_multi ≝ - λalpha,n,i,D.λt1,t2:Vector ? (S n). - t2 = change_vec ? (S n) t1 (tape_move alpha (nth i ? t1 (niltape ?)) D) i. - -lemma sem_move_multi : - ∀alpha,n,i,D.i ≤ n → - mmove i alpha n D ⊨ Rm_multi alpha n i D. -#alpha #n #i #D #Hin #int %{2} -%{(mk_mconfig ? mmove_states n mmove1 ?)} -[| % - [ whd in ⊢ (??%?); @eq_f whd in ⊢ (??%?); @eq_f % - | whd >tape_move_multi_def - <(change_vec_same … (ctapes …) i (niltape ?)) - >pmap_change tape_move_null_action % ] ] - qed. - +(* rewind *) definition rewind ≝ λsrc,dst,sig,n. parmove src dst sig n L · mmove src sig n R · mmove dst sig n R. -definition R_rewind ≝ λsrc,dst,sig,n.λint,outt: Vector (tape sig) (S n). +definition R_rewind_strong ≝ λsrc,dst,sig,n.λint,outt: Vector (tape sig) (S n). (∀x,x0,xs,rs. nth src ? int (niltape ?) = midtape sig (xs@[x0]) x rs → ∀ls0,y,y0,target,rs0.|xs| = |target| → @@ -120,30 +26,42 @@ definition R_rewind ≝ λsrc,dst,sig,n.λint,outt: Vector (tape sig) (S n). outt = change_vec ?? (change_vec ?? int (midtape sig [] x0 (reverse ? xs@x::rs)) src) (midtape sig ls0 y0 (reverse ? target@y::rs0)) dst) ∧ + (∀x,x0,xs,rs. + nth dst ? int (niltape ?) = midtape sig (xs@[x0]) x rs → + ∀ls0,y,y0,target,rs0.|xs| = |target| → + nth src ? int (niltape ?) = midtape sig (target@y0::ls0) y rs0 → + outt = change_vec ?? + (change_vec ?? int (midtape sig [] x0 (reverse ? xs@x::rs)) dst) + (midtape sig ls0 y0 (reverse ? target@y::rs0)) src) ∧ (∀x,rs.nth src ? int (niltape ?) = midtape sig [] x rs → ∀ls0,y,rs0.nth dst ? int (niltape ?) = midtape sig ls0 y rs0 → + outt = int) ∧ + (∀x,rs.nth dst ? int (niltape ?) = midtape sig [] x rs → + ∀ls0,y,rs0.nth src ? int (niltape ?) = midtape sig ls0 y rs0 → outt = int). -theorem accRealize_to_Realize : - ∀sig,n.∀M:mTM sig n.∀Rtrue,Rfalse,acc. - M ⊨ [ acc: Rtrue, Rfalse ] → M ⊨ Rtrue ∪ Rfalse. -#sig #n #M #Rtrue #Rfalse #acc #HR #t -cases (HR t) #k * #outc * * #Hloop -#Htrue #Hfalse %{k} %{outc} % // -cases (true_or_false (cstate sig (states sig n M) n outc == acc)) #Hcase -[ % @Htrue @(\P Hcase) | %2 @Hfalse @(\Pf Hcase) ] -qed. +definition R_rewind ≝ λsrc,dst,sig,n.λint,outt: Vector (tape sig) (S n). + (∀x,x0,xs,rs. + nth src ? int (niltape ?) = midtape sig (xs@[x0]) x rs → + ∀ls0,y,y0,target,rs0.|xs| = |target| → + nth dst ? int (niltape ?) = midtape sig (target@y0::ls0) y rs0 → + outt = change_vec ?? + (change_vec ?? int (midtape sig [] x0 (reverse ? xs@x::rs)) src) + (midtape sig ls0 y0 (reverse ? target@y::rs0)) dst) ∧ + (∀x,rs.nth src ? int (niltape ?) = midtape sig [] x rs → + ∀ls0,y,rs0.nth dst ? int (niltape ?) = midtape sig ls0 y rs0 → + outt = int). -lemma sem_rewind : ∀src,dst,sig,n. +lemma sem_rewind_strong : ∀src,dst,sig,n. src ≠ dst → src < S n → dst < S n → - rewind src dst sig n ⊨ R_rewind src dst sig n. + rewind src dst sig n ⊨ R_rewind_strong src dst sig n. #src #dst #sig #n #Hneq #Hsrc #Hdst @(sem_seq_app sig n ????? (sem_parmoveL src dst sig n Hneq Hsrc Hdst) ?) [| @(sem_seq_app sig n ????? (sem_move_multi … R ?) (sem_move_multi … R ?)) // @le_S_S_to_le // ] -#ta #tb * #tc * * #Htc #_ * #td * whd in ⊢ (%→%→?); #Htd #Htb % +#ta #tb * #tc * * * #Htc1 #Htc2 #_ * #td * whd in ⊢ (%→%→?); #Htd #Htb % [ % [ % [ #x #x0 #xs #rs #Hmidta_src #ls0 #y #y0 #target #rs0 #Hlen #Hmidta_dst - >(Htc ??? Hmidta_src ls0 y (target@[y0]) rs0 ??) in Htd; + >(Htc1 ??? Hmidta_src ls0 y (target@[y0]) rs0 ??) in Htd; [|>Hmidta_dst // |>length_append >length_append >Hlen % ] >change_vec_commute [|@sym_not_eq //] @@ -154,8 +72,20 @@ lemma sem_rewind : ∀src,dst,sig,n. >rev_append_def >append_nil #Htd >Htd in Htb; >change_vec_change_vec >nth_change_vec // cases ls0 [|#l1 #ls1] normalize in match (tape_move ???); // +| #x #x0 #xs #rs #Hmidta_dst #ls0 #y #y0 #target #rs0 #Hlen #Hmidta_src + >(Htc2 ??? Hmidta_dst ls0 y (target@[y0]) rs0 ??) in Htd; + [|>Hmidta_src // + |>length_append >length_append >Hlen % ] + >change_vec_change_vec + >change_vec_commute [|@sym_not_eq //] + >nth_change_vec // + >reverse_append >reverse_single + >reverse_append >reverse_single + cases ls0 [|#l1 #ls1] normalize in match (tape_move ???); + #Htd >Htd in Htb; >change_vec_change_vec >nth_change_vec // + >rev_append_def >change_vec_commute // normalize in match (tape_move ???); // ] | #x #rs #Hmidta_src #ls0 #y #rs0 #Hmidta_dst - lapply (Htc … Hmidta_src … (refl ??) Hmidta_dst) -Htc #Htc >Htc in Htd; + lapply (Htc1 … Hmidta_src … (refl ??) Hmidta_dst) -Htc1 #Htc >Htc in Htd; >change_vec_commute [|@sym_not_eq //] >change_vec_change_vec >nth_change_vec_neq [|@sym_not_eq //] >nth_change_vec // lapply (refl ? ls0) cases ls0 in ⊢ (???%→%); @@ -167,14 +97,42 @@ lemma sem_rewind : ∀src,dst,sig,n. >nth_change_vec // >change_vec_change_vec whd in match (tape_move ???);whd in match (tape_move ???); change_vec_same >change_vec_same // -]] + ] ] +| #x #rs #Hmidta_dst #ls0 #y #rs0 #Hmidta_src + lapply (Htc2 … Hmidta_dst … (refl ??) Hmidta_src) -Htc2 #Htc >Htc in Htd; + >change_vec_change_vec >change_vec_commute [|@sym_not_eq //] + >nth_change_vec // lapply (refl ? ls0) cases ls0 in ⊢ (???%→%); + [ #Hls0 destruct (Hls0) #Htd >Htd in Htb; + >nth_change_vec // >change_vec_change_vec + whd in match (tape_move ???);whd in match (tape_move ???); + change_vec_same >change_vec_same // + | #l1 #ls1 #Hls0 destruct (Hls0) #Htd >Htd in Htb; + >nth_change_vec // >change_vec_change_vec + whd in match (tape_move ???); whd in match (tape_move ???); change_vec_same >change_vec_same // + ] +] qed. +lemma sem_rewind : ∀src,dst,sig,n. + src ≠ dst → src < S n → dst < S n → + rewind src dst sig n ⊨ R_rewind src dst sig n. +#src #dst #sig #n #Hneq #Hsrc #Hdst @(Realize_to_Realize … (sem_rewind_strong …)) // +#ta #tb * * * #H1 #H2 #H3 #H4 % /2 by / +qed. + +(* match step *) + +definition match_test ≝ λsrc,dst.λsig:DeqSet.λn.λv:Vector ? n. + match (nth src (option sig) v (None ?)) with + [ None ⇒ false + | Some x ⇒ notb (nth dst (DeqOption sig) v (None ?) == None ?) ]. + definition match_step ≝ λsrc,dst,sig,n. compare src dst sig n · (ifTM ?? (partest sig n (match_test src dst sig ?)) (single_finalTM ?? - (rewind src dst sig n · (inject_TM ? (move_r ?) n dst))) + (rewind src dst sig n · mmove dst ?? R)) (nop …) partest1). @@ -190,7 +148,9 @@ definition R_match_step_false ≝ ((current sig (nth dst (tape sig) int (niltape sig)) = None ?) ∧ outt = int) ∨ (∃ls0,rs0,xs0. nth dst ? int (niltape ?) = midtape sig ls0 x rs0 ∧ xs = rs0@xs0 ∧ - current sig (nth dst (tape sig) outt (niltape sig)) = None ?) ∨ + outt = change_vec ?? + (change_vec ?? int (mk_tape sig (reverse ? rs0@x::ls) (option_hd ? xs0) (tail ? xs0)) src) + (mk_tape ? (reverse ? rs0@x::ls0) (None ?) [ ]) dst) ∨ (∃ls0,rs0. nth dst ? int (niltape ?) = midtape sig ls0 x (xs@rs0) ∧ (* ∀rsj,c. @@ -215,14 +175,13 @@ definition R_match_step_true ≝ ∀s,rs.nth src ? int (niltape ?) = midtape ? [ ] s rs → outt = change_vec ?? int (tape_move_mono … (nth dst ? int (niltape ?)) (〈None ?,R〉)) dst ∧ - (current sig (nth dst (tape sig) int (niltape sig)) = Some ? s → + (∃s0.current sig (nth dst (tape sig) int (niltape sig)) = Some ? s0 ∧ + (s0 = s → ∃xs,ci,rs',ls0,cj,rs0. rs = xs@ci::rs' ∧ nth dst ? int (niltape ?) = midtape sig ls0 s (xs@cj::rs0) ∧ - ci ≠ cj). + ci ≠ cj)). -axiom daemon : ∀X:Prop.X. - lemma sem_match_step : ∀src,dst,sig,n.src ≠ dst → src < S n → dst < S n → match_step src dst sig n ⊨ @@ -234,21 +193,18 @@ lemma sem_match_step : (acc_sem_if ? n … (sem_partest sig n (match_test src dst sig ?)) (sem_seq … (sem_rewind ???? Hneq Hsrc Hdst) - (sem_inject … dst (le_S_S_to_le … Hdst) (sem_move_r ? ))) - (sem_nop …))) + (sem_move_multi … R ?)) + (sem_nop …))) /2/ [ #ta #tb #tc * lapply (refl ? (current ? (nth src ? ta (niltape ?)))) cases (current ? (nth src ? ta (niltape ?))) in ⊢ (???%→%); [ #Hcurta_src #Hcomp #_ * #td * >Hcomp [| % %2 %] - whd in ⊢ (%→?); * whd in ⊢ (??%?→?); - >(?:nth src ? (current_chars ?? ta) (None ?) = None ?) - [ normalize in ⊢ (%→?); #H destruct (H) - | @daemon ] + whd in ⊢ (%→?); * whd in ⊢ (??%?→?); + >nth_current_chars >Hcurta_src normalize in ⊢ (%→?); #H destruct (H) | #s #Hs lapply (refl ? (current ? (nth dst ? ta (niltape ?)))) cases (current ? (nth dst ? ta (niltape ?))) in ⊢ (???%→%); [ #Hcurta_dst #Hcomp #_ * #td * >Hcomp [| %2 %] - whd in ⊢ (%→?); * whd in ⊢ (??%?→?); - >(?:nth src ? (current_chars ?? ta) (None ?) = Some ? s) [|@daemon] - >(?:nth dst ? (current_chars ?? ta) (None ?) = None ?) [|@daemon] + whd in ⊢ (%→?); * whd in ⊢ (??%?→?); + >nth_current_chars >nth_current_chars >Hs >Hcurta_dst normalize in ⊢ (%→?); #H destruct (H) | #s0 #Hs0 cases (current_to_midtape … Hs) #ls * #rs #Hmidta_src >Hmidta_src @@ -257,11 +213,18 @@ lemma sem_match_step : [ lapply (\P Hss0) -Hss0 #Hss0 destruct (Hss0) #_ #Hcomp cases (Hcomp ????? (refl ??) (refl ??)) -Hcomp [ * [ * #rs' * #_ #Hcurtc_dst * #td * whd in ⊢ (%→?); * whd in ⊢ (??%?→?); - >(?:nth dst ? (current_chars ?? tc) (None ?) = None ?) [|@daemon] - cases (nth src ? (current_chars ?? tc) (None ?)) - [| #x ] normalize in ⊢ (%→?); #H destruct (H) + >nth_current_chars >nth_current_chars >Hcurtc_dst + cases (current ? (nth src …)) + [normalize in ⊢ (%→?); #H destruct (H) + | #x >nth_change_vec // cases (reverse ? rs0) + [ normalize in ⊢ (%→?); #H destruct (H) + | #r1 #rs1 normalize in ⊢ (%→?); #H destruct (H) ] ] | * #rs0' * #_ #Hcurtc_src * #td * whd in ⊢ (%→?); * whd in ⊢ (??%?→?); - >(?:nth src ? (current_chars ?? tc) (None ?) = None ?) [|@daemon] + >(?:nth src ? (current_chars ?? tc) (None ?) = None ?) + [|>nth_current_chars >Hcurtc_src >nth_change_vec_neq + [>nth_change_vec [cases (append ???) // | @Hsrc] + |@(not_to_not … Hneq) // + ]] normalize in ⊢ (%→?); #H destruct (H) ] | * #xs * #ci * #cj * #rs'' * #rs0' * * * #Hcicj #Hrs #Hrs0 #Htc * #td * * #Hmatch #Htd destruct (Htd) * #te * * @@ -271,31 +234,22 @@ lemma sem_match_step : lapply (Hte … (refl ??) … (refl ??) (refl ??)) -Hte >change_vec_commute // >change_vec_change_vec >change_vec_commute [|@sym_not_eq //] >change_vec_change_vec #Hte - >Hte in Htb; * * #_ >nth_change_vec // #Htb1 - lapply (Htb1 … (refl ??)) -Htb1 #Htb1 #Htb2 % - [ @(eq_vec … (niltape ?)) #i #Hi - cases (true_or_false ((dst : DeqNat) == i)) #Hdsti - [ <(\P Hdsti) >Htb1 >nth_change_vec // >Hmidta_dst - >Hrs0 >reverse_reverse cases xs [|#r1 #rs1] % - | nth_change_vec_neq [| @(\Pf Hdsti)] - >Hrs0 >reverse_reverse >nth_change_vec_neq in ⊢ (???%); - change_vec_same % ] - | #_ >Hmidta_dst >Hrs0 - %{xs} %{ci} %{rs''} %{ls0} %{cj} %{rs0'} % // % // + >Hte in Htb; whd in ⊢ (%→?); #Htb >Htb % + [ >change_vec_change_vec >nth_change_vec // + >reverse_reverse change_vec_same Hmidta_dst %{s'} % [%] #_ + >Hrs0 %{xs} %{ci} %{rs''} %{ls0} %{cj} %{rs0'} % // % // ] ] | lapply (\Pf Hss0) -Hss0 #Hss0 #Htc cut (tc = ta) [@Htc % % @(not_to_not ??? Hss0) #H destruct (H) %] -Htc #Htc destruct (Htc) #_ * #td * whd in ⊢ (%→?); * #_ - #Htd destruct (Htd) * #te * * #_ #Hte * * #_ #Htb1 #Htb2 + #Htd destruct (Htd) * #te * * #_ #Hte whd in ⊢ (%→?); #Htb #s1 #rs1 >Hmidta_src #H destruct (H) lapply (Hte … Hmidta_src … Hmidta_dst) -Hte #Hte destruct (Hte) % - [ @(eq_vec … (niltape ?)) #i #Hi - cases (true_or_false ((dst : DeqNat) == i)) #Hdsti - [ <(\P Hdsti) >(Htb1 … Hmidta_dst) >nth_change_vec // >Hmidta_dst - cases rs0 [|#r2 #rs2] % - | nth_change_vec_neq [| @(\Pf Hdsti)] % ] - | >Hs0 #H destruct (H) @False_ind cases (Hss0) /2/ ] + [ >Htb % + | >Hs0 %{s0} % // #H destruct (H) @False_ind cases (Hss0) /2/ ] ] ] ] @@ -310,18 +264,21 @@ lemma sem_match_step : | >(?:tc=ta) in Htest; [|@Hcomp1 % % >Hta_src >Hta_dst @(not_to_not ??? (\Pf Hxx0)) normalize #Hxx0' destruct (Hxx0') % ] - whd in ⊢ (??%?→?); >(?:nth src ? (current_chars ?? ta) (None ?) = Some ? x) - [| @daemon ] - >(?:nth dst ? (current_chars ?? ta) (None ?) = Some ? x0) [|@daemon] + whd in ⊢ (??%?→?); + >nth_current_chars >Hta_src >nth_current_chars >Hta_dst whd in ⊢ (??%?→?); #Hfalse destruct (Hfalse) ] -Hcomp1 cases (Hcomp2 … Hta_src Hta_dst) [ * - [ * #rs' * #Hxs #Hcurtc % %2 %{ls0} %{rs0} %{rs'} % // % // + [ * #rs' * #Hxs #Hcurtc % %2 %{ls0} %{rs0} %{rs'} % + [ % // | >Hcurtc % ] | * #rs0' * #Hxs #Htc %2 >Htc %{ls0} %{rs0'} % // ] | * #xs0 * #ci * #cj * #rs' * #rs0' * * * #Hci #Hxs #Hrs0 #Htc @False_ind - whd in Htest:(??%?); - >(?:nth src ? (current_chars ?? tc) (None ?) = Some ? ci) in Htest; [|@daemon] - >(?:nth dst ? (current_chars ?? tc) (None ?) = Some ? cj) [|@daemon] + whd in Htest:(??%?); + >(?:nth src ? (current_chars ?? tc) (None ?) = Some ? ci) in Htest; + [|>nth_current_chars >Htc >nth_change_vec_neq [|@(not_to_not … Hneq) //] + >nth_change_vec //] + >(?:nth dst ? (current_chars ?? tc) (None ?) = Some ? cj) + [|>nth_current_chars >Htc >nth_change_vec //] normalize #H destruct (H) ] ] ] qed. @@ -333,7 +290,8 @@ definition R_match_m ≝ λsrc,dst,sig,n.λint,outt: Vector (tape sig) (S n). ∀x,rs. nth src ? int (niltape ?) = midtape sig [ ] x rs → - (current sig (nth dst (tape sig) int (niltape sig)) = None ? → outt = int) ∧ + (current sig (nth dst (tape sig) int (niltape sig)) = None ? → + right ? (nth dst (tape sig) int (niltape sig)) = [ ] → outt = int) ∧ (∀ls0,x0,rs0. nth dst ? int (niltape ?) = midtape sig ls0 x0 rs0 → (∃l,l1.x0::rs0 = l@x::rs@l1 ∧ @@ -374,10 +332,12 @@ lapply (sem_while … (sem_match_step src dst sig n Hneq Hsrc Hdst) … Hloop) / | * #ls0 * #rs0 * #xs0 * * #Htc_dst #Hrs0 #HNone % [ >Htc_dst normalize in ⊢ (%→?); #H destruct (H) | #ls1 #x1 #rs1 >Htc_dst #H destruct (H) - >Hrs0 cases xs0 + >Hrs0 >HNone cases xs0 [ % %{[ ]} %{[ ]} % [ >append_nil >append_nil %] - (* change false case - #cj #ls2 #H destruct (H) *) @daemon + @eq_f3 // + [ >reverse_append % + | >reverse_append >reverse_cons >reverse_append + >associative_append >associative_append % ] | #x2 #xs2 %2 #l #l1 % #Habs lapply (eq_f ?? (length ?) ?? Habs) >length_append whd in ⊢ (??%(??%)→?); >length_append >length_append normalize >commutative_plus whd in ⊢ (???%→?); @@ -400,10 +360,18 @@ lapply (sem_while … (sem_match_step src dst sig n Hneq Hsrc Hdst) … Hloop) / lapply (refl ? (current ? (nth dst ? ta (niltape ?)))) cases (current ? (nth dst ? ta (niltape ?))) in ⊢ (???%→?); [#Hcurta_dst % - [#_ whd in Htrue; >Hmidta_src in Htrue; #Htrue - cases (Htrue ?? (refl ??)) -Htrue >Hcurta_dst - (* dovremmo sapere che ta.dst è sul margine destro, da cui la move non - ha effetto *) #_ cut (tc = ta) [@daemon] #Htc destruct (Htc) #_ + [#Hcurta_dst #Hrightta_dst whd in Htrue; >Hmidta_src in Htrue; #Htrue + cases (Htrue ?? (refl ??)) -Htrue #Htc + cut (tc = ta) + [ >Htc whd in match (tape_move_mono ???); whd in match (tape_write ???); + <(change_vec_same … ta dst (niltape ?)) in ⊢ (???%); + lapply Hrightta_dst lapply Hcurta_dst -Hrightta_dst -Hcurta_dst + cases (nth dst ? ta (niltape ?)) + [ #_ #_ % + | #r0 #rs0 #_ normalize in ⊢ (%→?); #H destruct (H) + | #l0 #ls0 #_ #_ % + | #ls #x0 #rs normalize in ⊢ (%→?); #H destruct (H) ] ] + -Htc #Htc destruct (Htc) #_ cases (IH … Hmidta_src) #Houtc #_ @Houtc // |#ls0 #x0 #rs0 #Hmidta_dst >Hmidta_dst in Hcurta_dst; normalize in ⊢ (%→?); #H destruct (H) @@ -413,8 +381,8 @@ lapply (sem_while … (sem_match_step src dst sig n Hneq Hsrc Hdst) … Hloop) / #H destruct (H) whd in Htrue; >Hmidta_src in Htrue; #Htrue cases (Htrue ?? (refl …)) -Htrue >Hmidta_dst #Htc cases (true_or_false (x==c)) #eqx - [ lapply (\P eqx) -eqx #eqx destruct (eqx) - #Htrue cases (Htrue (refl ??)) -Htrue + [ lapply (\P eqx) -eqx #eqx destruct (eqx) * #s0 * whd in ⊢ (??%?→?); #Hs0 + destruct (Hs0) #Htrue cases (Htrue (refl ??)) -Htrue #xs0 * #ci * #rs' * #ls1 * #cj * #rs1 * * #Hxs #H destruct (H) #Hcicj >Htc in IH; whd in ⊢ (%→?); >nth_change_vec_neq [|@sym_not_eq //] #IH cases (IH … Hmidta_src) -IH #_ >nth_change_vec // @@ -423,10 +391,10 @@ lapply (sem_while … (sem_match_step src dst sig n Hneq Hsrc Hdst) … Hloop) / #Hxs1 >Hxs1 #IH cases (IH … (refl ??)) -IH [ * #l * #l1 * #Hxs1' >change_vec_commute // >change_vec_change_vec - #Houtc % %{(c::l)} %{l1} % + #Houtc % %{(s0::l)} %{l1} % [ normalize reverse_cons >associative_append >change_vec_commute // @Houtc ] - | #H %2 #l #l1 >(?:l@c::xs@l1 = l@(c::xs)@l1) [|%] + | #H %2 #l #l1 >(?:l@s0::xs@l1 = l@(s0::xs)@l1) [|%] @not_sub_list_merge [ #l2 >Hxs associative_append #H2 lapply (append_l2_injective ????? (refl ??) H2) @@ -435,141 +403,327 @@ lapply (sem_while … (sem_match_step src dst sig n Hneq Hsrc Hdst) … Hloop) / -H1 #H1 cases (H l2 l3) #H2 @H2 @H1 ] ] - | (* in match_step_true manca il caso di fallimento immediato - (con i due current diversi) *) - @daemon - (* - #_ lapply (\Pf eqx) -eqx #eqx >Hmidta_dst - cases (Htrue ? (refl ??) eqx) -Htrue #Htb #Hendcx #_ - cases rs0 in Htb; - [ #_ %2 #l #l1 cases l + | #_ cases (IH x xs ?) -IH + [| >Htc >nth_change_vec_neq [|@sym_not_eq //] @Hmidta_src ] + >Htc >nth_change_vec // cases rs0 + [ #_ #_ %2 #l #l1 cases l [ normalize cases xs [ cases l1 - [ normalize % #H destruct (H) cases eqx /2/ + [ normalize % #H destruct (H) cases (\Pf eqx) /2/ | #tmp1 #l2 normalize % #H destruct (H) ] | #tmp1 #l2 normalize % #H destruct (H) ] | #tmp1 #l2 normalize % #H destruct (H)cases l2 in e0; [ normalize #H1 destruct (H1) - | #tmp2 #l3 normalize #H1 destruct (H1) ] - ] - | #r1 #rs1 normalize in ⊢ (???(????%?)→?); #Htb >Htb in IH; #IH - cases (IH ls x xs end rs ? Hnotend Hend Hnotstart) - [| >Htb >nth_change_vec_neq [|@sym_not_eq //] @Hmid_src ] -IH - #_ #IH cases (IH Hstart (c::ls0) r1 rs1 ?) - [|| >nth_change_vec // ] -IH - [ * #l * #l1 * #Hll1 #Hout % %{(c::l)} %{l1} % >Hll1 // - >reverse_cons >associative_append #cj0 #ls #Hl1 >(Hout ?? Hl1) - >change_vec_commute in ⊢ (??(???%??)?); // @sym_not_eq // - | #IH %2 @(not_sub_list_merge_2 ?? (x::xs)) normalize [|@IH] - #l1 % #H destruct (H) cases eqx /2/ - ] *) + | #tmp2 #l3 normalize #H1 destruct (H1) ] ] + | #r1 #rs1 #_ #IH cases (IH … (refl ??)) -IH + [ * #l * #l1 * #Hll1 #Houtc % %{(c::l)} %{l1} % [ >Hll1 % ] + >Houtc >change_vec_commute // >change_vec_change_vec + >change_vec_commute [|@sym_not_eq //] + >reverse_cons >associative_append % + | #Hll1 %2 @(not_sub_list_merge_2 ?? (x::xs)) normalize [|@Hll1] + #l1 % #H destruct (H) cases (\Pf eqx) /2/ + ] + ] ] ] ] qed. -definition Pre_match_m ≝ - λsrc,sig,n,is_startc,is_endc.λt: Vector (tape sig) (S n). - ∃start,xs,end. - nth src (tape sig) t (niltape sig) = midtape ? [] start (xs@[end]) ∧ - is_startc start = true ∧ - (∀c.c ∈ (xs@[end]) = true → is_startc c = false) ∧ - (∀c.c ∈ (start::xs) = true → is_endc c = false) ∧ - is_endc end = true. - +definition R_match_step_true_naive ≝ + λsrc,dst,sig,n.λint,outt: Vector (tape sig) (S n). + |left ? (nth src ? outt (niltape ?))| + + |option_cons ? (current ? (nth dst ? outt (niltape ?))) (right ? (nth dst ? outt (niltape ?)))| < + |left ? (nth src ? int (niltape ?))| + + |option_cons ? (current ? (nth dst ? int (niltape ?))) (right ? (nth dst ? int (niltape ?)))|. + +lemma sem_match_step_termination : + ∀src,dst,sig,n.src ≠ dst → src < S n → dst < S n → + match_step src dst sig n ⊨ + [ inr ?? (inr ?? (inl … (inr ?? start_nop))) : + R_match_step_true_naive src dst sig n, + R_match_step_false src dst sig n ]. +#src #dst #sig #n #Hneq #Hsrc #Hdst +@(acc_sem_seq_app sig n … (sem_compare src dst sig n Hneq Hsrc Hdst) + (acc_sem_if ? n … (sem_partest sig n (match_test src dst sig ?)) + (sem_seq … + (sem_rewind_strong ???? Hneq Hsrc Hdst) + (sem_move_multi … R ?)) + (sem_nop …))) [/2/] +[ #ta #tb #tc * lapply (refl ? (current ? (nth src ? ta (niltape ?)))) + cases (current ? (nth src ? ta (niltape ?))) in ⊢ (???%→%); + [ #Hcurta_src #Hcomp #_ * #td * >Hcomp [| % %2 %] + whd in ⊢ (%→?); * whd in ⊢ (??%?→?); + >nth_current_chars >Hcurta_src normalize in ⊢ (%→?); #H destruct (H) + | #s #Hs lapply (refl ? (current ? (nth dst ? ta (niltape ?)))) + cases (current ? (nth dst ? ta (niltape ?))) in ⊢ (???%→%); + [ #Hcurta_dst #Hcomp #_ * #td * >Hcomp [| %2 %] + whd in ⊢ (%→?); * whd in ⊢ (??%?→?); + >nth_current_chars >nth_current_chars >Hs >Hcurta_dst + normalize in ⊢ (%→?); #H destruct (H) + | #s0 #Hs0 + cases (current_to_midtape … Hs) #ls * #rs #Hmidta_src >Hmidta_src + cases (current_to_midtape … Hs0) #ls0 * #rs0 #Hmidta_dst >Hmidta_dst + cases (true_or_false (s == s0)) #Hss0 + [ lapply (\P Hss0) -Hss0 #Hss0 destruct (Hss0) + #_ #Hcomp cases (Hcomp ????? (refl ??) (refl ??)) -Hcomp [ * + [ * #rs' * #_ #Hcurtc_dst * #td * whd in ⊢ (%→?); * whd in ⊢ (??%?→?); + >nth_current_chars >nth_current_chars >Hcurtc_dst + cases (current ? (nth src …)) + [normalize in ⊢ (%→?); #H destruct (H) + | #x >nth_change_vec [|@Hdst] cases (reverse ? rs0) + [ normalize in ⊢ (%→?); #H destruct (H) + | #r1 #rs1 normalize in ⊢ (%→?); #H destruct (H) ] ] + | * #rs0' * #_ #Hcurtc_src * #td * whd in ⊢ (%→?); * whd in ⊢ (??%?→?); + >(?:nth src ? (current_chars ?? tc) (None ?) = None ?) + [|>nth_current_chars >Hcurtc_src >nth_change_vec_neq + [>nth_change_vec [cases (append ???) // | @Hsrc] + |@(not_to_not … Hneq) // + ]] + normalize in ⊢ (%→?); #H destruct (H) ] + | * #xs * #ci * #cj * #rs'' * #rs0' * * * #Hcicj #Hrs #Hrs0 + #Htc * #td * * #Hmatch #Htd destruct (Htd) * #te * * * + >Htc >change_vec_commute [|//] >nth_change_vec [|//] + >change_vec_commute [|@sym_not_eq //] >nth_change_vec [|//] + cases (lists_length_split ? ls ls0) #lsa * #lsb * * #Hlen #Hlsalsb + destruct (Hlsalsb) * + [ #Hte #_ #_ <(reverse_reverse … ls) in Hte; <(reverse_reverse … lsa) + cut (|reverse ? lsa| = |reverse ? ls|) [ // ] #Hlen' + @(list_cases2 … Hlen') + [ #H1 #H2 >H1 >H2 -H1 -H2 normalize in match (reverse ? [ ]); #Hte #_ + lapply (Hte … (refl ??) … (refl ??) (refl ??)) -Hte + >change_vec_commute [|//] >change_vec_change_vec + >change_vec_commute [|@sym_not_eq //] >change_vec_change_vec #Hte + >Hte whd in ⊢ (%→?); >change_vec_change_vec >nth_change_vec [|//] + >reverse_reverse #Htb + cut (tb = change_vec ?? (change_vec (tape sig) (S n) ta (midtape sig [ ] s0 (xs@ci::rs'')) src) (mk_tape sig (s0::lsb) (option_hd sig (xs@cj::rs0')) (tail sig (xs@cj::rs0'))) dst) + [ >Htb @eq_f3 // cases (xs@cj::rs0') // ] + -Htb #Htb >Htb whd >nth_change_vec [|//] + >nth_change_vec_neq [|@sym_not_eq //] >nth_change_vec [|//] + >right_mk_tape [|cases xs [|#x0 #xs0] normalize in ⊢ (??%?→?); #H destruct (H)] + normalize in match (left ??); + >Hmidta_src >Hmidta_dst >current_mk_tape Hrs0 + normalize in ⊢ (?(?%)%); // + | #hda #hdb #tla #tlb #H1 #H2 >H1 >H2 + >reverse_cons >reverse_cons #Hte + lapply (Hte ci hdb (reverse ? xs@s0::reverse ? tlb) rs'' ? + lsb cj hda (reverse ? xs@s0::reverse ? tla) rs0' ??) + [ /2 by cons_injective_l, nil/ + | >length_append >length_append @eq_f @(eq_f ?? S) + >H1 in Hlen'; >H2 whd in ⊢ (??%%→?); #Hlen' + >length_reverse >length_reverse destruct (Hlen') // + | /2 by refl, trans_eq/ ] -Hte + #Hte #_ whd in ⊢ (%→?); #Htb + cut (tb = change_vec ?? (change_vec (tape sig) (S n) ta + (mk_tape sig (hda::lsb) (option_hd ? (reverse sig (reverse sig xs@s0::reverse sig tla)@cj::rs0')) (tail ? (reverse sig (reverse sig xs@s0::reverse sig tla)@cj::rs0'))) dst) + (midtape ? [ ] hdb (reverse sig (reverse sig xs@s0::reverse sig tlb)@ci::rs'')) src) + [ >Htb >Hte >nth_change_vec // >change_vec_change_vec >change_vec_commute [|//] + >change_vec_change_vec >change_vec_commute [|@sym_not_eq //] + >change_vec_change_vec >change_vec_commute [|//] + @eq_f3 // cases (reverse sig (reverse sig xs@s0::reverse sig tla)@cj::rs0') // ] + -Htb #Htb >Htb whd + >nth_change_vec [|//] >nth_change_vec_neq [|//] >nth_change_vec [|//] + >right_mk_tape + [| cases (reverse sig (reverse sig xs@s0::reverse sig tla)) + [|#x0 #xs0] normalize in ⊢ (??%?→?); #H destruct (H) ] + >Hmidta_src >Hmidta_dst + whd in match (left ??); whd in match (left ??); whd in match (right ??); + >current_mk_tape Hrs0 >length_append whd in ⊢ (??(??%)); >length_append >length_reverse + >length_append >commutative_plus in match (|reverse ??| + ?); + whd in match (|?::?|); >length_reverse >length_reverse + <(length_reverse ? ls) H1 normalize // ] + | #_ #Hte #_ <(reverse_reverse … ls0) in Hte; <(reverse_reverse … lsa) + cut (|reverse ? lsa| = |reverse ? ls0|) [ // ] #Hlen' + @(list_cases2 … Hlen') + [ #H1 #H2 >H1 >H2 normalize in match (reverse ? [ ]); #Hte + lapply (Hte … (refl ??) … (refl ??) (refl ??)) -Hte + >change_vec_change_vec >change_vec_commute [|@sym_not_eq //] + >change_vec_change_vec #Hte #_ + >Hte whd in ⊢ (%→?); >nth_change_vec [|//] >reverse_reverse #Htb + cut (tb = change_vec ?? (change_vec (tape sig) (S n) ta (mk_tape ? [s0] (option_hd ? (xs@cj::rs0')) (tail ? (xs@cj::rs0'))) dst) + (midtape ? lsb s0 (xs@ci::rs'')) src) + [ >Htb >change_vec_change_vec >change_vec_commute [|//] + @eq_f3 // Htb whd >nth_change_vec [|//] + >nth_change_vec_neq [|//] >nth_change_vec [|//] + >right_mk_tape + [| cases xs [|#x0 #xs0] normalize in ⊢ (??%?→?); #H destruct (H) ] + normalize in match (left ??); + >Hmidta_src >Hmidta_dst >current_mk_tape Hrs0 + >length_append normalize >length_append >length_append + <(reverse_reverse ? lsa) >H1 normalize // + | #hda #hdb #tla #tlb #H1 #H2 >H1 >H2 + >reverse_cons >reverse_cons #Hte + lapply (Hte cj hdb (reverse ? xs@s0::reverse ? tlb) rs0' ? + lsb ci hda (reverse ? xs@s0::reverse ? tla) rs'' ??) + [ /2 by cons_injective_l, nil/ + | >length_append >length_append @eq_f @(eq_f ?? S) + >H1 in Hlen'; >H2 whd in ⊢ (??%%→?); #Hlen' + >length_reverse >length_reverse destruct (Hlen') // + | /2 by refl, trans_eq/ ] -Hte + #Hte #_ whd in ⊢ (%→?); >Hte >nth_change_vec_neq [|//] >nth_change_vec [|//] #Htb + cut (tb = change_vec ?? (change_vec (tape sig) (S n) ta + (mk_tape sig [hdb] (option_hd ? (reverse sig (reverse sig xs@s0::reverse sig tlb)@cj::rs0')) (tail ? (reverse sig (reverse sig xs@s0::reverse sig tlb)@cj::rs0'))) dst) + (midtape ? lsb hda (reverse sig (reverse sig xs@s0::reverse sig tla)@ci::rs'')) src) + [ >Htb >change_vec_change_vec >change_vec_commute [|//] + >change_vec_change_vec >change_vec_commute [|@sym_not_eq //] + >change_vec_change_vec >change_vec_commute [|//] + @eq_f3 // cases (reverse sig (reverse sig xs@s0::reverse sig tlb)@cj::rs0') // ] + -Htb #Htb >Htb whd + >nth_change_vec [|//] >nth_change_vec_neq [|//] >nth_change_vec [|//] + >right_mk_tape + [| cases (reverse sig (reverse sig xs@s0::reverse sig tlb)) + [|#x0 #xs0] normalize in ⊢ (??%?→?); #H destruct (H) ] + >Hmidta_src >Hmidta_dst + whd in match (left ??); whd in match (left ??); whd in match (right ??); + >current_mk_tape Hrs0 >length_append whd in ⊢ (??(??%)); >length_append >length_reverse + >length_append >commutative_plus in match (|reverse ??| + ?); + whd in match (|?::?|); >length_reverse >length_reverse + <(length_reverse ? lsa) >Hlen' >H2 >length_append + normalize // + ] + ] + ] + | lapply (\Pf Hss0) -Hss0 #Hss0 #Htc cut (tc = ta) + [@Htc % % @(not_to_not ??? Hss0) #H destruct (H) %] + -Htc #Htc destruct (Htc) #_ * #td * whd in ⊢ (%→?); * #_ + #Htd destruct (Htd) * #te * * * * >Hmidta_src >Hmidta_dst + cases (lists_length_split ? ls ls0) #lsa * #lsb * * #Hlen #Hlsalsb + destruct (Hlsalsb) + [ <(reverse_reverse … ls) <(reverse_reverse … lsa) + cut (|reverse ? lsa| = |reverse ? ls|) [ // ] #Hlen' + @(list_cases2 … Hlen') + [ #H1 #H2 >H1 >H2 -H1 -H2 #_ #_ normalize in match (reverse ? [ ]); #Hte #_ + lapply (Hte … (refl ??) … (refl ??)) -Hte #Hte destruct (Hte) + whd in ⊢ (%→?); >Hmidta_dst #Htb + cut (tb = change_vec ?? ta (mk_tape ? (s0::lsa@lsb) (option_hd ? rs0) (tail ? rs0)) dst) + [ >Htb cases rs0 // ] + -Htb #Htb >Htb whd >nth_change_vec [|//] + >nth_change_vec_neq [|@sym_not_eq //] >Hmidta_src >Hmidta_dst + >right_mk_tape + [| cases rs0 [ #_ %2 % | #x0 #xs0 normalize in ⊢ (??%?→?); #H destruct (H)] ] + normalize in match (left ??); normalize in match (right ??); + >Hmidta_src >Hmidta_dst >current_mk_tape H1 >H2 + >reverse_cons >reverse_cons >associative_append #Hte + lapply (Hte ???? (refl ??) ? s0 ? (reverse ? tla) ?? (refl ??)) + [ >length_reverse >length_reverse cut (|hda::tla| = |hdb::tlb|) // + normalize #H destruct (H) // ] #Hte #_ #_ #_ + whd in ⊢ (%→?); >Hte >change_vec_change_vec >nth_change_vec // #Htb + cut (tb = change_vec ?? (change_vec (tape sig) (S n) ta + (mk_tape sig (hda::lsb) (option_hd ? (reverse sig (reverse sig tla)@s0::rs0)) (tail ? (reverse sig (reverse sig tla)@s0::rs0))) dst) + (midtape ? [ ] hdb (reverse sig (reverse sig tlb)@s::rs)) src) + [ >Htb >change_vec_commute [|//] @eq_f3 // cases (reverse sig (reverse sig tla)@s0::rs0) // ] + -Htb #Htb >Htb whd + >nth_change_vec [|//] >nth_change_vec_neq [|//] >nth_change_vec [|//] + >right_mk_tape + [| cases (reverse sig (reverse sig tla)) + [|#x0 #xs0] normalize in ⊢ (??%?→?); #H destruct (H) ] + >Hmidta_src >Hmidta_dst + whd in match (left ??); whd in match (left ??); whd in match (right ??); + >current_mk_tape length_append + >length_reverse >length_reverse <(length_reverse ? ls) H1 normalize // ] + | #_ <(reverse_reverse … ls0) <(reverse_reverse … lsa) + cut (|reverse ? lsa| = |reverse ? ls0|) [ // ] #Hlen' + @(list_cases2 … Hlen') + [ #H1 #H2 >H1 >H2 normalize in match (reverse ? [ ]); #_ #_ #Hte + lapply (Hte … (refl ??) … (refl ??)) -Hte #Hte destruct (Hte) + whd in ⊢ (%→?); #Htb whd >Hmidta_dst + cut (tb = change_vec (tape sig) (S n) ta (mk_tape ? (s0::ls0) (option_hd ? rs0) (tail ? rs0)) dst) + [ >Htb >Hmidta_dst cases rs0 // ] + -Htb #Htb >Htb whd >nth_change_vec [|//] + >nth_change_vec_neq [|@sym_not_eq //] >Hmidta_src >Hmidta_dst + >current_mk_tape >right_mk_tape + [| cases rs0 [ #_ %2 % | #x0 #xs0 normalize in ⊢ (??%?→?); #H destruct (H) ]] + normalize in ⊢ (??%); H1 >H2 + >reverse_cons >reverse_cons #Hte #_ #_ + lapply (Hte s0 hdb (reverse ? tlb) rs0 ? + lsb s hda (reverse ? tla) rs ??) + [ /2 by cons_injective_l, nil/ + | >length_reverse >length_reverse cut (|hda::tla| = |hdb::tlb|) // + normalize #H destruct (H) // + | /2 by refl, trans_eq/ ] -Hte + #Hte whd in ⊢ (%→?); >Hte >nth_change_vec_neq [|//] >nth_change_vec [|//] #Htb + cut (tb = change_vec ?? (change_vec (tape sig) (S n) ta + (mk_tape sig [hdb] (option_hd ? (reverse sig (reverse sig tlb)@s0::rs0)) (tail ? (reverse sig (reverse sig tlb)@s0::rs0))) dst) + (midtape ? lsb hda (reverse sig (reverse sig tla)@s::rs)) src) + [ >Htb >change_vec_commute [|//] >change_vec_change_vec + @eq_f3 // cases (reverse sig (reverse sig tlb)@s0::rs0) // ] + -Htb #Htb >Htb whd + >nth_change_vec [|//] >nth_change_vec_neq [|//] >nth_change_vec [|//] + >right_mk_tape + [| cases (reverse ? (reverse ? tlb)) [|#x0 #xs0] normalize in ⊢ (??%?→?); #H destruct (H) ] + >Hmidta_src >Hmidta_dst + whd in match (left ??); whd in match (left ??); whd in match (right ??); + >current_mk_tape length_append + normalize in ⊢ (??%); >length_append >reverse_reverse + <(length_reverse ? lsa) >Hlen' >H2 normalize // + ] + ] + ] + ] + ] +| #ta #tb #tc * #Hcomp1 #Hcomp2 * #td * * #Htest #Htd destruct (Htd) + whd in ⊢ (%→?); #Htb destruct (Htb) #ls #x #xs #Hta_src + lapply (refl ? (current ? (nth dst ? ta (niltape ?)))) + cases (current ? (nth dst ? ta (niltape ?))) in ⊢ (???%→?); + [ #Hcurta_dst % % % // @Hcomp1 %2 // + | #x0 #Hcurta_dst cases (current_to_midtape … Hcurta_dst) -Hcurta_dst + #ls0 * #rs0 #Hta_dst cases (true_or_false (x == x0)) #Hxx0 + [ lapply (\P Hxx0) -Hxx0 #Hxx0 destruct (Hxx0) + | >(?:tc=ta) in Htest; + [|@Hcomp1 % % >Hta_src >Hta_dst @(not_to_not ??? (\Pf Hxx0)) normalize + #Hxx0' destruct (Hxx0') % ] + whd in ⊢ (??%?→?); + >nth_current_chars >Hta_src >nth_current_chars >Hta_dst + whd in ⊢ (??%?→?); #Hfalse destruct (Hfalse) ] -Hcomp1 + cases (Hcomp2 … Hta_src Hta_dst) [ * + [ * #rs' * #Hxs #Hcurtc % %2 %{ls0} %{rs0} %{rs'} % + [ % // | >Hcurtc % ] + | * #rs0' * #Hxs #Htc %2 >Htc %{ls0} %{rs0'} % // ] + | * #xs0 * #ci * #cj * #rs' * #rs0' * * * + #Hci #Hxs #Hrs0 #Htc @False_ind + whd in Htest:(??%?); + >(?:nth src ? (current_chars ?? tc) (None ?) = Some ? ci) in Htest; + [|>nth_current_chars >Htc >nth_change_vec_neq [|@(not_to_not … Hneq) //] + >nth_change_vec //] + >(?:nth dst ? (current_chars ?? tc) (None ?) = Some ? cj) + [|>nth_current_chars >Htc >nth_change_vec //] + normalize #H destruct (H) ] ] ] +qed. + +(* lemma WF_to_WF_f : ∀A,B,R,f,b. WF A R (f b) → WF B (λx,y.R (f x) (f y)) b. *) +let rec WF_to_WF_f A B R f b (Hwf: WF A R (f b)) on Hwf: WF B (λx,y.R (f x) (f y)) b ≝ + match Hwf return (λa0,r.f b = a0 → WF B (λx,y:B. R (f x) (f y)) b) with + [ wf a Hwfa ⇒ λHeq.? ] (refl ??). +% #b1 #HRb @WF_to_WF_f @Hwfa nth_change_vec_neq [|@sym_not_eq //] - >Hmid_src #HR cases (HR ? (refl ??)) -HR - >nth_change_vec // >Htape_dst normalize in ⊢ (%→?); - * #H @False_ind @H % -| #x0 #xs0 #Htape_dst % #t1 whd in ⊢ (%→?); >nth_change_vec_neq [|@sym_not_eq //] - >Hmid_src #HR cases (HR ? (refl ??)) -HR - >nth_change_vec // >Htape_dst normalize in ⊢ (%→?); - * #H @False_ind @H % -| #x0 #xs0 #Htape_dst % #t1 whd in ⊢ (%→?); >nth_change_vec_neq [|@sym_not_eq //] - >Hmid_src #HR cases (HR ? (refl ??)) -HR - >nth_change_vec // >Htape_dst normalize in ⊢ (%→?); - * #H @False_ind @H % -| #ls #s #rs lapply s -s lapply ls -ls lapply Hmid_src lapply t -t elim rs - [#t #Hmid_src #ls #s #Hmid_dst % #t1 whd in ⊢ (%→?); >nth_change_vec_neq [|@sym_not_eq //] - >Hmid_src >nth_change_vec // >Hmid_dst #HR cases (HR ? (refl ??)) -HR #_ - #HR cases (HR Hstart Hnotstart) - cases (true_or_false (start == s)) #Hs - [ lapply (\P Hs) -Hs #Hs Hxs in Htrue; #Htrue - cases (Htrue [ ] start [ ] ? xs1 ? [ ] (refl ??) (refl ??) ?) - [ * #_ * #H @False_ind @H % ] - #c0 #Hc0 @Hnotend >(memb_single … Hc0) @memb_hd - | lapply (\Pf Hs) -Hs #Hs #Htrue #_ - cases (Htrue ? (refl ??) Hs) -Htrue #Ht1 #_ % - #t2 whd in ⊢ (%→?); #HR cases (HR start ?) - [ >Ht1 >nth_change_vec // normalize in ⊢ (%→?); * #H @False_ind @H % - | >Ht1 >nth_change_vec_neq [|@sym_not_eq //] - >nth_change_vec_neq [|@sym_not_eq //] >Hmid_src % ] - ] - |#r0 #rs0 #IH #t #Hmid_src #ls #s #Hmid_dst % #t1 whd in ⊢ (%→?); - >nth_change_vec_neq [|@sym_not_eq //] >Hmid_src - #Htrue cases (Htrue ? (refl ??)) -Htrue #_ #Htrue - <(change_vec_same … t1 dst (niltape ?)) - cases (Htrue Hstart Hnotstart) -Htrue - cases (true_or_false (start == s)) #Hs - [ lapply (\P Hs) -Hs #Hs Hrs - cut (∃y,ys. xs1 = y::ys) - [ lapply Hxs0notend lapply Hxs lapply xs0 elim xs - [ * - [ normalize #Hxs1 Hend #H1 destruct (H1) - ] - | #y #ys #IH0 * - [ normalize in ⊢ (%→?); #Hxs1 Hxs1 in Hxs; #Hxs >Hmid_src >Hmid_dst >Hxs >Hrs - %{ls} %{xs0} %{y} %{ys} %{xs2} - % [ % // | @Hcomp // ] ] - * #ls0 * #xs0 * #ci * #rs * #rs0 * * #Hmid_src' #Hmid_dst' #Hcomp - nth_change_vec // >Hs #Htrue destruct (Hs) - lapply (Htrue ??????? Hmid_src' Hmid_dst' ?) -Htrue - [ #c0 #Hc0 @Hnotend cases (orb_true_l … Hc0) -Hc0 #Hc0 - [ whd in ⊢ (??%?); >Hc0 % - | @memb_cons >Hmid_src in Hmid_src'; #Hmid_src' destruct (Hmid_src') - lapply e0 -e0 @(list_elim_left … rs) - [ #e0 destruct (e0) lapply (append_l1_injective_r ?????? e0) // - | #x1 #xs1 #_ >append_cons in ⊢ (???%→?); - e1 @memb_append_l1 @memb_append_l1 // ] ] - | * * #Hciendc cases rs0 in Hcomp; - [ #_ * #H @False_ind @H % - | #r1 #rs1 * [ >Hciendc #H destruct (H) ] - * #_ #Hcomp lapply (Hcomp ?? (refl ??)) -Hcomp #Hcomp #_ #Htrue - cases (Htrue ?? (refl ??) Hcomp) #Ht1 #_ >Ht1 @(IH ?? (s::ls) r0) - [ >nth_change_vec_neq [|@sym_not_eq //] - >nth_change_vec_neq [|@sym_not_eq //] @Hmid_src - | >nth_change_vec // >Hmid_dst % ] ] ] - | >Hmid_dst >nth_change_vec // lapply (\Pf Hs) -Hs #Hs #Htrue #_ - cases (Htrue ? (refl ??) Hs) #Ht1 #_ >Ht1 @(IH ?? (s::ls) r0) - [ >nth_change_vec_neq [|@sym_not_eq //] - >nth_change_vec_neq [|@sym_not_eq //] @Hmid_src - | >nth_change_vec // ] ] ] ] + match_m src dst sig n ↓ t. +#src #dst #sig #n #ta #Hneq #Hsrc #Hdst +@(terminate_while … (sem_match_step_termination src dst sig n Hneq Hsrc Hdst)) // +letin f ≝ (λt0:Vector (tape sig) (S n).|left ? (nth src (tape ?) t0 (niltape ?))| + +|option_cons ? (current ? (nth dst (tape ?) t0 (niltape ?))) + (right ? (nth dst (tape ?) t0 (niltape ?)))|) +change with (λx,y.f x < f y) in ⊢ (??%?); @WF_to_WF_f @lt_WF +qed. + +lemma sem_match_m : ∀src,dst,sig,n. +src ≠ dst → src < S n → dst < S n → + match_m src dst sig n \vDash R_match_m src dst sig n. +#src #dst #sig #n #Hneq #Hsrc #Hdst @WRealize_to_Realize [/2/| @wsem_match_m // ] qed. \ No newline at end of file