src/HOL/Mutabelle/mutabelle.ML
author huffman
Fri Aug 19 14:17:28 2011 -0700 (2011-08-19)
changeset 44311 42c5cbf68052
parent 43883 aacbe67793c3
child 45159 3f1d1ce024cb
permissions -rw-r--r--
Transcendental.thy: add tendsto_intros lemmas;
new isCont theorems;
simplify some proofs.
haftmann@37744
     1
(*  Title:      HOL/Mutabelle/mutabelle.ML
berghofe@34967
     2
    Author:     Veronika Ortner, TU Muenchen
bulwahn@34965
     3
wenzelm@41408
     4
Mutation of theorems.
bulwahn@34965
     5
*)
wenzelm@41408
     6
bulwahn@34965
     7
signature MUTABELLE =
bulwahn@34965
     8
sig
bulwahn@43883
     9
  exception WrongPath of string;
bulwahn@43883
    10
  exception WrongArg of string;
bulwahn@43883
    11
  val freeze : term -> term
bulwahn@43883
    12
  val mutate_exc : term -> string list -> int -> term list 
bulwahn@43883
    13
  val mutate_sign : term -> theory -> (string * string) list -> int -> term list 
bulwahn@43883
    14
  val mutate_mix : term -> theory -> string list -> 
bulwahn@34965
    15
   (string * string) list -> int -> term list
bulwahn@43883
    16
(*  val qc_test : term list -> (typ * typ) list -> theory ->
bulwahn@34965
    17
  int -> int -> int * Thm.cterm list * int * (Thm.cterm * (string * Thm.cterm) list) list
bulwahn@43883
    18
  val qc_test_file : bool -> term list -> (typ * typ) list 
bulwahn@34965
    19
   -> theory -> int -> int -> string -> unit
bulwahn@43883
    20
  val mutqc_file_exc : theory -> string list ->
bulwahn@34965
    21
  int -> Thm.thm -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    22
  val mutqc_file_sign : theory -> (string * string) list ->
bulwahn@34965
    23
  int -> Thm.thm -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    24
  val mutqc_file_mix : theory -> string list -> (string * string) list ->
bulwahn@34965
    25
  int -> Thm.thm -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    26
  val mutqc_file_rec_exc : theory -> string list -> int ->
bulwahn@34965
    27
  Thm.thm list -> (typ * typ) list -> int -> int -> string list -> unit
bulwahn@43883
    28
  val mutqc_file_rec_sign : theory -> (string * string) list -> int ->
bulwahn@34965
    29
  Thm.thm list -> (typ * typ) list -> int -> int -> string list -> unit
bulwahn@43883
    30
  val mutqc_file_rec_mix : theory -> string list -> (string * string) list ->
bulwahn@34965
    31
  int -> Thm.thm list -> (typ * typ) list -> int -> int -> string list -> unit
bulwahn@43883
    32
  val mutqc_thy_exc : theory -> theory ->
bulwahn@34965
    33
  string list -> int -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    34
  val mutqc_thy_sign : theory -> theory -> (string * string) list ->
bulwahn@34965
    35
  int -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    36
  val mutqc_thy_mix : theory -> theory -> string list -> (string * string) list ->
bulwahn@34965
    37
  int -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    38
  val mutqc_file_stat_sign : theory -> (string * string) list ->
bulwahn@34965
    39
  int -> Thm.thm list -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    40
  val mutqc_file_stat_exc : theory -> string list ->
bulwahn@34965
    41
  int -> Thm.thm list -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    42
  val mutqc_file_stat_mix : theory -> string list -> (string * string) list ->
bulwahn@34965
    43
  int -> Thm.thm list -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    44
  val mutqc_thystat_exc : (string -> thm -> bool) -> theory -> theory ->
bulwahn@34965
    45
  string list -> int -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    46
  val mutqc_thystat_sign : (string -> thm -> bool) -> theory -> theory -> (string * string) list ->
bulwahn@34965
    47
  int -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    48
  val mutqc_thystat_mix : (string -> thm -> bool) -> theory -> theory -> string list -> 
bulwahn@34965
    49
  (string * string) list -> int -> (typ * typ) list -> int -> int -> string -> unit
bulwahn@43883
    50
  val canonize_term: term -> string list -> term
bulwahn@43883
    51
*)  
bulwahn@43883
    52
  val all_unconcealed_thms_of : theory -> (string * thm) list
bulwahn@34965
    53
end;
bulwahn@34965
    54
bulwahn@34965
    55
structure Mutabelle : MUTABELLE = 
bulwahn@34965
    56
struct
bulwahn@34965
    57
bulwahn@34965
    58
fun all_unconcealed_thms_of thy =
bulwahn@34965
    59
  let
wenzelm@39557
    60
    val facts = Global_Theory.facts_of thy
bulwahn@34965
    61
  in
bulwahn@34965
    62
    Facts.fold_static
bulwahn@34965
    63
      (fn (s, ths) =>
bulwahn@34965
    64
        if Facts.is_concealed facts s then I else append (map (`(Thm.get_name_hint)) ths))
bulwahn@34965
    65
      facts []
bulwahn@34965
    66
  end;
bulwahn@34965
    67
bulwahn@34965
    68
fun thms_of thy = filter (fn (_, th) =>
bulwahn@34965
    69
   Context.theory_name (theory_of_thm th) = Context.theory_name thy) (all_unconcealed_thms_of thy);
bulwahn@34965
    70
bulwahn@34965
    71
fun consts_of thy =
bulwahn@34965
    72
 let
bulwahn@34965
    73
   val (namespace, const_table) = #constants (Consts.dest (Sign.consts_of thy))
bulwahn@34965
    74
   val consts = Symtab.dest const_table
bulwahn@34965
    75
 in
wenzelm@42429
    76
   map_filter (fn (s, (T, NONE)) => SOME (s, T) | _ => NONE)
bulwahn@34965
    77
     (filter_out (fn (s, _) => Name_Space.is_concealed namespace s) consts)
bulwahn@34965
    78
 end;
bulwahn@34965
    79
bulwahn@34965
    80
wenzelm@41408
    81
(*possibility to print a given term for debugging purposes*)
bulwahn@34965
    82
wenzelm@37863
    83
fun prt x = Pretty.writeln (Syntax.pretty_term_global @{theory Main} x);
bulwahn@34965
    84
bulwahn@34965
    85
val debug = (Unsynchronized.ref false);
bulwahn@34965
    86
fun debug_msg mutterm = if (!debug) then (prt mutterm) else ();
bulwahn@34965
    87
bulwahn@34965
    88
bulwahn@34965
    89
(*thrown in case the specified path doesn't exist in the specified term*)
bulwahn@34965
    90
bulwahn@34965
    91
exception WrongPath of string;
bulwahn@34965
    92
bulwahn@34965
    93
bulwahn@34965
    94
(*thrown in case the arguments did not fit to the function*)
bulwahn@34965
    95
bulwahn@34965
    96
exception WrongArg of string; 
bulwahn@34965
    97
bulwahn@34965
    98
(*Rename the bound variables in a term with the minimal Index min of 
bulwahn@34965
    99
bound variables. Variable (Bound(min)) will be renamed to Bound(0) etc. 
bulwahn@34965
   100
This is needed in course auf evaluation of contexts.*)
bulwahn@34965
   101
bulwahn@34965
   102
fun rename_bnds curTerm 0 = curTerm
bulwahn@34965
   103
 | rename_bnds (Bound(i)) minInd = 
bulwahn@34965
   104
   let 
bulwahn@34965
   105
     val erg = if (i-minInd < 0) then 0 else (i - minInd)
bulwahn@34965
   106
   in 
bulwahn@34965
   107
     Bound(erg)
bulwahn@34965
   108
   end
bulwahn@34965
   109
 | rename_bnds (Abs(name,t,uTerm)) minInd = 
bulwahn@34965
   110
   Abs(name,t,(rename_bnds uTerm minInd))
bulwahn@34965
   111
 | rename_bnds (fstUTerm $ sndUTerm) minInd =
bulwahn@34965
   112
   (rename_bnds fstUTerm minInd) $ (rename_bnds sndUTerm minInd)
bulwahn@34965
   113
 | rename_bnds elseTerm minInd = elseTerm;
bulwahn@34965
   114
bulwahn@34965
   115
bulwahn@34965
   116
bulwahn@34965
   117
bulwahn@34965
   118
bulwahn@34965
   119
(*Partition a term in its subterms and create an entry 
bulwahn@34965
   120
(term * type * abscontext * mincontext * path) 
bulwahn@34965
   121
for each term in the return list 
bulwahn@34965
   122
e.g: getSubTermList Abs(y, int, Const(f,int->int) $ Const(x,int) $ Bound(0))
bulwahn@34965
   123
will give       [(Const(f,int->int),int->int,[int],[],[00]),
bulwahn@34965
   124
               (Const(x,int),int,[int],[],[010]),
bulwahn@34965
   125
               (Bound(0),int,[int],[int],[110]),
bulwahn@34965
   126
               (Const(x,int) $ Bound(0),type,[int],[int],[10]),
bulwahn@34965
   127
               (Const(f,int->int) $ Const(x,int) $ Bound(0),type,[int],[int],[0],
bulwahn@34965
   128
               (Abs (y,int,Const(f,int->int) $ const(x,int) $ Bound(0)),type,[],[],[])]
bulwahn@34965
   129
                *)
bulwahn@34965
   130
bulwahn@34965
   131
fun getSubTermList (Const(name,t)) abscontext path acc =
bulwahn@34965
   132
   (Const(name,t),t,abscontext,abscontext,path)::acc
bulwahn@34965
   133
 | getSubTermList (Free(name,t)) abscontext path acc =
bulwahn@34965
   134
   (Free(name,t),t,abscontext,abscontext,path)::acc
bulwahn@34965
   135
 | getSubTermList (Var(indname,t)) abscontext path acc =
bulwahn@34965
   136
   (Var(indname,t),t,abscontext,abscontext,path)::acc
bulwahn@34965
   137
 | getSubTermList (Bound(i)) abscontext path acc =
bulwahn@34965
   138
   (Bound(0),nth abscontext i,abscontext, Library.drop i abscontext,path)::acc
bulwahn@34965
   139
 | getSubTermList (Abs(name,t,uTerm)) abscontext path acc = 
bulwahn@34965
   140
   let 
bulwahn@34965
   141
     val curTerm = Abs(name,t,uTerm)
bulwahn@34965
   142
     val bnos = Term.add_loose_bnos (curTerm,0,[])
bulwahn@34965
   143
     val minInd = if (bnos = []) then 0 
bulwahn@34965
   144
       else Library.foldl (fn (n,m) => if (n<m) then n else m) (hd bnos,tl bnos)
bulwahn@34965
   145
     val newTerm = rename_bnds curTerm minInd
bulwahn@34965
   146
     val newContext = Library.drop minInd abscontext
bulwahn@34965
   147
   in 
bulwahn@34965
   148
     getSubTermList uTerm (t::abscontext) (0::path) 
bulwahn@34965
   149
               ((newTerm,(fastype_of1 (abscontext, curTerm)),abscontext,newContext,path)::acc)
bulwahn@34965
   150
   end
bulwahn@34965
   151
 | getSubTermList (fstUTerm $ sndUTerm) abscontext path acc = 
bulwahn@34965
   152
   let 
bulwahn@34965
   153
     val curTerm = (fstUTerm $ sndUTerm)
bulwahn@34965
   154
     val bnos = Term.add_loose_bnos (curTerm, 0, [])
bulwahn@34965
   155
     val minInd = if (bnos = []) then 0
bulwahn@34965
   156
       else Library.foldl (fn (n,m) => if (n<m) then n else m) (hd bnos,tl bnos)
bulwahn@34965
   157
     val newTerm = rename_bnds curTerm minInd
bulwahn@34965
   158
     val newContext = Library.drop minInd abscontext
bulwahn@34965
   159
   in 
bulwahn@34965
   160
     getSubTermList fstUTerm abscontext (0::path) 
bulwahn@34965
   161
       (getSubTermList sndUTerm abscontext (1::path) 
bulwahn@34965
   162
         ((newTerm,(fastype_of1 (abscontext, curTerm)),abscontext,newContext,path)::acc)) 
bulwahn@34965
   163
   end;  
bulwahn@34965
   164
bulwahn@34965
   165
bulwahn@34965
   166
bulwahn@34965
   167
bulwahn@34965
   168
bulwahn@34965
   169
(*tests if the given element ist in the given list*)
bulwahn@34965
   170
bulwahn@34965
   171
fun in_list elem [] = false
bulwahn@34965
   172
 | in_list elem (x::xs) = if (elem = x) then true else in_list elem xs;
bulwahn@34965
   173
bulwahn@34965
   174
bulwahn@34965
   175
(*Evaluate if the longContext is more special as the shortContext. 
bulwahn@34965
   176
If so, a term with shortContext can be substituted in the place of a 
bulwahn@34965
   177
term with longContext*)
bulwahn@34965
   178
bulwahn@34965
   179
fun is_morespecial longContext shortContext = 
bulwahn@34965
   180
 let 
bulwahn@34965
   181
   val revlC = rev longContext
bulwahn@34965
   182
   val revsC = rev shortContext
bulwahn@34965
   183
   fun is_prefix [] longList = true
bulwahn@34965
   184
     | is_prefix shList [] = false
bulwahn@34965
   185
     | is_prefix (x::xs) (y::ys) = if (x=y) then is_prefix xs ys else false
bulwahn@34965
   186
 in 
bulwahn@34965
   187
   is_prefix revsC revlC
bulwahn@34965
   188
 end;
bulwahn@34965
   189
bulwahn@34965
   190
bulwahn@34965
   191
(*takes a (term * type * context * context * path)-tupel and searches in the specified list for 
bulwahn@34965
   192
terms with the same type and appropriate context. Returns a (term * path) list of these terms.
bulwahn@34965
   193
Used in order to generate a list of type-equal subterms of the original term*)
bulwahn@34965
   194
bulwahn@34965
   195
fun searchForMutatableSubTerm (sterm,stype,sabsContext,sminContext,spath) [] resultList = 
bulwahn@34965
   196
   resultList
bulwahn@34965
   197
 | searchForMutatableSubTerm (sterm,stype,sabsContext,sminContext,spath) 
bulwahn@34965
   198
   ((hdterm,hdtype,hdabsContext,hdminContext,hdpath)::xs) resultList = 
bulwahn@34965
   199
   if ((stype = hdtype) andalso (is_morespecial sabsContext hdminContext) 
bulwahn@34965
   200
     andalso (is_morespecial hdabsContext sminContext)) 
bulwahn@34965
   201
   then searchForMutatableSubTerm (sterm,stype,sabsContext,sminContext,spath) xs 
bulwahn@34965
   202
     ((hdterm,hdabsContext,hdminContext,hdpath)::resultList) 
bulwahn@34965
   203
   else searchForMutatableSubTerm (sterm,stype,sabsContext,sminContext,spath) xs resultList;
bulwahn@34965
   204
bulwahn@34965
   205
bulwahn@34965
   206
(*evaluates if the given function is in the passed list of forbidden functions*)
bulwahn@34965
   207
bulwahn@34965
   208
fun in_list_forb consSig (consNameStr,consType) [] = false
bulwahn@34965
   209
 | in_list_forb consSig (consNameStr,consType) ((forbNameStr,forbTypeStr)::xs) = 
bulwahn@34965
   210
   let 
bulwahn@34965
   211
     val forbType = Syntax.read_typ_global consSig forbTypeStr
bulwahn@34965
   212
     val typeSignature = #tsig (Sign.rep_sg consSig)
bulwahn@34965
   213
   in
bulwahn@34965
   214
     if ((consNameStr = forbNameStr) 
wenzelm@35845
   215
       andalso (Type.typ_instance typeSignature (consType,(Logic.varifyT_global forbType))))
bulwahn@34965
   216
     then true
bulwahn@34965
   217
     else in_list_forb consSig (consNameStr,consType) xs
bulwahn@34965
   218
   end;
bulwahn@34965
   219
bulwahn@34965
   220
bulwahn@34965
   221
bulwahn@34965
   222
(*searches in the given signature Consts with the same type as sterm and 
bulwahn@34965
   223
returns a list of those terms*)
bulwahn@34965
   224
bulwahn@34965
   225
fun searchForSignatureMutations (sterm,stype) consSig forbidden_funs = 
bulwahn@34965
   226
 let 
bulwahn@34965
   227
   val sigConsTypeList = consts_of consSig;
bulwahn@34965
   228
   val typeSignature = #tsig (Sign.rep_sg consSig)
bulwahn@34965
   229
 in 
bulwahn@34965
   230
   let 
bulwahn@34965
   231
     fun recursiveSearch mutatableTermList [] = mutatableTermList
bulwahn@34965
   232
       | recursiveSearch mutatableTermList ((ConsName,ConsType)::xs) = 
bulwahn@34965
   233
         if (Type.typ_instance typeSignature (stype,ConsType) 
bulwahn@34965
   234
           andalso (not (sterm = Const(ConsName,stype))) 
bulwahn@34965
   235
           andalso (not (in_list_forb consSig (ConsName,ConsType) forbidden_funs))) 
bulwahn@34965
   236
         then recursiveSearch ((Term.Const(ConsName,stype), [], [], [5])::mutatableTermList) xs
bulwahn@34965
   237
         else recursiveSearch mutatableTermList xs
bulwahn@34965
   238
     in
bulwahn@34965
   239
       recursiveSearch [] sigConsTypeList
bulwahn@34965
   240
     end
bulwahn@34965
   241
   end;     
bulwahn@34965
   242
bulwahn@34965
   243
bulwahn@34965
   244
(*generates a list of terms that can be used instead of the passed subterm in the original term. These terms either have
bulwahn@34965
   245
the same type and appropriate context and are generated from the list of subterms either - in case of a Const-term they have been found
bulwahn@34965
   246
in the current signature.
bulwahn@34965
   247
This function has 3 versions:
bulwahn@34965
   248
0: no instertion of signature functions, 
bulwahn@34965
   249
  only terms in the subTermList with the same type and appropriate context as the passed term are returned
bulwahn@34965
   250
1: no exchange of subterms,
bulwahn@34965
   251
  only signature functions are inserted at the place of type-aequivalent Conses
bulwahn@34965
   252
2: mixture of the two other versions. insertion of signature functions and exchange of subterms*)
bulwahn@34965
   253
bulwahn@34965
   254
fun searchForMutatableTerm 0 (sterm,stype,sabscontext,smincontext,spath) 
bulwahn@34965
   255
   subTerms consSig resultList forbidden_funs =
bulwahn@34965
   256
   searchForMutatableSubTerm (sterm,stype,sabscontext,smincontext,spath) subTerms resultList
bulwahn@34965
   257
 | searchForMutatableTerm 1 (Const(constName,constType),stype,sabscontext,smincontext,spath) 
bulwahn@34965
   258
   subTerms consSig resultList forbidden_funs = 
bulwahn@34965
   259
   searchForSignatureMutations (Const(constName,constType),stype) consSig forbidden_funs
bulwahn@34965
   260
 | searchForMutatableTerm 1 _ _ _ _ _ = []
bulwahn@34965
   261
 | searchForMutatableTerm 2 (Const(constName,constType),stype,sabscontext,smincontext,spath) 
bulwahn@34965
   262
   subTerms consSig resultList forbidden_funs = 
bulwahn@34965
   263
     let 
bulwahn@34965
   264
       val subtermMutations = searchForMutatableSubTerm 
bulwahn@34965
   265
         (Const(constName,constType),stype,sabscontext,smincontext,spath) subTerms resultList
bulwahn@34965
   266
       val signatureMutations = searchForSignatureMutations 
bulwahn@34965
   267
         (Const(constName,constType),stype) consSig forbidden_funs
bulwahn@34965
   268
     in
bulwahn@34965
   269
       subtermMutations@signatureMutations
bulwahn@34965
   270
     end
bulwahn@34965
   271
 | searchForMutatableTerm 2 (sterm,stype,sabscontext,smincontext,spath) 
bulwahn@34965
   272
   subTerms consSig resultList forbidden_funs =
bulwahn@34965
   273
   searchForMutatableSubTerm (sterm,stype,sabscontext,smincontext,spath) subTerms resultList
bulwahn@34965
   274
 | searchForMutatableTerm i _ _ _ _ _ = 
bulwahn@34965
   275
   raise WrongArg("Version " ^ string_of_int i ^ 
bulwahn@34965
   276
     " doesn't exist for function searchForMutatableTerm!") ;
bulwahn@34965
   277
bulwahn@34965
   278
bulwahn@34965
   279
bulwahn@34965
   280
bulwahn@34965
   281
(*evaluates if the two terms with paths passed as arguments can be exchanged, i.e. evaluates if one of the terms is a subterm of the other one*)  
bulwahn@34965
   282
bulwahn@34965
   283
fun areReplacable [] [] = false
bulwahn@34965
   284
 | areReplacable fstPath [] = false
bulwahn@34965
   285
 | areReplacable [] sndPath = false
bulwahn@34965
   286
 | areReplacable (x::xs) (y::ys) = if (x=y) then areReplacable xs ys else true; 
bulwahn@34965
   287
bulwahn@34965
   288
bulwahn@34965
   289
bulwahn@34965
   290
bulwahn@34965
   291
(*substitutes the term at the position of the first list in fstTerm by sndTerm. 
bulwahn@34965
   292
The lists represent paths as generated by createSubTermList*)
bulwahn@34965
   293
bulwahn@34965
   294
fun substitute [] fstTerm sndTerm = sndTerm
bulwahn@34965
   295
 | substitute (_::xs) (Abs(s,T,subTerm)) sndTerm = Abs(s,T,(substitute xs subTerm sndTerm))
bulwahn@34965
   296
 | substitute (0::xs) (t $ u) sndTerm = substitute xs t sndTerm $ u 
bulwahn@34965
   297
 | substitute (1::xs) (t $ u) sndTerm = t $ substitute xs u sndTerm
bulwahn@34965
   298
 | substitute (_::xs) _ sndTerm = 
bulwahn@34965
   299
   raise WrongPath ("The Term could not be found at the specified position"); 
bulwahn@34965
   300
bulwahn@34965
   301
bulwahn@34965
   302
(*get the subterm with the specified path in myTerm*)
bulwahn@34965
   303
bulwahn@34965
   304
fun getSubTerm myTerm [] = myTerm
bulwahn@34965
   305
 | getSubTerm (Abs(s,T,subTerm)) (0::xs) = getSubTerm subTerm xs
bulwahn@34965
   306
 | getSubTerm (t $ u) (0::xs) = getSubTerm t xs
bulwahn@34965
   307
 | getSubTerm (t $ u) (1::xs) = getSubTerm u xs
bulwahn@34965
   308
 | getSubTerm _ (_::xs) = 
bulwahn@34965
   309
   raise WrongPath ("The subterm could not be found at the specified position");
bulwahn@34965
   310
bulwahn@34965
   311
bulwahn@34965
   312
(*exchanges two subterms with the given paths in the original Term*)
bulwahn@34965
   313
bulwahn@34965
   314
fun replace origTerm (fstTerm, fstPath) (sndTerm, sndPath) = 
bulwahn@34965
   315
 if (areReplacable (rev fstPath) (rev sndPath))
bulwahn@34965
   316
 then substitute (rev sndPath) (substitute (rev fstPath) origTerm sndTerm) fstTerm
bulwahn@34965
   317
 else origTerm; 
bulwahn@34965
   318
bulwahn@34965
   319
bulwahn@34965
   320
bulwahn@34965
   321
bulwahn@34965
   322
(*tests if the terms with the given pathes in the origTerm are commutative
bulwahn@34965
   323
respecting the list of commutative operators (commutatives)*)
bulwahn@34965
   324
bulwahn@34965
   325
fun areCommutative origTerm fstPath sndPath commutatives =
bulwahn@34965
   326
 if (sndPath = []) 
bulwahn@34965
   327
 then false
bulwahn@34965
   328
 else
bulwahn@34965
   329
   let 
bulwahn@34965
   330
     val base = (tl sndPath)
bulwahn@34965
   331
   in
bulwahn@34965
   332
     let 
bulwahn@34965
   333
       val fstcomm = 1::0::base
bulwahn@34965
   334
       val opcomm = 0::0::base
bulwahn@34965
   335
     in
bulwahn@34965
   336
       if ((fstPath = fstcomm) andalso (is_Const (getSubTerm origTerm (rev opcomm))))
bulwahn@34965
   337
       then
bulwahn@34965
   338
         let 
bulwahn@34965
   339
           val Const(name,_) = (getSubTerm origTerm (rev opcomm))
bulwahn@34965
   340
         in
bulwahn@34965
   341
           if (in_list name commutatives) 
bulwahn@34965
   342
           then true 
bulwahn@34965
   343
           else false
bulwahn@34965
   344
         end
bulwahn@34965
   345
       else false
bulwahn@34965
   346
     end
bulwahn@34965
   347
   end;
bulwahn@34965
   348
bulwahn@34965
   349
bulwahn@34965
   350
(*Canonizes term t with the commutative operators stored in list 
bulwahn@34965
   351
commutatives*)
bulwahn@34965
   352
bulwahn@34965
   353
fun canonize_term (Const (s, T) $ t $ u) comms =
bulwahn@34965
   354
 let
bulwahn@34965
   355
   val t' = canonize_term t comms;
bulwahn@34965
   356
   val u' = canonize_term u comms;
bulwahn@34965
   357
 in 
haftmann@36692
   358
   if member (op =) comms s andalso Term_Ord.termless (u', t')
bulwahn@34965
   359
   then Const (s, T) $ u' $ t'
bulwahn@34965
   360
   else Const (s, T) $ t' $ u'
bulwahn@34965
   361
 end
bulwahn@34965
   362
 | canonize_term (t $ u) comms = canonize_term t comms $ canonize_term u comms
bulwahn@34965
   363
 | canonize_term (Abs (s, T, t)) comms = Abs (s, T, canonize_term t comms)
bulwahn@34965
   364
 | canonize_term t comms = t;
bulwahn@34965
   365
bulwahn@34965
   366
bulwahn@34965
   367
(*inspect the passed list and mutate origTerm following the elements of the list:
bulwahn@34965
   368
if the path of the current element is [5] (dummy path), the term has been found in the signature 
bulwahn@34965
   369
and the subterm will be substituted by it
bulwahn@34965
   370
else the term has been found in the original term and the two subterms have to be exchanged
bulwahn@34965
   371
The additional parameter commutatives indicates the commutative operators  
bulwahn@34965
   372
in the term whose operands won't be exchanged*)
bulwahn@34965
   373
bulwahn@34965
   374
fun createMutatedTerms origTerm _ [] commutatives mutatedTerms = mutatedTerms
bulwahn@34965
   375
 | createMutatedTerms origTerm (hdt as (hdTerm,hdabsContext,hdminContext,hdPath))
bulwahn@34965
   376
   ((sndTerm,sndabsContext,sndminContext,sndPath)::xs) commutatives mutatedTerms = 
bulwahn@34965
   377
   if (sndPath = [5])
bulwahn@34965
   378
   then
bulwahn@34965
   379
     let 
bulwahn@34965
   380
         val canonized = canonize_term (substitute (rev hdPath) origTerm sndTerm) commutatives
bulwahn@34965
   381
       in
bulwahn@34965
   382
         if (canonized = origTerm)  
bulwahn@34965
   383
         then createMutatedTerms origTerm hdt xs commutatives mutatedTerms
bulwahn@34965
   384
         else createMutatedTerms origTerm hdt xs commutatives 
bulwahn@34965
   385
           (insert op aconv canonized mutatedTerms)
bulwahn@34965
   386
       end
bulwahn@34965
   387
     else 
bulwahn@34965
   388
       if ((areCommutative origTerm hdPath sndPath commutatives)
bulwahn@34965
   389
         orelse (areCommutative origTerm sndPath hdPath commutatives)) 
bulwahn@34965
   390
       then createMutatedTerms origTerm hdt xs commutatives mutatedTerms
bulwahn@34965
   391
       else
bulwahn@34965
   392
         let 
bulwahn@34965
   393
           val canonized = canonize_term 
bulwahn@34965
   394
             (replace origTerm
bulwahn@34965
   395
                (incr_boundvars (length sndabsContext - length hdminContext) hdTerm,
bulwahn@34965
   396
                 hdPath)
bulwahn@34965
   397
                (incr_boundvars (length hdabsContext - length sndminContext) sndTerm,
bulwahn@34965
   398
                 sndPath)) commutatives
bulwahn@34965
   399
         in
bulwahn@34965
   400
           if (not(canonized = origTerm)) 
bulwahn@34965
   401
           then createMutatedTerms origTerm hdt xs commutatives 
bulwahn@34965
   402
             (insert op aconv canonized mutatedTerms)
bulwahn@34965
   403
           else createMutatedTerms origTerm hdt xs commutatives mutatedTerms
bulwahn@34965
   404
         end;
bulwahn@34965
   405
bulwahn@34965
   406
bulwahn@34965
   407
bulwahn@34965
   408
(*mutates origTerm by exchanging subterms. The mutated terms are returned in a term list
bulwahn@34965
   409
The parameter commutatives consists of a list of commutative operators. The permutation of their 
bulwahn@34965
   410
operands won't be considered as a new term
bulwahn@34965
   411
!!!Attention!!!: The given origTerm must be canonized. Use function canonize_term!*)
bulwahn@34965
   412
bulwahn@34965
   413
fun mutate_once option origTerm tsig commutatives forbidden_funs= 
bulwahn@34965
   414
 let 
bulwahn@34965
   415
   val subTermList = getSubTermList origTerm [] [] []
bulwahn@34965
   416
 in
bulwahn@34965
   417
   let 
bulwahn@34965
   418
     fun replaceRecursively [] mutatedTerms = mutatedTerms
bulwahn@34965
   419
       | replaceRecursively ((hdTerm,hdType,hdabsContext,hdminContext,hdPath)::tail) 
bulwahn@34965
   420
         mutatedTerms =
bulwahn@34965
   421
         replaceRecursively tail (union op aconv (createMutatedTerms origTerm 
bulwahn@34965
   422
           (hdTerm,hdabsContext,hdminContext,hdPath) 
bulwahn@34965
   423
           (searchForMutatableTerm option (hdTerm,hdType,hdabsContext,hdminContext,hdPath) 
bulwahn@34965
   424
             tail tsig [] forbidden_funs) 
bulwahn@34965
   425
           commutatives []) mutatedTerms)
bulwahn@34965
   426
   in
bulwahn@34965
   427
     replaceRecursively subTermList []
bulwahn@34965
   428
   end
bulwahn@34965
   429
 end;
bulwahn@34965
   430
bulwahn@34965
   431
bulwahn@34965
   432
bulwahn@34965
   433
bulwahn@34965
   434
(*helper function in order to apply recursively the mutate_once function on a whole list of terms
bulwahn@34965
   435
Needed for the mutate function*)
bulwahn@34965
   436
bulwahn@34965
   437
fun mutate_once_rec option [] tsig commutatives forbidden_funs acc = acc
bulwahn@34965
   438
 | mutate_once_rec option (x::xs) tsig commutatives forbidden_funs acc = 
bulwahn@34965
   439
   mutate_once_rec option xs tsig commutatives forbidden_funs 
bulwahn@34965
   440
     (union op aconv (mutate_once option x tsig commutatives forbidden_funs) acc);
bulwahn@34965
   441
bulwahn@34965
   442
bulwahn@34965
   443
bulwahn@34965
   444
(*apply function mutate_once iter times on the given origTerm. *)
bulwahn@34965
   445
(*call of mutiere with canonized form of origTerm. Prevents us of the computation of
bulwahn@34965
   446
canonization in the course of insertion of new terms!*)
bulwahn@34965
   447
bulwahn@34965
   448
fun mutate option origTerm tsig commutatives forbidden_funs 0 = []
bulwahn@34965
   449
 | mutate option origTerm tsig commutatives forbidden_funs 1 = 
bulwahn@34965
   450
   mutate_once option (canonize_term origTerm commutatives) tsig commutatives forbidden_funs
bulwahn@34965
   451
 | mutate option origTerm tsig commutatives forbidden_funs iter = 
bulwahn@34965
   452
   mutate_once_rec option (mutate option origTerm tsig commutatives forbidden_funs (iter-1)) 
bulwahn@34965
   453
     tsig commutatives forbidden_funs []; 
bulwahn@34965
   454
bulwahn@34965
   455
(*mutate origTerm iter times by only exchanging subterms*)
bulwahn@34965
   456
bulwahn@34965
   457
fun mutate_exc origTerm commutatives iter =
wenzelm@37863
   458
 mutate 0 origTerm @{theory Main} commutatives [] iter;
bulwahn@34965
   459
bulwahn@34965
   460
bulwahn@34965
   461
(*mutate origTerm iter times by only inserting signature functions*)
bulwahn@34965
   462
bulwahn@34965
   463
fun mutate_sign origTerm tsig forbidden_funs iter = 
bulwahn@34965
   464
 mutate 1 origTerm tsig [] forbidden_funs iter;
bulwahn@34965
   465
bulwahn@34965
   466
bulwahn@34965
   467
(*mutate origTerm iter times by exchange of subterms and insertion of subterms*)
bulwahn@34965
   468
bulwahn@34965
   469
fun mutate_mix origTerm tsig commutatives forbidden_funs iter =
bulwahn@34965
   470
 mutate 2 origTerm tsig commutatives forbidden_funs iter;  
bulwahn@34965
   471
bulwahn@34965
   472
bulwahn@34965
   473
(*helper function in order to prettily print a list of terms*)
bulwahn@34965
   474
bulwahn@34965
   475
fun pretty xs = map (fn (id, t) => (id, (HOLogic.mk_number HOLogic.natT
bulwahn@34965
   476
 (HOLogic.dest_nat t)) handle TERM _ => t)) xs;
bulwahn@34965
   477
bulwahn@34965
   478
bulwahn@34965
   479
(*helper function for the quickcheck invocation. Evaluates the quickcheck_term function on a whole list of terms
bulwahn@34965
   480
and tries to print the exceptions*)
bulwahn@34965
   481
bulwahn@34965
   482
fun freeze (t $ u) = freeze t $ freeze u
bulwahn@34965
   483
 | freeze (Abs (s, T, t)) = Abs (s, T, freeze t)
bulwahn@34965
   484
 | freeze (Var ((a, i), T)) =
bulwahn@34965
   485
     Free (if i = 0 then a else a ^ "_" ^ string_of_int i, T)
bulwahn@34965
   486
 | freeze t = t;
bulwahn@34965
   487
bulwahn@34965
   488
fun inst_type insts (Type (s, Ts)) = Type (s, map (inst_type insts) Ts)
bulwahn@34965
   489
 | inst_type insts T = the_default HOLogic.intT (AList.lookup op = insts T);
bulwahn@34965
   490
wenzelm@35625
   491
fun preprocess thy insts t = Object_Logic.atomize_term thy
bulwahn@34965
   492
 (map_types (inst_type insts) (freeze t));
bulwahn@34965
   493
bulwahn@34965
   494
fun is_executable thy insts th =
bulwahn@43883
   495
  let
bulwahn@43883
   496
    val ctxt' = Proof_Context.init_global thy
bulwahn@40920
   497
      |> Config.put Quickcheck.size 1
bulwahn@40920
   498
      |> Config.put Quickcheck.iterations 1
bulwahn@43883
   499
    val test = Quickcheck.test_term Exhaustive_Generators.compile_generator_expr ctxt' (true, false)
bulwahn@43883
   500
  in  
bulwahn@43883
   501
    case try test (preprocess thy insts (prop_of th), []) of
bulwahn@43883
   502
      SOME _ => (Output.urgent_message "executable"; true)
bulwahn@43883
   503
    | NONE => (Output.urgent_message ("not executable"); false)
bulwahn@43883
   504
  end;
bulwahn@43883
   505
(*
bulwahn@34965
   506
(*create a string of a list of terms*)
bulwahn@34965
   507
bulwahn@34965
   508
fun string_of_ctermlist thy [] acc = acc
bulwahn@34965
   509
 | string_of_ctermlist thy (x::xs) acc = 
bulwahn@34965
   510
   string_of_ctermlist thy xs ((Syntax.string_of_term_global thy (term_of x)) ^ "\n" ^ acc);
bulwahn@34965
   511
bulwahn@34965
   512
(*helper function in order to decompose the counter examples generated by quickcheck*)
bulwahn@34965
   513
bulwahn@34965
   514
fun decompose_ce thy [] acc = acc
bulwahn@34965
   515
 | decompose_ce thy ((varname,varce)::xs) acc = 
bulwahn@34965
   516
   decompose_ce thy xs ("\t" ^ varname ^ " instanciated to " ^ 
bulwahn@34965
   517
     (Syntax.string_of_term_global thy (term_of varce)) ^ "\n" ^ acc);
bulwahn@34965
   518
bulwahn@34965
   519
(*helper function in order to decompose a list of counter examples*)
bulwahn@34965
   520
bulwahn@34965
   521
fun decompose_celist thy [] acc = acc
bulwahn@34965
   522
 | decompose_celist thy ((mutTerm,varcelist)::xs) acc = decompose_celist thy xs 
bulwahn@34965
   523
   ("mutated term : " ^ 
bulwahn@34965
   524
   (Syntax.string_of_term_global thy (term_of mutTerm)) ^ "\n" ^ 
bulwahn@34965
   525
   "counterexample : \n" ^ 
bulwahn@34965
   526
   (decompose_ce thy (rev varcelist) "") ^ acc); 
bulwahn@34965
   527
bulwahn@34965
   528
bulwahn@34965
   529
(*quickcheck test the list of mutants mutated by applying the type instantiations 
bulwahn@34965
   530
insts and using the quickcheck-theory usedthy. The results of quickcheck are stored
bulwahn@34965
   531
in the file with name filename. If app is true, the output will be appended to the file. 
bulwahn@34965
   532
Else it will be overwritten. *)
bulwahn@34965
   533
bulwahn@34965
   534
fun qc_test_file app mutated insts usedthy sz qciter filename =
bulwahn@34965
   535
 let 
bulwahn@34965
   536
   val statisticList = qc_test mutated insts usedthy sz qciter
bulwahn@34965
   537
   val passed = (string_of_int (#1 statisticList)) ^ 
bulwahn@34965
   538
     " terms passed the quickchecktest: \n\n" ^ 
bulwahn@34965
   539
     (string_of_ctermlist usedthy (rev (#2 statisticList)) "") 
bulwahn@34965
   540
   val counterexps = (string_of_int (#3 statisticList)) ^ 
bulwahn@34965
   541
     " terms produced a counterexample: \n\n" ^
bulwahn@34965
   542
     decompose_celist usedthy (rev (#4 statisticList)) "" 
bulwahn@34965
   543
 in
bulwahn@34965
   544
   if (app = false) 
bulwahn@34965
   545
   then File.write (Path.explode filename) (passed ^ "\n\n" ^ counterexps)
bulwahn@34965
   546
   else File.append (Path.explode filename) (passed ^ "\n\n" ^ counterexps)
bulwahn@34965
   547
 end;
bulwahn@34965
   548
bulwahn@34965
   549
bulwahn@34965
   550
(*mutate sourceThm with the mutate-version given in option and check the resulting mutants. 
bulwahn@34965
   551
The output will be written to the file with name filename*)
bulwahn@34965
   552
bulwahn@34965
   553
fun mutqc_file option usedthy commutatives forbidden_funs iter sourceThm insts sz qciter filename =
bulwahn@34965
   554
 let 
bulwahn@34965
   555
   val mutated = mutate option (prop_of sourceThm) 
bulwahn@34965
   556
     usedthy commutatives forbidden_funs iter 
bulwahn@34965
   557
 in
bulwahn@34965
   558
   qc_test_file false mutated insts usedthy sz qciter filename 
bulwahn@34965
   559
 end;
bulwahn@34965
   560
bulwahn@34965
   561
(*exchange version of function mutqc_file*)
bulwahn@34965
   562
bulwahn@34965
   563
fun mutqc_file_exc usedthy commutatives iter sourceThm insts sz qciter filename =
bulwahn@34965
   564
 mutqc_file 0 usedthy commutatives [] iter sourceThm insts sz qciter filename;
bulwahn@34965
   565
bulwahn@34965
   566
bulwahn@34965
   567
(*sinature version of function mutqc_file*)
bulwahn@34965
   568
fun mutqc_file_sign usedthy forbidden_funs iter sourceThm insts sz qciter filename= 
bulwahn@34965
   569
 mutqc_file 1 usedthy [] forbidden_funs iter sourceThm insts sz qciter filename;
bulwahn@34965
   570
bulwahn@34965
   571
(*mixed version of function mutqc_file*)
bulwahn@34965
   572
bulwahn@34965
   573
fun mutqc_file_mix usedthy commutatives forbidden_funs iter sourceThm insts sz qciter filename =
bulwahn@34965
   574
 mutqc_file 2 usedthy commutatives forbidden_funs iter sourceThm insts sz qciter filename;
bulwahn@34965
   575
bulwahn@34965
   576
bulwahn@34965
   577
bulwahn@34965
   578
(*apply function mutqc_file on a list of theorems. The output for each theorem 
bulwahn@34965
   579
will be stored in a seperated file whose filename must be indicated in a list*)
bulwahn@34965
   580
bulwahn@34965
   581
fun mutqc_file_rec option usedthy commutatives forbFuns iter [] insts sz qciter _ = ()
bulwahn@34965
   582
 | mutqc_file_rec option usedthy commutatives forbFuns iter  sourceThms insts sz qciter [] = 
bulwahn@34965
   583
   raise WrongArg ("Not enough files for the output of qc_test_file_rec!")
bulwahn@34965
   584
 | mutqc_file_rec option usedthy commutatives forbFuns iter (x::xs) insts sz qciter (y::ys) = 
bulwahn@34965
   585
   (mutqc_file option usedthy commutatives forbFuns iter x insts sz qciter y ; 
bulwahn@34965
   586
   mutqc_file_rec option usedthy commutatives forbFuns iter xs insts sz qciter ys);
bulwahn@34965
   587
bulwahn@34965
   588
bulwahn@34965
   589
(*exchange version of function mutqc_file_rec*)
bulwahn@34965
   590
bulwahn@34965
   591
fun mutqc_file_rec_exc usedthy commutatives iter sourceThms insts sz qciter files =
bulwahn@34965
   592
 mutqc_file_rec 0 usedthy commutatives [] iter sourceThms insts sz qciter files;
bulwahn@34965
   593
bulwahn@34965
   594
(*signature version of function mutqc_file_rec*)
bulwahn@34965
   595
bulwahn@34965
   596
fun mutqc_file_rec_sign usedthy forbidden_funs iter sourceThms insts sz qciter files =
bulwahn@34965
   597
 mutqc_file_rec 1 usedthy [] forbidden_funs iter sourceThms insts sz qciter files;
bulwahn@34965
   598
bulwahn@34965
   599
(*mixed version of function mutqc_file_rec*)
bulwahn@34965
   600
bulwahn@34965
   601
fun mutqc_file_rec_mix usedthy commutatives forbidden_funs iter sourceThms insts sz qciter files =
bulwahn@34965
   602
 mutqc_file_rec 2 usedthy commutatives forbidden_funs iter sourceThms insts sz qciter files;
bulwahn@34965
   603
bulwahn@34965
   604
(*create the appropriate number of spaces in order to properly print a table*)
bulwahn@34965
   605
bulwahn@34965
   606
fun create_spaces entry spacenum =
bulwahn@34965
   607
 let 
wenzelm@41067
   608
   val diff = spacenum - (size entry)
wenzelm@41067
   609
 in
wenzelm@41067
   610
   if (diff > 0)
bulwahn@34965
   611
   then implode (replicate diff " ")
bulwahn@34965
   612
   else ""
bulwahn@34965
   613
 end;
bulwahn@34965
   614
bulwahn@34965
   615
bulwahn@34965
   616
(*create a statistic of the output of a quickcheck test on the passed thmlist*)
bulwahn@34965
   617
bulwahn@34965
   618
fun mutqc_file_stat option usedthy commutatives forbidden_funs iter thmlist insts sz qciter filename = 
bulwahn@34965
   619
 let 
bulwahn@34965
   620
   fun mutthmrec [] = ()
bulwahn@34965
   621
   |   mutthmrec (x::xs) =
bulwahn@34965
   622
     let 
bulwahn@34965
   623
       val mutated = mutate option (prop_of x) usedthy
bulwahn@34965
   624
         commutatives forbidden_funs iter
bulwahn@34965
   625
       val (passednum,_,cenum,_) = qc_test mutated insts usedthy sz qciter
wenzelm@36743
   626
       val thmname =  "\ntheorem " ^ Thm.get_name_hint x ^ ":"
bulwahn@34965
   627
       val pnumstring = string_of_int passednum
bulwahn@34965
   628
       val cenumstring = string_of_int cenum
bulwahn@34965
   629
     in
bulwahn@34965
   630
       (File.append (Path.explode filename) 
bulwahn@34965
   631
         (thmname ^ (create_spaces thmname 50) ^ 
bulwahn@34965
   632
         pnumstring ^ (create_spaces pnumstring 20) ^ 
bulwahn@34965
   633
         cenumstring ^ (create_spaces cenumstring 20) ^ "\n");
bulwahn@34965
   634
       mutthmrec xs)
bulwahn@34965
   635
     end;
bulwahn@34965
   636
 in 
bulwahn@34965
   637
   (File.write (Path.explode filename) 
bulwahn@34965
   638
     ("\n\ntheorem name" ^ (create_spaces "theorem name" 50) ^ 
bulwahn@34965
   639
     "passed mutants"  ^ (create_spaces "passed mutants" 20) ^ 
bulwahn@34965
   640
     "counter examples\n\n" );
bulwahn@34965
   641
   mutthmrec thmlist)
bulwahn@34965
   642
 end;
bulwahn@34965
   643
bulwahn@34965
   644
(*signature version of function mutqc_file_stat*)
bulwahn@34965
   645
bulwahn@34965
   646
fun mutqc_file_stat_sign usedthy forbidden_funs iter thmlist insts sz qciter filename =
bulwahn@34965
   647
 mutqc_file_stat 1 usedthy [] forbidden_funs iter thmlist insts sz qciter filename;
bulwahn@34965
   648
bulwahn@34965
   649
(*exchange version of function mutqc_file_stat*)
bulwahn@34965
   650
bulwahn@34965
   651
fun mutqc_file_stat_exc usedthy commutatives iter thmlist insts sz qciter filename =
bulwahn@34965
   652
 mutqc_file_stat 0 usedthy commutatives [] iter thmlist insts sz qciter filename;
bulwahn@34965
   653
bulwahn@34965
   654
(*mixed version of function mutqc_file_stat*)
bulwahn@34965
   655
bulwahn@34965
   656
fun mutqc_file_stat_mix usedthy commutatives forbidden_funs iter thmlist insts sz qciter filename =
bulwahn@34965
   657
 mutqc_file_stat 2 usedthy commutatives forbidden_funs iter thmlist insts sz qciter filename;
bulwahn@34965
   658
bulwahn@34965
   659
(*mutate and quickcheck-test all the theorems contained in the passed theory. 
bulwahn@34965
   660
The output will be stored in a single file*)
bulwahn@34965
   661
bulwahn@34965
   662
fun mutqc_thy option mutthy usedthy commutatives forbidden_funs iter insts sz qciter filename =
bulwahn@34965
   663
 let
bulwahn@34965
   664
   val thmlist = filter (is_executable mutthy insts o snd) (thms_of mutthy);
bulwahn@34965
   665
   fun mutthmrec [] = ()
bulwahn@34965
   666
     | mutthmrec ((name,thm)::xs) = 
bulwahn@34965
   667
         let
bulwahn@34965
   668
           val mutated = mutate option (prop_of thm) 
bulwahn@34965
   669
             usedthy commutatives forbidden_funs iter
bulwahn@34965
   670
         in
bulwahn@34965
   671
           (File.append (Path.explode filename) 
bulwahn@34965
   672
             ("--------------------------\n\nQuickchecktest of theorem " ^ name ^ ":\n\n");
bulwahn@34965
   673
           qc_test_file true mutated insts usedthy sz qciter filename;
bulwahn@34965
   674
           mutthmrec xs)
bulwahn@34965
   675
         end;
bulwahn@34965
   676
   in 
bulwahn@34965
   677
     mutthmrec thmlist
bulwahn@34965
   678
   end;
bulwahn@34965
   679
bulwahn@34965
   680
(*exchange version of function mutqc_thy*)
bulwahn@34965
   681
bulwahn@34965
   682
fun mutqc_thy_exc mutthy usedthy commutatives iter insts sz qciter filename =
bulwahn@34965
   683
 mutqc_thy 0 mutthy usedthy commutatives [] iter insts sz qciter filename;
bulwahn@34965
   684
bulwahn@34965
   685
(*signature version of function mutqc_thy*)
bulwahn@34965
   686
bulwahn@34965
   687
fun mutqc_thy_sign mutthy usedthy forbidden_funs iter insts sz qciter filename =
bulwahn@34965
   688
 mutqc_thy 1 mutthy usedthy [] forbidden_funs iter insts sz qciter filename;
bulwahn@34965
   689
bulwahn@34965
   690
(*mixed version of function mutqc_thy*)
bulwahn@34965
   691
bulwahn@34965
   692
fun mutqc_thy_mix mutthy usedthy commutatives forbidden_funs iter insts sz qciter filename =
bulwahn@34965
   693
 mutqc_thy 2 mutthy usedthy commutatives forbidden_funs iter insts sz qciter filename;
bulwahn@34965
   694
bulwahn@34965
   695
(*create a statistic representation of the call of function mutqc_thy*)
bulwahn@34965
   696
bulwahn@34965
   697
fun mutqc_thystat option p mutthy usedthy commutatives forbidden_funs iter insts sz qciter filename =
bulwahn@34965
   698
 let
bulwahn@34965
   699
   val thmlist = filter
wenzelm@40132
   700
     (fn (s, th) => not (p s th) andalso (Output.urgent_message s; is_executable mutthy insts th)) (thms_of mutthy)
bulwahn@34965
   701
   fun mutthmrec [] = ()
bulwahn@34965
   702
   |   mutthmrec ((name,thm)::xs) =
bulwahn@34965
   703
     let          
wenzelm@40132
   704
       val _ = Output.urgent_message ("mutthmrec: " ^ name);
bulwahn@34965
   705
       val mutated = mutate option (prop_of thm) usedthy
bulwahn@34965
   706
           commutatives forbidden_funs iter
bulwahn@34965
   707
       val (passednum,_,cenum,_) = qc_test mutated insts usedthy sz qciter
bulwahn@34965
   708
       val thmname =  "\ntheorem " ^ name ^ ":"
bulwahn@34965
   709
       val pnumstring = string_of_int passednum
bulwahn@34965
   710
       val cenumstring = string_of_int cenum
bulwahn@34965
   711
     in
bulwahn@34965
   712
       (File.append (Path.explode filename) 
bulwahn@34965
   713
         (thmname ^ (create_spaces thmname 50) ^ 
bulwahn@34965
   714
         pnumstring ^ (create_spaces pnumstring 20) ^ 
bulwahn@34965
   715
         cenumstring ^ (create_spaces cenumstring 20) ^ "\n");
bulwahn@34965
   716
       mutthmrec xs)
bulwahn@34965
   717
     end;
bulwahn@34965
   718
 in 
bulwahn@34965
   719
   (File.write (Path.explode filename) ("Result of the quickcheck-test of theory " ^
bulwahn@34965
   720
     ":\n\ntheorem name" ^ (create_spaces "theorem name" 50) ^ 
bulwahn@34965
   721
     "passed mutants"  ^ (create_spaces "passed mutants" 20) ^ 
bulwahn@34965
   722
     "counter examples\n\n" );
bulwahn@34965
   723
   mutthmrec thmlist)
bulwahn@34965
   724
 end;
bulwahn@34965
   725
bulwahn@34965
   726
(*exchange version of function mutqc_thystat*)
wenzelm@41067
   727
bulwahn@34965
   728
fun mutqc_thystat_exc p mutthy usedthy commutatives iter insts sz qciter filename =
bulwahn@34965
   729
 mutqc_thystat 0 p mutthy usedthy commutatives [] iter insts sz qciter filename;
bulwahn@34965
   730
bulwahn@34965
   731
(*signature version of function mutqc_thystat*)
bulwahn@34965
   732
bulwahn@34965
   733
fun mutqc_thystat_sign p mutthy usedthy forbidden_funs iter insts sz qciter filename =
bulwahn@34965
   734
 mutqc_thystat 1 p mutthy usedthy [] forbidden_funs iter insts sz qciter filename;
bulwahn@34965
   735
bulwahn@34965
   736
(*mixed version of function mutqc_thystat*)
bulwahn@34965
   737
bulwahn@34965
   738
fun mutqc_thystat_mix p mutthy usedthy commutatives forbidden_funs iter insts sz qciter filename =
bulwahn@34965
   739
 mutqc_thystat 2 p mutthy usedthy commutatives forbidden_funs iter insts sz qciter filename;
bulwahn@43883
   740
*)
bulwahn@34965
   741
bulwahn@34965
   742
end