|
587
|
1 |
theory BasicIdentities
|
|
|
2 |
imports "Lexer"
|
|
|
3 |
begin
|
|
|
4 |
|
|
|
5 |
datatype rrexp =
|
|
|
6 |
RZERO
|
|
|
7 |
| RONE
|
|
|
8 |
| RCHAR char
|
|
|
9 |
| RSEQ rrexp rrexp
|
|
|
10 |
| RALTS "rrexp list"
|
|
|
11 |
| RSTAR rrexp
|
|
|
12 |
| RNTIMES rrexp nat
|
|
|
13 |
|
|
|
14 |
abbreviation
|
|
|
15 |
"RALT r1 r2 \<equiv> RALTS [r1, r2]"
|
|
|
16 |
|
|
|
17 |
|
|
|
18 |
fun
|
|
|
19 |
rnullable :: "rrexp \<Rightarrow> bool"
|
|
|
20 |
where
|
|
|
21 |
"rnullable (RZERO) = False"
|
|
|
22 |
| "rnullable (RONE) = True"
|
|
|
23 |
| "rnullable (RCHAR c) = False"
|
|
|
24 |
| "rnullable (RALTS rs) = (\<exists>r \<in> set rs. rnullable r)"
|
|
|
25 |
| "rnullable (RSEQ r1 r2) = (rnullable r1 \<and> rnullable r2)"
|
|
|
26 |
| "rnullable (RSTAR r) = True"
|
|
|
27 |
| "rnullable (RNTIMES r n) = (if n = 0 then True else rnullable r)"
|
|
|
28 |
|
|
|
29 |
fun
|
|
|
30 |
rder :: "char \<Rightarrow> rrexp \<Rightarrow> rrexp"
|
|
|
31 |
where
|
|
|
32 |
"rder c (RZERO) = RZERO"
|
|
|
33 |
| "rder c (RONE) = RZERO"
|
|
|
34 |
| "rder c (RCHAR d) = (if c = d then RONE else RZERO)"
|
|
|
35 |
| "rder c (RALTS rs) = RALTS (map (rder c) rs)"
|
|
|
36 |
| "rder c (RSEQ r1 r2) =
|
|
|
37 |
(if rnullable r1
|
|
|
38 |
then RALT (RSEQ (rder c r1) r2) (rder c r2)
|
|
|
39 |
else RSEQ (rder c r1) r2)"
|
|
|
40 |
| "rder c (RSTAR r) = RSEQ (rder c r) (RSTAR r)"
|
|
|
41 |
| "rder c (RNTIMES r n) = (if n = 0 then RZERO else RSEQ (rder c r) (RNTIMES r (n - 1)))"
|
|
|
42 |
|
|
|
43 |
fun
|
|
|
44 |
rders :: "rrexp \<Rightarrow> string \<Rightarrow> rrexp"
|
|
|
45 |
where
|
|
|
46 |
"rders r [] = r"
|
|
|
47 |
| "rders r (c#s) = rders (rder c r) s"
|
|
|
48 |
|
|
|
49 |
fun rdistinct :: "'a list \<Rightarrow>'a set \<Rightarrow> 'a list"
|
|
|
50 |
where
|
|
|
51 |
"rdistinct [] acc = []"
|
|
|
52 |
| "rdistinct (x#xs) acc =
|
|
|
53 |
(if x \<in> acc then rdistinct xs acc
|
|
|
54 |
else x # (rdistinct xs ({x} \<union> acc)))"
|
|
|
55 |
|
|
|
56 |
lemma rdistinct1:
|
|
|
57 |
assumes "a \<in> acc"
|
|
|
58 |
shows "a \<notin> set (rdistinct rs acc)"
|
|
|
59 |
using assms
|
|
|
60 |
apply(induct rs arbitrary: acc a)
|
|
|
61 |
apply(auto)
|
|
|
62 |
done
|
|
|
63 |
|
|
|
64 |
|
|
|
65 |
lemma rdistinct_does_the_job:
|
|
|
66 |
shows "distinct (rdistinct rs s)"
|
|
|
67 |
apply(induct rs s rule: rdistinct.induct)
|
|
|
68 |
apply(auto simp add: rdistinct1)
|
|
|
69 |
done
|
|
|
70 |
|
|
|
71 |
|
|
|
72 |
|
|
|
73 |
lemma rdistinct_concat:
|
|
|
74 |
assumes "set rs \<subseteq> rset"
|
|
|
75 |
shows "rdistinct (rs @ rsa) rset = rdistinct rsa rset"
|
|
|
76 |
using assms
|
|
|
77 |
apply(induct rs)
|
|
|
78 |
apply simp+
|
|
|
79 |
done
|
|
|
80 |
|
|
|
81 |
lemma distinct_not_exist:
|
|
|
82 |
assumes "a \<notin> set rs"
|
|
|
83 |
shows "rdistinct rs rset = rdistinct rs (insert a rset)"
|
|
|
84 |
using assms
|
|
|
85 |
apply(induct rs arbitrary: rset)
|
|
|
86 |
apply(auto)
|
|
|
87 |
done
|
|
|
88 |
|
|
|
89 |
lemma rdistinct_on_distinct:
|
|
|
90 |
shows "distinct rs \<Longrightarrow> rdistinct rs {} = rs"
|
|
|
91 |
apply(induct rs)
|
|
|
92 |
apply simp
|
|
|
93 |
using distinct_not_exist by fastforce
|
|
|
94 |
|
|
|
95 |
lemma distinct_rdistinct_append:
|
|
|
96 |
assumes "distinct rs1" "\<forall>r \<in> set rs1. r \<notin> acc"
|
|
|
97 |
shows "rdistinct (rs1 @ rsa) acc = rs1 @ (rdistinct rsa (acc \<union> set rs1))"
|
|
|
98 |
using assms
|
|
|
99 |
apply(induct rs1 arbitrary: rsa acc)
|
|
|
100 |
apply(auto)[1]
|
|
|
101 |
apply(auto)[1]
|
|
|
102 |
apply(drule_tac x="rsa" in meta_spec)
|
|
|
103 |
apply(drule_tac x="{a} \<union> acc" in meta_spec)
|
|
|
104 |
apply(simp)
|
|
|
105 |
apply(drule meta_mp)
|
|
|
106 |
apply(auto)[1]
|
|
|
107 |
apply(simp)
|
|
|
108 |
done
|
|
|
109 |
|
|
|
110 |
|
|
|
111 |
lemma rdistinct_set_equality1:
|
|
|
112 |
shows "set (rdistinct rs acc) = set rs - acc"
|
|
|
113 |
apply(induct rs acc rule: rdistinct.induct)
|
|
|
114 |
apply(auto)
|
|
|
115 |
done
|
|
|
116 |
|
|
|
117 |
|
|
|
118 |
lemma rdistinct_set_equality:
|
|
|
119 |
shows "set (rdistinct rs {}) = set rs"
|
|
|
120 |
by (simp add: rdistinct_set_equality1)
|
|
|
121 |
|
|
|
122 |
|
|
611
|
123 |
lemma distinct_removes_middle:
|
|
|
124 |
shows "\<lbrakk>a \<in> set as\<rbrakk>
|
|
|
125 |
\<Longrightarrow> rdistinct (as @ as2) rset = rdistinct (as @ [a] @ as2) rset"
|
|
|
126 |
and "rdistinct (ab # as @ [ab] @ as3) rset1 = rdistinct (ab # as @ as3) rset1"
|
|
|
127 |
apply(induct as arbitrary: rset rset1 ab as2 as3 a)
|
|
|
128 |
apply simp
|
|
|
129 |
apply simp
|
|
|
130 |
apply(case_tac "a \<in> rset")
|
|
|
131 |
apply simp
|
|
|
132 |
apply metis
|
|
|
133 |
apply simp
|
|
|
134 |
apply (metis insertI1)
|
|
|
135 |
apply(case_tac "a = ab")
|
|
|
136 |
apply simp
|
|
|
137 |
apply(case_tac "ab \<in> rset")
|
|
|
138 |
apply simp
|
|
|
139 |
apply presburger
|
|
|
140 |
apply (meson insertI1)
|
|
|
141 |
apply(case_tac "a \<in> rset")
|
|
|
142 |
apply (metis (no_types, opaque_lifting) Un_insert_left append_Cons insert_iff rdistinct.simps(2) sup_bot_left)
|
|
|
143 |
apply(case_tac "ab \<in> rset")
|
|
|
144 |
apply simp
|
|
|
145 |
apply (meson insert_iff)
|
|
|
146 |
apply simp
|
|
|
147 |
by (metis insertI1)
|
|
|
148 |
|
|
|
149 |
lemma distinct_removes_middle3:
|
|
|
150 |
shows "\<lbrakk>a \<in> set as\<rbrakk>
|
|
|
151 |
\<Longrightarrow> rdistinct (as @ a #as2) rset = rdistinct (as @ as2) rset"
|
|
|
152 |
using distinct_removes_middle(1) by fastforce
|
|
|
153 |
|
|
|
154 |
lemma last_elem_out:
|
|
|
155 |
shows "\<lbrakk>x \<notin> set xs; x \<notin> rset \<rbrakk> \<Longrightarrow> rdistinct (xs @ [x]) rset = rdistinct xs rset @ [x]"
|
|
|
156 |
apply(induct xs arbitrary: rset)
|
|
|
157 |
apply simp+
|
|
|
158 |
done
|
|
|
159 |
|
|
|
160 |
|
|
|
161 |
|
|
|
162 |
|
|
|
163 |
lemma rdistinct_concat_general:
|
|
|
164 |
shows "rdistinct (rs1 @ rs2) {} = (rdistinct rs1 {}) @ (rdistinct rs2 (set rs1))"
|
|
|
165 |
apply(induct rs1 arbitrary: rs2 rule: rev_induct)
|
|
|
166 |
apply simp
|
|
|
167 |
apply(drule_tac x = "x # rs2" in meta_spec)
|
|
|
168 |
apply simp
|
|
|
169 |
apply(case_tac "x \<in> set xs")
|
|
|
170 |
apply simp
|
|
|
171 |
|
|
|
172 |
apply (simp add: distinct_removes_middle3 insert_absorb)
|
|
|
173 |
apply simp
|
|
|
174 |
by (simp add: last_elem_out)
|
|
|
175 |
|
|
|
176 |
|
|
|
177 |
lemma distinct_once_enough:
|
|
|
178 |
shows "rdistinct (rs @ rsa) {} = rdistinct (rdistinct rs {} @ rsa) {}"
|
|
|
179 |
apply(subgoal_tac "distinct (rdistinct rs {})")
|
|
|
180 |
apply(subgoal_tac
|
|
|
181 |
" rdistinct (rdistinct rs {} @ rsa) {} = rdistinct rs {} @ (rdistinct rsa (set rs))")
|
|
|
182 |
apply(simp only:)
|
|
|
183 |
using rdistinct_concat_general apply blast
|
|
|
184 |
apply (simp add: distinct_rdistinct_append rdistinct_set_equality1)
|
|
|
185 |
by (simp add: rdistinct_does_the_job)
|
|
|
186 |
|
|
|
187 |
|
|
587
|
188 |
fun rflts :: "rrexp list \<Rightarrow> rrexp list"
|
|
|
189 |
where
|
|
|
190 |
"rflts [] = []"
|
|
|
191 |
| "rflts (RZERO # rs) = rflts rs"
|
|
|
192 |
| "rflts ((RALTS rs1) # rs) = rs1 @ rflts rs"
|
|
|
193 |
| "rflts (r1 # rs) = r1 # rflts rs"
|
|
|
194 |
|
|
|
195 |
|
|
|
196 |
lemma rflts_def_idiot:
|
|
|
197 |
shows "\<lbrakk> a \<noteq> RZERO; \<nexists>rs1. a = RALTS rs1\<rbrakk> \<Longrightarrow> rflts (a # rs) = a # rflts rs"
|
|
|
198 |
apply(case_tac a)
|
|
|
199 |
apply simp_all
|
|
|
200 |
done
|
|
|
201 |
|
|
|
202 |
lemma rflts_def_idiot2:
|
|
|
203 |
shows "\<lbrakk>a \<noteq> RZERO; \<nexists>rs1. a = RALTS rs1; a \<in> set rs\<rbrakk> \<Longrightarrow> a \<in> set (rflts rs)"
|
|
|
204 |
apply(induct rs rule: rflts.induct)
|
|
|
205 |
apply(auto)
|
|
|
206 |
done
|
|
|
207 |
|
|
|
208 |
lemma flts_append:
|
|
|
209 |
shows "rflts (rs1 @ rs2) = rflts rs1 @ rflts rs2"
|
|
|
210 |
apply(induct rs1)
|
|
|
211 |
apply simp
|
|
|
212 |
apply(case_tac a)
|
|
|
213 |
apply simp+
|
|
|
214 |
done
|
|
|
215 |
|
|
|
216 |
|
|
|
217 |
fun rsimp_ALTs :: " rrexp list \<Rightarrow> rrexp"
|
|
|
218 |
where
|
|
|
219 |
"rsimp_ALTs [] = RZERO"
|
|
|
220 |
| "rsimp_ALTs [r] = r"
|
|
|
221 |
| "rsimp_ALTs rs = RALTS rs"
|
|
|
222 |
|
|
|
223 |
lemma rsimpalts_conscons:
|
|
|
224 |
shows "rsimp_ALTs (r1 # rsa @ r2 # rsb) = RALTS (r1 # rsa @ r2 # rsb)"
|
|
|
225 |
by (metis Nil_is_append_conv list.exhaust rsimp_ALTs.simps(3))
|
|
|
226 |
|
|
|
227 |
lemma rsimp_alts_equal:
|
|
|
228 |
shows "rsimp_ALTs (rsa @ a # rsb @ a # rsc) = RALTS (rsa @ a # rsb @ a # rsc) "
|
|
|
229 |
by (metis append_Cons append_Nil neq_Nil_conv rsimpalts_conscons)
|
|
|
230 |
|
|
|
231 |
|
|
|
232 |
fun rsimp_SEQ :: " rrexp \<Rightarrow> rrexp \<Rightarrow> rrexp"
|
|
|
233 |
where
|
|
|
234 |
"rsimp_SEQ RZERO _ = RZERO"
|
|
|
235 |
| "rsimp_SEQ _ RZERO = RZERO"
|
|
|
236 |
| "rsimp_SEQ RONE r2 = r2"
|
|
|
237 |
| "rsimp_SEQ r1 r2 = RSEQ r1 r2"
|
|
|
238 |
|
|
|
239 |
|
|
|
240 |
fun rsimp :: "rrexp \<Rightarrow> rrexp"
|
|
|
241 |
where
|
|
|
242 |
"rsimp (RSEQ r1 r2) = rsimp_SEQ (rsimp r1) (rsimp r2)"
|
|
|
243 |
| "rsimp (RALTS rs) = rsimp_ALTs (rdistinct (rflts (map rsimp rs)) {}) "
|
|
|
244 |
| "rsimp r = r"
|
|
|
245 |
|
|
|
246 |
|
|
|
247 |
fun
|
|
|
248 |
rders_simp :: "rrexp \<Rightarrow> string \<Rightarrow> rrexp"
|
|
|
249 |
where
|
|
|
250 |
"rders_simp r [] = r"
|
|
|
251 |
| "rders_simp r (c#s) = rders_simp (rsimp (rder c r)) s"
|
|
|
252 |
|
|
|
253 |
fun rsize :: "rrexp \<Rightarrow> nat" where
|
|
|
254 |
"rsize RZERO = 1"
|
|
|
255 |
| "rsize (RONE) = 1"
|
|
|
256 |
| "rsize (RCHAR c) = 1"
|
|
|
257 |
| "rsize (RALTS rs) = Suc (sum_list (map rsize rs))"
|
|
|
258 |
| "rsize (RSEQ r1 r2) = Suc (rsize r1 + rsize r2)"
|
|
|
259 |
| "rsize (RSTAR r) = Suc (rsize r)"
|
|
|
260 |
| "rsize (RNTIMES r n) = Suc (rsize r) + n"
|
|
|
261 |
|
|
|
262 |
abbreviation rsizes where
|
|
|
263 |
"rsizes rs \<equiv> sum_list (map rsize rs)"
|
|
|
264 |
|
|
|
265 |
|
|
|
266 |
lemma rder_rsimp_ALTs_commute:
|
|
|
267 |
shows " (rder x (rsimp_ALTs rs)) = rsimp_ALTs (map (rder x) rs)"
|
|
|
268 |
apply(induct rs)
|
|
|
269 |
apply simp
|
|
|
270 |
apply(case_tac rs)
|
|
|
271 |
apply simp
|
|
|
272 |
apply auto
|
|
|
273 |
done
|
|
|
274 |
|
|
|
275 |
|
|
|
276 |
lemma rsimp_aalts_smaller:
|
|
|
277 |
shows "rsize (rsimp_ALTs rs) \<le> rsize (RALTS rs)"
|
|
|
278 |
apply(induct rs)
|
|
|
279 |
apply simp
|
|
|
280 |
apply simp
|
|
|
281 |
apply(case_tac "rs = []")
|
|
|
282 |
apply simp
|
|
|
283 |
apply(subgoal_tac "\<exists>rsp ap. rs = ap # rsp")
|
|
|
284 |
apply(erule exE)+
|
|
|
285 |
apply simp
|
|
|
286 |
apply simp
|
|
|
287 |
by(meson neq_Nil_conv)
|
|
|
288 |
|
|
|
289 |
|
|
|
290 |
|
|
|
291 |
|
|
|
292 |
|
|
|
293 |
lemma rSEQ_mono:
|
|
|
294 |
shows "rsize (rsimp_SEQ r1 r2) \<le>rsize (RSEQ r1 r2)"
|
|
|
295 |
apply auto
|
|
|
296 |
apply(induct r1)
|
|
|
297 |
apply auto
|
|
|
298 |
apply(case_tac "r2")
|
|
|
299 |
apply simp_all
|
|
|
300 |
apply(case_tac r2)
|
|
|
301 |
apply simp_all
|
|
|
302 |
apply(case_tac r2)
|
|
|
303 |
apply simp_all
|
|
|
304 |
apply(case_tac r2)
|
|
|
305 |
apply simp_all
|
|
|
306 |
apply(case_tac r2)
|
|
|
307 |
apply simp_all
|
|
|
308 |
apply(case_tac r2)
|
|
|
309 |
apply simp_all
|
|
|
310 |
done
|
|
|
311 |
|
|
|
312 |
lemma ralts_cap_mono:
|
|
|
313 |
shows "rsize (RALTS rs) \<le> Suc (rsizes rs)"
|
|
|
314 |
by simp
|
|
|
315 |
|
|
|
316 |
|
|
|
317 |
|
|
|
318 |
|
|
|
319 |
lemma rflts_mono:
|
|
|
320 |
shows "rsizes (rflts rs) \<le> rsizes rs"
|
|
|
321 |
apply(induct rs)
|
|
|
322 |
apply simp
|
|
|
323 |
apply(case_tac "a = RZERO")
|
|
|
324 |
apply simp
|
|
|
325 |
apply(case_tac "\<exists>rs1. a = RALTS rs1")
|
|
|
326 |
apply(erule exE)
|
|
|
327 |
apply simp
|
|
|
328 |
apply(subgoal_tac "rflts (a # rs) = a # (rflts rs)")
|
|
|
329 |
prefer 2
|
|
|
330 |
|
|
|
331 |
using rflts_def_idiot apply blast
|
|
|
332 |
apply simp
|
|
|
333 |
done
|
|
|
334 |
|
|
|
335 |
lemma rdistinct_smaller:
|
|
|
336 |
shows "rsizes (rdistinct rs ss) \<le> rsizes rs"
|
|
|
337 |
apply (induct rs arbitrary: ss)
|
|
|
338 |
apply simp
|
|
|
339 |
by (simp add: trans_le_add2)
|
|
|
340 |
|
|
|
341 |
|
|
|
342 |
lemma rsimp_alts_mono :
|
|
|
343 |
shows "\<And>x. (\<And>xa. xa \<in> set x \<Longrightarrow> rsize (rsimp xa) \<le> rsize xa) \<Longrightarrow>
|
|
|
344 |
rsize (rsimp_ALTs (rdistinct (rflts (map rsimp x)) {})) \<le> Suc (rsizes x)"
|
|
|
345 |
apply(subgoal_tac "rsize (rsimp_ALTs (rdistinct (rflts (map rsimp x)) {} ))
|
|
|
346 |
\<le> rsize (RALTS (rdistinct (rflts (map rsimp x)) {} ))")
|
|
|
347 |
prefer 2
|
|
|
348 |
using rsimp_aalts_smaller apply auto[1]
|
|
|
349 |
apply(subgoal_tac "rsize (RALTS (rdistinct (rflts (map rsimp x)) {})) \<le>Suc (rsizes (rdistinct (rflts (map rsimp x)) {}))")
|
|
|
350 |
prefer 2
|
|
|
351 |
using ralts_cap_mono apply blast
|
|
|
352 |
apply(subgoal_tac "rsizes (rdistinct (rflts (map rsimp x)) {}) \<le> rsizes (rflts (map rsimp x))")
|
|
|
353 |
prefer 2
|
|
|
354 |
using rdistinct_smaller apply presburger
|
|
|
355 |
apply(subgoal_tac "rsizes (rflts (map rsimp x)) \<le> rsizes (map rsimp x)")
|
|
|
356 |
prefer 2
|
|
|
357 |
using rflts_mono apply blast
|
|
|
358 |
apply(subgoal_tac "rsizes (map rsimp x) \<le> rsizes x")
|
|
|
359 |
prefer 2
|
|
|
360 |
|
|
|
361 |
apply (simp add: sum_list_mono)
|
|
|
362 |
by linarith
|
|
|
363 |
|
|
|
364 |
|
|
|
365 |
|
|
|
366 |
|
|
|
367 |
|
|
|
368 |
lemma rsimp_mono:
|
|
|
369 |
shows "rsize (rsimp r) \<le> rsize r"
|
|
|
370 |
apply(induct r)
|
|
|
371 |
apply simp_all
|
|
|
372 |
apply(subgoal_tac "rsize (rsimp_SEQ (rsimp r1) (rsimp r2)) \<le> rsize (RSEQ (rsimp r1) (rsimp r2))")
|
|
|
373 |
apply force
|
|
|
374 |
using rSEQ_mono
|
|
|
375 |
apply presburger
|
|
|
376 |
using rsimp_alts_mono by auto
|
|
|
377 |
|
|
|
378 |
lemma idiot:
|
|
|
379 |
shows "rsimp_SEQ RONE r = r"
|
|
|
380 |
apply(case_tac r)
|
|
|
381 |
apply simp_all
|
|
|
382 |
done
|
|
|
383 |
|
|
|
384 |
|
|
|
385 |
|
|
|
386 |
|
|
|
387 |
|
|
|
388 |
lemma idiot2:
|
|
|
389 |
shows " \<lbrakk>r1 \<noteq> RZERO; r1 \<noteq> RONE;r2 \<noteq> RZERO\<rbrakk>
|
|
|
390 |
\<Longrightarrow> rsimp_SEQ r1 r2 = RSEQ r1 r2"
|
|
|
391 |
apply(case_tac r1)
|
|
|
392 |
apply(case_tac r2)
|
|
|
393 |
apply simp_all
|
|
|
394 |
apply(case_tac r2)
|
|
|
395 |
apply simp_all
|
|
|
396 |
apply(case_tac r2)
|
|
|
397 |
apply simp_all
|
|
|
398 |
apply(case_tac r2)
|
|
|
399 |
apply simp_all
|
|
|
400 |
apply(case_tac r2)
|
|
|
401 |
apply simp_all
|
|
|
402 |
apply(case_tac r2)
|
|
|
403 |
apply simp_all
|
|
|
404 |
done
|
|
|
405 |
|
|
|
406 |
lemma rders__onechar:
|
|
|
407 |
shows " (rders_simp r [c]) = (rsimp (rders r [c]))"
|
|
|
408 |
by simp
|
|
|
409 |
|
|
|
410 |
lemma rders_append:
|
|
|
411 |
"rders c (s1 @ s2) = rders (rders c s1) s2"
|
|
|
412 |
apply(induct s1 arbitrary: c s2)
|
|
|
413 |
apply(simp_all)
|
|
|
414 |
done
|
|
|
415 |
|
|
|
416 |
lemma rders_simp_append:
|
|
|
417 |
"rders_simp c (s1 @ s2) = rders_simp (rders_simp c s1) s2"
|
|
|
418 |
apply(induct s1 arbitrary: c s2)
|
|
|
419 |
apply(simp_all)
|
|
|
420 |
done
|
|
|
421 |
|
|
|
422 |
|
|
|
423 |
lemma rders_simp_one_char:
|
|
|
424 |
shows "rders_simp r [c] = rsimp (rder c r)"
|
|
|
425 |
apply auto
|
|
|
426 |
done
|
|
|
427 |
|
|
|
428 |
|
|
|
429 |
|
|
|
430 |
fun nonalt :: "rrexp \<Rightarrow> bool"
|
|
|
431 |
where
|
|
|
432 |
"nonalt (RALTS rs) = False"
|
|
|
433 |
| "nonalt r = True"
|
|
|
434 |
|
|
|
435 |
|
|
|
436 |
fun good :: "rrexp \<Rightarrow> bool" where
|
|
|
437 |
"good RZERO = False"
|
|
|
438 |
| "good (RONE) = True"
|
|
|
439 |
| "good (RCHAR c) = True"
|
|
|
440 |
| "good (RALTS []) = False"
|
|
|
441 |
| "good (RALTS [r]) = False"
|
|
|
442 |
| "good (RALTS (r1 # r2 # rs)) = ((distinct ( (r1 # r2 # rs))) \<and>(\<forall>r' \<in> set (r1 # r2 # rs). good r' \<and> nonalt r'))"
|
|
|
443 |
| "good (RSEQ RZERO _) = False"
|
|
|
444 |
| "good (RSEQ RONE _) = False"
|
|
|
445 |
| "good (RSEQ _ RZERO) = False"
|
|
|
446 |
| "good (RSEQ r1 r2) = (good r1 \<and> good r2)"
|
|
|
447 |
| "good (RSTAR r) = True"
|
|
|
448 |
| "good (RNTIMES r n) = True"
|
|
|
449 |
|
|
|
450 |
lemma k0a:
|
|
|
451 |
shows "rflts [RALTS rs] = rs"
|
|
|
452 |
apply(simp)
|
|
|
453 |
done
|
|
|
454 |
|
|
|
455 |
lemma bbbbs:
|
|
|
456 |
assumes "good r" "r = RALTS rs"
|
|
|
457 |
shows "rsimp_ALTs (rflts [r]) = RALTS rs"
|
|
|
458 |
using assms
|
|
|
459 |
by (metis good.simps(4) good.simps(5) k0a rsimp_ALTs.elims)
|
|
|
460 |
|
|
|
461 |
lemma bbbbs1:
|
|
|
462 |
shows "nonalt r \<or> (\<exists> rs. r = RALTS rs)"
|
|
|
463 |
by (meson nonalt.elims(3))
|
|
|
464 |
|
|
|
465 |
|
|
|
466 |
|
|
|
467 |
lemma good0:
|
|
|
468 |
assumes "rs \<noteq> Nil" "\<forall>r \<in> set rs. nonalt r" "distinct rs"
|
|
|
469 |
shows "good (rsimp_ALTs rs) \<longleftrightarrow> (\<forall>r \<in> set rs. good r)"
|
|
|
470 |
using assms
|
|
|
471 |
apply(induct rs rule: rsimp_ALTs.induct)
|
|
|
472 |
apply(auto)
|
|
|
473 |
done
|
|
|
474 |
|
|
|
475 |
lemma flts1:
|
|
|
476 |
assumes "good r"
|
|
|
477 |
shows "rflts [r] \<noteq> []"
|
|
|
478 |
using assms
|
|
|
479 |
apply(induct r)
|
|
|
480 |
apply(simp_all)
|
|
|
481 |
using good.simps(4) by blast
|
|
|
482 |
|
|
|
483 |
lemma flts2:
|
|
|
484 |
assumes "good r"
|
|
|
485 |
shows "\<forall>r' \<in> set (rflts [r]). good r' \<and> nonalt r'"
|
|
|
486 |
using assms
|
|
|
487 |
apply(induct r)
|
|
|
488 |
apply(simp)
|
|
|
489 |
apply(simp)
|
|
|
490 |
apply(simp)
|
|
|
491 |
prefer 2
|
|
|
492 |
apply(simp)
|
|
|
493 |
apply(auto)[1]
|
|
|
494 |
|
|
|
495 |
apply (metis flts1 good.simps(5) good.simps(6) k0a neq_Nil_conv)
|
|
|
496 |
apply (metis flts1 good.simps(5) good.simps(6) k0a neq_Nil_conv)
|
|
|
497 |
apply fastforce
|
|
|
498 |
apply(simp)
|
|
|
499 |
by simp
|
|
|
500 |
|
|
|
501 |
|
|
|
502 |
lemma flts3:
|
|
|
503 |
assumes "\<forall>r \<in> set rs. good r \<or> r = RZERO"
|
|
|
504 |
shows "\<forall>r \<in> set (rflts rs). good r"
|
|
|
505 |
using assms
|
|
|
506 |
apply(induct rs arbitrary: rule: rflts.induct)
|
|
|
507 |
apply(simp_all)
|
|
|
508 |
by (metis UnE flts2 k0a)
|
|
|
509 |
|
|
|
510 |
|
|
|
511 |
lemma k0:
|
|
|
512 |
shows "rflts (r # rs1) = rflts [r] @ rflts rs1"
|
|
|
513 |
apply(induct r arbitrary: rs1)
|
|
|
514 |
apply(auto)
|
|
|
515 |
done
|
|
|
516 |
|
|
|
517 |
|
|
|
518 |
lemma good_SEQ:
|
|
|
519 |
assumes "r1 \<noteq> RZERO" "r2 \<noteq> RZERO" " r1 \<noteq> RONE"
|
|
|
520 |
shows "good (RSEQ r1 r2) = (good r1 \<and> good r2)"
|
|
|
521 |
using assms
|
|
|
522 |
apply(case_tac r1)
|
|
|
523 |
apply(simp_all)
|
|
|
524 |
apply(case_tac r2)
|
|
|
525 |
apply(simp_all)
|
|
|
526 |
apply(case_tac r2)
|
|
|
527 |
apply(simp_all)
|
|
|
528 |
apply(case_tac r2)
|
|
|
529 |
apply(simp_all)
|
|
|
530 |
apply(case_tac r2)
|
|
|
531 |
apply(simp_all)
|
|
|
532 |
apply(case_tac r2)
|
|
|
533 |
apply(simp_all)
|
|
|
534 |
done
|
|
|
535 |
|
|
|
536 |
lemma rsize0:
|
|
|
537 |
shows "0 < rsize r"
|
|
|
538 |
apply(induct r)
|
|
|
539 |
apply(auto)
|
|
|
540 |
done
|
|
|
541 |
|
|
|
542 |
|
|
|
543 |
fun nonnested :: "rrexp \<Rightarrow> bool"
|
|
|
544 |
where
|
|
|
545 |
"nonnested (RALTS []) = True"
|
|
|
546 |
| "nonnested (RALTS ((RALTS rs1) # rs2)) = False"
|
|
|
547 |
| "nonnested (RALTS (r # rs2)) = nonnested (RALTS rs2)"
|
|
|
548 |
| "nonnested r = True"
|
|
|
549 |
|
|
|
550 |
|
|
|
551 |
|
|
|
552 |
lemma k00:
|
|
|
553 |
shows "rflts (rs1 @ rs2) = rflts rs1 @ rflts rs2"
|
|
|
554 |
apply(induct rs1 arbitrary: rs2)
|
|
|
555 |
apply(auto)
|
|
|
556 |
by (metis append.assoc k0)
|
|
|
557 |
|
|
|
558 |
|
|
|
559 |
|
|
|
560 |
|
|
|
561 |
lemma k0b:
|
|
|
562 |
assumes "nonalt r" "r \<noteq> RZERO"
|
|
|
563 |
shows "rflts [r] = [r]"
|
|
|
564 |
using assms
|
|
|
565 |
apply(case_tac r)
|
|
|
566 |
apply(simp_all)
|
|
|
567 |
done
|
|
|
568 |
|
|
|
569 |
lemma nn1qq:
|
|
|
570 |
assumes "nonnested (RALTS rs)"
|
|
|
571 |
shows "\<nexists> rs1. RALTS rs1 \<in> set rs"
|
|
|
572 |
using assms
|
|
|
573 |
apply(induct rs rule: rflts.induct)
|
|
|
574 |
apply(auto)
|
|
|
575 |
done
|
|
|
576 |
|
|
|
577 |
|
|
|
578 |
|
|
|
579 |
lemma n0:
|
|
|
580 |
shows "nonnested (RALTS rs) \<longleftrightarrow> (\<forall>r \<in> set rs. nonalt r)"
|
|
|
581 |
apply(induct rs )
|
|
|
582 |
apply(auto)
|
|
|
583 |
apply (metis list.set_intros(1) nn1qq nonalt.elims(3))
|
|
|
584 |
apply (metis nonalt.elims(2) nonnested.simps(3) nonnested.simps(4) nonnested.simps(5) nonnested.simps(6) nonnested.simps(7) nonnested.simps(8))
|
|
|
585 |
using bbbbs1 apply fastforce
|
|
|
586 |
by (metis bbbbs1 list.set_intros(2) nn1qq)
|
|
|
587 |
|
|
|
588 |
|
|
|
589 |
|
|
|
590 |
|
|
|
591 |
lemma nn1c:
|
|
|
592 |
assumes "\<forall>r \<in> set rs. nonnested r"
|
|
|
593 |
shows "\<forall>r \<in> set (rflts rs). nonalt r"
|
|
|
594 |
using assms
|
|
|
595 |
apply(induct rs rule: rflts.induct)
|
|
|
596 |
apply(auto)
|
|
|
597 |
using n0 by blast
|
|
|
598 |
|
|
|
599 |
lemma nn1bb:
|
|
|
600 |
assumes "\<forall>r \<in> set rs. nonalt r"
|
|
|
601 |
shows "nonnested (rsimp_ALTs rs)"
|
|
|
602 |
using assms
|
|
|
603 |
apply(induct rs rule: rsimp_ALTs.induct)
|
|
|
604 |
apply(auto)
|
|
|
605 |
using nonalt.simps(1) nonnested.elims(3) apply blast
|
|
|
606 |
using n0 by auto
|
|
|
607 |
|
|
|
608 |
lemma bsimp_ASEQ0:
|
|
|
609 |
shows "rsimp_SEQ r1 RZERO = RZERO"
|
|
|
610 |
apply(induct r1)
|
|
|
611 |
apply(auto)
|
|
|
612 |
done
|
|
|
613 |
|
|
|
614 |
lemma nn1b:
|
|
|
615 |
shows "nonnested (rsimp r)"
|
|
|
616 |
apply(induct r)
|
|
|
617 |
apply(simp_all)
|
|
|
618 |
apply(case_tac "rsimp r1 = RZERO")
|
|
|
619 |
apply(simp)
|
|
|
620 |
apply(case_tac "rsimp r2 = RZERO")
|
|
|
621 |
apply(simp)
|
|
|
622 |
apply(subst bsimp_ASEQ0)
|
|
|
623 |
apply(simp)
|
|
|
624 |
apply(case_tac "\<exists>bs. rsimp r1 = RONE")
|
|
|
625 |
apply(auto)[1]
|
|
|
626 |
using idiot apply fastforce
|
|
|
627 |
apply (simp add: idiot2)
|
|
|
628 |
by (metis (mono_tags, lifting) image_iff list.set_map nn1bb nn1c rdistinct_set_equality)
|
|
|
629 |
|
|
|
630 |
lemma nonalt_flts_rd:
|
|
|
631 |
shows "\<lbrakk>xa \<in> set (rdistinct (rflts (map rsimp rs)) {})\<rbrakk>
|
|
|
632 |
\<Longrightarrow> nonalt xa"
|
|
|
633 |
by (metis Diff_empty ex_map_conv nn1b nn1c rdistinct_set_equality1)
|
|
|
634 |
|
|
|
635 |
|
|
|
636 |
lemma rsimpalts_implies1:
|
|
|
637 |
shows " rsimp_ALTs (a # rdistinct rs {a}) = RZERO \<Longrightarrow> a = RZERO"
|
|
|
638 |
using rsimp_ALTs.elims by auto
|
|
|
639 |
|
|
|
640 |
|
|
|
641 |
lemma rsimpalts_implies2:
|
|
|
642 |
shows "rsimp_ALTs (a # rdistinct rs rset) = RZERO \<Longrightarrow> rdistinct rs rset = []"
|
|
|
643 |
by (metis append_butlast_last_id rrexp.distinct(7) rsimpalts_conscons)
|
|
|
644 |
|
|
|
645 |
lemma rsimpalts_implies21:
|
|
|
646 |
shows "rsimp_ALTs (a # rdistinct rs {a}) = RZERO \<Longrightarrow> rdistinct rs {a} = []"
|
|
|
647 |
using rsimpalts_implies2 by blast
|
|
|
648 |
|
|
|
649 |
|
|
|
650 |
lemma bsimp_ASEQ2:
|
|
|
651 |
shows "rsimp_SEQ RONE r2 = r2"
|
|
|
652 |
apply(induct r2)
|
|
|
653 |
apply(auto)
|
|
|
654 |
done
|
|
|
655 |
|
|
|
656 |
lemma elem_smaller_than_set:
|
|
|
657 |
shows "xa \<in> set list \<Longrightarrow> rsize xa < Suc (rsizes list)"
|
|
|
658 |
apply(induct list)
|
|
|
659 |
apply simp
|
|
|
660 |
by (metis image_eqI le_imp_less_Suc list.set_map member_le_sum_list)
|
|
|
661 |
|
|
|
662 |
lemma rsimp_list_mono:
|
|
|
663 |
shows "rsizes (map rsimp rs) \<le> rsizes rs"
|
|
|
664 |
apply(induct rs)
|
|
|
665 |
apply simp+
|
|
|
666 |
by (simp add: add_mono_thms_linordered_semiring(1) rsimp_mono)
|
|
|
667 |
|
|
|
668 |
|
|
|
669 |
(*says anything coming out of simp+flts+db will be good*)
|
|
|
670 |
lemma good2_obv_simplified:
|
|
|
671 |
shows " \<lbrakk>\<forall>y. rsize y < Suc (rsizes rs) \<longrightarrow> good (rsimp y) \<or> rsimp y = RZERO;
|
|
|
672 |
xa \<in> set (rdistinct (rflts (map rsimp rs)) {}); good (rsimp xa) \<or> rsimp xa = RZERO\<rbrakk> \<Longrightarrow> good xa"
|
|
|
673 |
apply(subgoal_tac " \<forall>xa' \<in> set (map rsimp rs). good xa' \<or> xa' = RZERO")
|
|
|
674 |
prefer 2
|
|
|
675 |
apply (simp add: elem_smaller_than_set)
|
|
|
676 |
by (metis Diff_empty flts3 rdistinct_set_equality1)
|
|
|
677 |
|
|
|
678 |
thm Diff_empty flts3 rdistinct_set_equality1
|
|
|
679 |
|
|
|
680 |
lemma good1:
|
|
|
681 |
shows "good (rsimp a) \<or> rsimp a = RZERO"
|
|
|
682 |
apply(induct a taking: rsize rule: measure_induct)
|
|
|
683 |
apply(case_tac x)
|
|
|
684 |
apply(simp)
|
|
|
685 |
apply(simp)
|
|
|
686 |
apply(simp)
|
|
|
687 |
prefer 3
|
|
|
688 |
apply(simp)
|
|
|
689 |
prefer 2
|
|
|
690 |
apply(simp only:)
|
|
|
691 |
apply simp
|
|
|
692 |
apply (smt (verit, ccfv_threshold) add_mono_thms_linordered_semiring(1) elem_smaller_than_set good0 good2_obv_simplified le_eq_less_or_eq nonalt_flts_rd order_less_trans plus_1_eq_Suc rdistinct_does_the_job rdistinct_smaller rflts_mono rsimp_ALTs.simps(1) rsimp_list_mono)
|
|
|
693 |
apply simp
|
|
|
694 |
apply(subgoal_tac "good (rsimp x41) \<or> rsimp x41 = RZERO")
|
|
|
695 |
apply(subgoal_tac "good (rsimp x42) \<or> rsimp x42 = RZERO")
|
|
|
696 |
apply(case_tac "rsimp x41 = RZERO")
|
|
|
697 |
apply simp
|
|
|
698 |
apply(case_tac "rsimp x42 = RZERO")
|
|
|
699 |
apply simp
|
|
|
700 |
using bsimp_ASEQ0 apply blast
|
|
|
701 |
apply(subgoal_tac "good (rsimp x41)")
|
|
|
702 |
apply(subgoal_tac "good (rsimp x42)")
|
|
|
703 |
apply simp
|
|
|
704 |
apply (metis bsimp_ASEQ2 good_SEQ idiot2)
|
|
|
705 |
apply blast
|
|
|
706 |
apply fastforce
|
|
|
707 |
using less_add_Suc2 apply blast
|
|
|
708 |
using less_iff_Suc_add apply blast
|
|
|
709 |
using good.simps(45) rsimp.simps(7) by presburger
|
|
|
710 |
|
|
|
711 |
|
|
|
712 |
|
|
|
713 |
fun
|
|
|
714 |
RL :: "rrexp \<Rightarrow> string set"
|
|
|
715 |
where
|
|
|
716 |
"RL (RZERO) = {}"
|
|
|
717 |
| "RL (RONE) = {[]}"
|
|
|
718 |
| "RL (RCHAR c) = {[c]}"
|
|
|
719 |
| "RL (RSEQ r1 r2) = (RL r1) ;; (RL r2)"
|
|
|
720 |
| "RL (RALTS rs) = (\<Union> (set (map RL rs)))"
|
|
|
721 |
| "RL (RSTAR r) = (RL r)\<star>"
|
|
|
722 |
| "RL (RNTIMES r n) = (RL r) ^^ n"
|
|
|
723 |
|
|
|
724 |
lemma pow_rempty_iff:
|
|
|
725 |
shows "[] \<in> (RL r) ^^ n \<longleftrightarrow> (if n = 0 then True else [] \<in> (RL r))"
|
|
|
726 |
by (induct n) (auto simp add: Sequ_def)
|
|
|
727 |
|
|
|
728 |
lemma RL_rnullable:
|
|
|
729 |
shows "rnullable r = ([] \<in> RL r)"
|
|
|
730 |
apply(induct r)
|
|
|
731 |
apply(auto simp add: Sequ_def pow_rempty_iff)
|
|
|
732 |
done
|
|
|
733 |
|
|
|
734 |
lemma concI_if_Nil1: "[] \<in> A \<Longrightarrow> xs : B \<Longrightarrow> xs \<in> A ;; B"
|
|
|
735 |
by (metis append_Nil concI)
|
|
|
736 |
|
|
|
737 |
|
|
|
738 |
lemma empty_pow_add:
|
|
|
739 |
fixes A::"string set"
|
|
|
740 |
assumes "[] \<in> A" "s \<in> A ^^ n"
|
|
|
741 |
shows "s \<in> A ^^ (n + m)"
|
|
|
742 |
using assms
|
|
|
743 |
apply(induct m arbitrary: n)
|
|
|
744 |
apply(auto simp add: Sequ_def)
|
|
|
745 |
done
|
|
|
746 |
|
|
|
747 |
(*
|
|
|
748 |
lemma der_pow:
|
|
|
749 |
shows "Der c (A ^^ n) = (if n = 0 then {} else (Der c A) ;; (A ^^ (n - 1)))"
|
|
|
750 |
apply(induct n arbitrary: A)
|
|
|
751 |
apply(auto)
|
|
|
752 |
by (smt (verit, best) Suc_pred concE concI concI_if_Nil2 conc_pow_comm lang_pow.simps(2))
|
|
|
753 |
*)
|
|
|
754 |
|
|
|
755 |
lemma RL_rder:
|
|
|
756 |
shows "RL (rder c r) = Der c (RL r)"
|
|
|
757 |
apply(induct r)
|
|
|
758 |
apply(auto simp add: Sequ_def Der_def)[5]
|
|
|
759 |
apply (metis append_Cons)
|
|
|
760 |
using RL_rnullable apply blast
|
|
|
761 |
apply (metis append_eq_Cons_conv)
|
|
|
762 |
apply (metis append_Cons)
|
|
|
763 |
apply (metis RL_rnullable append_eq_Cons_conv)
|
|
|
764 |
apply simp
|
|
|
765 |
apply(simp)
|
|
|
766 |
done
|
|
|
767 |
|
|
|
768 |
lemma RL_rsimp_RSEQ:
|
|
|
769 |
shows "RL (rsimp_SEQ r1 r2) = (RL r1 ;; RL r2)"
|
|
|
770 |
apply(induct r1 r2 rule: rsimp_SEQ.induct)
|
|
|
771 |
apply(simp_all)
|
|
|
772 |
done
|
|
|
773 |
|
|
|
774 |
lemma RL_rsimp_RALTS:
|
|
|
775 |
shows "RL (rsimp_ALTs rs) = (\<Union> (set (map RL rs)))"
|
|
|
776 |
apply(induct rs rule: rsimp_ALTs.induct)
|
|
|
777 |
apply(simp_all)
|
|
|
778 |
done
|
|
|
779 |
|
|
|
780 |
lemma RL_rsimp_rdistinct:
|
|
|
781 |
shows "(\<Union> (set (map RL (rdistinct rs {})))) = (\<Union> (set (map RL rs)))"
|
|
|
782 |
apply(auto)
|
|
|
783 |
apply (metis Diff_iff rdistinct_set_equality1)
|
|
|
784 |
by (metis Diff_empty rdistinct_set_equality1)
|
|
|
785 |
|
|
|
786 |
lemma RL_rsimp_rflts:
|
|
|
787 |
shows "(\<Union> (set (map RL (rflts rs)))) = (\<Union> (set (map RL rs)))"
|
|
|
788 |
apply(induct rs rule: rflts.induct)
|
|
|
789 |
apply(simp_all)
|
|
|
790 |
done
|
|
|
791 |
|
|
|
792 |
lemma RL_rsimp:
|
|
|
793 |
shows "RL r = RL (rsimp r)"
|
|
|
794 |
apply(induct r rule: rsimp.induct)
|
|
|
795 |
apply(auto simp add: Sequ_def RL_rsimp_RSEQ)
|
|
|
796 |
using RL_rsimp_RALTS RL_rsimp_rdistinct RL_rsimp_rflts apply auto[1]
|
|
|
797 |
by (smt (verit, del_insts) RL_rsimp_RALTS RL_rsimp_rdistinct RL_rsimp_rflts UN_E image_iff list.set_map)
|
|
|
798 |
|
|
|
799 |
|
|
|
800 |
lemma qqq1:
|
|
|
801 |
shows "RZERO \<notin> set (rflts (map rsimp rs))"
|
|
|
802 |
by (metis ex_map_conv flts3 good.simps(1) good1)
|
|
|
803 |
|
|
|
804 |
|
|
|
805 |
fun nonazero :: "rrexp \<Rightarrow> bool"
|
|
|
806 |
where
|
|
|
807 |
"nonazero RZERO = False"
|
|
|
808 |
| "nonazero r = True"
|
|
|
809 |
|
|
|
810 |
|
|
|
811 |
lemma flts_single1:
|
|
|
812 |
assumes "nonalt r" "nonazero r"
|
|
|
813 |
shows "rflts [r] = [r]"
|
|
|
814 |
using assms
|
|
|
815 |
apply(induct r)
|
|
|
816 |
apply(auto)
|
|
|
817 |
done
|
|
|
818 |
|
|
|
819 |
lemma nonalt0_flts_keeps:
|
|
|
820 |
shows "(a \<noteq> RZERO) \<and> (\<forall>rs. a \<noteq> RALTS rs) \<Longrightarrow> rflts (a # xs) = a # rflts xs"
|
|
|
821 |
apply(case_tac a)
|
|
|
822 |
apply simp+
|
|
|
823 |
done
|
|
|
824 |
|
|
|
825 |
|
|
|
826 |
lemma nonalt0_fltseq:
|
|
|
827 |
shows "\<forall>r \<in> set rs. r \<noteq> RZERO \<and> nonalt r \<Longrightarrow> rflts rs = rs"
|
|
|
828 |
apply(induct rs)
|
|
|
829 |
apply simp
|
|
|
830 |
apply(case_tac "a = RZERO")
|
|
|
831 |
apply fastforce
|
|
|
832 |
apply(case_tac "\<exists>rs1. a = RALTS rs1")
|
|
|
833 |
apply(erule exE)
|
|
|
834 |
apply simp+
|
|
|
835 |
using nonalt0_flts_keeps by presburger
|
|
|
836 |
|
|
|
837 |
|
|
|
838 |
|
|
|
839 |
|
|
|
840 |
lemma goodalts_nonalt:
|
|
|
841 |
shows "good (RALTS rs) \<Longrightarrow> rflts rs = rs"
|
|
|
842 |
apply(induct x == "RALTS rs" arbitrary: rs rule: good.induct)
|
|
|
843 |
apply simp
|
|
|
844 |
|
|
|
845 |
using good.simps(5) apply blast
|
|
|
846 |
apply simp
|
|
|
847 |
apply(case_tac "r1 = RZERO")
|
|
|
848 |
using good.simps(1) apply force
|
|
|
849 |
apply(case_tac "r2 = RZERO")
|
|
|
850 |
using good.simps(1) apply force
|
|
|
851 |
apply(subgoal_tac "rflts (r1 # r2 # rs) = r1 # r2 # rflts rs")
|
|
|
852 |
prefer 2
|
|
|
853 |
apply (metis nonalt.simps(1) rflts_def_idiot)
|
|
|
854 |
apply(subgoal_tac "\<forall>r \<in> set rs. r \<noteq> RZERO \<and> nonalt r")
|
|
|
855 |
apply(subgoal_tac "rflts rs = rs")
|
|
|
856 |
apply presburger
|
|
|
857 |
using nonalt0_fltseq apply presburger
|
|
|
858 |
using good.simps(1) by blast
|
|
|
859 |
|
|
|
860 |
|
|
|
861 |
|
|
|
862 |
|
|
|
863 |
|
|
|
864 |
lemma test:
|
|
|
865 |
assumes "good r"
|
|
|
866 |
shows "rsimp r = r"
|
|
|
867 |
|
|
|
868 |
using assms
|
|
|
869 |
apply(induct rule: good.induct)
|
|
|
870 |
apply simp
|
|
|
871 |
apply simp
|
|
|
872 |
apply simp
|
|
|
873 |
apply simp
|
|
|
874 |
apply simp
|
|
|
875 |
apply(subgoal_tac "distinct (r1 # r2 # rs)")
|
|
|
876 |
prefer 2
|
|
|
877 |
using good.simps(6) apply blast
|
|
|
878 |
apply(subgoal_tac "rflts (r1 # r2 # rs ) = r1 # r2 # rs")
|
|
|
879 |
prefer 2
|
|
|
880 |
using goodalts_nonalt apply blast
|
|
|
881 |
|
|
|
882 |
apply(subgoal_tac "r1 \<noteq> r2")
|
|
|
883 |
prefer 2
|
|
|
884 |
apply (meson distinct_length_2_or_more)
|
|
|
885 |
apply(subgoal_tac "r1 \<notin> set rs")
|
|
|
886 |
apply(subgoal_tac "r2 \<notin> set rs")
|
|
|
887 |
apply(subgoal_tac "\<forall>r \<in> set rs. rsimp r = r")
|
|
|
888 |
apply(subgoal_tac "map rsimp rs = rs")
|
|
|
889 |
apply simp
|
|
|
890 |
apply(subgoal_tac "\<forall>r \<in> {r1, r2}. r \<notin> set rs")
|
|
|
891 |
apply (metis distinct_not_exist rdistinct_on_distinct)
|
|
|
892 |
|
|
|
893 |
apply blast
|
|
|
894 |
apply (meson map_idI)
|
|
|
895 |
apply (metis good.simps(6) insert_iff list.simps(15))
|
|
|
896 |
|
|
|
897 |
apply (meson distinct.simps(2))
|
|
|
898 |
apply (simp add: distinct_length_2_or_more)
|
|
|
899 |
apply simp+
|
|
|
900 |
done
|
|
|
901 |
|
|
|
902 |
|
|
|
903 |
|
|
|
904 |
lemma rsimp_idem:
|
|
|
905 |
shows "rsimp (rsimp r) = rsimp r"
|
|
|
906 |
using test good1
|
|
|
907 |
by force
|
|
|
908 |
|
|
|
909 |
corollary rsimp_inner_idem4:
|
|
|
910 |
shows "rsimp r = RALTS rs \<Longrightarrow> rflts rs = rs"
|
|
|
911 |
by (metis good1 goodalts_nonalt rrexp.simps(12))
|
|
|
912 |
|
|
|
913 |
|
|
|
914 |
lemma head_one_more_simp:
|
|
|
915 |
shows "map rsimp (r # rs) = map rsimp (( rsimp r) # rs)"
|
|
|
916 |
by (simp add: rsimp_idem)
|
|
|
917 |
|
|
|
918 |
|
|
|
919 |
lemma der_simp_nullability:
|
|
|
920 |
shows "rnullable r = rnullable (rsimp r)"
|
|
|
921 |
using RL_rnullable RL_rsimp by auto
|
|
|
922 |
|
|
|
923 |
|
|
|
924 |
lemma no_alt_short_list_after_simp:
|
|
|
925 |
shows "RALTS rs = rsimp r \<Longrightarrow> rsimp_ALTs rs = RALTS rs"
|
|
|
926 |
by (metis bbbbs good1 k0a rrexp.simps(12))
|
|
|
927 |
|
|
|
928 |
|
|
|
929 |
lemma no_further_dB_after_simp:
|
|
|
930 |
shows "RALTS rs = rsimp r \<Longrightarrow> rdistinct rs {} = rs"
|
|
|
931 |
apply(subgoal_tac "good (RALTS rs)")
|
|
|
932 |
apply(subgoal_tac "distinct rs")
|
|
|
933 |
using rdistinct_on_distinct apply blast
|
|
|
934 |
apply (metis distinct.simps(1) distinct.simps(2) empty_iff good.simps(6) list.exhaust set_empty2)
|
|
|
935 |
using good1 by fastforce
|
|
|
936 |
|
|
|
937 |
|
|
|
938 |
lemma idem_after_simp1:
|
|
|
939 |
shows "rsimp_ALTs (rdistinct (rflts [rsimp aa]) {}) = rsimp aa"
|
|
|
940 |
apply(case_tac "rsimp aa")
|
|
|
941 |
apply simp+
|
|
|
942 |
apply (metis no_alt_short_list_after_simp no_further_dB_after_simp)
|
|
|
943 |
apply(simp)
|
|
|
944 |
apply(simp)
|
|
|
945 |
done
|
|
|
946 |
|
|
|
947 |
lemma identity_wwo0:
|
|
|
948 |
shows "rsimp (rsimp_ALTs (RZERO # rs)) = rsimp (rsimp_ALTs rs)"
|
|
|
949 |
apply (metis idem_after_simp1 list.exhaust list.simps(8) list.simps(9) rflts.simps(2) rsimp.simps(2) rsimp.simps(3) rsimp_ALTs.simps(1) rsimp_ALTs.simps(2) rsimp_ALTs.simps(3))
|
|
|
950 |
done
|
|
|
951 |
|
|
|
952 |
lemma distinct_removes_last:
|
|
|
953 |
shows "\<lbrakk>a \<in> set as\<rbrakk>
|
|
|
954 |
\<Longrightarrow> rdistinct as rset = rdistinct (as @ [a]) rset"
|
|
|
955 |
and "rdistinct (ab # as @ [ab]) rset1 = rdistinct (ab # as) rset1"
|
|
|
956 |
apply(induct as arbitrary: rset ab rset1 a)
|
|
|
957 |
apply simp
|
|
|
958 |
apply simp
|
|
|
959 |
apply(case_tac "aa \<in> rset")
|
|
|
960 |
apply(case_tac "a = aa")
|
|
|
961 |
apply (metis append_Cons)
|
|
|
962 |
apply simp
|
|
|
963 |
apply(case_tac "a \<in> set as")
|
|
|
964 |
apply (metis append_Cons rdistinct.simps(2) set_ConsD)
|
|
|
965 |
apply(case_tac "a = aa")
|
|
|
966 |
prefer 2
|
|
|
967 |
apply simp
|
|
|
968 |
apply (metis append_Cons)
|
|
|
969 |
apply(case_tac "ab \<in> rset1")
|
|
|
970 |
prefer 2
|
|
|
971 |
apply(subgoal_tac "rdistinct (ab # (a # as) @ [ab]) rset1 =
|
|
|
972 |
ab # (rdistinct ((a # as) @ [ab]) (insert ab rset1))")
|
|
|
973 |
prefer 2
|
|
|
974 |
apply force
|
|
|
975 |
apply(simp only:)
|
|
|
976 |
apply(subgoal_tac "rdistinct (ab # a # as) rset1 = ab # (rdistinct (a # as) (insert ab rset1))")
|
|
|
977 |
apply(simp only:)
|
|
|
978 |
apply(subgoal_tac "rdistinct ((a # as) @ [ab]) (insert ab rset1) = rdistinct (a # as) (insert ab rset1)")
|
|
|
979 |
apply blast
|
|
|
980 |
apply(case_tac "a \<in> insert ab rset1")
|
|
|
981 |
apply simp
|
|
|
982 |
apply (metis insertI1)
|
|
|
983 |
apply simp
|
|
|
984 |
apply (meson insertI1)
|
|
|
985 |
apply simp
|
|
|
986 |
apply(subgoal_tac "rdistinct ((a # as) @ [ab]) rset1 = rdistinct (a # as) rset1")
|
|
|
987 |
apply simp
|
|
|
988 |
by (metis append_Cons insert_iff insert_is_Un rdistinct.simps(2))
|
|
|
989 |
|
|
|
990 |
|
|
|
991 |
|
|
|
992 |
|
|
|
993 |
|
|
|
994 |
|
|
|
995 |
lemma distinct_removes_list:
|
|
|
996 |
shows "\<lbrakk> \<forall>r \<in> set rs. r \<in> set as\<rbrakk> \<Longrightarrow> rdistinct (as @ rs) {} = rdistinct as {}"
|
|
|
997 |
apply(induct rs)
|
|
|
998 |
apply simp+
|
|
|
999 |
apply(subgoal_tac "rdistinct (as @ a # rs) {} = rdistinct (as @ rs) {}")
|
|
|
1000 |
prefer 2
|
|
|
1001 |
apply (metis append_Cons append_Nil distinct_removes_middle(1))
|
|
|
1002 |
by presburger
|
|
|
1003 |
|
|
|
1004 |
|
|
|
1005 |
lemma spawn_simp_rsimpalts:
|
|
|
1006 |
shows "rsimp (rsimp_ALTs rs) = rsimp (rsimp_ALTs (map rsimp rs))"
|
|
|
1007 |
apply(cases rs)
|
|
|
1008 |
apply simp
|
|
|
1009 |
apply(case_tac list)
|
|
|
1010 |
apply simp
|
|
|
1011 |
apply(subst rsimp_idem[symmetric])
|
|
|
1012 |
apply simp
|
|
|
1013 |
apply(subgoal_tac "rsimp_ALTs rs = RALTS rs")
|
|
|
1014 |
apply(simp only:)
|
|
|
1015 |
apply(subgoal_tac "rsimp_ALTs (map rsimp rs) = RALTS (map rsimp rs)")
|
|
|
1016 |
apply(simp only:)
|
|
|
1017 |
prefer 2
|
|
|
1018 |
apply simp
|
|
|
1019 |
prefer 2
|
|
|
1020 |
using rsimp_ALTs.simps(3) apply presburger
|
|
|
1021 |
apply auto
|
|
|
1022 |
apply(subst rsimp_idem)+
|
|
|
1023 |
by (metis comp_apply rsimp_idem)
|
|
|
1024 |
|
|
|
1025 |
|
|
|
1026 |
lemma simp_singlealt_flatten:
|
|
|
1027 |
shows "rsimp (RALTS [RALTS rsa]) = rsimp (RALTS (rsa @ []))"
|
|
|
1028 |
apply(induct rsa)
|
|
|
1029 |
apply simp
|
|
|
1030 |
apply simp
|
|
|
1031 |
by (metis idem_after_simp1 list.simps(9) rsimp.simps(2))
|
|
|
1032 |
|
|
|
1033 |
|
|
|
1034 |
lemma good1_rsimpalts:
|
|
|
1035 |
shows "rsimp r = RALTS rs \<Longrightarrow> rsimp_ALTs rs = RALTS rs"
|
|
|
1036 |
by (metis no_alt_short_list_after_simp)
|
|
|
1037 |
|
|
|
1038 |
|
|
|
1039 |
|
|
|
1040 |
|
|
|
1041 |
lemma good1_flatten:
|
|
|
1042 |
shows "\<lbrakk> rsimp r = (RALTS rs1)\<rbrakk>
|
|
|
1043 |
\<Longrightarrow> rflts (rsimp_ALTs rs1 # map rsimp rsb) = rflts (rs1 @ map rsimp rsb)"
|
|
|
1044 |
apply(subst good1_rsimpalts)
|
|
|
1045 |
apply simp+
|
|
|
1046 |
apply(subgoal_tac "rflts (rs1 @ map rsimp rsb) = rs1 @ rflts (map rsimp rsb)")
|
|
|
1047 |
apply simp
|
|
|
1048 |
using flts_append rsimp_inner_idem4 by presburger
|
|
|
1049 |
|
|
|
1050 |
|
|
|
1051 |
lemma flatten_rsimpalts:
|
|
|
1052 |
shows "rflts (rsimp_ALTs (rdistinct (rflts (map rsimp rsa)) {}) # map rsimp rsb) =
|
|
|
1053 |
rflts ( (rdistinct (rflts (map rsimp rsa)) {}) @ map rsimp rsb)"
|
|
|
1054 |
apply(case_tac "map rsimp rsa")
|
|
|
1055 |
apply simp
|
|
|
1056 |
apply(case_tac "list")
|
|
|
1057 |
apply simp
|
|
|
1058 |
apply(case_tac a)
|
|
|
1059 |
apply simp+
|
|
|
1060 |
apply(rename_tac rs1)
|
|
|
1061 |
apply (metis good1_flatten map_eq_Cons_D no_further_dB_after_simp)
|
|
|
1062 |
|
|
|
1063 |
apply simp
|
|
|
1064 |
|
|
|
1065 |
apply(subgoal_tac "\<forall>r \<in> set( rflts (map rsimp rsa)). good r")
|
|
|
1066 |
apply(case_tac "rdistinct (rflts (map rsimp rsa)) {}")
|
|
|
1067 |
apply simp
|
|
|
1068 |
apply auto[1]
|
|
|
1069 |
apply simp
|
|
|
1070 |
apply(simp)
|
|
|
1071 |
apply(case_tac "lista")
|
|
|
1072 |
apply simp_all
|
|
|
1073 |
|
|
|
1074 |
apply (metis append_Cons append_Nil good1_flatten rflts.simps(2) rsimp.simps(2) rsimp_ALTs.elims)
|
|
|
1075 |
by (metis (no_types, opaque_lifting) append_Cons append_Nil good1_flatten rflts.simps(2) rsimp.simps(2) rsimp_ALTs.elims)
|
|
|
1076 |
|
|
|
1077 |
|
|
|
1078 |
|
|
|
1079 |
|
|
|
1080 |
|
|
|
1081 |
lemma simp_flatten:
|
|
|
1082 |
shows "rsimp (RALTS ((RALTS rsa) # rsb)) = rsimp (RALTS (rsa @ rsb))"
|
|
|
1083 |
apply simp
|
|
|
1084 |
apply(subst flatten_rsimpalts)
|
|
|
1085 |
apply(simp add: flts_append)
|
|
|
1086 |
by (metis Diff_empty distinct_once_enough flts_append nonalt0_fltseq nonalt_flts_rd qqq1 rdistinct_set_equality1)
|
|
|
1087 |
|
|
|
1088 |
lemma basic_rsimp_SEQ_property1:
|
|
|
1089 |
shows "rsimp_SEQ RONE r = r"
|
|
|
1090 |
by (simp add: idiot)
|
|
|
1091 |
|
|
|
1092 |
|
|
|
1093 |
|
|
|
1094 |
lemma basic_rsimp_SEQ_property3:
|
|
|
1095 |
shows "rsimp_SEQ r RZERO = RZERO"
|
|
|
1096 |
using rsimp_SEQ.elims by blast
|
|
|
1097 |
|
|
|
1098 |
|
|
|
1099 |
|
|
|
1100 |
fun vsuf :: "char list \<Rightarrow> rrexp \<Rightarrow> char list list" where
|
|
|
1101 |
"vsuf [] _ = []"
|
|
|
1102 |
|"vsuf (c#cs) r1 = (if (rnullable r1) then (vsuf cs (rder c r1)) @ [c # cs]
|
|
|
1103 |
else (vsuf cs (rder c r1))
|
|
|
1104 |
) "
|
|
|
1105 |
|
|
|
1106 |
|
|
|
1107 |
|
|
|
1108 |
|
|
|
1109 |
|
|
|
1110 |
|
|
|
1111 |
fun star_update :: "char \<Rightarrow> rrexp \<Rightarrow> char list list \<Rightarrow> char list list" where
|
|
|
1112 |
"star_update c r [] = []"
|
|
|
1113 |
|"star_update c r (s # Ss) = (if (rnullable (rders r s))
|
|
|
1114 |
then (s@[c]) # [c] # (star_update c r Ss)
|
|
|
1115 |
else (s@[c]) # (star_update c r Ss) )"
|
|
|
1116 |
|
|
|
1117 |
|
|
|
1118 |
fun star_updates :: "char list \<Rightarrow> rrexp \<Rightarrow> char list list \<Rightarrow> char list list"
|
|
|
1119 |
where
|
|
|
1120 |
"star_updates [] r Ss = Ss"
|
|
|
1121 |
| "star_updates (c # cs) r Ss = star_updates cs r (star_update c r Ss)"
|
|
|
1122 |
|
|
|
1123 |
lemma stupdates_append: shows
|
|
|
1124 |
"star_updates (s @ [c]) r Ss = star_update c r (star_updates s r Ss)"
|
|
|
1125 |
apply(induct s arbitrary: Ss)
|
|
|
1126 |
apply simp
|
|
|
1127 |
apply simp
|
|
|
1128 |
done
|
|
|
1129 |
|
|
|
1130 |
lemma flts_removes0:
|
|
|
1131 |
shows " rflts (rs @ [RZERO]) =
|
|
|
1132 |
rflts rs"
|
|
|
1133 |
apply(induct rs)
|
|
|
1134 |
apply simp
|
|
|
1135 |
by (metis append_Cons rflts.simps(2) rflts.simps(3) rflts_def_idiot)
|
|
|
1136 |
|
|
|
1137 |
|
|
|
1138 |
lemma rflts_spills_last:
|
|
|
1139 |
shows "rflts (rs1 @ [RALTS rs]) = rflts rs1 @ rs"
|
|
|
1140 |
apply (induct rs1 rule: rflts.induct)
|
|
|
1141 |
apply(auto)
|
|
|
1142 |
done
|
|
|
1143 |
|
|
|
1144 |
lemma flts_keeps1:
|
|
|
1145 |
shows "rflts (rs @ [RONE]) = rflts rs @ [RONE]"
|
|
|
1146 |
apply (induct rs rule: rflts.induct)
|
|
|
1147 |
apply(auto)
|
|
|
1148 |
done
|
|
|
1149 |
|
|
|
1150 |
lemma flts_keeps_others:
|
|
|
1151 |
shows "\<lbrakk>a \<noteq> RZERO; \<nexists>rs1. a = RALTS rs1\<rbrakk> \<Longrightarrow>rflts (rs @ [a]) = rflts rs @ [a]"
|
|
|
1152 |
apply(induct rs rule: rflts.induct)
|
|
|
1153 |
apply(auto)
|
|
|
1154 |
by (meson k0b nonalt.elims(3))
|
|
|
1155 |
|
|
|
1156 |
lemma spilled_alts_contained:
|
|
|
1157 |
shows "\<lbrakk>a = RALTS rs ; a \<in> set rs1\<rbrakk> \<Longrightarrow> \<forall>r \<in> set rs. r \<in> set (rflts rs1)"
|
|
|
1158 |
apply(induct rs1)
|
|
|
1159 |
apply simp
|
|
|
1160 |
apply(case_tac "a = aa")
|
|
|
1161 |
apply simp
|
|
|
1162 |
apply(subgoal_tac " a \<in> set rs1")
|
|
|
1163 |
prefer 2
|
|
|
1164 |
apply (meson set_ConsD)
|
|
|
1165 |
apply(case_tac aa)
|
|
|
1166 |
using rflts.simps(2) apply presburger
|
|
|
1167 |
apply fastforce
|
|
|
1168 |
apply fastforce
|
|
|
1169 |
apply fastforce
|
|
|
1170 |
apply fastforce
|
|
|
1171 |
apply fastforce
|
|
|
1172 |
by simp
|
|
|
1173 |
|
|
|
1174 |
|
|
|
1175 |
lemma distinct_removes_duplicate_flts:
|
|
|
1176 |
shows " a \<in> set rsa
|
|
|
1177 |
\<Longrightarrow> rdistinct (rflts (map rsimp rsa @ [rsimp a])) {} =
|
|
|
1178 |
rdistinct (rflts (map rsimp rsa)) {}"
|
|
|
1179 |
apply(subgoal_tac "rsimp a \<in> set (map rsimp rsa)")
|
|
|
1180 |
prefer 2
|
|
|
1181 |
apply simp
|
|
|
1182 |
apply(induct "rsimp a")
|
|
|
1183 |
apply simp
|
|
|
1184 |
using flts_removes0 apply presburger
|
|
|
1185 |
apply(subgoal_tac " rdistinct (rflts (map rsimp rsa @ [rsimp a])) {} =
|
|
|
1186 |
rdistinct (rflts (map rsimp rsa @ [RONE])) {}")
|
|
|
1187 |
apply (simp only:)
|
|
|
1188 |
apply(subst flts_keeps1)
|
|
|
1189 |
apply (metis distinct_removes_last(1) flts_append in_set_conv_decomp rflts.simps(4))
|
|
|
1190 |
apply presburger
|
|
|
1191 |
apply(subgoal_tac " rdistinct (rflts (map rsimp rsa @ [rsimp a])) {} =
|
|
|
1192 |
rdistinct ((rflts (map rsimp rsa)) @ [RCHAR x]) {}")
|
|
|
1193 |
apply (simp only:)
|
|
|
1194 |
prefer 2
|
|
|
1195 |
apply (metis flts_append rflts.simps(1) rflts.simps(5))
|
|
|
1196 |
apply (metis distinct_removes_last(1) rflts_def_idiot2 rrexp.distinct(25) rrexp.distinct(3))
|
|
|
1197 |
apply (metis distinct_removes_last(1) flts_append rflts.simps(1) rflts.simps(6) rflts_def_idiot2 rrexp.distinct(31) rrexp.distinct(5))
|
|
|
1198 |
apply (metis distinct_removes_list rflts_spills_last spilled_alts_contained)
|
|
|
1199 |
apply (metis distinct_removes_last(1) flts_append good.simps(1) good.simps(44) rflts.simps(1) rflts.simps(7) rflts_def_idiot2 rrexp.distinct(37))
|
|
|
1200 |
by (metis distinct_removes_last(1) flts_append rflts.simps(1) rflts.simps(8) rflts_def_idiot2 rrexp.distinct(11) rrexp.distinct(39))
|
|
|
1201 |
|
|
|
1202 |
(*some basic facts about rsimp*)
|
|
|
1203 |
|
|
|
1204 |
unused_thms
|
|
|
1205 |
|
|
|
1206 |
|
|
|
1207 |
end |