2 ||M|| This file is part of HELM, an Hypertextual, Electronic
3 ||A|| Library of Mathematics, developed at the Computer Science
4 ||T|| Department of the University of Bologna, Italy.
8 \ / This file is distributed under the terms of the
9 \ / GNU General Public License Version 2
10 V_____________________________________________________________*)
17 include "turing/universal/marks.ma".
19 definition STape ≝ FinProd … FSUnialpha FinBool.
21 definition only_bits_or_nulls ≝ λl.
22 ∀c.memb STape c l = true → bit_or_null (\fst c) = true.
24 definition no_grids ≝ λl.
25 ∀c.memb STape c l = true → is_grid (\fst c) = false.
27 definition no_bars ≝ λl.
28 ∀c.memb STape c l = true → is_bar (\fst c) = false.
30 definition no_marks ≝ λl.
31 ∀c.memb STape c l = true → is_marked ? c = false.
33 lemma bit_not_grid: ∀d. is_bit d = true → is_grid d = false.
34 * // normalize #H destruct
37 lemma bit_or_null_not_grid: ∀d. bit_or_null d = true → is_grid d = false.
38 * // normalize #H destruct
41 lemma bit_not_bar: ∀d. is_bit d = true → is_bar d = false.
42 * // normalize #H destruct
45 lemma bit_or_null_not_bar: ∀d. bit_or_null d = true → is_bar d = false.
46 * // normalize #H destruct
49 (* by definition, a tuple is not marked *)
50 definition tuple_TM : nat → list STape → Prop ≝
53 only_bits_or_nulls qin ∧ only_bits_or_nulls qout ∧ bit_or_null mv = true ∧
54 |qin| = n ∧ |qout| = n (* ∧ |mv| = ? *) ∧
55 t = qin@〈comma,false〉::qout@〈comma,false〉::[〈mv,false〉].
57 inductive table_TM : nat → list STape → Prop ≝
58 | ttm_nil : ∀n.table_TM n []
59 | ttm_cons : ∀n,t1,T.tuple_TM n t1 → table_TM n T → table_TM n (t1@〈bar,false〉::T).
61 lemma no_grids_in_table: ∀n.∀l.table_TM n l → no_grids l.
63 [normalize #n #x #H destruct
64 |#m #t1 #t2 * #qin * #qout * #mv * * * * * *
65 #Hmarks #Hqin #Hqout #Hmv #_ #_ #Heq #Ht2 #Hind
67 cases (memb_append … membx) -membx #membx
68 [cases (memb_append … membx) -membx #membx
69 [@bit_or_null_not_grid @Hqin //
70 |cases (orb_true_l … membx) -membx #membx
72 |cases (memb_append … membx) -membx #membx
73 [@bit_or_null_not_grid @Hqout //
74 |cases (orb_true_l … membx) -membx #membx
76 |@bit_or_null_not_grid >(memb_single … membx) @Hmv
81 |cases (orb_true_l … membx) -membx #membx
89 lemma no_marks_in_table: ∀n.∀l.table_TM n l → no_marks l.
91 [normalize #n #x #H destruct
92 |#m #t1 #t2 * #qin * #qout * #mv * * * * * *
93 #Hmarks #_ #_ #_ #_ #_ #_ #Ht2 #Hind
94 #x #Hx cases (memb_append … Hx) -Hx #Hx
96 |cases (orb_true_l … Hx) -Hx #Hx
104 axiom last_of_table: ∀n,l,b.¬ table_TM n (l@[〈bar,b〉]).
107 l0 x* a l1 x0* a0 l2 ------> l0 x a* l1 x0 a0* l2
110 if current (* x *) = #
113 then move_right; ----
115 if current (* x0 *) = 0
116 then advance_mark ----
120 else x = 1 (* analogo *)
126 MARK NEXT TUPLE machine
127 (partially axiomatized)
129 marks the first character after the first bar (rightwards)
132 definition bar_or_grid ≝ λc:STape.is_bar (\fst c) ∨ is_grid (\fst c).
134 definition mark_next_tuple ≝
135 seq ? (adv_to_mark_r ? bar_or_grid)
136 (ifTM ? (test_char ? (λc:STape.is_bar (\fst c)))
137 (move_right_and_mark ?) (nop ?) 1).
139 definition R_mark_next_tuple ≝
142 (* c non può essere un separatore ... speriamo *)
143 t1 = midtape STape ls c (rs1@〈grid,false〉::rs2) →
144 no_marks rs1 → no_grids rs1 → bar_or_grid c = false →
145 (∃rs3,rs4,d,b.rs1 = rs3 @ 〈bar,false〉 :: rs4 ∧
147 Some ? 〈d,b〉 = option_hd ? (rs4@〈grid,false〉::rs2) ∧
148 t2 = midtape STape (〈bar,false〉::reverse ? rs3@c::ls) 〈d,true〉 (tail ? (rs4@〈grid,false〉::rs2)))
150 (no_bars rs1 ∧ t2 = midtape ? (reverse ? rs1@c::ls) 〈grid,false〉 rs2).
154 (∀x.memb A x l = true → f x = false) ∨
155 (∃l1,c,l2.f c = true ∧ l = l1@c::l2 ∧ ∀x.memb ? x l1 = true → f x = false).
157 [ % #x normalize #Hfalse *)
159 theorem sem_mark_next_tuple :
160 Realize ? mark_next_tuple R_mark_next_tuple.
162 lapply (sem_seq ? (adv_to_mark_r ? bar_or_grid)
163 (ifTM ? (test_char ? (λc:STape.is_bar (\fst c))) (move_right_and_mark ?) (nop ?) 1) ????)
164 [@sem_if [5: // |6: @sem_move_right_and_mark |7: // |*:skip]
166 |||#Hif cases (Hif intape) -Hif
167 #j * #outc * #Hloop * #ta * #Hleft #Hright
168 @(ex_intro ?? j) @ex_intro [|% [@Hloop] ]
170 #ls #c #rs1 #rs2 #Hrs #Hrs1 #Hrs1' #Hc
172 [ * #Hfalse >Hfalse in Hc; #Htf destruct (Htf)
173 | * #_ #Hta cases (tech_split STape (λc.is_bar (\fst c)) rs1)
174 [ #H1 lapply (Hta rs1 〈grid,false〉 rs2 (refl ??) ? ?)
175 [ * #x #b #Hx whd in ⊢ (??%?); >(Hrs1' … Hx) >(H1 … Hx) %
177 | -Hta #Hta cases Hright
178 [ * #tb * whd in ⊢ (%→?); #Hcurrent
179 @False_ind cases (Hcurrent 〈grid,false〉 ?)
180 [ normalize #Hfalse destruct (Hfalse)
182 | * #tb * whd in ⊢ (%→?); #Hcurrent
183 cases (Hcurrent 〈grid,false〉 ?)
184 [ #_ #Htb whd in ⊢ (%→?); #Houtc
187 | >Houtc >Htb >Hta % ]
191 | * #rs3 * #c0 * #rs4 * * #Hc0 #Hsplit #Hrs3
192 % @(ex_intro ?? rs3) @(ex_intro ?? rs4)
193 lapply (Hta rs3 c0 (rs4@〈grid,false〉::rs2) ???)
194 [ #x #Hrs3' whd in ⊢ (??%?); >Hsplit in Hrs1;>Hsplit in Hrs3;
195 #Hrs3 #Hrs1 >(Hrs1 …) [| @memb_append_l1 @Hrs3'|]
196 >(Hrs3 … Hrs3') @Hrs1' >Hsplit @memb_append_l1 //
197 | whd in ⊢ (??%?); >Hc0 %
198 | >Hsplit >associative_append % ] -Hta #Hta
200 [ * #tb * whd in ⊢ (%→?); #Hta'
203 [ #_ #Htb' >Htb' in Htb; #Htb
204 generalize in match Hsplit; -Hsplit
206 [ #Hta #Hsplit >(Htb … Hta)
207 >(?:c0 = 〈bar,false〉)
208 [ @(ex_intro ?? grid) @(ex_intro ?? false)
210 [(* Hsplit *) @daemon |(*Hrs3*) @daemon ] | % ] | % ]
211 | (* Hc0 *) @daemon ]
212 | #r5 #rs5 >(eq_pair_fst_snd … r5)
213 #Hta #Hsplit >(Htb … Hta)
214 >(?:c0 = 〈bar,false〉)
215 [ @(ex_intro ?? (\fst r5)) @(ex_intro ?? (\snd r5))
216 % [ % [ % [ (* Hc0, Hsplit *) @daemon | (*Hrs3*) @daemon ] | % ]
217 | % ] | (* Hc0 *) @daemon ] ] | >Hta % ]
218 | * #tb * whd in ⊢ (%→?); #Hta'
221 [ #Hfalse @False_ind >Hfalse in Hc0;
227 definition init_current_on_match ≝
229 (seq ? (adv_to_mark_l ? (λc:STape.is_grid (\fst c)))
230 (seq ? (move_r ?) (mark ?)))).
232 definition R_init_current_on_match ≝ λt1,t2.
233 ∀l1,l2,c,rs. no_grids l1 → is_grid c = false →
234 t1 = midtape STape (l1@〈c,false〉::〈grid,false〉::l2) 〈grid,false〉 rs →
235 t2 = midtape STape (〈grid,false〉::l2) 〈c,true〉 ((reverse ? l1)@〈grid,false〉::rs).
237 lemma sem_init_current_on_match :
238 Realize ? init_current_on_match R_init_current_on_match.
240 cases (sem_seq ????? (sem_move_l ?)
241 (sem_seq ????? (sem_adv_to_mark_l ? (λc:STape.is_grid (\fst c)))
242 (sem_seq ????? (sem_move_r ?) (sem_mark ?))) intape)
243 #k * #outc * #Hloop #HR
244 @(ex_intro ?? k) @(ex_intro ?? outc) % [@Hloop] -Hloop
245 #l1 #l2 #c #rs #Hl1 #Hc #Hintape
246 cases HR -HR #ta * whd in ⊢ (%→?); #Hta lapply (Hta … Hintape) -Hta -Hintape
247 generalize in match Hl1; cases l1
248 [#Hl1 whd in ⊢ ((???(??%%%))→?); #Hta
249 * #tb * whd in ⊢ (%→?); #Htb cases (Htb … Hta) -Hta
250 [* >Hc #Htemp destruct (Htemp) ]
251 * #_ #Htc lapply (Htc [ ] 〈grid,false〉 ? (refl ??) (refl …) Hl1)
252 whd in ⊢ ((???(??%%%))→?); -Htc #Htc
253 * #td * whd in ⊢ (%→?); #Htd lapply (Htd … Htc) -Htc -Htd
254 whd in ⊢ ((???(??%%%))→?); #Htd
255 whd in ⊢ (%→?); #Houtc lapply (Houtc … Htd) -Houtc #Houtc
257 |#d #tl #Htl whd in ⊢ ((???(??%%%))→?); #Hta
258 * #tb * whd in ⊢ (%→?); #Htb cases (Htb … Hta) -Htb
259 [* >(Htl … (memb_hd …)) #Htemp destruct (Htemp)]
260 * #Hd >append_cons #Htb lapply (Htb … (refl ??) (refl …) ?)
261 [#x #membx cases (memb_append … membx) -membx #membx
262 [@Htl @memb_cons @membx | >(memb_single … membx) @Hc]]-Htb #Htb
263 * #tc * whd in ⊢ (%→?); #Htc lapply (Htc … Htb) -Htb -Htc
264 >reverse_append >associative_append whd in ⊢ ((???(??%%%))→?); #Htc
265 whd in ⊢ (%→?); #Houtc lapply (Houtc … Htc) -Houtc #Houtc
266 >Houtc >reverse_cons >associative_append %
271 definition init_current_gen ≝
272 seq ? (adv_to_mark_l ? (is_marked ?))
273 (seq ? (clear_mark ?)
275 (seq ? (adv_to_mark_l ? (λc:STape.is_grid (\fst c)))
276 (seq ? (move_r ?) (mark ?))))).
278 definition R_init_current_gen ≝ λt1,t2.
279 ∀l1,c,l2,b,l3,c1,rs,c0,b0. no_marks l1 → no_grids l2 →
280 Some ? 〈c0,b0〉 = option_hd ? (reverse ? (〈c,true〉::l2)) →
281 t1 = midtape STape (l1@〈c,true〉::l2@〈grid,b〉::l3) 〈c1,false〉 rs →
282 t2 = midtape STape (〈grid,b〉::l3) 〈c0,true〉
283 ((tail ? (reverse ? (l1@〈c,false〉::l2))@〈c1,false〉::rs)).
285 lemma sem_init_current_gen : Realize ? init_current_gen R_init_current_gen.
287 cases (sem_seq ????? (sem_adv_to_mark_l ? (is_marked ?))
288 (sem_seq ????? (sem_clear_mark ?)
289 (sem_seq ????? (sem_move_l ?)
290 (sem_seq ????? (sem_adv_to_mark_l ? (λc:STape.is_grid (\fst c)))
291 (sem_seq ????? (sem_move_r ?) (sem_mark ?))))) intape)
292 #k * #outc * #Hloop #HR
293 @(ex_intro ?? k) @(ex_intro ?? outc) % [@Hloop] -Hloop
294 #l1 #c #l2 #b #l3 #c1 #rs #c0 #b0 #Hl1 #Hl2 #Hc #Hintape
295 cases HR -HR #ta * whd in ⊢ (%→?); #Hta cases (Hta … Hintape) -Hta -Hintape
296 [ * #Hfalse normalize in Hfalse; destruct (Hfalse) ]
297 * #_ #Hta lapply (Hta l1 〈c,true〉 ? (refl ??) ??) [@Hl1|%] -Hta #Hta
298 * #tb * whd in ⊢ (%→?); #Htb lapply (Htb … Hta) -Htb -Hta #Htb
299 * #tc * whd in ⊢ (%→?); #Htc lapply (Htc … Htb) -Htc -Htb
300 generalize in match Hc; generalize in match Hl2; cases l2
301 [#_ whd in ⊢ ((???%)→?); #Htemp destruct (Htemp)
302 whd in ⊢ ((???(??%%%))→?); #Htc
303 * #td * whd in ⊢ (%→?); #Htd cases (Htd … Htc) -Htd
304 [2: * whd in ⊢ (??%?→?); #Htemp destruct (Htemp) ]
305 * #_ #Htd >Htd in Htc; -Htd #Htd
306 * #te * whd in ⊢ (%→?); #Hte lapply (Hte … Htd) -Htd
307 >reverse_append >reverse_cons
308 whd in ⊢ ((???(??%%%))→?); #Hte
309 whd in ⊢ (%→?); #Houtc lapply (Houtc … Hte) -Houtc -Hte #Houtc
311 |#d #tl #Htl #Hc0 whd in ⊢ ((???(??%%%))→?); #Htc
312 * #td * whd in ⊢ (%→?); #Htd cases (Htd … Htc) -Htd
313 [* >(Htl … (memb_hd …)) whd in ⊢ (??%?→?); #Htemp destruct (Htemp)]
314 * #Hd #Htd lapply (Htd … (refl ??) (refl ??) ?)
315 [#x #membx @Htl @memb_cons @membx] -Htd #Htd
316 * #te * whd in ⊢ (%→?); #Hte lapply (Hte … Htd) -Htd
317 >reverse_append >reverse_cons >reverse_cons
318 >reverse_cons in Hc0; >reverse_cons cases (reverse ? tl)
319 [normalize in ⊢ (%→?); #Hc0 destruct (Hc0) #Hte
320 whd in ⊢ (%→?); #Houtc lapply (Houtc … Hte) -Houtc -Hte #Houtc
322 |* #c2 #b2 #tl2 normalize in ⊢ (%→?); #Hc0 destruct (Hc0)
323 whd in ⊢ ((???(??%%%))→?); #Hte
324 whd in ⊢ (%→?); #Houtc lapply (Houtc … Hte) -Houtc -Hte #Houtc
325 >Houtc >associative_append >associative_append >associative_append %
330 definition init_current ≝
331 seq ? (adv_to_mark_l ? (is_marked ?))
332 (seq ? (clear_mark ?)
333 (seq ? (adv_to_mark_l ? (λc:STape.is_grid (\fst c)))
334 (seq ? (move_r ?) (mark ?)))).
336 definition R_init_current ≝ λt1,t2.
337 ∀l1,c,l2,b,l3,c1,rs,c0,b0. no_marks l1 → no_grids l2 → is_grid c = false →
338 Some ? 〈c0,b0〉 = option_hd ? (reverse ? (〈c,true〉::l2)) →
339 t1 = midtape STape (l1@〈c,true〉::l2@〈grid,b〉::l3) 〈c1,false〉 rs →
340 t2 = midtape STape (〈grid,b〉::l3) 〈c0,true〉
341 ((tail ? (reverse ? (l1@〈c,false〉::l2))@〈c1,false〉::rs)).
343 lemma sem_init_current : Realize ? init_current R_init_current.
345 cases (sem_seq ????? (sem_adv_to_mark_l ? (is_marked ?))
346 (sem_seq ????? (sem_clear_mark ?)
347 (sem_seq ????? (sem_adv_to_mark_l ? (λc:STape.is_grid (\fst c)))
348 (sem_seq ????? (sem_move_r ?) (sem_mark ?)))) intape)
349 #k * #outc * #Hloop #HR
350 @(ex_intro ?? k) @(ex_intro ?? outc) % [@Hloop]
351 cases HR -HR #ta * whd in ⊢ (%→?); #Hta
352 * #tb * whd in ⊢ (%→?); #Htb
353 * #tc * whd in ⊢ (%→?); #Htc
354 * #td * whd in ⊢ (%→%→?); #Htd #Houtc
355 #l1 #c #l2 #b #l3 #c1 #rs #c0 #b0 #Hl1 #Hl2 #Hc #Hc0 #Hintape
356 cases (Hta … Hintape) [ * #Hfalse normalize in Hfalse; destruct (Hfalse) ]
357 -Hta * #_ #Hta lapply (Hta l1 〈c,true〉 ? (refl ??) ??) [@Hl1|%]
358 -Hta #Hta lapply (Htb … Hta) -Htb #Htb cases (Htc … Htb) [ >Hc -Hc * #Hc destruct (Hc) ]
359 -Htc * #_ #Htc lapply (Htc … (refl ??) (refl ??) ?) [@Hl2]
360 -Htc #Htc lapply (Htd … Htc) -Htd
361 >reverse_append >reverse_cons
362 >reverse_cons in Hc0; cases (reverse … l2)
363 [ normalize in ⊢ (%→?); #Hc0 destruct (Hc0)
364 #Htd >(Houtc … Htd) %
365 | * #c2 #b2 #tl2 normalize in ⊢ (%→?);
366 #Hc0 #Htd >(Houtc … Htd)
367 whd in ⊢ (???%); destruct (Hc0)
368 >associative_append >associative_append %
372 definition match_tuple_step ≝
373 ifTM ? (test_char ? (λc:STape.¬ is_grid (\fst c)))
376 (ifTM ? (test_char ? (λc:STape.is_grid (\fst c)))
378 (seq ? mark_next_tuple
379 (ifTM ? (test_char ? (λc:STape.is_grid (\fst c)))
380 (mark ?) (seq ? (move_l ?) init_current) tc_true)) tc_true)))
383 definition R_match_tuple_step_true ≝ λt1,t2.
384 ∀ls,c,l1,l2,c1,l3,l4,rs,n.
385 bit_or_null c = true → only_bits_or_nulls l1 → no_marks l1 (* → no_grids l2 *) → bit_or_null c1 = true →
386 only_bits_or_nulls l3 → n = |l1| → |l1| = |l3| →
387 table_TM (S n) (l2@〈bar,false〉::〈c1,false〉::l3@〈comma,false〉::l4) →
388 t1 = midtape STape (〈grid,false〉::ls) 〈c,true〉
389 (l1@〈grid,false〉::l2@〈bar,false〉::〈c1,true〉::l3@〈comma,false〉::l4@〈grid,false〉::rs) →
391 (〈c,false〉::l1 = 〈c1,false〉::l3 ∧
392 t2 = midtape ? (reverse ? l1@〈c,false〉::〈grid,false〉::ls) 〈grid,false〉
393 (l2@〈bar,false〉::〈c1,false〉::l3@〈comma,true〉::l4@〈grid,false〉::rs))
395 (* non facciamo match e marchiamo la prossima tupla *)
396 ((〈c,false〉::l1 ≠ 〈c1,false〉::l3 ∧
397 ∃c2,l5,l6.l4 = l5@〈bar,false〉::〈c2,false〉::l6 ∧
398 (* condizioni su l5 l6 l7 *)
399 t2 = midtape STape (〈grid,false〉::ls) 〈c,true〉
400 (l1@〈grid,false〉::l2@〈bar,false〉::〈c1,false〉::l3@〈comma,false〉::
401 l5@〈bar,false〉::〈c2,true〉::l6@〈grid,false〉::rs))
403 (* non facciamo match e non c'è una prossima tupla:
404 non specifichiamo condizioni sul nastro di output, perché
405 non eseguiremo altre operazioni, quindi il suo formato non ci interessa *)
406 (〈c,false〉::l1 ≠ 〈c1,false〉::l3 ∧ no_bars l4 ∧ current ? t2 = Some ? 〈grid,true〉)).
408 definition R_match_tuple_step_false ≝ λt1,t2.
409 ∀ls,c,rs.t1 = midtape STape ls c rs → is_grid (\fst c) = true ∧ t2 = t1.
411 include alias "basics/logic.ma".
414 lemma eq_f4: ∀A1,A2,A3,A4,B.∀f:A1 → A2 →A3 →A4 →B.
415 ∀x1,x2,x3,x4,y1,y2,y3,y4. x1 = y1 → x2 = y2 →x3=y3 →x4 = y4 →
416 f x1 x2 x3 x4 = f y1 y2 y3 y4.
420 lemma some_option_hd: ∀A.∀l:list A.∀a.∃b.
421 Some ? b = option_hd ? (l@[a]) .
422 #A #l #a cases l normalize /2/
425 axiom tech_split2 : ∀A,l1,l2,l3,l4,x.
426 memb A x l1 = false → memb ? x l3 = false →
427 l1@x::l2 = l3@x::l4 → l1 = l3 ∧ l2 = l4.
429 axiom injective_append : ∀A,l.injective … (λx.append A x l).
431 lemma sem_match_tuple_step:
432 accRealize ? match_tuple_step (inr … (inl … (inr … 0)))
433 R_match_tuple_step_true R_match_tuple_step_false.
434 @(acc_sem_if_app … (sem_test_char ? (λc:STape.¬ is_grid (\fst c))) …
435 (sem_seq … sem_compare
436 (sem_if … (sem_test_char ? (λc:STape.is_grid (\fst c)))
438 (sem_seq … sem_mark_next_tuple
439 (sem_if … (sem_test_char ? (λc:STape.is_grid (\fst c)))
440 (sem_mark ?) (sem_seq … (sem_move_l …) (sem_init_current …))))))
442 [(* is_grid: termination case *)
443 2:#t1 #t2 #t3 whd in ⊢ (%→?); #H #H1 whd #ls #c #rs #Ht1
444 cases (H c ?) [2: >Ht1 %] #Hgrid #Heq %
445 [@injective_notb @Hgrid | <Heq @H1]
446 |#tapea #tapeout #tapeb whd in ⊢ (%→?); #Htapea
447 * #tapec * #Hcompare #Hor
448 #ls #c #l1 #l2 #c1 #l3 #l4 #rs #n #Hc #Hl1bars #Hl1marks #Hc1 #Hl3 #eqn
449 #eqlen #Htable #Htapea1 cases (Htapea 〈c,true〉 ?) >Htapea1 [2:%]
450 #notgridc -Htapea -Htapea1 -tapea #Htapeb
451 cases (Hcompare … Htapeb) -Hcompare -Htapeb * #_ #_ #Hcompare
452 cases (Hcompare c c1 l1 l3 (l2@[〈bar,false〉]) (l4@〈grid,false〉::rs) eqlen Hl1bars Hl3 Hl1marks … (refl …) Hc ?)
454 [* #Htemp destruct (Htemp) #Htapec %1 % [%]
455 >Htapec in Hor; -Htapec *
456 [2: * #t3 * whd in ⊢ (%→?); #H @False_ind
457 cases (H … (refl …)) whd in ⊢ ((??%?)→?); #H destruct (H)
458 |* #taped * whd in ⊢ (%→?); #Htaped cases (Htaped ? (refl …)) -Htaped *
459 #Htaped whd in ⊢ (%→?); #Htapeout >Htapeout >Htaped >associative_append
462 |* #la * #c' * #d' * #lb * #lc * * * #H1 #H2 #H3 #Htapec
463 cut (〈c,false〉::l1 ≠ 〈c1,false〉::l3)
465 [@(not_to_not …H1) normalize #H destruct %
466 |#x #tl @not_to_not normalize #H destruct //
469 cut (bit_or_null d' = true)
471 [normalize in ⊢ (%→?); #H destruct //
472 |#x #tl #H @(Hl3 〈d',false〉)
473 normalize in H; destruct @memb_append_l2 @memb_hd
476 >Htapec in Hor; -Htapec *
477 [* #taped * whd in ⊢ (%→?); #H @False_ind
478 cases (H … (refl …)) >(bit_or_null_not_grid ? Hd') #Htemp destruct (Htemp)
479 |* #taped * whd in ⊢ (%→?); #H cases (H … (refl …)) -H #_
480 #Htaped * #tapee * whd in ⊢ (%→?); #Htapee
481 <(associative_append ? lc (〈comma,false〉::l4)) in Htaped; #Htaped
482 cases (Htapee … Htaped ???) -Htaped -Htapee
483 [* #rs3 * * (* we proceed by cases on rs4 *)
484 [(* rs4 is empty : the case is absurd since the tape
485 cannot end with a bar *)
486 * #d * #b * * * #Heq1 @False_ind
487 cut (∀A,l1,l2.∀a:A. a::l1@l2=(a::l1)@l2) [//] #Hcut
488 >Hcut in Htable; >H3 >associative_append
489 normalize >Heq1 >Hcut <associative_append >Hcut
490 <associative_append #Htable @(absurd … Htable)
493 * #d2 #b2 #rs3' * #d * #b * * * #Heq1 #Hnobars
494 cut (memb STape 〈d2,b2〉 (l2@〈bar,false〉::〈c1,false〉::l3@〈comma,false〉::l4) = true)
495 [@memb_append_l2 @memb_cons
496 cut (∀A,l1,l2.∀a:A. a::l1@l2=(a::l1)@l2) [//] #Hcut
497 >Hcut >H3 >associative_append @memb_append_l2
498 @memb_cons >Heq1 @memb_append_l2 @memb_cons @memb_hd] #d2intable
499 cut (is_grid d2 = false)
500 [@(no_grids_in_table … Htable … 〈d2,b2〉 d2intable)] #Hd2
502 [@(no_marks_in_table … Htable … 〈d2,b2〉 d2intable)] #Hb2
503 >Hb2 in Heq1; #Heq1 -Hb2 -b2
504 whd in ⊢ ((???%)→?); #Htemp destruct (Htemp) #Htapee >Htapee -Htapee *
505 [(* we know current is not grid *)
506 * #tapef * whd in ⊢ (%→?); #Htapef
507 cases (Htapef … (refl …)) >Hd2 #Htemp destruct (Htemp)
508 |* #tapef * whd in ⊢ (%→?); #Htapef
509 cases (Htapef … (refl …)) #_ -Htapef #Htapef
510 * #tapeg >Htapef -Htapef *
513 #H lapply (H … (refl …)) whd in ⊢ (???%→?); -H #Htapeg
516 whd in ⊢ (%→?); #Htapeout
517 %1 cases (some_option_hd ? (reverse ? (reverse ? la)) 〈c',true〉)
520 (Htapeout (reverse ? rs3 @〈d',false〉::reverse ? la@reverse ? (l2@[〈bar,false〉])@(〈grid,false〉::reverse ? lb))
521 c' (reverse ? la) false ls bar (〈d2,true〉::rs3'@〈grid,false〉::rs) c00 b00 ?????) -Htapeout
522 [whd in ⊢ (??(??%??)?); @eq_f3 [2:%|3: %]
524 generalize in match (〈c',true〉::reverse ? la@〈grid,false〉::ls); #l
525 whd in ⊢ (???(???%)); >associative_append >associative_append %
526 |>reverse_cons @Hoption
528 [normalize in ⊢ (%→?); #Htemp destruct (Htemp)
529 @injective_notb @notgridc
530 |#x #tl normalize in ⊢ (%→?); #Htemp destruct (Htemp)
531 @bit_or_null_not_grid @(Hl1bars 〈c',false〉) @memb_append_l2 @memb_hd
533 |cut (only_bits_or_nulls (la@(〈c',false〉::lb)))
534 [<H2 whd #c0 #Hmemb cases (orb_true_l … Hmemb)
535 [#eqc0 >(\P eqc0) @Hc |@Hl1bars]
536 |#Hl1' #x #Hx @bit_or_null_not_grid @Hl1'
537 @memb_append_l1 @daemon
540 |>reverse_append >reverse_cons >reverse_reverse
541 >reverse_append >reverse_reverse
542 >reverse_cons >reverse_append >reverse_reverse
543 >reverse_append >reverse_cons >reverse_reverse
545 #Htapeout % [@Hnoteq]
547 cut (∃rs32.rs3 = lc@〈comma,false〉::rs32)
548 [ (*cases (tech_split STape (λc.c == 〈bar,false〉) l4)
550 | * #l41 * * #cbar #bfalse * #l42 * * #Hbar #Hl4 #Hl41
551 @(ex_intro ?? l41) >Hl4 in Heq1; #Heq1
553 cut (sublist … lc l3)
554 [ #x #Hx cases la in H3;
555 [ normalize #H3 destruct (H3) @Hx
556 | #p #la' normalize #Hla' destruct (Hla')
557 @memb_append_l2 @memb_cons @Hx ] ] #Hsublist*)
561 (〈c1,false〉::l3@〈comma,false〉::l4= la@〈d',false〉::rs3@〈bar,false〉::〈d2,b2〉::rs3')
563 cut (l4=rs32@〈bar,false〉::〈d2,false〉::rs3')
564 [ >Hrs3 in Heq1; @daemon ] #Hl4
565 @(ex_intro … rs32) @(ex_intro … rs3') %
569 |(*>Hrs3 *)>append_cons
570 > (?:l1@〈grid,false〉::l2@〈bar,false〉::〈c1,false〉::l3@〈comma,false〉::rs32@〈bar,false〉::〈d2,true〉::rs3'@〈grid,false〉::rs
571 = (l1@〈grid,false〉::l2@〈bar,false〉::〈c1,false〉::l3@〈comma,false〉::rs32@[〈bar,false〉])@〈d2,true〉::rs3'@〈grid,false〉::rs)
572 [|>associative_append normalize
573 >associative_append normalize
574 >associative_append normalize
575 >associative_append normalize
578 @(injective_append … (〈d2,false〉::rs3'))
579 >(?:(la@[〈c',false〉])@((((lb@[〈grid,false〉])@l2@[〈bar,false〉])@la)@[〈d',false〉])@rs3
580 =((la@〈c',false〉::lb)@([〈grid,false〉]@l2@[〈bar,false〉]@la@[〈d',false〉]@rs3)))
581 [|>associative_append >associative_append
582 >associative_append >associative_append >associative_append
583 >associative_append >associative_append % ]
584 <H2 normalize (* <Hrs3 *)
585 >associative_append >associative_append >associative_append
586 @eq_f normalize @eq_f >associative_append
587 >associative_append @eq_f normalize @eq_f
588 >(append_cons ? 〈d',false〉) >associative_append
589 <Heq1 >Hl4 <associative_append <append_cons
591 >associative_append normalize
592 >associative_append normalize %
598 |* #Hnobars #Htapee >Htapee -Htapee *
599 [whd in ⊢ (%→?); * #tapef * whd in ⊢ (%→?); #Htapef
600 cases (Htapef … (refl …)) -Htapef #_ #Htapef >Htapef -Htapef
601 whd in ⊢ (%→?); #Htapeout %2
602 >(Htapeout … (refl …)) %
605 | whd #x #Hx @Hnobars @memb_append_l2 @memb_cons //
609 |whd in ⊢ (%→?); * #tapef * whd in ⊢ (%→?); #Htapef
610 cases (Htapef … (refl …)) -Htapef
611 whd in ⊢ ((??%?)→?); #Htemp destruct (Htemp)
613 |(* no marks in table *)
614 #x #membx @(no_marks_in_table … Htable)
615 @memb_append_l2 @memb_cons
616 cut (∀A,l1,l2.∀a:A. a::l1@l2=(a::l1)@l2) [//] #Hcut >Hcut
617 >H3 >associative_append @memb_append_l2 @memb_cons @membx
618 |(* no grids in table *)
619 #x #membx @(no_grids_in_table … Htable)
620 @memb_append_l2 @memb_cons
621 cut (∀A,l1,l2.∀a:A. a::l1@l2=(a::l1)@l2) [//] #Hcut >Hcut
622 >H3 >associative_append @memb_append_l2 @memb_cons @membx
623 |whd in ⊢ (??%?); >(bit_or_null_not_grid … Hd') >(bit_or_null_not_bar … Hd') %
626 |#x #membx @(no_marks_in_table … Htable)
627 @memb_append_l2 @memb_cons @memb_cons @memb_append_l1 @membx
628 |#x #membx @(no_marks_in_table … Htable)
629 cases (memb_append … membx) -membx #membx
630 [@memb_append_l1 @membx | @memb_append_l2 >(memb_single … membx) @memb_hd]
631 |>associative_append %
640 scrolls through the tuples in the transition table until one matching the
641 current configuration is found
644 definition match_tuple ≝ whileTM ? match_tuple_step (inr … (inl … (inr … 0))).
646 definition R_match_tuple ≝ λt1,t2.
648 is_bit c = true → only_bits_or_nulls l1 → is_bit c1 = true → n = |l1| →
649 table_TM (S n) (〈c1,false〉::l2) →
650 t1 = midtape STape (〈grid,false〉::ls) 〈c,true〉
651 (l1@〈grid,false〉::〈c1,true〉::l2@〈grid,false〉::rs) →
654 〈c1,false〉::l2 = l3@〈c,false〉::l1@〈comma,false〉::newc@〈comma,false〉::mv@l4 ∧
655 t2 = midtape ? (reverse ? l1@〈c,false〉::〈grid,false〉::ls) 〈grid,false〉
656 (l3@〈c,false〉::l1@〈comma,true〉::newc@〈comma,false〉::mv@l4@〈grid,false〉::rs))
658 (* non facciamo match su nessuna tupla;
659 non specifichiamo condizioni sul nastro di output, perché
660 non eseguiremo altre operazioni, quindi il suo formato non ci interessa *)
661 (current ? t2 = Some ? 〈grid,true〉 ∧
663 〈c1,false〉::l2 ≠ l3@〈c,false〉::l1@〈comma,false〉::newc@〈comma,false〉::mv@l4).