Commit e11e092b by Gerwin Klein

### Aux.thy -> Auxiliary.thy because AUX is a reserved name in Windows

 ... ... @@ -8,7 +8,7 @@ header {* \isaheader{Auxiliary Definitions and Lemmata} *} theory Aux theory Auxiliary imports Main "~~/src/HOL/Library/FinFun_Syntax" ... ...
 ... ... @@ -18,7 +18,7 @@ imports Main "../../Collections/impl/TrieMapImpl" "../../Collections/impl/ListMapImpl" "../../Collections/impl/Fifo" Aux Auxiliary begin end
 theory Common_Main imports "../Basic/Aux" "../Basic/Auxiliary" "../Framework/FWProgress" "../Framework/FWBisimDeadlock" "../Framework/FWBisimLift" ... ...
 ... ... @@ -11,7 +11,7 @@ header {* theory Type imports "../Basic/Aux" "../Basic/Auxiliary" begin type_synonym cname = String.literal -- "class names" ... ...
 ... ... @@ -13,12 +13,12 @@ theory Compiler1 imports begin definition fresh_var :: "vname list \ vname" where "fresh_var Vs \ Aux.concat (STR ''V'' # Vs)" where "fresh_var Vs \ Auxiliary.concat (STR ''V'' # Vs)" lemma fresh_var_fresh: "fresh_var Vs \ set Vs" proof - have "\V \ set Vs. length (explode V) < length (explode (fresh_var Vs))" by(induct Vs)(auto simp add: fresh_var_def Aux.concat_def STR_inverse implode_def) by(induct Vs)(auto simp add: fresh_var_def Auxiliary.concat_def STR_inverse implode_def) thus ?thesis by auto qed ... ...
 ... ... @@ -8,7 +8,7 @@ Kildall's algorithm. header {* \isaheader{Kildall's Algorithm}\label{sec:Kildall} *} theory Kildall imports SemilatAlg "../Basic/Aux" imports SemilatAlg "../Basic/Auxiliary" begin locale Kildall_base = ... ...
 ... ... @@ -31,9 +31,9 @@ text {* Various other functions *} instantiation heapobj :: toString begin primrec toString_heapobj :: "heapobj \ String.literal" where "toString (Obj C fs) = Aux.concat [STR ''(Obj '', toString C, STR '', '', toString fs, STR '')'']" "toString (Obj C fs) = Auxiliary.concat [STR ''(Obj '', toString C, STR '', '', toString fs, STR '')'']" | "toString (Arr T si fs el) = Aux.concat [STR ''(['', toString si, STR '']'', toString T, STR '', '', toString fs, STR '', '', toString (map snd (rm_to_list el)), STR '')'']" Auxiliary.concat [STR ''(['', toString si, STR '']'', toString T, STR '', '', toString fs, STR '', '', toString (map snd (rm_to_list el)), STR '')'']" instance proof qed end ... ...
 ... ... @@ -8,7 +8,7 @@ header {* theory FWState imports "../Basic/Aux" "../Basic/Auxiliary" begin datatype lock_action = ... ...
 ... ... @@ -6,7 +6,7 @@ header {* \isaheader{Labelled transition systems} *} theory LTS imports "../Basic/Aux" "../Basic/Auxiliary" "../../Coinductive/TLList" "~~/src/HOL/Library/Quotient_Option" begin ... ...
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!