V_____________________________________________________________*)
-(* COMPARE BIT
+(****************************** table of tuples *******************************)
+include "turing/universal/normalTM.ma".
-*)
-
-include "turing/universal/marks.ma".
-
-definition STape ≝ FinProd … FSUnialpha FinBool.
-
-definition only_bits ≝ λl.
- ∀c.memb STape c l = true → is_bit (\fst c) = true.
-
-definition no_grids ≝ λl.
- ∀c.memb STape c l = true → is_grid (\fst c) = false.
-
-definition no_bars ≝ λl.
- ∀c.memb STape c l = true → is_bar (\fst c) = false.
-
-definition no_marks ≝ λl.
- ∀c.memb STape c l = true → is_marked ? c = false.
-
-definition tuple_TM : nat → list STape → Prop ≝
- λn,t.∃qin,qout,mv,b1,b2.
- only_bits qin ∧ only_bits qout ∧ only_bits mv ∧
- |qin| = n ∧ |qout| = n (* ∧ |mv| = ? *) ∧
- t = qin@〈comma,b1〉::qout@〈comma,b2〉::mv.
+(* a well formed table is a list of tuples *)
-inductive table_TM : nat → list STape → Prop ≝
-| ttm_nil : ∀n.table_TM n []
-| ttm_cons : ∀n,t1,T,b.tuple_TM n t1 → table_TM n T → table_TM n (t1@〈bar,b〉::T).
+inductive table_TM (n:nat) : list STape → Prop ≝
+| ttm_nil : table_TM n []
+| ttm_cons : ∀t1,T.tuple_TM n t1 → table_TM n T → table_TM n (t1@T).
-axiom no_grids_in_table: ∀n.∀l.table_TM n l → no_grids l.
-(*
-l0 x* a l1 x0* a0 l2 ------> l0 x a* l1 x0 a0* l2
- ^ ^
+lemma wftable: ∀n,h,l.table_TM (S n) (flatten ? (tuples_list n h l)).
+#n #h #l elim l // -l #a #tl #Hind
+whd in match (flatten … (tuples_list …));
+@ttm_cons //
+qed.
-if current (* x *) = #
- then
- else if x = 0
- then move_right; ----
- adv_to_mark_r;
- if current (* x0 *) = 0
- then advance_mark ----
- adv_to_mark_l;
- advance_mark
- else STOP
- else x = 1 (* analogo *)
+(*********************** general properties of tables *************************)
+lemma no_grids_in_table: ∀n.∀l.table_TM n l → no_grids l.
+#n #l #t elim t
+ [normalize #c #H destruct
+ |#t1 #t2 #Ht1 #Ht2 #IH lapply (no_grids_in_tuple … Ht1) -Ht1 #Ht1 #x #Hx
+ cases (memb_append … Hx) -Hx #Hx
+ [ @(Ht1 … Hx)
+ | @(IH … Hx) ] ]
+qed.
-*)
+lemma no_marks_in_table: ∀n.∀l.table_TM n l → no_marks l.
+#n #l #t elim t
+ [normalize #c #H destruct
+ |#t1 #t2 #Ht1 #Ht2 #IH lapply (no_marks_in_tuple … Ht1) -Ht1 #Ht1 #x #Hx
+ cases (memb_append … Hx) -Hx #Hx
+ [ @(Ht1 … Hx)
+ | @(IH … Hx) ] ]
+qed.
+axiom last_of_table: ∀n,l,b.¬ table_TM n (l@[〈bar,b〉]).
-(*
- MARK NEXT TUPLE machine
- (partially axiomatized)
-
- marks the first character after the first bar (rightwards)
- *)
-
-definition bar_or_grid ≝ λc:STape.is_bar (\fst c) ∨ is_grid (\fst c).
-
-definition mark_next_tuple ≝
- seq ? (adv_to_mark_r ? bar_or_grid)
- (ifTM ? (test_char ? (λc:STape.is_bar (\fst c)))
- (move_right_and_mark ?) (nop ?) 1).
+(************************** matching in a table *******************************)
+inductive match_in_table (n:nat) (qin:list STape) (cin: STape)
+ (qout:list STape) (cout:STape) (mv:STape)
+: list STape → Prop ≝
+| mit_hd :
+ ∀tb.
+ tuple_TM n (mk_tuple qin cin qout cout mv) →
+ match_in_table n qin cin qout cout mv
+ (mk_tuple qin cin qout cout mv @tb)
+| mit_tl :
+ ∀qin0,cin0,qout0,cout0,mv0,tb.
+ tuple_TM n (mk_tuple qin0 cin0 qout0 cout0 mv0) →
+ match_in_table n qin cin qout cout mv tb →
+ match_in_table n qin cin qout cout mv
+ (mk_tuple qin0 cin0 qout0 cout0 mv0@tb).
-definition R_mark_next_tuple ≝
- λt1,t2.
- ∀ls,c,rs1,rs2.
- (* c non può essere un separatore ... speriamo *)
- t1 = midtape STape ls c (rs1@〈grid,false〉::rs2) →
- no_marks rs1 → no_grids rs1 → bar_or_grid c = false →
- (∃rs3,rs4,d,b.rs1 = rs3 @ 〈bar,false〉 :: rs4 ∧
- no_bars rs3 ∧
- Some ? 〈d,b〉 = option_hd ? (rs4@〈grid,false〉::rs2) ∧
- t2 = midtape STape (〈bar,false〉::reverse ? rs3@c::ls) 〈d,true〉 (tail ? (rs4@〈grid,false〉::rs2)))
- ∨
- (no_bars rs1 ∧ t2 = midtape ? (reverse ? rs1@c::ls) 〈grid,false〉 rs2).
-
-axiom tech_split :
- ∀A:DeqSet.∀f,l.
- (∀x.memb A x l = true → f x = false) ∨
- (∃l1,c,l2.f c = true ∧ l = l1@c::l2 ∧ ∀x.memb ? x l1 = true → f x = false).
-(*#A #f #l elim l
-[ % #x normalize #Hfalse *)
-
-theorem sem_mark_next_tuple :
- Realize ? mark_next_tuple R_mark_next_tuple.
-#intape
-lapply (sem_seq ? (adv_to_mark_r ? bar_or_grid)
- (ifTM ? (test_char ? (λc:STape.is_bar (\fst c))) (move_right_and_mark ?) (nop ?) 1) ????)
-[@sem_if [5: // |6: @sem_move_right_and_mark |7: // |*:skip]
-| //
-|||#Hif cases (Hif intape) -Hif
- #j * #outc * #Hloop * #ta * #Hleft #Hright
- @(ex_intro ?? j) @ex_intro [|% [@Hloop] ]
- -Hloop
- #ls #c #rs1 #rs2 #Hrs #Hrs1 #Hrs1' #Hc
- cases (Hleft … Hrs)
- [ * #Hfalse >Hfalse in Hc; #Htf destruct (Htf)
- | * #_ #Hta cases (tech_split STape (λc.is_bar (\fst c)) rs1)
- [ #H1 lapply (Hta rs1 〈grid,false〉 rs2 (refl ??) ? ?)
- [ * #x #b #Hx whd in ⊢ (??%?); >(Hrs1' … Hx) >(H1 … Hx) %
- | %
- | -Hta #Hta cases Hright
- [ * #tb * whd in ⊢ (%→?); #Hcurrent
- @False_ind cases (Hcurrent 〈grid,false〉 ?)
- [ normalize #Hfalse destruct (Hfalse)
- | >Hta % ]
- | * #tb * whd in ⊢ (%→?); #Hcurrent
- cases (Hcurrent 〈grid,false〉 ?)
- [ #_ #Htb whd in ⊢ (%→?); #Houtc
- %2 %
- [ @H1
- | >Houtc >Htb >Hta % ]
- | >Hta % ]
- ]
- ]
- | * #rs3 * #c0 * #rs4 * * #Hc0 #Hsplit #Hrs3
- % @(ex_intro ?? rs3) @(ex_intro ?? rs4)
- lapply (Hta rs3 c0 (rs4@〈grid,false〉::rs2) ???)
- [ #x #Hrs3' whd in ⊢ (??%?); >Hsplit in Hrs1;>Hsplit in Hrs3;
- #Hrs3 #Hrs1 >(Hrs1 …) [| @memb_append_l1 @Hrs3'|]
- >(Hrs3 … Hrs3') @Hrs1' >Hsplit @memb_append_l1 //
- | whd in ⊢ (??%?); >Hc0 %
- | >Hsplit >associative_append % ] -Hta #Hta
- cases Hright
- [ * #tb * whd in ⊢ (%→?); #Hta'
- whd in ⊢ (%→?); #Htb
- cases (Hta' c0 ?)
- [ #_ #Htb' >Htb' in Htb; #Htb
- generalize in match Hsplit; -Hsplit
- cases rs4 in Hta;
- [ #Hta #Hsplit >(Htb … Hta)
- >(?:c0 = 〈bar,false〉)
- [ @(ex_intro ?? grid) @(ex_intro ?? false)
- % [ % [ %
- [(* Hsplit *) @daemon |(*Hrs3*) @daemon ] | % ] | % ]
- | (* Hc0 *) @daemon ]
- | #r5 #rs5 >(eq_pair_fst_snd … r5)
- #Hta #Hsplit >(Htb … Hta)
- >(?:c0 = 〈bar,false〉)
- [ @(ex_intro ?? (\fst r5)) @(ex_intro ?? (\snd r5))
- % [ % [ % [ (* Hc0, Hsplit *) @daemon | (*Hrs3*) @daemon ] | % ]
- | % ] | (* Hc0 *) @daemon ] ] | >Hta % ]
- | * #tb * whd in ⊢ (%→?); #Hta'
- whd in ⊢ (%→?); #Htb
- cases (Hta' c0 ?)
- [ #Hfalse @False_ind >Hfalse in Hc0;
- #Hc0 destruct (Hc0)
- | >Hta % ]
-]]]]
+lemma tuple_to_match: ∀n,h,l,qin,cin,qout,cout,mv,p.
+ p = mk_tuple qin cin qout cout mv
+ → mem ? p (tuples_list n h l) →
+ match_in_table (S n) qin cin qout cout mv (flatten ? (tuples_list n h l)).
+#n #h #l #qin #cin #qout #cout #mv #p
+#Hp elim l
+ [whd in ⊢ (%→?); @False_ind
+ |#p1 #tl #Hind *
+ [#H whd in match (tuples_list ???);
+ <H >Hp @mit_hd //
+ |#H whd in match (tuples_list ???);
+ cases (is_tuple n h p1) #qin1 * #cin1 * #qout1 * #cout1 * #mv1
+ * #_ #Htuplep1 >Htuplep1 @mit_tl // @Hind //
+ ]
+ ]
qed.
-definition init_current ≝
- seq ? (adv_to_mark_l ? (is_marked ?))
- (seq ? (clear_mark ?)
- (seq ? (adv_to_mark_l ? (λc:STape.is_grid (\fst c)))
- (seq ? (move_r ?) (mark ?)))).
-
-definition R_init_current ≝ λt1,t2.
- ∀l1,c,l2,b,l3,c1,rs,c0,b0. no_marks l1 → no_grids l2 → is_grid c = false →
- Some ? 〈c0,b0〉 = option_hd ? (reverse ? (〈c,true〉::l2)) →
- t1 = midtape STape (l1@〈c,true〉::l2@〈grid,b〉::l3) 〈c1,false〉 rs →
- t2 = midtape STape (〈grid,b〉::l3) 〈c0,true〉
- ((tail ? (reverse ? (l1@〈c,false〉::l2))@〈c1,false〉::rs)).
+axiom match_decomp: ∀n,l,qin,cin,qout,cout,mv.
+ match_in_table (S n) qin cin qout cout mv l →
+ ∃l1,l2. l = l1@(mk_tuple qin cin qout cout mv)@l2 ∧
+ (∃q.|l1| = (tuple_length (S n))*q) ∧
+ tuple_TM (S n) (mk_tuple qin cin qout cout mv).
-lemma sem_init_current : Realize ? init_current R_init_current.
-#intape
-cases (sem_seq ????? (sem_adv_to_mark_l ? (is_marked ?))
- (sem_seq ????? (sem_clear_mark ?)
- (sem_seq ????? (sem_adv_to_mark_l ? (λc:STape.is_grid (\fst c)))
- (sem_seq ????? (sem_move_r ?) (sem_mark ?)))) intape)
-#k * #outc * #Hloop #HR
-@(ex_intro ?? k) @(ex_intro ?? outc) % [@Hloop]
-cases HR -HR #ta * whd in ⊢ (%→?); #Hta
-* #tb * whd in ⊢ (%→?); #Htb
-* #tc * whd in ⊢ (%→?); #Htc
-* #td * whd in ⊢ (%→%→?); #Htd #Houtc
-#l1 #c #l2 #b #l3 #c1 #rs #c0 #b0 #Hl1 #Hl2 #Hc #Hc0 #Hintape
-cases (Hta … Hintape) [ * #Hfalse normalize in Hfalse; destruct (Hfalse) ]
--Hta * #_ #Hta lapply (Hta l1 〈c,true〉 ? (refl ??) ??) [@Hl1|%]
--Hta #Hta lapply (Htb … Hta) -Htb #Htb cases (Htc … Htb) [ >Hc -Hc * #Hc destruct (Hc) ]
--Htc * #_ #Htc lapply (Htc … (refl ??) (refl ??) ?) [@Hl2]
--Htc #Htc lapply (Htd … Htc) -Htd
->reverse_append >reverse_cons
->reverse_cons in Hc0; cases (reverse … l2)
-[ normalize in ⊢ (%→?); #Hc0 destruct (Hc0)
- #Htd >(Houtc … Htd) %
-| * #c2 #b2 #tl2 normalize in ⊢ (%→?);
- #Hc0 #Htd >(Houtc … Htd)
- whd in ⊢ (???%); destruct (Hc0)
- >associative_append >associative_append %
-]
+lemma match_to_tuples_list: ∀n,h,l,qin,cin,qout,cout,mv.
+ match_in_table (S n) qin cin qout cout mv (flatten ? (tuples_list n h l)) →
+ ∃p. p = mk_tuple qin cin qout cout mv ∧ mem ? p (tuples_list n h l).
+#n #h #l #qin #cin #qout #cout #mv #Hmatch
+@(ex_intro … (mk_tuple qin cin qout cout mv)) % //
+cases (match_decomp … Hmatch) #l1 * #l2 * * #Hflat #Hlen #Htuple
+@(flatten_to_mem … Hflat … Hlen)
+ [//
+ |#x #memx @length_of_tuple
+ cases (mem_map ????? memx) #t * #memt #Ht <Ht //
+ |@(length_of_tuple … Htuple)
+ ]
qed.
-definition match_tuple_step ≝
- ifTM ? (test_char ? (λc:STape.¬ is_grid (\fst c)))
- (single_finalTM ?
- (seq ? compare
- (ifTM ? (test_char ? (λc:STape.is_grid (\fst c)))
- (nop ?)
- (seq ? mark_next_tuple
- (ifTM ? (test_char ? (λc:STape.is_grid (\fst c)))
- (mark ?) (seq ? (move_l ?) init_current) tc_true)) tc_true)))
- (nop ?) tc_true.
+lemma match_to_tuple: ∀n,h,l,qin,cin,qout,cout,mv.
+ match_in_table (S n) qin cin qout cout mv (flatten ? (tuples_list n h l)) →
+ ∃p. tuple_encoding n h p = mk_tuple qin cin qout cout mv ∧ mem ? p l.
+#n #h #l #qin #cin #qout #cout #mv #Hmatch
+cases (match_to_tuples_list … Hmatch)
+#p * #eqp #memb
+cases(mem_map … (λp.tuple_encoding n h p) … memb)
+#p1 * #Hmem #H @(ex_intro … p1) % /2/
+qed.
-definition R_match_tuple_step_true ≝ λt1,t2.
- ∀ls,c,l1,l2,c1,l3,l4,rs,n.
- is_bit c = true → only_bits l1 → no_grids l2 → is_bit c1 = true →
- only_bits l3 → n = |l1| → |l1| = |l3| →
- table_TM (S n) (〈c1,true〉::l3@〈comma,false〉::l4) →
- t1 = midtape STape (〈grid,false〉::ls) 〈c,true〉
- (l1@〈grid,false〉::l2@〈bar,false〉::〈c1,true〉::l3@〈comma,false〉::l4@〈grid,false〉::rs) →
- (* facciamo match *)
- (〈c,false〉::l1 = 〈c1,false〉::l3 ∧
- t2 = midtape ? (reverse ? l1@〈c,false〉::〈grid,false〉::ls) 〈grid,false〉
- (l2@〈bar,false〉::〈c1,false〉::l3@〈comma,true〉::l4@〈grid,false〉::rs))
- ∨
- (* non facciamo match e marchiamo la prossima tupla *)
- ((〈c,false〉::l1 ≠ 〈c1,false〉::l3 ∧
- ∃c2,l5,l6,l7.l4 = l5@〈bar,false〉::〈c2,false〉::l6@〈comma,false〉::l7 ∧
- (* condizioni su l5 l6 l7 *)
- t2 = midtape STape (〈grid,false〉::ls) 〈c,true〉
- (l1@〈grid,false〉::l2@〈bar,false〉::〈c1,true〉::l3@〈comma,false〉::
- l5@〈bar,false〉::〈c2,true〉::l6@〈comma,false〉::l7))
- ∨
- (* non facciamo match e non c'è una prossima tupla:
- non specifichiamo condizioni sul nastro di output, perché
- non eseguiremo altre operazioni, quindi il suo formato non ci interessa *)
- (〈c,false〉::l1 ≠ 〈c1,false〉::l3 ∧ no_bars l4 ∧ current ? t2 = Some ? 〈grid,true〉)).
-
-definition R_match_tuple_step_false ≝ λt1,t2.
- ∀ls,c,rs.t1 = midtape STape ls c rs → is_grid (\fst c) = true ∧ t2 = t1.
-
-include alias "basics/logic.ma".
+lemma match_to_trans:
+ ∀n.∀trans: trans_source n → trans_target n.
+ ∀h,qin,cin,qout,cout,mv.
+ match_in_table (S n) qin cin qout cout mv (flatten ? (tuples_list n h (graph_enum ?? trans))) →
+ ∃s,t. tuple_encoding n h 〈s,t〉 = mk_tuple qin cin qout cout mv
+ ∧ trans s = t.
+#n #trans #h #qin #cin #qout #cout #mv #Hmatch
+cases (match_to_tuple … Hmatch) -Hmatch * #s #t * #Heq #Hmem
+@(ex_intro … s) @(ex_intro … t) % // @graph_enum_correct
+@mem_to_memb @Hmem
+qed.
+
+lemma trans_to_match:
+ ∀n.∀h.∀trans: trans_source n → trans_target n.
+ ∀s,t,qin,cin,qout,cout,mv. trans s = t →
+ tuple_encoding n h 〈s,t〉 = mk_tuple qin cin qout cout mv →
+ match_in_table (S n) qin cin qout cout mv (flatten ? (tuples_list n h (graph_enum ?? trans))).
+#n #h #trans #inp #outp #qin #cin #qout #cout #mv #Htrans #Htuple
+@(tuple_to_match … (refl…)) <Htuple @mem_map_forward
+@(memb_to_mem (FinProd (trans_source n) (trans_target n)))
+@graph_enum_complete //
+qed.
(*
-lemma eq_f4: ∀A1,A2,A3,A4,B.∀f:A1 → A2 →A3 →A4 →B.
- ∀x1,x2,x3,x4,y1,y2,y3,y4. x1 = y1 → x2 = y2 →x3=y3 →x4 = y4 →
- f x1 x2 x3 x4 = f y1 y2 y3 y4.
-//
-qed-. *)
+axiom append_eq_tech1 :
+ ∀A,l1,l2,l3,l4.l1@l2 = l3@l4 → |l1| < |l3| → ∃la:list A.l1@la = l3.
+axiom append_eq_tech2 :
+ ∀A,l1,l2,l3,l4,a.l1@a::l2 = l3@l4 → memb A a l4 = false → ∃la:list A.l3 = l1@a::la.
+axiom list_decompose_cases :
+ ∀A,l1,l2,l3,l4,a.l1@a::l2 = l3@l4 → ∃la,lb:list A.l3 = la@a::lb ∨ l4 = la@a::lb.
+axiom list_decompose_l :
+ ∀A,l1,l2,l3,l4,a.l1@a::l2 = l3@l4 → memb A a l4 = false →
+ ∃la,lb.l2 = la@lb ∧ l3 = l1@a::la.*)
+
+lemma list_decompose_r :
+ ∀A,l1,l2,l3,l4,a.l1@a::l2 = l3@l4 → memb A a l3 = false →
+ ∃la,lb.l1 = la@lb ∧ l4 = lb@a::l2.
+#A #l1 #l2 #l3 generalize in match l1; generalize in match l2; elim l3
+ [normalize #l1 #l2 #l4 #a #H #_ @(ex_intro … []) @(ex_intro … l2) /2/
+ |#b #tl #Hind #l1 #l2 #l4 #a cases l2
+ [normalize #Heq destruct >(\b (refl … b)) normalize #Hfalse destruct
+ |#c #tl2 whd in ⊢ ((??%%)→?); #Heq destruct #Hmema
+ cases (Hind l1 tl2 l4 a ??)
+ [#l5 * #l6 * #eql #eql4
+ @(ex_intro … (b::l5)) @(ex_intro … l6) % /2/
+ |@e0
+ |cases (true_or_false (memb ? a tl)) [2://]
+ #H @False_ind @(absurd ?? not_eq_true_false)
+ <Hmema @sym_eq @memb_cons //
+ ]
+ ]
+ ]
+qed.
+
+(*axiom list_decompose_memb :
+ ∀A,l1,l2,l3,l4,a.l1@a::l2 = l3@l4 → |l1| < |l3| → memb A a l3 = true.*)
-lemma some_option_hd: ∀A.∀l:list A.∀a.∃b.
- Some ? b = option_hd ? (l@[a]) .
-#A #l #a cases l normalize /2/
+lemma table_invert_r : ∀n,t,T.
+ tuple_TM n t → table_TM n (t@T) → table_TM n T.
+#n #t #T #Htuple #Htable inversion Htable
+[ cases Htuple #qin * #cin * #qout * #cout * #mv * #_ #Ht >Ht
+ normalize #Hfalse destruct (Hfalse)
+| #t0 #T0 #Htuple0 #Htable0 #_ #Heq
+ lapply (append_l2_injective ?????? Heq)
+ [ >(length_of_tuple … Htuple) >(length_of_tuple … Htuple0) % ]
+ -Heq #Heq destruct (Heq) // ]
qed.
-lemma bit_not_grid: ∀d. is_bit d = true → is_grid d = false.
-* // normalize #H destruct
+lemma match_in_table_to_tuple :
+ ∀n,T,qin,cin,qout,cout,mv.
+ match_in_table n qin cin qout cout mv T → table_TM n T →
+ tuple_TM n (mk_tuple qin cin qout cout mv).
+#n #T #qin #cin #qout #cout #mv #Hmatch elim Hmatch
+[ //
+| #qin0 #cin0 #qout0 #cout0 #mv0 #tb #Htuple #Hmatch #IH #Htable
+ @IH @(table_invert_r ???? Htable) @Htuple
+]
qed.
-lemma bit_not_bar: ∀d. is_bit d = true → is_bar d = false.
-* // normalize #H destruct
+lemma match_in_table_append :
+ ∀n,T,qin,cin,qout,cout,mv,t.
+ tuple_TM n t →
+ match_in_table n qin cin qout cout mv (t@T) →
+ t = mk_tuple qin cin qout cout mv ∨ match_in_table n qin cin qout cout mv T.
+#n #T #qin #cin #qout #cout #mv #t #Ht #Hmatch inversion Hmatch
+[ #T0 #H #H1 % >(append_l1_injective … H1) //
+ >(length_of_tuple … Ht) >(length_of_tuple … H) %
+| #qin0 #cin0 #qout0 #cout0 #mv0 #T0 #H #H1 #_ #H2 %2
+ >(append_l2_injective … H2) // >(length_of_tuple … Ht) >(length_of_tuple … H) %
+]
qed.
-lemma sem_match_tuple_step:
- accRealize ? match_tuple_step (inr … (inl … (inr … 0)))
- R_match_tuple_step_true R_match_tuple_step_false.
-@(acc_sem_if_app … (sem_test_char ? (λc:STape.¬ is_grid (\fst c))) …
- (sem_seq … sem_compare
- (sem_if … (sem_test_char ? (λc:STape.is_grid (\fst c)))
- (sem_nop …)
- (sem_seq … sem_mark_next_tuple
- (sem_if … (sem_test_char ? (λc:STape.is_grid (\fst c)))
- (sem_mark ?) (sem_seq … (sem_move_l …) (sem_init_current …))))))
- (sem_nop ?) …)
-[(* is_grid: termination case *)
- 2:#t1 #t2 #t3 whd in ⊢ (%→?); #H #H1 whd #ls #c #rs #Ht1
- cases (H c ?) [2: >Ht1 %] #Hgrid #Heq %
- [@injective_notb @Hgrid | <Heq @H1]
-|#tapea #tapeout #tapeb whd in ⊢ (%→?); #Htapea
- * #tapec * #Hcompare #Hor
- #ls #c #l1 #l2 #c1 #l3 #l4 #rs #n #Hc #Hl1 #Hl2 #Hc1 #Hl3 #eqn
- #eqlen #Htable #Htapea1 cases (Htapea 〈c,true〉 ?) >Htapea1 [2:%]
- #notgridc -Htapea -Htapea1 -tapea #Htapeb
- cases (Hcompare … Htapeb) -Hcompare -Htapeb * #_ #_ #Hcompare
- cases (Hcompare c c1 l1 l3 (l2@[〈bar,false〉]) (l4@〈grid,false〉::rs) eqlen … (refl …) Hc ?)
- -Hcompare
- [* #Htemp destruct (Htemp) #Htapec %1 % [%]
- >Htapec in Hor; -Htapec *
- [2: * #t3 * whd in ⊢ (%→?); #H @False_ind
- cases (H … (refl …)) whd in ⊢ ((??%?)→?); #H destruct (H)
- |* #taped * whd in ⊢ (%→?); #Htaped cases (Htaped ? (refl …)) -Htaped *
- #Htaped whd in ⊢ (%→?); #Htapeout >Htapeout >Htaped >associative_append
- %
- ]
- |* #la * #c' * #d' * #lb * #lc * * * #H1 #H2 #H3 #Htapec
- cut (〈c,false〉::l1 ≠ 〈c1,false〉::l3)
- [>H2 >H3 elim la
- [@(not_to_not …H1) normalize #H destruct %
- |#x #tl @not_to_not normalize #H destruct //
+lemma generic_match_to_match_in_table_tech :
+ ∀n,t,T0,T1,T2.tuple_TM n t → table_TM n (T1@〈bar,false〉::T2) →
+ t@T0 = T1@〈bar,false〉::T2 → T1 = [] ∨ ∃T3.T1 = t@T3.
+#n #t #T0 #T1 #T2 #Ht cases T1
+[ #_ #_ % %
+| normalize #c #T1c #Htable #Heq %2
+ cases Ht in Heq; #qin * #cin * #qout * #cout * #mv **********
+ #Hqin1 #Hqout1 #Hqin2 #Hqout2 #Hcin #Hcout #Hmv #Hcoutmv #Hqinlen #Hqoutlen
+ #Heqt >Heqt whd in ⊢ (??%%→?); #Ht lapply (cons_injective_r ????? Ht)
+ #Ht' cases (list_decompose_r STape … (sym_eq … Ht') ?)
+ [ #la * #lb * #HT1c #HT0 %{lb} >HT1c @(eq_f2 ??? (append ?) (c::la)) //
+ >HT0 in Ht'; >HT1c >associative_append in ⊢ (???%→?); #Ht'
+ <(append_l1_injective_r … Ht') // <(cons_injective_l ????? Ht) %
+ |@(noteq_to_eqnot ? true) @(not_to_not … not_eq_true_false) #Hbar @sym_eq
+ cases (memb_append … Hbar) -Hbar #Hbar
+ [@(Hqin2 … Hbar)
+ |cases (orb_true_l … Hbar) -Hbar
+ [#Hbar lapply (\P Hbar) -Hbar #Hbar destruct (Hbar) @Hcin
+ |whd in ⊢ ((??%?)→?); #Hbar cases (memb_append … Hbar) -Hbar #Hbar
+ [@(Hqout2 … Hbar)
+ |cases (orb_true_l … Hbar) -Hbar
+ [#Hbar lapply (\P Hbar) -Hbar #Hbar destruct (Hbar) @Hcout
+ |#Hbar cases (orb_true_l … Hbar) -Hbar
+ [whd in ⊢ ((??%?)→?); #Hbar @Hbar
+ |#Hbar lapply (memb_single … Hbar) -Hbar #Hbar destruct (Hbar) @Hmv
+ ]
+ ]
]
- ] #Hnoteq %2
- cut (is_bit d' = true)
- [cases la in H3;
- [normalize in ⊢ (%→?); #H destruct //
- |#x #tl #H @(Hl3 〈d',false〉)
- normalize in H; destruct @memb_append_l2 @memb_hd
- ]
- ] #Hd'
- >Htapec in Hor; -Htapec *
- [* #taped * whd in ⊢ (%→?); #H @False_ind
- cases (H … (refl …)) >Hd' #Htemp destruct (Htemp)
- |* #taped * whd in ⊢ (%→?); #H cases (H … (refl …)) -H #_
- #Htaped * #tapee * whd in ⊢ (%→?); #Htapee
- <(associative_append ? lc (〈comma,false〉::l4)) in Htaped; #Htaped
- lapply (Htapee … Htaped ???) -Htaped -Htapee
- [whd in ⊢ (??%?); >(bit_not_grid … Hd') >(bit_not_bar … Hd') %
- |#x #Hx cases (memb_append … Hx)
- [-Hx #Hx @bit_not_grid @Hl3 cases la in H3; normalize
- [#H3 destruct (H3) @Hx | #y #tl #H3 destruct (H3)
- @memb_append_l2 @memb_cons @Hx ]
- |-Hx #Hx @(no_grids_in_table … Htable)
- @memb_cons @memb_append_l2 @Hx
- ]
- |@daemon (* TODO *)
- |*
- [* #rs3 * * (* we proceed by cases on rs4 *)
- [* #d * #b * * * #Heq1 #Hnobars
- whd in ⊢ ((???%)→?); #Htemp destruct (Htemp)
- #Htapee *
- [* #tapef * whd in ⊢ (%→?); >Htapee -Htapee #Htapef
- cases (Htapef … (refl …)) -Htapef #_ #Htapef >Htapef -Htapef
- whd in ⊢ (%→?); #H lapply (H … ???? (refl …)) #Htapeout
- %1 %
- [ //| @daemon]
- | >Htapeout %
- ]
- |* #tapef * whd in ⊢ (%→?); >Htapee -Htapee #Htapef
- cases (Htapef … (refl …)) whd in ⊢ ((??%?)→?); #Htemp destruct (Htemp)
- ]
- |* #d2 #b2 #rs3' * #d * #b * * * #Heq1 #Hnobars
- cut (is_grid d2 = false) [@daemon (* ??? *)] #Hd2
- whd in ⊢ ((???%)→?); #Htemp destruct (Htemp) #Htapee >Htapee -Htapee *
- [* #tapef * whd in ⊢ (%→?); #Htapef
- cases (Htapef … (refl …)) >Hd2 #Htemp destruct (Htemp)
- |* #tapef * whd in ⊢ (%→?); #Htapef
- cases (Htapef … (refl …)) #_ -Htapef #Htapef
- * #tapeg >Htapef -Htapef * whd in ⊢ (%→?);
- #H lapply (H … (refl …)) whd in ⊢ (???%→?); -H #Htapeg
- >Htapeg -Htapeg whd in ⊢ (%→?); #Htapeout
- %1 cases (some_option_hd ? (reverse ? (reverse ? la)) 〈c',true〉)
- * #c00 #b00 #Hoption
- lapply
- (Htapeout (reverse ? rs3 @〈d',false〉::reverse ? la@reverse ? (l2@[〈bar,false〉])@(〈grid,false〉::reverse ? lb))
- c' (reverse ? la) false ls bar (〈d2,true〉::rs3'@〈grid,false〉::rs) c00 b00 ?????) -Htapeout
- [whd in ⊢ (??(??%??)?); @eq_f3 [2:%|3: %]
- >associative_append
- generalize in match (〈c',true〉::reverse ? la@〈grid,false〉::ls); #l
- whd in ⊢ (???(???%)); >associative_append >associative_append
- %
- |@daemon
- |@daemon
- |@daemon
- |@daemon
- |@daemon
- ]
- ]
- ]
- |* #Hnobars #Htapee >Htapee -Htapee *
- [whd in ⊢ (%→?); * #tapef * whd in ⊢ (%→?); #Htapef
- cases (Htapef … (refl …)) -Htapef #_ #Htapef >Htapef -Htapef
- whd in ⊢ (%→?); #Htapeout %2
- >(Htapeout … (refl …)) %
- [ %
- [ @daemon
- | @daemon
- ]
- | %
- ]
- |whd in ⊢ (%→?); * #tapef * whd in ⊢ (%→?); #Htapef
- cases (Htapef … (refl …)) -Htapef
- whd in ⊢ ((??%?)→?); #Htemp destruct (Htemp)
- ]
- |
-
-
-
-
-
-
- ????? (refl …) Hc ?) -Hcompare
- #Hcompare
- is_bit c = true → only_bits l1 → no_grids l2 → is_bit c1 = true →
- only_bits l3 → n = |l2| → |l2| = |l3| →
- table_TM (S n) (〈c1,true〉::l3@〈comma,false〉::l4) →#x
-
- #intape
-cases
- (acc_sem_if … (sem_test_char ? (λc:STape.¬ is_grid (\fst c)))
- (sem_seq … sem_compare
- (sem_if … (sem_test_char ? (λc:STape.is_grid (\fst c)))
- (sem_nop …)
- (sem_seq … sem_mark_next_tuple
- (sem_if … (sem_test_char ? (λc:STape.is_grid (\fst c)))
- (sem_mark ?) (sem_seq … (sem_move_l …) (sem_init_current …))))))
- (sem_nop ?) intape)
-#k * #outc * * #Hloop #H1 #H2
-@(ex_intro ?? k) @(ex_intro ?? outc) %
-[ % [@Hloop ] ] -Hloop
-
\ No newline at end of file
+ ]
+ ]
+ ]
+qed.
+
+lemma generic_match_to_match_in_table :
+ ∀n,T.table_TM n T →
+ ∀qin,cin,qout,cout,mv.|qin| = n → |qout| = n →
+ only_bits qin → only_bits qout →
+ bit_or_null (\fst cin) = true → bit_or_null (\fst cout) = true →
+ bit_or_null (\fst mv) = true →
+ ∀t1,t2.
+ T = (t1@〈bar,false〉::qin@cin::〈comma,false〉::qout@cout::〈comma,false〉::[mv])@t2 →
+ match_in_table n qin cin qout cout mv T.
+#n #T #Htable #qin #cin #qout #cout #mv #Hlenqin #Hlenqout
+#Hqinbits #Hqoutbits #Hcin #Hcout #Hmv
+elim Htable
+[ * [ #t2 normalize in ⊢ (%→?); #Hfalse destruct (Hfalse)
+ | #c0 #t1 #t2 normalize in ⊢ (%→?); #Hfalse destruct (Hfalse) ]
+| #tuple #T0 #H1 #Htable0#IH #t1 #t2 #HT cases H1 #qin0 * #cin0 * #qout0 * #cout0 * #mv0
+ * * * * * * * * * *
+ #Hqin0marks #Hqout0marks #Hqin0bits #Hqout0bits #Hcin0 #Hcout0 #Hmv0 #Hcout0mv0
+ #Hlenqin0 #Hlenqout0 #Htuple
+ lapply (generic_match_to_match_in_table_tech n ? T0 t1
+ (qin@cin::〈comma,false〉::qout@[cout;〈comma,false〉;mv]@t2) H1) #Htmp
+ >Htuple in H1; #H1
+ lapply (ttm_cons … T0 H1 Htable0) <Htuple in ⊢ (%→?); >HT
+ >associative_append normalize >associative_append normalize
+ >associative_append #Htable cases (Htmp Htable ?)
+ [ #Ht1 >Htuple in HT; >Ht1 normalize in ⊢ (??%%→?);
+ >associative_append >associative_append #HT
+ cut (qin0 = qin ∧ (〈cin0,false〉 = cin ∧ (qout0 = qout ∧
+ (〈cout0,false〉 = cout ∧ (〈mv0,false〉 = mv ∧ T0 = t2)))))
+ [ lapply (cons_injective_r ????? HT) -HT #HT
+ lapply (append_l1_injective … HT) [ >Hlenqin @Hlenqin0 ]
+ #Hqin % [ @Hqin ] -Hqin
+ lapply (append_l2_injective … HT) [ >Hlenqin @Hlenqin0 ] -HT #HT
+ lapply (cons_injective_l ????? HT) #Hcin % [ @Hcin ] -Hcin
+ lapply (cons_injective_r ????? HT) -HT #HT
+ lapply (cons_injective_r ????? HT) -HT
+ >associative_append >associative_append #HT
+ lapply (append_l1_injective … HT) [ >Hlenqout @Hlenqout0 ]
+ #Hqout % [ @Hqout ] -Hqout
+ lapply (append_l2_injective … HT) [ >Hlenqout @Hlenqout0 ] -HT normalize #HT
+ lapply (cons_injective_l ????? HT) #Hcout % [ @Hcout ] -Hcout
+ lapply (cons_injective_r ????? HT) -HT #HT
+ lapply (cons_injective_r ????? HT) -HT #HT
+ lapply (cons_injective_l ????? HT) #Hmv % [ @Hmv ] -Hmv
+ @(cons_injective_r ????? HT) ]
+ -HT * #Hqin * #Hcin * #Hqout * #Hcout * #Hmv #HT0
+ >(?:〈bar,false〉::qin0@(〈cin0,false〉::〈comma,false〉::qout0@
+ [〈cout0,false〉;〈comma,false〉;〈mv0,false〉])@T0 = tuple@T0)
+ [ >Htuple >Hqin >Hqout >Hcin >Hcout >Hmv % //
+ | >Htuple normalize >associative_append normalize >associative_append
+ normalize >associative_append % ]
+ | * #T3 #HT3 >HT3 in HT; >associative_append; >associative_append #HT
+ lapply (append_l2_injective … HT) // -HT #HT %2 //
+ @(IH T3 t2) >HT >associative_append %
+ |>HT >associative_append normalize >associative_append normalize
+ >associative_append % ]
+]
+qed.
projects / helm.git / blobdiff