theory Re1

  imports "Main" 

begin

section {* Sequential Composition of Sets *}

definition

  Sequ :: "string set \<Rightarrow> string set \<Rightarrow> string set" ("_ ;; _" [100,100] 100)

where 

  "A ;; B = {s1 @ s2 | s1 s2. s1 \<in> A \<and> s2 \<in> B}"

text {* Two Simple Properties about Sequential Composition *}

lemma seq_empty [simp]:

  shows "A ;; {[]} = A"

  and   "{[]} ;; A = A"

by (simp_all add: Sequ_def)

lemma seq_null [simp]:

  shows "A ;; {} = {}"

  and   "{} ;; A = {}"

by (simp_all add: Sequ_def)

section {* Regular Expressions *}

datatype rexp =

  NULL

| EMPTY

| CHAR char

| SEQ rexp rexp

| ALT rexp rexp

fun SEQS :: "rexp \<Rightarrow> rexp list \<Rightarrow> rexp"

where

  "SEQS r [] = r"

| "SEQS r (r'#rs) = SEQ r (SEQS r' rs)"

section {* Semantics of Regular Expressions *}

fun

  L :: "rexp \<Rightarrow> string set"

where

  "L (NULL) = {}"

| "L (EMPTY) = {[]}"

| "L (CHAR c) = {[c]}"

| "L (SEQ r1 r2) = (L r1) ;; (L r2)"

| "L (ALT r1 r2) = (L r1) \<union> (L r2)"

fun zeroable where

  "zeroable NULL = True"

| "zeroable EMPTY = False"

| "zeroable (CHAR c) = False"

| "zeroable (ALT r1 r2) = (zeroable r1 \<and> zeroable r2)"

| "zeroable (SEQ r1 r2) = (zeroable r1 \<or> zeroable r2)"

lemma L_ALT_cases:

  "L (ALT r1 r2) \<noteq> {} \<Longrightarrow> (L r1 \<noteq> {}) \<or> (L r1 = {} \<and> L r2 \<noteq> {})"

by(auto)

fun

 nullable :: "rexp \<Rightarrow> bool"

where

  "nullable (NULL) = False"

| "nullable (EMPTY) = True"

| "nullable (CHAR c) = False"

| "nullable (ALT r1 r2) = (nullable r1 \<or> nullable r2)"

| "nullable (SEQ r1 r2) = (nullable r1 \<and> nullable r2)"

lemma nullable_correctness:

  shows "nullable r  \<longleftrightarrow> [] \<in> (L r)"

apply (induct r) 

apply(auto simp add: Sequ_def) 

done

section {* Values *}

datatype val = 

  Void

| Char char

| Seq val val

| Right val

| Left val

fun Seqs :: "val \<Rightarrow> val list \<Rightarrow> val"

where

  "Seqs v [] = v"

| "Seqs v (v'#vs) = Seqs (Seq v v') vs"

section {* The string behind a value *}

fun flat :: "val \<Rightarrow> string"

where

  "flat(Void) = []"

| "flat(Char c) = [c]"

| "flat(Left v) = flat(v)"

| "flat(Right v) = flat(v)"

| "flat(Seq v1 v2) = flat(v1) @ flat(v2)"

fun flats :: "val \<Rightarrow> string list"

where

  "flats(Void) = [[]]"

| "flats(Char c) = [[c]]"

| "flats(Left v) = flats(v)"

| "flats(Right v) = flats(v)"

| "flats(Seq v1 v2) = (flats v1) @ (flats v2)"

value "flats(Seq(Char c)(Char b))"

section {* Relation between values and regular expressions *}

inductive Prfs :: "string \<Rightarrow> val \<Rightarrow> rexp \<Rightarrow> bool" ("\<Turnstile>_ _ : _" [100, 100, 100] 100)

where

 "\<lbrakk>\<Turnstile>s1 v1 : r1; \<Turnstile>s2 v2 : r2\<rbrakk> \<Longrightarrow> \<Turnstile>(s1 @ s2) (Seq v1 v2) : SEQ r1 r2"

| "\<Turnstile>s v1 : r1 \<Longrightarrow> \<Turnstile>s (Left v1) : ALT r1 r2"

| "\<Turnstile>s v2 : r2 \<Longrightarrow> \<Turnstile>s (Right v2) : ALT r1 r2"

| "\<Turnstile>[] Void : EMPTY"

| "\<Turnstile>[c] (Char c) : CHAR c"

lemma Prfs_flat:

  "\<Turnstile>s v : r \<Longrightarrow> flat v = s"

apply(induct s v r rule: Prfs.induct)

apply(auto)

done

inductive Prfn :: "nat \<Rightarrow> val \<Rightarrow> rexp \<Rightarrow> bool" ("\<TTurnstile>_ _ : _" [100, 100, 100] 100)

where

 "\<lbrakk>\<TTurnstile>n1 v1 : r1; \<TTurnstile>n2 v2 : r2\<rbrakk> \<Longrightarrow> \<TTurnstile>(n1 + n2) (Seq v1 v2) : SEQ r1 r2"

| "\<TTurnstile>n v1 : r1 \<Longrightarrow> \<TTurnstile>n (Left v1) : ALT r1 r2"

| "\<TTurnstile>n v2 : r2 \<Longrightarrow> \<TTurnstile>n (Right v2) : ALT r1 r2"

| "\<TTurnstile>0 Void : EMPTY"

| "\<TTurnstile>1 (Char c) : CHAR c"

lemma Prfn_flat:

  "\<TTurnstile>n v : r \<Longrightarrow> length (flat v) = n"

apply(induct rule: Prfn.induct)

apply(auto)

done

inductive Prf :: "val \<Rightarrow> rexp \<Rightarrow> bool" ("\<turnstile> _ : _" [100, 100] 100)

where

 "\<lbrakk>\<turnstile> v1 : r1; \<turnstile> v2 : r2\<rbrakk> \<Longrightarrow> \<turnstile> Seq v1 v2 : SEQ r1 r2"

| "\<turnstile> v1 : r1 \<Longrightarrow> \<turnstile> Left v1 : ALT r1 r2"

| "\<turnstile> v2 : r2 \<Longrightarrow> \<turnstile> Right v2 : ALT r1 r2"

| "\<turnstile> Void : EMPTY"

| "\<turnstile> Char c : CHAR c"

lemma Prf_Prfn:

  shows "\<turnstile> v : r \<Longrightarrow> \<TTurnstile>(length (flat v)) v : r"

apply(induct v r rule: Prf.induct)

apply(auto intro: Prfn.intros)

by (metis One_nat_def Prfn.intros(5))

lemma Prfn_Prf:

  shows "\<TTurnstile>n v : r \<Longrightarrow> \<turnstile> v : r"

apply(induct n v r rule: Prfn.induct)

apply(auto intro: Prf.intros)

done

lemma Prf_Prfs:

  shows "\<turnstile> v : r \<Longrightarrow> \<Turnstile>(flat v) v : r"

apply(induct v r rule: Prf.induct)

apply(auto intro: Prfs.intros)

done

lemma Prfs_Prf:

  shows "\<Turnstile>s v : r \<Longrightarrow> \<turnstile> v : r"

apply(induct s v r rule: Prfs.induct)

apply(auto intro: Prf.intros)

done

lemma not_nullable_flat:

  assumes "\<turnstile> v : r" "\<not>nullable r"

  shows "flat v \<noteq> []"

using assms

apply(induct)

apply(auto)

done

fun mkeps :: "rexp \<Rightarrow> val"

where

  "mkeps(EMPTY) = Void"

| "mkeps(SEQ r1 r2) = Seq (mkeps r1) (mkeps r2)"

| "mkeps(ALT r1 r2) = (if nullable(r1) then Left (mkeps r1) else Right (mkeps r2))"

lemma mkeps_nullable:

  assumes "nullable(r)" shows "\<turnstile> mkeps r : r"

using assms

apply(induct rule: nullable.induct)

apply(auto intro: Prf.intros)

done

lemma mkeps_nullable_n:

  assumes "nullable(r)" shows "\<TTurnstile>0 (mkeps r) : r"

using assms

apply(induct rule: nullable.induct)

apply(auto intro: Prfn.intros)

apply(drule Prfn.intros(1))

apply(assumption)

apply(simp)

done

lemma mkeps_nullable_s:

  assumes "nullable(r)" shows "\<Turnstile>[] (mkeps r) : r"

using assms

apply(induct rule: nullable.induct)

apply(auto intro: Prfs.intros)

apply(drule Prfs.intros(1))

apply(assumption)

apply(simp)

done

lemma mkeps_flat:

  assumes "nullable(r)" shows "flat (mkeps r) = []"

using assms

apply(induct rule: nullable.induct)

apply(auto)

done

text {*

  The value mkeps returns is always the correct POSIX

  value.

*}

lemma Prf_flat_L:

  assumes "\<turnstile> v : r" shows "flat v \<in> L r"

using assms

apply(induct v r rule: Prf.induct)

apply(auto simp add: Sequ_def)

done

lemma L_flat_Prf:

  "L(r) = {flat v | v. \<turnstile> v : r}"

apply(induct r)

apply(auto dest: Prf_flat_L simp add: Sequ_def)

apply (metis Prf.intros(4) flat.simps(1))

apply (metis Prf.intros(5) flat.simps(2))

apply (metis Prf.intros(1) flat.simps(5))

apply (metis Prf.intros(2) flat.simps(3))

apply (metis Prf.intros(3) flat.simps(4))

apply(erule Prf.cases)

apply(auto)

done

definition prefix :: "string \<Rightarrow> string \<Rightarrow> bool" ("_ \<sqsubseteq> _" [100, 100] 100)

where

  "s1 \<sqsubseteq> s2 \<equiv> \<exists>s3. s1 @ s3 = s2"

definition sprefix :: "string \<Rightarrow> string \<Rightarrow> bool" ("_ \<sqsubset> _" [100, 100] 100)

where

  "s1 \<sqsubset> s2 \<equiv> (s1 \<sqsubseteq> s2 \<and> s1 \<noteq> s2)"

lemma length_sprefix:

  "s1 \<sqsubset> s2 \<Longrightarrow> length s1 < length s2"

unfolding sprefix_def prefix_def

by (auto)

definition Prefixes :: "string \<Rightarrow> string set" where

  "Prefixes s \<equiv> {sp. sp \<sqsubseteq> s}"

definition Suffixes :: "string \<Rightarrow> string set" where

  "Suffixes s \<equiv> rev ` (Prefixes (rev s))"

lemma Suffixes_in: 

  "\<exists>s1. s1 @ s2 = s3 \<Longrightarrow> s2 \<in> Suffixes s3"

unfolding Suffixes_def Prefixes_def prefix_def image_def

apply(auto)

by (metis rev_rev_ident)

lemma Prefixes_Cons:

  "Prefixes (c # s) = {[]} \<union> {c # sp | sp. sp \<in> Prefixes s}"

unfolding Prefixes_def prefix_def

apply(auto simp add: append_eq_Cons_conv) 

done

lemma finite_Prefixes:

  "finite (Prefixes s)"

apply(induct s)

apply(auto simp add: Prefixes_def prefix_def)[1]

apply(simp add: Prefixes_Cons)

done

lemma finite_Suffixes:

  "finite (Suffixes s)"

unfolding Suffixes_def

apply(rule finite_imageI)

apply(rule finite_Prefixes)

done

lemma prefix_Cons:

  "((c # s1) \<sqsubseteq> (c # s2)) = (s1 \<sqsubseteq> s2)"

apply(auto simp add: prefix_def)

done

lemma prefix_append:

  "((s @ s1) \<sqsubseteq> (s @ s2)) = (s1 \<sqsubseteq> s2)"

apply(induct s)

apply(simp)

apply(simp add: prefix_Cons)

done

definition Values :: "rexp \<Rightarrow> string \<Rightarrow> val set" where

  "Values r s \<equiv> {v. \<turnstile> v : r \<and> flat v \<sqsubseteq> s}"

definition rest :: "val \<Rightarrow> string \<Rightarrow> string" where

  "rest v s \<equiv> drop (length (flat v)) s"

lemma rest_Suffixes:

  "rest v s \<in> Suffixes s"

unfolding rest_def

by (metis Suffixes_in append_take_drop_id)

lemma Values_recs:

  "Values (NULL) s = {}"

  "Values (EMPTY) s = {Void}"

  "Values (CHAR c) s = (if [c] \<sqsubseteq> s then {Char c} else {})" 

  "Values (ALT r1 r2) s = {Left v | v. v \<in> Values r1 s} \<union> {Right v | v. v \<in> Values r2 s}"

  "Values (SEQ r1 r2) s = {Seq v1 v2 | v1 v2. v1 \<in> Values r1 s \<and> v2 \<in> Values r2 (rest v1 s)}"

unfolding Values_def

apply(auto)

(*NULL*)

apply(erule Prf.cases)

apply(simp_all)[5]

(*EMPTY*)

apply(erule Prf.cases)

apply(simp_all)[5]

apply(rule Prf.intros)

apply (metis append_Nil prefix_def)

(*CHAR*)

apply(erule Prf.cases)

apply(simp_all)[5]

apply(rule Prf.intros)

apply(erule Prf.cases)

apply(simp_all)[5]

(*ALT*)

apply(erule Prf.cases)

apply(simp_all)[5]

apply (metis Prf.intros(2))

apply (metis Prf.intros(3))

(*SEQ*)

apply(erule Prf.cases)

apply(simp_all)[5]

apply (simp add: append_eq_conv_conj prefix_def rest_def)

apply (metis Prf.intros(1))

apply (simp add: append_eq_conv_conj prefix_def rest_def)

done

lemma Values_finite:

  "finite (Values r s)"

apply(induct r arbitrary: s)

apply(simp_all add: Values_recs)

thm finite_surj

apply(rule_tac f="\<lambda>(x, y). Seq x y" and 

               A="{(v1, v2) | v1 v2. v1 \<in> Values r1 s \<and> v2 \<in> Values r2 (rest v1 s)}" in finite_surj)

prefer 2

apply(auto)[1]

apply(rule_tac B="\<Union>sp \<in> Suffixes s. {(v1, v2). v1 \<in> Values r1 s \<and> v2 \<in> Values r2 sp}" in finite_subset)

apply(auto)[1]

apply (metis rest_Suffixes)

apply(rule finite_UN_I)

apply(rule finite_Suffixes)

apply(simp)

done

section {* Greedy Ordering according to Frisch/Cardelli *}

inductive GrOrd :: "val \<Rightarrow> val \<Rightarrow> bool" ("_ \<prec> _")

where 

  "v1 \<prec> v1' \<Longrightarrow> (Seq v1 v2) \<prec> (Seq v1' v2')"

| "v2 \<prec> v2' \<Longrightarrow> (Seq v1 v2) \<prec> (Seq v1 v2')"

| "v1 \<prec> v2 \<Longrightarrow> (Left v1) \<prec> (Left v2)"

| "v1 \<prec> v2 \<Longrightarrow> (Right v1) \<prec> (Right v2)"

| "(Right v1) \<prec> (Left v2)"

| "(Char c) \<prec> (Char c)"

| "(Void) \<prec> (Void)"

lemma Gr_refl:

  assumes "\<turnstile> v : r"

  shows "v \<prec> v"

using assms

apply(induct)

apply(auto intro: GrOrd.intros)

done

lemma Gr_total:

  assumes "\<turnstile> v1 : r" "\<turnstile> v2 : r"

  shows "v1 \<prec> v2 \<or> v2 \<prec> v1"

using assms

apply(induct v1 r arbitrary: v2 rule: Prf.induct)

apply(rotate_tac 4)

apply(erule Prf.cases)

apply(simp_all)[5]

apply(clarify)

apply (metis GrOrd.intros(1) GrOrd.intros(2))

apply(rotate_tac 2)

apply(erule Prf.cases)

apply(simp_all)

apply(clarify)

apply (metis GrOrd.intros(3))

apply(clarify)

apply (metis GrOrd.intros(5))

apply(rotate_tac 2)

apply(erule Prf.cases)

apply(simp_all)

apply(clarify)

apply (metis GrOrd.intros(5))

apply(clarify)

apply (metis GrOrd.intros(4))

apply(erule Prf.cases)

apply(simp_all)

apply (metis GrOrd.intros(7))

apply(erule Prf.cases)

apply(simp_all)

apply (metis GrOrd.intros(6))

done

lemma Gr_trans: 

  assumes "v1 \<prec> v2" "v2 \<prec> v3" "\<turnstile> v1 : r" "\<turnstile> v2 : r" "\<turnstile> v3 : r"

  shows "v1 \<prec> v3"

using assms

apply(induct r arbitrary: v1 v2 v3)

apply(erule Prf.cases)

apply(simp_all)[5]

apply(erule Prf.cases)

apply(simp_all)[5]

apply(erule Prf.cases)

apply(simp_all)[5]

apply(erule Prf.cases)

apply(simp_all)[5]

apply(erule Prf.cases)

apply(simp_all)[5]

defer

(* ALT case *)

apply(erule Prf.cases)

apply(simp_all (no_asm_use))[5]

apply(erule Prf.cases)

apply(simp_all (no_asm_use))[5]

apply(erule Prf.cases)

apply(simp_all (no_asm_use))[5]

apply(clarify)

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply (metis GrOrd.intros(3))

apply(clarify)

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply(erule Prf.cases)

apply(simp_all (no_asm_use))[5]

apply(clarify)

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply(clarify)

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply(erule Prf.cases)

apply(simp_all (no_asm_use))[5]

apply(erule Prf.cases)

apply(simp_all (no_asm_use))[5]

apply(clarify)

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply (metis GrOrd.intros(5))

apply(clarify)

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply(erule Prf.cases)

apply(simp_all (no_asm_use))[5]

apply(clarify)

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply (metis GrOrd.intros(5))

apply(clarify)

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply(erule GrOrd.cases)

apply(simp_all (no_asm_use))[7]

apply (metis GrOrd.intros(4))

(* seq case *)

apply(erule Prf.cases)

apply(simp_all (no_asm_use))[5]