src/HOL/Tools/Predicate_Compile/predicate_compile_aux.ML
author wenzelm
Fri Dec 17 17:08:56 2010 +0100 (2010-12-17)
changeset 41228 e1fce873b814
parent 40844 5895c525739d
child 42094 e6867e9c6d10
permissions -rw-r--r--
renamed structure MetaSimplifier to raw_Simplifer, to emphasize its meaning;
wenzelm@33265
     1
(*  Title:      HOL/Tools/Predicate_Compile/predicate_compile_aux.ML
wenzelm@33265
     2
    Author:     Lukas Bulwahn, TU Muenchen
bulwahn@33250
     3
wenzelm@33265
     4
Auxilary functions for predicate compiler.
bulwahn@33250
     5
*)
bulwahn@33250
     6
bulwahn@36047
     7
signature PREDICATE_COMPILE_AUX =
bulwahn@36047
     8
sig
bulwahn@36047
     9
  (* general functions *)
bulwahn@36047
    10
  val apfst3 : ('a -> 'd) -> 'a * 'b * 'c -> 'd * 'b * 'c
bulwahn@36047
    11
  val apsnd3 : ('b -> 'd) -> 'a * 'b * 'c -> 'a * 'd * 'c
bulwahn@36047
    12
  val aptrd3 : ('c -> 'd) -> 'a * 'b * 'c -> 'a * 'b * 'd
bulwahn@36047
    13
  val find_indices : ('a -> bool) -> 'a list -> int list
bulwahn@36047
    14
  val assert : bool -> unit
bulwahn@36047
    15
  (* mode *)
bulwahn@36047
    16
  datatype mode = Bool | Input | Output | Pair of mode * mode | Fun of mode * mode
bulwahn@36047
    17
  val eq_mode : mode * mode -> bool
bulwahn@39311
    18
  val mode_ord: mode * mode -> order
bulwahn@36047
    19
  val list_fun_mode : mode list -> mode
bulwahn@36047
    20
  val strip_fun_mode : mode -> mode list
bulwahn@36047
    21
  val dest_fun_mode : mode -> mode list
bulwahn@36047
    22
  val dest_tuple_mode : mode -> mode list
bulwahn@36047
    23
  val all_modes_of_typ : typ -> mode list
bulwahn@36047
    24
  val all_smodes_of_typ : typ -> mode list
bulwahn@36047
    25
  val fold_map_aterms_prodT : ('a -> 'a -> 'a) -> (typ -> 'b -> 'a * 'b) -> typ -> 'b -> 'a * 'b
bulwahn@36047
    26
  val map_filter_prod : (term -> term option) -> term -> term option
bulwahn@36047
    27
  val replace_ho_args : mode -> term list -> term list -> term list
bulwahn@36047
    28
  val ho_arg_modes_of : mode -> mode list
bulwahn@36047
    29
  val ho_argsT_of : mode -> typ list -> typ list
bulwahn@36047
    30
  val ho_args_of : mode -> term list -> term list
bulwahn@39299
    31
  val ho_args_of_typ : typ -> term list -> term list
bulwahn@39299
    32
  val ho_argsT_of_typ : typ list -> typ list
bulwahn@36047
    33
  val split_map_mode : (mode -> term -> term option * term option)
bulwahn@36047
    34
    -> mode -> term list -> term list * term list
bulwahn@36047
    35
  val split_map_modeT : (mode -> typ -> typ option * typ option)
bulwahn@36047
    36
    -> mode -> typ list -> typ list * typ list
bulwahn@36047
    37
  val split_mode : mode -> term list -> term list * term list
bulwahn@40139
    38
  val split_modeT : mode -> typ list -> typ list * typ list
bulwahn@36047
    39
  val string_of_mode : mode -> string
bulwahn@36047
    40
  val ascii_string_of_mode : mode -> string
bulwahn@36047
    41
  (* premises *)
bulwahn@36047
    42
  datatype indprem = Prem of term | Negprem of term | Sidecond of term
bulwahn@36047
    43
    | Generator of (string * typ)
bulwahn@36251
    44
  val dest_indprem : indprem -> term
bulwahn@36254
    45
  val map_indprem : (term -> term) -> indprem -> indprem
bulwahn@36047
    46
  (* general syntactic functions *)
bulwahn@36047
    47
  val conjuncts : term -> term list
bulwahn@36047
    48
  val is_equationlike : thm -> bool
bulwahn@36047
    49
  val is_pred_equation : thm -> bool
bulwahn@36047
    50
  val is_intro : string -> thm -> bool
bulwahn@36047
    51
  val is_predT : typ -> bool
bulwahn@36047
    52
  val is_constrt : theory -> term -> bool
bulwahn@36047
    53
  val is_constr : Proof.context -> string -> bool
bulwahn@36047
    54
  val focus_ex : term -> Name.context -> ((string * typ) list * term) * Name.context
bulwahn@36047
    55
  val strip_all : term -> (string * typ) list * term
bulwahn@40101
    56
  val strip_intro_concl : thm -> term * term list
bulwahn@36047
    57
  (* introduction rule combinators *)
bulwahn@36047
    58
  val map_atoms : (term -> term) -> term -> term
bulwahn@36047
    59
  val fold_atoms : (term -> 'a -> 'a) -> term -> 'a -> 'a
bulwahn@36047
    60
  val fold_map_atoms : (term -> 'a -> term * 'a) -> term -> 'a -> term * 'a
bulwahn@36047
    61
  val maps_premises : (term -> term list) -> term -> term
bulwahn@36047
    62
  val map_concl : (term -> term) -> term -> term
bulwahn@36047
    63
  val map_term : theory -> (term -> term) -> thm -> thm
bulwahn@36047
    64
  (* split theorems of case expressions *)
bulwahn@36047
    65
  val prepare_split_thm : Proof.context -> thm -> thm
bulwahn@36047
    66
  val find_split_thm : theory -> term -> thm option
bulwahn@36047
    67
  (* datastructures and setup for generic compilation *)
bulwahn@36047
    68
  datatype compilation_funs = CompilationFuns of {
bulwahn@36047
    69
    mk_predT : typ -> typ,
bulwahn@36047
    70
    dest_predT : typ -> typ,
bulwahn@36047
    71
    mk_bot : typ -> term,
bulwahn@36047
    72
    mk_single : term -> term,
bulwahn@36047
    73
    mk_bind : term * term -> term,
bulwahn@36047
    74
    mk_sup : term * term -> term,
bulwahn@36047
    75
    mk_if : term -> term,
bulwahn@36049
    76
    mk_iterate_upto : typ -> term * term * term -> term,
bulwahn@36047
    77
    mk_not : term -> term,
bulwahn@36047
    78
    mk_map : typ -> typ -> term -> term -> term
bulwahn@36047
    79
  };
bulwahn@36047
    80
  val mk_predT : compilation_funs -> typ -> typ
bulwahn@36047
    81
  val dest_predT : compilation_funs -> typ -> typ
bulwahn@36047
    82
  val mk_bot : compilation_funs -> typ -> term
bulwahn@36047
    83
  val mk_single : compilation_funs -> term -> term
bulwahn@36047
    84
  val mk_bind : compilation_funs -> term * term -> term
bulwahn@36047
    85
  val mk_sup : compilation_funs -> term * term -> term
bulwahn@36047
    86
  val mk_if : compilation_funs -> term -> term
bulwahn@36049
    87
  val mk_iterate_upto : compilation_funs -> typ -> term * term * term -> term
bulwahn@36047
    88
  val mk_not : compilation_funs -> term -> term
bulwahn@36047
    89
  val mk_map : compilation_funs -> typ -> typ -> term -> term -> term
bulwahn@36047
    90
  val funT_of : compilation_funs -> mode -> typ -> typ
bulwahn@36047
    91
  (* Different compilations *)
bulwahn@36047
    92
  datatype compilation = Pred | Depth_Limited | Random | Depth_Limited_Random | DSeq | Annotated
bulwahn@36047
    93
    | Pos_Random_DSeq | Neg_Random_DSeq | New_Pos_Random_DSeq | New_Neg_Random_DSeq
bulwahn@40051
    94
    | Pos_Generator_DSeq | Neg_Generator_DSeq
bulwahn@36047
    95
  val negative_compilation_of : compilation -> compilation
bulwahn@36047
    96
  val compilation_for_polarity : bool -> compilation -> compilation
bulwahn@40049
    97
  val is_depth_limited_compilation : compilation -> bool 
bulwahn@36047
    98
  val string_of_compilation : compilation -> string
bulwahn@36047
    99
  val compilation_names : (string * compilation) list
bulwahn@36047
   100
  val non_random_compilations : compilation list
bulwahn@36047
   101
  val random_compilations : compilation list
bulwahn@36047
   102
  (* Different options for compiler *)
bulwahn@36047
   103
  datatype options = Options of {  
bulwahn@36047
   104
    expected_modes : (string * mode list) option,
bulwahn@39382
   105
    proposed_modes : (string * mode list) list,
bulwahn@36047
   106
    proposed_names : ((string * mode) * string) list,
bulwahn@36047
   107
    show_steps : bool,
bulwahn@36047
   108
    show_proof_trace : bool,
bulwahn@36047
   109
    show_intermediate_results : bool,
bulwahn@36047
   110
    show_mode_inference : bool,
bulwahn@36047
   111
    show_modes : bool,
bulwahn@36047
   112
    show_compilation : bool,
bulwahn@36047
   113
    show_caught_failures : bool,
bulwahn@39383
   114
    show_invalid_clauses : bool,
bulwahn@36047
   115
    skip_proof : bool,
bulwahn@36047
   116
    no_topmost_reordering : bool,
bulwahn@36047
   117
    function_flattening : bool,
bulwahn@36047
   118
    fail_safe_function_flattening : bool,
bulwahn@36248
   119
    specialise : bool,
bulwahn@36047
   120
    no_higher_order_predicate : string list,
bulwahn@36047
   121
    inductify : bool,
bulwahn@36254
   122
    detect_switches : bool,
bulwahn@40048
   123
    smart_depth_limiting : bool,
bulwahn@36047
   124
    compilation : compilation
bulwahn@36047
   125
  };
bulwahn@36047
   126
  val expected_modes : options -> (string * mode list) option
bulwahn@39382
   127
  val proposed_modes : options -> string -> mode list option
bulwahn@36047
   128
  val proposed_names : options -> string -> mode -> string option
bulwahn@36047
   129
  val show_steps : options -> bool
bulwahn@36047
   130
  val show_proof_trace : options -> bool
bulwahn@36047
   131
  val show_intermediate_results : options -> bool
bulwahn@36047
   132
  val show_mode_inference : options -> bool
bulwahn@36047
   133
  val show_modes : options -> bool
bulwahn@36047
   134
  val show_compilation : options -> bool
bulwahn@36047
   135
  val show_caught_failures : options -> bool
bulwahn@39383
   136
  val show_invalid_clauses : options -> bool
bulwahn@36047
   137
  val skip_proof : options -> bool
bulwahn@36047
   138
  val no_topmost_reordering : options -> bool
bulwahn@36047
   139
  val function_flattening : options -> bool
bulwahn@36047
   140
  val fail_safe_function_flattening : options -> bool
bulwahn@36248
   141
  val specialise : options -> bool
bulwahn@36047
   142
  val no_higher_order_predicate : options -> string list
bulwahn@36047
   143
  val is_inductify : options -> bool
bulwahn@36254
   144
  val detect_switches : options -> bool
bulwahn@40048
   145
  val smart_depth_limiting : options -> bool
bulwahn@36047
   146
  val compilation : options -> compilation
bulwahn@36047
   147
  val default_options : options
bulwahn@36047
   148
  val bool_options : string list
bulwahn@36047
   149
  val print_step : options -> string -> unit
bulwahn@39657
   150
  (* conversions *)
bulwahn@39657
   151
  val imp_prems_conv : conv -> conv
bulwahn@36047
   152
  (* simple transformations *)
bulwahn@39787
   153
  val split_conjuncts_in_assms : Proof.context -> thm -> thm
bulwahn@40052
   154
  val dest_conjunct_prem : thm -> thm list
bulwahn@36047
   155
  val expand_tuples : theory -> thm -> thm
bulwahn@39802
   156
  val case_betapply : theory -> term -> term
bulwahn@36047
   157
  val eta_contract_ho_arguments : theory -> thm -> thm
bulwahn@36047
   158
  val remove_equalities : theory -> thm -> thm
bulwahn@36246
   159
  val remove_pointless_clauses : thm -> thm list
bulwahn@36246
   160
  val peephole_optimisation : theory -> thm -> thm option
bulwahn@40101
   161
  (* auxillary *)
bulwahn@40101
   162
  val unify_consts : theory -> term list -> term list -> (term list * term list)
bulwahn@40101
   163
  val mk_casesrule : Proof.context -> term -> thm list -> term
bulwahn@40101
   164
  val preprocess_intro : theory -> thm -> thm
bulwahn@40101
   165
  
bulwahn@39541
   166
  val define_quickcheck_predicate :
bulwahn@40052
   167
    term -> theory -> (((string * typ) * (string * typ) list) * thm) * theory
bulwahn@36047
   168
end;
bulwahn@34948
   169
bulwahn@36047
   170
structure Predicate_Compile_Aux : PREDICATE_COMPILE_AUX =
bulwahn@33250
   171
struct
bulwahn@33250
   172
bulwahn@34948
   173
(* general functions *)
bulwahn@34948
   174
bulwahn@34948
   175
fun apfst3 f (x, y, z) = (f x, y, z)
bulwahn@34948
   176
fun apsnd3 f (x, y, z) = (x, f y, z)
bulwahn@34948
   177
fun aptrd3 f (x, y, z) = (x, y, f z)
bulwahn@34948
   178
bulwahn@34948
   179
fun comb_option f (SOME x1, SOME x2) = SOME (f (x1, x2))
bulwahn@34948
   180
  | comb_option f (NONE, SOME x2) = SOME x2
bulwahn@34948
   181
  | comb_option f (SOME x1, NONE) = SOME x1
bulwahn@34948
   182
  | comb_option f (NONE, NONE) = NONE
bulwahn@34948
   183
bulwahn@35885
   184
fun map2_optional f (x :: xs) (y :: ys) = f x (SOME y) :: (map2_optional f xs ys)
bulwahn@34948
   185
  | map2_optional f (x :: xs) [] = (f x NONE) :: (map2_optional f xs [])
bulwahn@34948
   186
  | map2_optional f [] [] = []
bulwahn@34948
   187
bulwahn@34948
   188
fun find_indices f xs =
bulwahn@34948
   189
  map_filter (fn (i, true) => SOME i | (i, false) => NONE) (map_index (apsnd f) xs)
bulwahn@33328
   190
bulwahn@35885
   191
fun assert check = if check then () else raise Fail "Assertion failed!"
bulwahn@35885
   192
bulwahn@33328
   193
(* mode *)
bulwahn@33328
   194
bulwahn@34948
   195
datatype mode = Bool | Input | Output | Pair of mode * mode | Fun of mode * mode
bulwahn@33619
   196
bulwahn@33623
   197
(* equality of instantiatedness with respect to equivalences:
bulwahn@33623
   198
  Pair Input Input == Input and Pair Output Output == Output *)
bulwahn@34948
   199
fun eq_mode (Fun (m1, m2), Fun (m3, m4)) = eq_mode (m1, m3) andalso eq_mode (m2, m4)
bulwahn@34948
   200
  | eq_mode (Pair (m1, m2), Pair (m3, m4)) = eq_mode (m1, m3) andalso eq_mode (m2, m4)
bulwahn@34948
   201
  | eq_mode (Pair (m1, m2), Input) = eq_mode (m1, Input) andalso eq_mode (m2, Input)
bulwahn@34948
   202
  | eq_mode (Pair (m1, m2), Output) = eq_mode (m1, Output) andalso eq_mode (m2, Output)
bulwahn@34948
   203
  | eq_mode (Input, Pair (m1, m2)) = eq_mode (Input, m1) andalso eq_mode (Input, m2)
bulwahn@34948
   204
  | eq_mode (Output, Pair (m1, m2)) = eq_mode (Output, m1) andalso eq_mode (Output, m2)
bulwahn@34948
   205
  | eq_mode (Input, Input) = true
bulwahn@34948
   206
  | eq_mode (Output, Output) = true
bulwahn@34948
   207
  | eq_mode (Bool, Bool) = true
bulwahn@34948
   208
  | eq_mode _ = false
bulwahn@33623
   209
bulwahn@39311
   210
fun mode_ord (Input, Output) = LESS
bulwahn@39311
   211
  | mode_ord (Output, Input) = GREATER
bulwahn@39311
   212
  | mode_ord (Input, Input) = EQUAL
bulwahn@39311
   213
  | mode_ord (Output, Output) = EQUAL
bulwahn@39311
   214
  | mode_ord (Bool, Bool) = EQUAL
bulwahn@39311
   215
  | mode_ord (Pair (m1, m2), Pair (m3, m4)) = prod_ord mode_ord mode_ord ((m1, m2), (m3, m4))
bulwahn@39311
   216
  | mode_ord (Fun (m1, m2), Fun (m3, m4)) = prod_ord mode_ord mode_ord ((m1, m2), (m3, m4))
bulwahn@39311
   217
 
bulwahn@36035
   218
fun list_fun_mode [] = Bool
bulwahn@36035
   219
  | list_fun_mode (m :: ms) = Fun (m, list_fun_mode ms)
bulwahn@36035
   220
bulwahn@33619
   221
(* name: binder_modes? *)
bulwahn@33619
   222
fun strip_fun_mode (Fun (mode, mode')) = mode :: strip_fun_mode mode'
bulwahn@33619
   223
  | strip_fun_mode Bool = []
bulwahn@35885
   224
  | strip_fun_mode _ = raise Fail "Bad mode for strip_fun_mode"
bulwahn@33619
   225
bulwahn@36047
   226
(* name: strip_fun_mode? *)
bulwahn@33619
   227
fun dest_fun_mode (Fun (mode, mode')) = mode :: dest_fun_mode mode'
bulwahn@33619
   228
  | dest_fun_mode mode = [mode]
bulwahn@33619
   229
bulwahn@33619
   230
fun dest_tuple_mode (Pair (mode, mode')) = mode :: dest_tuple_mode mode'
bulwahn@33619
   231
  | dest_tuple_mode _ = []
bulwahn@33619
   232
bulwahn@35324
   233
fun all_modes_of_typ' (T as Type ("fun", _)) = 
bulwahn@35324
   234
  let
bulwahn@35324
   235
    val (S, U) = strip_type T
bulwahn@35324
   236
  in
bulwahn@35324
   237
    if U = HOLogic.boolT then
bulwahn@35324
   238
      fold_rev (fn m1 => fn m2 => map_product (curry Fun) m1 m2)
bulwahn@35324
   239
        (map all_modes_of_typ' S) [Bool]
bulwahn@35324
   240
    else
bulwahn@35324
   241
      [Input, Output]
bulwahn@35324
   242
  end
haftmann@37678
   243
  | all_modes_of_typ' (Type (@{type_name Product_Type.prod}, [T1, T2])) = 
bulwahn@35324
   244
    map_product (curry Pair) (all_modes_of_typ' T1) (all_modes_of_typ' T2)
bulwahn@35324
   245
  | all_modes_of_typ' _ = [Input, Output]
bulwahn@35324
   246
bulwahn@35324
   247
fun all_modes_of_typ (T as Type ("fun", _)) =
bulwahn@35885
   248
    let
bulwahn@35885
   249
      val (S, U) = strip_type T
bulwahn@35885
   250
    in
bulwahn@35885
   251
      if U = @{typ bool} then
bulwahn@35885
   252
        fold_rev (fn m1 => fn m2 => map_product (curry Fun) m1 m2)
bulwahn@35885
   253
          (map all_modes_of_typ' S) [Bool]
bulwahn@35885
   254
      else
bulwahn@39192
   255
        raise Fail "Invocation of all_modes_of_typ with a non-predicate type"
bulwahn@35885
   256
    end
bulwahn@35885
   257
  | all_modes_of_typ @{typ bool} = [Bool]
bulwahn@39192
   258
  | all_modes_of_typ T =
bulwahn@39192
   259
    raise Fail "Invocation of all_modes_of_typ with a non-predicate type"
bulwahn@34948
   260
bulwahn@35324
   261
fun all_smodes_of_typ (T as Type ("fun", _)) =
bulwahn@35324
   262
  let
bulwahn@35324
   263
    val (S, U) = strip_type T
haftmann@37678
   264
    fun all_smodes (Type (@{type_name Product_Type.prod}, [T1, T2])) = 
bulwahn@35324
   265
      map_product (curry Pair) (all_smodes T1) (all_smodes T2)
bulwahn@35324
   266
      | all_smodes _ = [Input, Output]
bulwahn@35324
   267
  in
bulwahn@35324
   268
    if U = HOLogic.boolT then
bulwahn@35324
   269
      fold_rev (fn m1 => fn m2 => map_product (curry Fun) m1 m2) (map all_smodes S) [Bool]
bulwahn@35324
   270
    else
bulwahn@36047
   271
      raise Fail "invalid type for predicate"
bulwahn@35324
   272
  end
bulwahn@35885
   273
bulwahn@34948
   274
fun ho_arg_modes_of mode =
bulwahn@34948
   275
  let
bulwahn@34948
   276
    fun ho_arg_mode (m as Fun _) =  [m]
bulwahn@34948
   277
      | ho_arg_mode (Pair (m1, m2)) = ho_arg_mode m1 @ ho_arg_mode m2
bulwahn@34948
   278
      | ho_arg_mode _ = []
bulwahn@34948
   279
  in
bulwahn@34948
   280
    maps ho_arg_mode (strip_fun_mode mode)
bulwahn@34948
   281
  end
bulwahn@34948
   282
bulwahn@34948
   283
fun ho_args_of mode ts =
bulwahn@34948
   284
  let
bulwahn@34948
   285
    fun ho_arg (Fun _) (SOME t) = [t]
bulwahn@36047
   286
      | ho_arg (Fun _) NONE = raise Fail "mode and term do not match"
bulwahn@35885
   287
      | ho_arg (Pair (m1, m2)) (SOME (Const (@{const_name Pair}, _) $ t1 $ t2)) =
bulwahn@34948
   288
          ho_arg m1 (SOME t1) @ ho_arg m2 (SOME t2)
bulwahn@34948
   289
      | ho_arg (Pair (m1, m2)) NONE = ho_arg m1 NONE @ ho_arg m2 NONE
bulwahn@34948
   290
      | ho_arg _ _ = []
bulwahn@34948
   291
  in
bulwahn@34948
   292
    flat (map2_optional ho_arg (strip_fun_mode mode) ts)
bulwahn@34948
   293
  end
bulwahn@34948
   294
bulwahn@39299
   295
fun ho_args_of_typ T ts =
bulwahn@39299
   296
  let
bulwahn@39312
   297
    fun ho_arg (T as Type("fun", [_,_])) (SOME t) = if body_type T = @{typ bool} then [t] else []
bulwahn@39299
   298
      | ho_arg (Type("fun", [_,_])) NONE = raise Fail "mode and term do not match"
bulwahn@39299
   299
      | ho_arg (Type(@{type_name "Product_Type.prod"}, [T1, T2]))
bulwahn@39299
   300
         (SOME (Const (@{const_name Pair}, _) $ t1 $ t2)) =
bulwahn@39299
   301
          ho_arg T1 (SOME t1) @ ho_arg T2 (SOME t2)
bulwahn@39299
   302
      | ho_arg (Type(@{type_name "Product_Type.prod"}, [T1, T2])) NONE =
bulwahn@39299
   303
          ho_arg T1 NONE @ ho_arg T2 NONE
bulwahn@39299
   304
      | ho_arg _ _ = []
bulwahn@39299
   305
  in
bulwahn@39299
   306
    flat (map2_optional ho_arg (binder_types T) ts)
bulwahn@39299
   307
  end
bulwahn@39299
   308
bulwahn@39299
   309
fun ho_argsT_of_typ Ts =
bulwahn@39299
   310
  let
bulwahn@39312
   311
    fun ho_arg (T as Type("fun", [_,_])) = if body_type T = @{typ bool} then [T] else []
bulwahn@39299
   312
      | ho_arg (Type(@{type_name "Product_Type.prod"}, [T1, T2])) =
bulwahn@39299
   313
          ho_arg T1 @ ho_arg T2
bulwahn@39299
   314
      | ho_arg _ = []
bulwahn@39299
   315
  in
bulwahn@39299
   316
    maps ho_arg Ts
bulwahn@39299
   317
  end
bulwahn@39299
   318
  
bulwahn@39299
   319
bulwahn@34948
   320
(* temporary function should be replaced by unsplit_input or so? *)
bulwahn@34948
   321
fun replace_ho_args mode hoargs ts =
bulwahn@34948
   322
  let
bulwahn@34948
   323
    fun replace (Fun _, _) (arg' :: hoargs') = (arg', hoargs')
haftmann@37391
   324
      | replace (Pair (m1, m2), Const (@{const_name Pair}, T) $ t1 $ t2) hoargs =
bulwahn@34948
   325
        let
bulwahn@34948
   326
          val (t1', hoargs') = replace (m1, t1) hoargs
bulwahn@34948
   327
          val (t2', hoargs'') = replace (m2, t2) hoargs'
bulwahn@34948
   328
        in
haftmann@37391
   329
          (Const (@{const_name Pair}, T) $ t1' $ t2', hoargs'')
bulwahn@34948
   330
        end
bulwahn@34948
   331
      | replace (_, t) hoargs = (t, hoargs)
bulwahn@34948
   332
  in
bulwahn@35885
   333
    fst (fold_map replace (strip_fun_mode mode ~~ ts) hoargs)
bulwahn@34948
   334
  end
bulwahn@34948
   335
bulwahn@34948
   336
fun ho_argsT_of mode Ts =
bulwahn@34948
   337
  let
bulwahn@34948
   338
    fun ho_arg (Fun _) T = [T]
haftmann@37678
   339
      | ho_arg (Pair (m1, m2)) (Type (@{type_name Product_Type.prod}, [T1, T2])) = ho_arg m1 T1 @ ho_arg m2 T2
bulwahn@34948
   340
      | ho_arg _ _ = []
bulwahn@34948
   341
  in
bulwahn@34948
   342
    flat (map2 ho_arg (strip_fun_mode mode) Ts)
bulwahn@34948
   343
  end
bulwahn@34948
   344
bulwahn@34948
   345
(* splits mode and maps function to higher-order argument types *)
bulwahn@34948
   346
fun split_map_mode f mode ts =
bulwahn@34948
   347
  let
bulwahn@34948
   348
    fun split_arg_mode' (m as Fun _) t = f m t
haftmann@37391
   349
      | split_arg_mode' (Pair (m1, m2)) (Const (@{const_name Pair}, _) $ t1 $ t2) =
bulwahn@34948
   350
        let
bulwahn@34948
   351
          val (i1, o1) = split_arg_mode' m1 t1
bulwahn@34948
   352
          val (i2, o2) = split_arg_mode' m2 t2
bulwahn@34948
   353
        in
bulwahn@34948
   354
          (comb_option HOLogic.mk_prod (i1, i2), comb_option HOLogic.mk_prod (o1, o2))
bulwahn@34948
   355
        end
bulwahn@35324
   356
      | split_arg_mode' m t =
bulwahn@35324
   357
        if eq_mode (m, Input) then (SOME t, NONE)
bulwahn@35324
   358
        else if eq_mode (m, Output) then (NONE,  SOME t)
bulwahn@35885
   359
        else raise Fail "split_map_mode: mode and term do not match"
bulwahn@34948
   360
  in
bulwahn@34948
   361
    (pairself (map_filter I) o split_list) (map2 split_arg_mode' (strip_fun_mode mode) ts)
bulwahn@34948
   362
  end
bulwahn@34948
   363
bulwahn@34948
   364
(* splits mode and maps function to higher-order argument types *)
bulwahn@34948
   365
fun split_map_modeT f mode Ts =
bulwahn@34948
   366
  let
bulwahn@34948
   367
    fun split_arg_mode' (m as Fun _) T = f m T
haftmann@37678
   368
      | split_arg_mode' (Pair (m1, m2)) (Type (@{type_name Product_Type.prod}, [T1, T2])) =
bulwahn@34948
   369
        let
bulwahn@34948
   370
          val (i1, o1) = split_arg_mode' m1 T1
bulwahn@34948
   371
          val (i2, o2) = split_arg_mode' m2 T2
bulwahn@34948
   372
        in
bulwahn@34948
   373
          (comb_option HOLogic.mk_prodT (i1, i2), comb_option HOLogic.mk_prodT (o1, o2))
bulwahn@34948
   374
        end
bulwahn@34948
   375
      | split_arg_mode' Input T = (SOME T, NONE)
bulwahn@34948
   376
      | split_arg_mode' Output T = (NONE,  SOME T)
bulwahn@35885
   377
      | split_arg_mode' _ _ = raise Fail "split_modeT': mode and type do not match"
bulwahn@34948
   378
  in
bulwahn@34948
   379
    (pairself (map_filter I) o split_list) (map2 split_arg_mode' (strip_fun_mode mode) Ts)
bulwahn@34948
   380
  end
bulwahn@34948
   381
bulwahn@34948
   382
fun split_mode mode ts = split_map_mode (fn _ => fn _ => (NONE, NONE)) mode ts
bulwahn@34948
   383
haftmann@37678
   384
fun fold_map_aterms_prodT comb f (Type (@{type_name Product_Type.prod}, [T1, T2])) s =
bulwahn@34948
   385
  let
bulwahn@34948
   386
    val (x1, s') = fold_map_aterms_prodT comb f T1 s
bulwahn@34948
   387
    val (x2, s'') = fold_map_aterms_prodT comb f T2 s'
bulwahn@34948
   388
  in
bulwahn@34948
   389
    (comb x1 x2, s'')
bulwahn@34948
   390
  end
bulwahn@34948
   391
  | fold_map_aterms_prodT comb f T s = f T s
bulwahn@34948
   392
haftmann@37391
   393
fun map_filter_prod f (Const (@{const_name Pair}, _) $ t1 $ t2) =
bulwahn@34948
   394
  comb_option HOLogic.mk_prod (map_filter_prod f t1, map_filter_prod f t2)
bulwahn@34948
   395
  | map_filter_prod f t = f t
bulwahn@34948
   396
  
bulwahn@40139
   397
fun split_modeT mode Ts =
bulwahn@34948
   398
  let
bulwahn@40139
   399
    fun split_arg_mode (Fun _) T = ([], [])
bulwahn@40139
   400
      | split_arg_mode (Pair (m1, m2)) (Type (@{type_name Product_Type.prod}, [T1, T2])) =
bulwahn@34948
   401
        let
bulwahn@40139
   402
          val (i1, o1) = split_arg_mode m1 T1
bulwahn@40139
   403
          val (i2, o2) = split_arg_mode m2 T2
bulwahn@34948
   404
        in
bulwahn@34948
   405
          (i1 @ i2, o1 @ o2)
bulwahn@34948
   406
        end
bulwahn@40139
   407
      | split_arg_mode Input T = ([T], [])
bulwahn@40139
   408
      | split_arg_mode Output T = ([], [T])
bulwahn@40139
   409
      | split_arg_mode _ _ = raise Fail "split_modeT: mode and type do not match"
bulwahn@34948
   410
  in
bulwahn@40139
   411
    (pairself flat o split_list) (map2 split_arg_mode (strip_fun_mode mode) Ts)
bulwahn@34948
   412
  end
bulwahn@34948
   413
bulwahn@34948
   414
fun string_of_mode mode =
bulwahn@33619
   415
  let
bulwahn@33619
   416
    fun string_of_mode1 Input = "i"
bulwahn@33619
   417
      | string_of_mode1 Output = "o"
bulwahn@33619
   418
      | string_of_mode1 Bool = "bool"
bulwahn@33619
   419
      | string_of_mode1 mode = "(" ^ (string_of_mode3 mode) ^ ")"
bulwahn@33626
   420
    and string_of_mode2 (Pair (m1, m2)) = string_of_mode3 m1 ^ " * " ^  string_of_mode2 m2
bulwahn@33619
   421
      | string_of_mode2 mode = string_of_mode1 mode
bulwahn@33619
   422
    and string_of_mode3 (Fun (m1, m2)) = string_of_mode2 m1 ^ " => " ^ string_of_mode3 m2
bulwahn@33619
   423
      | string_of_mode3 mode = string_of_mode2 mode
bulwahn@34948
   424
  in string_of_mode3 mode end
bulwahn@33619
   425
bulwahn@34948
   426
fun ascii_string_of_mode mode' =
bulwahn@33626
   427
  let
bulwahn@33626
   428
    fun ascii_string_of_mode' Input = "i"
bulwahn@33626
   429
      | ascii_string_of_mode' Output = "o"
bulwahn@33626
   430
      | ascii_string_of_mode' Bool = "b"
bulwahn@33626
   431
      | ascii_string_of_mode' (Pair (m1, m2)) =
bulwahn@33626
   432
          "P" ^ ascii_string_of_mode' m1 ^ ascii_string_of_mode'_Pair m2
bulwahn@33626
   433
      | ascii_string_of_mode' (Fun (m1, m2)) = 
bulwahn@33626
   434
          "F" ^ ascii_string_of_mode' m1 ^ ascii_string_of_mode'_Fun m2 ^ "B"
bulwahn@33626
   435
    and ascii_string_of_mode'_Fun (Fun (m1, m2)) =
bulwahn@33626
   436
          ascii_string_of_mode' m1 ^ (if m2 = Bool then "" else "_" ^ ascii_string_of_mode'_Fun m2)
bulwahn@33626
   437
      | ascii_string_of_mode'_Fun Bool = "B"
bulwahn@33626
   438
      | ascii_string_of_mode'_Fun m = ascii_string_of_mode' m
bulwahn@33626
   439
    and ascii_string_of_mode'_Pair (Pair (m1, m2)) =
bulwahn@33626
   440
          ascii_string_of_mode' m1 ^ ascii_string_of_mode'_Pair m2
bulwahn@33626
   441
      | ascii_string_of_mode'_Pair m = ascii_string_of_mode' m
bulwahn@33626
   442
  in ascii_string_of_mode'_Fun mode' end
bulwahn@33626
   443
bulwahn@34948
   444
(* premises *)
bulwahn@33619
   445
bulwahn@34948
   446
datatype indprem = Prem of term | Negprem of term | Sidecond of term
bulwahn@34948
   447
  | Generator of (string * typ);
bulwahn@33619
   448
bulwahn@36251
   449
fun dest_indprem (Prem t) = t
bulwahn@36251
   450
  | dest_indprem (Negprem t) = t
bulwahn@36251
   451
  | dest_indprem (Sidecond t) = t
bulwahn@36251
   452
  | dest_indprem (Generator _) = raise Fail "cannot destruct generator"
bulwahn@36251
   453
bulwahn@36254
   454
fun map_indprem f (Prem t) = Prem (f t)
bulwahn@36254
   455
  | map_indprem f (Negprem t) = Negprem (f t)
bulwahn@36254
   456
  | map_indprem f (Sidecond t) = Sidecond (f t)
bulwahn@36254
   457
  | map_indprem f (Generator (v, T)) = Generator (dest_Free (f (Free (v, T))))
bulwahn@36254
   458
bulwahn@33250
   459
(* general syntactic functions *)
bulwahn@33250
   460
bulwahn@33250
   461
(*Like dest_conj, but flattens conjunctions however nested*)
haftmann@38795
   462
fun conjuncts_aux (Const (@{const_name HOL.conj}, _) $ t $ t') conjs = conjuncts_aux t (conjuncts_aux t' conjs)
bulwahn@33250
   463
  | conjuncts_aux t conjs = t::conjs;
bulwahn@33250
   464
bulwahn@33250
   465
fun conjuncts t = conjuncts_aux t [];
bulwahn@33250
   466
bulwahn@33250
   467
fun is_equationlike_term (Const ("==", _) $ _ $ _) = true
haftmann@38864
   468
  | is_equationlike_term (Const (@{const_name Trueprop}, _) $ (Const (@{const_name HOL.eq}, _) $ _ $ _)) = true
bulwahn@33250
   469
  | is_equationlike_term _ = false
bulwahn@33250
   470
  
bulwahn@33250
   471
val is_equationlike = is_equationlike_term o prop_of 
bulwahn@33250
   472
bulwahn@33250
   473
fun is_pred_equation_term (Const ("==", _) $ u $ v) =
bulwahn@33250
   474
  (fastype_of u = @{typ bool}) andalso (fastype_of v = @{typ bool})
bulwahn@33250
   475
  | is_pred_equation_term _ = false
bulwahn@33250
   476
  
bulwahn@33250
   477
val is_pred_equation = is_pred_equation_term o prop_of 
bulwahn@33250
   478
bulwahn@33250
   479
fun is_intro_term constname t =
bulwahn@34948
   480
  the_default false (try (fn t => case fst (strip_comb (HOLogic.dest_Trueprop (Logic.strip_imp_concl t))) of
bulwahn@33250
   481
    Const (c, _) => c = constname
bulwahn@34948
   482
  | _ => false) t)
bulwahn@33250
   483
  
bulwahn@33250
   484
fun is_intro constname t = is_intro_term constname (prop_of t)
bulwahn@33250
   485
haftmann@38552
   486
fun is_pred thy constname = (body_type (Sign.the_const_type thy constname) = HOLogic.boolT);
bulwahn@33250
   487
wenzelm@40844
   488
fun is_predT (T as Type("fun", [_, _])) = (body_type T = @{typ bool})
bulwahn@33250
   489
  | is_predT _ = false
bulwahn@33250
   490
bulwahn@33250
   491
(*** check if a term contains only constructor functions ***)
bulwahn@34948
   492
(* TODO: another copy in the core! *)
bulwahn@33623
   493
(* FIXME: constructor terms are supposed to be seen in the way the code generator
bulwahn@33623
   494
  sees constructors.*)
bulwahn@33250
   495
fun is_constrt thy =
bulwahn@33250
   496
  let
bulwahn@33250
   497
    val cnstrs = flat (maps
bulwahn@33250
   498
      (map (fn (_, (Tname, _, cs)) => map (apsnd (rpair Tname o length)) cs) o #descr o snd)
bulwahn@33250
   499
      (Symtab.dest (Datatype.get_all thy)));
bulwahn@33250
   500
    fun check t = (case strip_comb t of
bulwahn@36032
   501
        (Var _, []) => true
bulwahn@36032
   502
      | (Free _, []) => true
bulwahn@33250
   503
      | (Const (s, T), ts) => (case (AList.lookup (op =) cnstrs s, body_type T) of
bulwahn@33250
   504
            (SOME (i, Tname), Type (Tname', _)) => length ts = i andalso Tname = Tname' andalso forall check ts
bulwahn@33250
   505
          | _ => false)
bulwahn@33250
   506
      | _ => false)
bulwahn@36032
   507
  in check end;
bulwahn@34948
   508
bulwahn@34948
   509
fun is_funtype (Type ("fun", [_, _])) = true
bulwahn@34948
   510
  | is_funtype _ = false;
bulwahn@34948
   511
bulwahn@34948
   512
fun is_Type (Type _) = true
bulwahn@34948
   513
  | is_Type _ = false
bulwahn@34948
   514
bulwahn@34948
   515
(* returns true if t is an application of an datatype constructor *)
bulwahn@34948
   516
(* which then consequently would be splitted *)
bulwahn@34948
   517
(* else false *)
bulwahn@34948
   518
(*
bulwahn@34948
   519
fun is_constructor thy t =
bulwahn@34948
   520
  if (is_Type (fastype_of t)) then
bulwahn@34948
   521
    (case DatatypePackage.get_datatype thy ((fst o dest_Type o fastype_of) t) of
bulwahn@34948
   522
      NONE => false
bulwahn@34948
   523
    | SOME info => (let
bulwahn@34948
   524
      val constr_consts = maps (fn (_, (_, _, constrs)) => map fst constrs) (#descr info)
bulwahn@34948
   525
      val (c, _) = strip_comb t
bulwahn@34948
   526
      in (case c of
bulwahn@34948
   527
        Const (name, _) => name mem_string constr_consts
bulwahn@34948
   528
        | _ => false) end))
bulwahn@34948
   529
  else false
bulwahn@34948
   530
*)
bulwahn@34948
   531
bulwahn@35891
   532
val is_constr = Code.is_constr o ProofContext.theory_of;
bulwahn@34948
   533
bulwahn@36047
   534
fun strip_all t = (Term.strip_all_vars t, Term.strip_all_body t)
bulwahn@36047
   535
haftmann@38558
   536
fun strip_ex (Const (@{const_name Ex}, _) $ Abs (x, T, t)) =
bulwahn@33250
   537
  let
bulwahn@33250
   538
    val (xTs, t') = strip_ex t
bulwahn@33250
   539
  in
bulwahn@33250
   540
    ((x, T) :: xTs, t')
bulwahn@33250
   541
  end
bulwahn@33250
   542
  | strip_ex t = ([], t)
bulwahn@33250
   543
bulwahn@33250
   544
fun focus_ex t nctxt =
bulwahn@33250
   545
  let
bulwahn@33250
   546
    val ((xs, Ts), t') = apfst split_list (strip_ex t) 
bulwahn@33250
   547
    val (xs', nctxt') = Name.variants xs nctxt;
bulwahn@33250
   548
    val ps' = xs' ~~ Ts;
bulwahn@33250
   549
    val vs = map Free ps';
bulwahn@33250
   550
    val t'' = Term.subst_bounds (rev vs, t');
bulwahn@33250
   551
  in ((ps', t''), nctxt') end;
bulwahn@33250
   552
bulwahn@40101
   553
val strip_intro_concl = (strip_comb o HOLogic.dest_Trueprop o Logic.strip_imp_concl o prop_of)
bulwahn@40101
   554
  
bulwahn@33250
   555
(* introduction rule combinators *)
bulwahn@33250
   556
bulwahn@33250
   557
fun map_atoms f intro = 
bulwahn@33250
   558
  let
bulwahn@33250
   559
    val (literals, head) = Logic.strip_horn intro
bulwahn@33250
   560
    fun appl t = (case t of
bulwahn@35885
   561
        (@{term Not} $ t') => HOLogic.mk_not (f t')
bulwahn@33250
   562
      | _ => f t)
bulwahn@33250
   563
  in
bulwahn@33250
   564
    Logic.list_implies
bulwahn@33250
   565
      (map (HOLogic.mk_Trueprop o appl o HOLogic.dest_Trueprop) literals, head)
bulwahn@33250
   566
  end
bulwahn@33250
   567
bulwahn@33250
   568
fun fold_atoms f intro s =
bulwahn@33250
   569
  let
bulwahn@33250
   570
    val (literals, head) = Logic.strip_horn intro
bulwahn@33250
   571
    fun appl t s = (case t of
bulwahn@35885
   572
      (@{term Not} $ t') => f t' s
bulwahn@33250
   573
      | _ => f t s)
bulwahn@33250
   574
  in fold appl (map HOLogic.dest_Trueprop literals) s end
bulwahn@33250
   575
bulwahn@33250
   576
fun fold_map_atoms f intro s =
bulwahn@33250
   577
  let
bulwahn@33250
   578
    val (literals, head) = Logic.strip_horn intro
bulwahn@33250
   579
    fun appl t s = (case t of
bulwahn@35885
   580
      (@{term Not} $ t') => apfst HOLogic.mk_not (f t' s)
bulwahn@33250
   581
      | _ => f t s)
bulwahn@33250
   582
    val (literals', s') = fold_map appl (map HOLogic.dest_Trueprop literals) s
bulwahn@33250
   583
  in
bulwahn@33250
   584
    (Logic.list_implies (map HOLogic.mk_Trueprop literals', head), s')
bulwahn@33250
   585
  end;
bulwahn@33250
   586
bulwahn@36246
   587
fun map_premises f intro =
bulwahn@36246
   588
  let
bulwahn@36246
   589
    val (premises, head) = Logic.strip_horn intro
bulwahn@36246
   590
  in
bulwahn@36246
   591
    Logic.list_implies (map f premises, head)
bulwahn@36246
   592
  end
bulwahn@36246
   593
bulwahn@36246
   594
fun map_filter_premises f intro =
bulwahn@36246
   595
  let
bulwahn@36246
   596
    val (premises, head) = Logic.strip_horn intro
bulwahn@36246
   597
  in
bulwahn@36246
   598
    Logic.list_implies (map_filter f premises, head)
bulwahn@36246
   599
  end
bulwahn@36246
   600
bulwahn@33250
   601
fun maps_premises f intro =
bulwahn@33250
   602
  let
bulwahn@33250
   603
    val (premises, head) = Logic.strip_horn intro
bulwahn@33250
   604
  in
bulwahn@33250
   605
    Logic.list_implies (maps f premises, head)
bulwahn@33250
   606
  end
bulwahn@35324
   607
bulwahn@35875
   608
fun map_concl f intro =
bulwahn@35875
   609
  let
bulwahn@35875
   610
    val (premises, head) = Logic.strip_horn intro
bulwahn@35875
   611
  in
bulwahn@35875
   612
    Logic.list_implies (premises, f head)
bulwahn@35875
   613
  end
bulwahn@35875
   614
bulwahn@35875
   615
(* combinators to apply a function to all basic parts of nested products *)
bulwahn@35875
   616
haftmann@37391
   617
fun map_products f (Const (@{const_name Pair}, T) $ t1 $ t2) =
haftmann@37391
   618
  Const (@{const_name Pair}, T) $ map_products f t1 $ map_products f t2
bulwahn@35875
   619
  | map_products f t = f t
bulwahn@35324
   620
bulwahn@35324
   621
(* split theorems of case expressions *)
bulwahn@35324
   622
bulwahn@35324
   623
fun prepare_split_thm ctxt split_thm =
bulwahn@35324
   624
    (split_thm RS @{thm iffD2})
wenzelm@35624
   625
    |> Local_Defs.unfold ctxt [@{thm atomize_conjL[symmetric]},
bulwahn@35324
   626
      @{thm atomize_all[symmetric]}, @{thm atomize_imp[symmetric]}]
bulwahn@35324
   627
bulwahn@36029
   628
fun find_split_thm thy (Const (name, T)) = Option.map #split (Datatype_Data.info_of_case thy name)
bulwahn@36029
   629
  | find_split_thm thy _ = NONE
bulwahn@35324
   630
bulwahn@33250
   631
(* lifting term operations to theorems *)
bulwahn@33250
   632
bulwahn@33250
   633
fun map_term thy f th =
bulwahn@33250
   634
  Skip_Proof.make_thm thy (f (prop_of th))
bulwahn@33250
   635
bulwahn@33250
   636
(*
bulwahn@33250
   637
fun equals_conv lhs_cv rhs_cv ct =
bulwahn@33250
   638
  case Thm.term_of ct of
bulwahn@33250
   639
    Const ("==", _) $ _ $ _ => Conv.arg_conv cv ct  
bulwahn@33250
   640
  | _ => error "equals_conv"  
bulwahn@33250
   641
*)
bulwahn@33250
   642
bulwahn@36038
   643
(* Different compilations *)
bulwahn@33250
   644
bulwahn@35881
   645
datatype compilation = Pred | Depth_Limited | Random | Depth_Limited_Random | DSeq | Annotated
bulwahn@40051
   646
  | Pos_Random_DSeq | Neg_Random_DSeq | New_Pos_Random_DSeq | New_Neg_Random_DSeq |
bulwahn@40051
   647
    Pos_Generator_DSeq | Neg_Generator_DSeq
bulwahn@35324
   648
bulwahn@35324
   649
fun negative_compilation_of Pos_Random_DSeq = Neg_Random_DSeq
bulwahn@35324
   650
  | negative_compilation_of Neg_Random_DSeq = Pos_Random_DSeq
bulwahn@36018
   651
  | negative_compilation_of New_Pos_Random_DSeq = New_Neg_Random_DSeq
bulwahn@36018
   652
  | negative_compilation_of New_Neg_Random_DSeq = New_Pos_Random_DSeq
bulwahn@40051
   653
  | negative_compilation_of Pos_Generator_DSeq = Neg_Generator_DSeq
bulwahn@40051
   654
  | negative_compilation_of Pos_Generator_DSeq = Pos_Generator_DSeq
bulwahn@35324
   655
  | negative_compilation_of c = c
bulwahn@35324
   656
  
bulwahn@35324
   657
fun compilation_for_polarity false Pos_Random_DSeq = Neg_Random_DSeq
bulwahn@36018
   658
  | compilation_for_polarity false New_Pos_Random_DSeq = New_Neg_Random_DSeq
bulwahn@35324
   659
  | compilation_for_polarity _ c = c
bulwahn@34948
   660
bulwahn@40049
   661
fun is_depth_limited_compilation c =
bulwahn@40051
   662
  (c = New_Pos_Random_DSeq) orelse (c = New_Neg_Random_DSeq) orelse
bulwahn@40051
   663
  (c = Pos_Generator_DSeq) orelse (c = Pos_Generator_DSeq)
bulwahn@40049
   664
bulwahn@35885
   665
fun string_of_compilation c =
bulwahn@35885
   666
  case c of
bulwahn@34948
   667
    Pred => ""
bulwahn@34948
   668
  | Random => "random"
bulwahn@34948
   669
  | Depth_Limited => "depth limited"
bulwahn@35881
   670
  | Depth_Limited_Random => "depth limited random"
bulwahn@34948
   671
  | DSeq => "dseq"
bulwahn@34948
   672
  | Annotated => "annotated"
bulwahn@35324
   673
  | Pos_Random_DSeq => "pos_random dseq"
bulwahn@35324
   674
  | Neg_Random_DSeq => "neg_random_dseq"
bulwahn@36018
   675
  | New_Pos_Random_DSeq => "new_pos_random dseq"
bulwahn@36018
   676
  | New_Neg_Random_DSeq => "new_neg_random_dseq"
bulwahn@40051
   677
  | Pos_Generator_DSeq => "pos_generator_dseq"
bulwahn@40051
   678
  | Neg_Generator_DSeq => "neg_generator_dseq"
bulwahn@36038
   679
bulwahn@36018
   680
val compilation_names = [("pred", Pred),
bulwahn@36018
   681
  ("random", Random),
bulwahn@36018
   682
  ("depth_limited", Depth_Limited),
bulwahn@36018
   683
  ("depth_limited_random", Depth_Limited_Random),
bulwahn@36018
   684
  (*("annotated", Annotated),*)
bulwahn@40054
   685
  ("dseq", DSeq),
bulwahn@40054
   686
  ("random_dseq", Pos_Random_DSeq),
bulwahn@40051
   687
  ("new_random_dseq", New_Pos_Random_DSeq),
bulwahn@40051
   688
  ("generator_dseq", Pos_Generator_DSeq)]
bulwahn@36038
   689
bulwahn@36038
   690
val non_random_compilations = [Pred, Depth_Limited, DSeq, Annotated]
bulwahn@36038
   691
bulwahn@36038
   692
bulwahn@36038
   693
val random_compilations = [Random, Depth_Limited_Random,
bulwahn@36038
   694
  Pos_Random_DSeq, Neg_Random_DSeq, New_Pos_Random_DSeq, New_Neg_Random_DSeq]
bulwahn@36038
   695
bulwahn@36046
   696
(* datastructures and setup for generic compilation *)
bulwahn@36046
   697
bulwahn@36046
   698
datatype compilation_funs = CompilationFuns of {
bulwahn@36046
   699
  mk_predT : typ -> typ,
bulwahn@36046
   700
  dest_predT : typ -> typ,
bulwahn@36046
   701
  mk_bot : typ -> term,
bulwahn@36046
   702
  mk_single : term -> term,
bulwahn@36046
   703
  mk_bind : term * term -> term,
bulwahn@36046
   704
  mk_sup : term * term -> term,
bulwahn@36046
   705
  mk_if : term -> term,
bulwahn@36049
   706
  mk_iterate_upto : typ -> term * term * term -> term,
bulwahn@36046
   707
  mk_not : term -> term,
bulwahn@36046
   708
  mk_map : typ -> typ -> term -> term -> term
bulwahn@36046
   709
};
bulwahn@36038
   710
bulwahn@36046
   711
fun mk_predT (CompilationFuns funs) = #mk_predT funs
bulwahn@36046
   712
fun dest_predT (CompilationFuns funs) = #dest_predT funs
bulwahn@36046
   713
fun mk_bot (CompilationFuns funs) = #mk_bot funs
bulwahn@36046
   714
fun mk_single (CompilationFuns funs) = #mk_single funs
bulwahn@36046
   715
fun mk_bind (CompilationFuns funs) = #mk_bind funs
bulwahn@36046
   716
fun mk_sup (CompilationFuns funs) = #mk_sup funs
bulwahn@36046
   717
fun mk_if (CompilationFuns funs) = #mk_if funs
bulwahn@36049
   718
fun mk_iterate_upto (CompilationFuns funs) = #mk_iterate_upto funs
bulwahn@36046
   719
fun mk_not (CompilationFuns funs) = #mk_not funs
bulwahn@36046
   720
fun mk_map (CompilationFuns funs) = #mk_map funs
bulwahn@36046
   721
bulwahn@36046
   722
(** function types and names of different compilations **)
bulwahn@36046
   723
bulwahn@36046
   724
fun funT_of compfuns mode T =
bulwahn@36046
   725
  let
bulwahn@36046
   726
    val Ts = binder_types T
bulwahn@36046
   727
    val (inTs, outTs) = split_map_modeT (fn m => fn T => (SOME (funT_of compfuns m T), NONE)) mode Ts
bulwahn@36046
   728
  in
bulwahn@36046
   729
    inTs ---> (mk_predT compfuns (HOLogic.mk_tupleT outTs))
bulwahn@36046
   730
  end;
bulwahn@36046
   731
bulwahn@36046
   732
(* Different options for compiler *)
bulwahn@34948
   733
bulwahn@33250
   734
datatype options = Options of {  
bulwahn@34948
   735
  expected_modes : (string * mode list) option,
bulwahn@39382
   736
  proposed_modes : (string * mode list) list,
bulwahn@34948
   737
  proposed_names : ((string * mode) * string) list,
bulwahn@33250
   738
  show_steps : bool,
bulwahn@33250
   739
  show_proof_trace : bool,
bulwahn@33250
   740
  show_intermediate_results : bool,
bulwahn@33251
   741
  show_mode_inference : bool,
bulwahn@33251
   742
  show_modes : bool,
bulwahn@33250
   743
  show_compilation : bool,
bulwahn@35324
   744
  show_caught_failures : bool,
bulwahn@39383
   745
  show_invalid_clauses : bool,
bulwahn@33250
   746
  skip_proof : bool,
bulwahn@35324
   747
  no_topmost_reordering : bool,
bulwahn@35324
   748
  function_flattening : bool,
bulwahn@36248
   749
  specialise : bool,
bulwahn@35324
   750
  fail_safe_function_flattening : bool,
bulwahn@35324
   751
  no_higher_order_predicate : string list,
bulwahn@33250
   752
  inductify : bool,
bulwahn@36254
   753
  detect_switches : bool,
bulwahn@40048
   754
  smart_depth_limiting : bool,
bulwahn@34948
   755
  compilation : compilation
bulwahn@33250
   756
};
bulwahn@33250
   757
bulwahn@33250
   758
fun expected_modes (Options opt) = #expected_modes opt
bulwahn@39382
   759
fun proposed_modes (Options opt) = AList.lookup (op =) (#proposed_modes opt)
bulwahn@34948
   760
fun proposed_names (Options opt) name mode = AList.lookup (eq_pair (op =) eq_mode)
bulwahn@33623
   761
  (#proposed_names opt) (name, mode)
bulwahn@33620
   762
bulwahn@33250
   763
fun show_steps (Options opt) = #show_steps opt
bulwahn@33250
   764
fun show_intermediate_results (Options opt) = #show_intermediate_results opt
bulwahn@33250
   765
fun show_proof_trace (Options opt) = #show_proof_trace opt
bulwahn@33251
   766
fun show_modes (Options opt) = #show_modes opt
bulwahn@33251
   767
fun show_mode_inference (Options opt) = #show_mode_inference opt
bulwahn@33250
   768
fun show_compilation (Options opt) = #show_compilation opt
bulwahn@35324
   769
fun show_caught_failures (Options opt) = #show_caught_failures opt
bulwahn@39383
   770
fun show_invalid_clauses (Options opt) = #show_invalid_clauses opt
bulwahn@33250
   771
fun skip_proof (Options opt) = #skip_proof opt
bulwahn@33250
   772
bulwahn@35324
   773
fun function_flattening (Options opt) = #function_flattening opt
bulwahn@35324
   774
fun fail_safe_function_flattening (Options opt) = #fail_safe_function_flattening opt
bulwahn@36248
   775
fun specialise (Options opt) = #specialise opt
bulwahn@35324
   776
fun no_topmost_reordering (Options opt) = #no_topmost_reordering opt
bulwahn@35324
   777
fun no_higher_order_predicate (Options opt) = #no_higher_order_predicate opt
bulwahn@35324
   778
bulwahn@33250
   779
fun is_inductify (Options opt) = #inductify opt
bulwahn@34948
   780
bulwahn@34948
   781
fun compilation (Options opt) = #compilation opt
bulwahn@33250
   782
bulwahn@36254
   783
fun detect_switches (Options opt) = #detect_switches opt
bulwahn@36254
   784
bulwahn@40048
   785
fun smart_depth_limiting (Options opt) = #smart_depth_limiting opt
bulwahn@40048
   786
bulwahn@33250
   787
val default_options = Options {
bulwahn@33250
   788
  expected_modes = NONE,
bulwahn@39382
   789
  proposed_modes = [],
bulwahn@33623
   790
  proposed_names = [],
bulwahn@33250
   791
  show_steps = false,
bulwahn@33250
   792
  show_intermediate_results = false,
bulwahn@33250
   793
  show_proof_trace = false,
bulwahn@33251
   794
  show_modes = false,
bulwahn@33250
   795
  show_mode_inference = false,
bulwahn@33250
   796
  show_compilation = false,
bulwahn@35324
   797
  show_caught_failures = false,
bulwahn@39383
   798
  show_invalid_clauses = false,
bulwahn@34948
   799
  skip_proof = true,
bulwahn@35324
   800
  no_topmost_reordering = false,
bulwahn@35324
   801
  function_flattening = false,
bulwahn@36248
   802
  specialise = false,
bulwahn@35324
   803
  fail_safe_function_flattening = false,
bulwahn@35324
   804
  no_higher_order_predicate = [],
bulwahn@33250
   805
  inductify = false,
bulwahn@36254
   806
  detect_switches = true,
bulwahn@40048
   807
  smart_depth_limiting = false,
bulwahn@34948
   808
  compilation = Pred
bulwahn@33250
   809
}
bulwahn@33250
   810
bulwahn@34948
   811
val bool_options = ["show_steps", "show_intermediate_results", "show_proof_trace", "show_modes",
bulwahn@39383
   812
  "show_mode_inference", "show_compilation", "show_invalid_clauses", "skip_proof", "inductify",
bulwahn@40048
   813
  "no_function_flattening", "detect_switches", "specialise", "no_topmost_reordering",
bulwahn@40048
   814
  "smart_depth_limiting"]
bulwahn@34948
   815
bulwahn@33250
   816
fun print_step options s =
bulwahn@33250
   817
  if show_steps options then tracing s else ()
bulwahn@33250
   818
bulwahn@36047
   819
(* simple transformations *)
bulwahn@36047
   820
bulwahn@36047
   821
(** tuple processing **)
bulwahn@33250
   822
bulwahn@39657
   823
fun rewrite_args [] (pats, intro_t, ctxt) = (pats, intro_t, ctxt)
bulwahn@39657
   824
  | rewrite_args (arg::args) (pats, intro_t, ctxt) = 
bulwahn@39657
   825
    (case HOLogic.strip_tupleT (fastype_of arg) of
bulwahn@39657
   826
      (Ts as _ :: _ :: _) =>
bulwahn@39657
   827
      let
bulwahn@39657
   828
        fun rewrite_arg' (Const (@{const_name Pair}, _) $ _ $ t2, Type (@{type_name Product_Type.prod}, [_, T2]))
bulwahn@39657
   829
          (args, (pats, intro_t, ctxt)) = rewrite_arg' (t2, T2) (args, (pats, intro_t, ctxt))
bulwahn@39657
   830
          | rewrite_arg' (t, Type (@{type_name Product_Type.prod}, [T1, T2])) (args, (pats, intro_t, ctxt)) =
bulwahn@39657
   831
            let
bulwahn@39657
   832
              val thy = ProofContext.theory_of ctxt
bulwahn@39657
   833
              val ([x, y], ctxt') = Variable.variant_fixes ["x", "y"] ctxt
bulwahn@39657
   834
              val pat = (t, HOLogic.mk_prod (Free (x, T1), Free (y, T2)))
bulwahn@39657
   835
              val intro_t' = Pattern.rewrite_term thy [pat] [] intro_t
bulwahn@39657
   836
              val args' = map (Pattern.rewrite_term thy [pat] []) args
bulwahn@39657
   837
            in
bulwahn@39657
   838
              rewrite_arg' (Free (y, T2), T2) (args', (pat::pats, intro_t', ctxt'))
bulwahn@39657
   839
            end
bulwahn@39657
   840
          | rewrite_arg' _ (args, (pats, intro_t, ctxt)) = (args, (pats, intro_t, ctxt))
bulwahn@39657
   841
        val (args', (pats, intro_t', ctxt')) = rewrite_arg' (arg, fastype_of arg)
bulwahn@39657
   842
          (args, (pats, intro_t, ctxt))
bulwahn@39657
   843
      in
bulwahn@39657
   844
        rewrite_args args' (pats, intro_t', ctxt')
bulwahn@39657
   845
      end
bulwahn@39657
   846
  | _ => rewrite_args args (pats, intro_t, ctxt))
bulwahn@39657
   847
bulwahn@39657
   848
fun rewrite_prem atom =
bulwahn@39657
   849
  let
bulwahn@39657
   850
    val (_, args) = strip_comb atom
bulwahn@39657
   851
  in rewrite_args args end
bulwahn@39657
   852
bulwahn@39787
   853
fun split_conjuncts_in_assms ctxt th =
bulwahn@39787
   854
  let
bulwahn@39787
   855
    val ((_, [fixed_th]), ctxt') = Variable.import false [th] ctxt 
bulwahn@39787
   856
    fun split_conjs i nprems th =
bulwahn@39787
   857
      if i > nprems then th
bulwahn@39787
   858
      else
bulwahn@39787
   859
        case try Drule.RSN (@{thm conjI}, (i, th)) of
bulwahn@39787
   860
          SOME th' => split_conjs i (nprems+1) th'
bulwahn@39787
   861
        | NONE => split_conjs (i+1) nprems th
bulwahn@39787
   862
  in
bulwahn@39787
   863
    singleton (Variable.export ctxt' ctxt) (split_conjs 1 (Thm.nprems_of fixed_th) fixed_th)
bulwahn@39787
   864
  end
bulwahn@40052
   865
bulwahn@40052
   866
fun dest_conjunct_prem th =
bulwahn@40052
   867
  case HOLogic.dest_Trueprop (prop_of th) of
bulwahn@40052
   868
    (Const (@{const_name HOL.conj}, _) $ t $ t') =>
bulwahn@40052
   869
      dest_conjunct_prem (th RS @{thm conjunct1})
bulwahn@40052
   870
        @ dest_conjunct_prem (th RS @{thm conjunct2})
bulwahn@40052
   871
    | _ => [th]
bulwahn@40052
   872
bulwahn@33250
   873
fun expand_tuples thy intro =
bulwahn@33250
   874
  let
wenzelm@36610
   875
    val ctxt = ProofContext.init_global thy
bulwahn@33250
   876
    val (((T_insts, t_insts), [intro']), ctxt1) = Variable.import false [intro] ctxt
bulwahn@33250
   877
    val intro_t = prop_of intro'
bulwahn@33250
   878
    val concl = Logic.strip_imp_concl intro_t
bulwahn@33250
   879
    val (p, args) = strip_comb (HOLogic.dest_Trueprop concl)
bulwahn@33250
   880
    val (pats', intro_t', ctxt2) = rewrite_args args ([], intro_t, ctxt1)
bulwahn@33250
   881
    val (pats', intro_t', ctxt3) = 
bulwahn@33250
   882
      fold_atoms rewrite_prem intro_t' (pats', intro_t', ctxt2)
bulwahn@33250
   883
    fun rewrite_pat (ct1, ct2) =
bulwahn@33250
   884
      (ct1, cterm_of thy (Pattern.rewrite_term thy pats' [] (term_of ct2)))
bulwahn@33250
   885
    val t_insts' = map rewrite_pat t_insts
bulwahn@33250
   886
    val intro'' = Thm.instantiate (T_insts, t_insts') intro
bulwahn@33250
   887
    val [intro'''] = Variable.export ctxt3 ctxt [intro'']
bulwahn@33250
   888
    val intro'''' = Simplifier.full_simplify
bulwahn@33250
   889
      (HOL_basic_ss addsimps [@{thm fst_conv}, @{thm snd_conv}, @{thm Pair_eq}])
bulwahn@33250
   890
      intro'''
bulwahn@33250
   891
    (* splitting conjunctions introduced by Pair_eq*)
bulwahn@39787
   892
    val intro''''' = split_conjuncts_in_assms ctxt intro''''
bulwahn@33250
   893
  in
bulwahn@33250
   894
    intro'''''
bulwahn@33250
   895
  end
bulwahn@33250
   896
bulwahn@39802
   897
(** making case distributivity rules **)
bulwahn@39802
   898
(*** this should be part of the datatype package ***)
bulwahn@39802
   899
bulwahn@39802
   900
fun datatype_names_of_case_name thy case_name =
bulwahn@39802
   901
  map (#1 o #2) (#descr (the (Datatype_Data.info_of_case thy case_name)))
bulwahn@39802
   902
bulwahn@39802
   903
fun make_case_distribs new_type_names descr sorts thy =
bulwahn@39802
   904
  let
bulwahn@39802
   905
    val case_combs = Datatype_Prop.make_case_combs new_type_names descr sorts thy "f";
bulwahn@39802
   906
    fun make comb =
bulwahn@39802
   907
      let
bulwahn@39802
   908
        val Type ("fun", [T, T']) = fastype_of comb;
bulwahn@39802
   909
        val (Const (case_name, _), fs) = strip_comb comb
bulwahn@39802
   910
        val used = Term.add_tfree_names comb []
bulwahn@39802
   911
        val U = TFree (Name.variant used "'t", HOLogic.typeS)
bulwahn@39802
   912
        val x = Free ("x", T)
bulwahn@39802
   913
        val f = Free ("f", T' --> U)
bulwahn@39802
   914
        fun apply_f f' =
bulwahn@39802
   915
          let
bulwahn@39802
   916
            val Ts = binder_types (fastype_of f')
bulwahn@39802
   917
            val bs = map Bound ((length Ts - 1) downto 0)
bulwahn@39802
   918
          in
bulwahn@39802
   919
            fold (curry absdummy) (rev Ts) (f $ (list_comb (f', bs)))
bulwahn@39802
   920
          end
bulwahn@39802
   921
        val fs' = map apply_f fs
bulwahn@39802
   922
        val case_c' = Const (case_name, (map fastype_of fs') @ [T] ---> U)
bulwahn@39802
   923
      in
bulwahn@39802
   924
        HOLogic.mk_eq (f $ (comb $ x), list_comb (case_c', fs') $ x)
bulwahn@39802
   925
      end
bulwahn@39802
   926
  in
bulwahn@39802
   927
    map make case_combs
bulwahn@39802
   928
  end
bulwahn@39802
   929
bulwahn@39802
   930
fun case_rewrites thy Tcon =
bulwahn@39802
   931
  let
bulwahn@39802
   932
    val info = Datatype.the_info thy Tcon
bulwahn@39802
   933
    val descr = #descr info
bulwahn@39802
   934
    val sorts = #sorts info
bulwahn@39802
   935
    val typ_names = the_default [Tcon] (#alt_names info)
bulwahn@39802
   936
  in
bulwahn@39802
   937
    map (Drule.export_without_context o Skip_Proof.make_thm thy o HOLogic.mk_Trueprop)
bulwahn@39802
   938
      (make_case_distribs typ_names [descr] sorts thy)
bulwahn@39802
   939
  end
bulwahn@39802
   940
bulwahn@39802
   941
fun instantiated_case_rewrites thy Tcon =
bulwahn@39802
   942
  let
bulwahn@39802
   943
    val rew_ths = case_rewrites thy Tcon
bulwahn@39802
   944
    val ctxt = ProofContext.init_global thy
bulwahn@39802
   945
    fun instantiate th =
bulwahn@39802
   946
    let
bulwahn@39802
   947
      val f = (fst (strip_comb (fst (HOLogic.dest_eq (HOLogic.dest_Trueprop (prop_of th))))))
bulwahn@39802
   948
      val Type ("fun", [uninst_T, uninst_T']) = fastype_of f
bulwahn@39802
   949
      val ([tname, tname', uname, yname], ctxt') = Variable.add_fixes ["'t", "'t'", "'u", "y"] ctxt
bulwahn@39802
   950
      val T = TFree (tname, HOLogic.typeS)
bulwahn@39802
   951
      val T' = TFree (tname', HOLogic.typeS)
bulwahn@39802
   952
      val U = TFree (uname, HOLogic.typeS)
bulwahn@39802
   953
      val y = Free (yname, U)
bulwahn@39802
   954
      val f' = absdummy (U --> T', Bound 0 $ y)
bulwahn@39802
   955
      val th' = Thm.certify_instantiate
bulwahn@39802
   956
        ([(dest_TVar uninst_T, U --> T'), (dest_TVar uninst_T', T')],
bulwahn@39802
   957
         [((fst (dest_Var f), (U --> T') --> T'), f')]) th
bulwahn@39802
   958
      val [th'] = Variable.export ctxt' ctxt [th']
bulwahn@39802
   959
   in
bulwahn@39802
   960
     th'
bulwahn@39802
   961
   end
bulwahn@39802
   962
 in
bulwahn@39802
   963
   map instantiate rew_ths
bulwahn@39802
   964
 end
bulwahn@39802
   965
bulwahn@39802
   966
fun case_betapply thy t =
bulwahn@39802
   967
  let
bulwahn@39802
   968
    val case_name = fst (dest_Const (fst (strip_comb t)))
bulwahn@39802
   969
    val Tcons = datatype_names_of_case_name thy case_name
bulwahn@39802
   970
    val ths = maps (instantiated_case_rewrites thy) Tcons
bulwahn@39802
   971
  in
wenzelm@41228
   972
    Raw_Simplifier.rewrite_term thy
bulwahn@39802
   973
      (map (fn th => th RS @{thm eq_reflection}) ths) [] t
bulwahn@39802
   974
  end
bulwahn@39802
   975
bulwahn@39657
   976
(*** conversions ***)
bulwahn@39657
   977
bulwahn@39657
   978
fun imp_prems_conv cv ct =
bulwahn@39657
   979
  case Thm.term_of ct of
bulwahn@39657
   980
    Const ("==>", _) $ _ $ _ => Conv.combination_conv (Conv.arg_conv cv) (imp_prems_conv cv) ct
bulwahn@39657
   981
  | _ => Conv.all_conv ct
bulwahn@39657
   982
bulwahn@39657
   983
fun all_params_conv cv ctxt ct =
bulwahn@39657
   984
  if Logic.is_all (Thm.term_of ct)
bulwahn@39657
   985
  then Conv.arg_conv (Conv.abs_conv (all_params_conv cv o #2) ctxt) ct
bulwahn@39657
   986
  else cv ctxt ct;
bulwahn@39657
   987
  
bulwahn@36047
   988
(** eta contract higher-order arguments **)
bulwahn@35875
   989
bulwahn@35875
   990
fun eta_contract_ho_arguments thy intro =
bulwahn@35875
   991
  let
bulwahn@35875
   992
    fun f atom = list_comb (apsnd ((map o map_products) Envir.eta_contract) (strip_comb atom))
bulwahn@35875
   993
  in
bulwahn@35875
   994
    map_term thy (map_concl f o map_atoms f) intro
bulwahn@35875
   995
  end
bulwahn@35875
   996
bulwahn@36047
   997
(** remove equalities **)
bulwahn@36022
   998
bulwahn@36022
   999
fun remove_equalities thy intro =
bulwahn@36022
  1000
  let
bulwahn@36022
  1001
    fun remove_eqs intro_t =
bulwahn@36022
  1002
      let
bulwahn@36022
  1003
        val (prems, concl) = Logic.strip_horn intro_t
bulwahn@36022
  1004
        fun remove_eq (prems, concl) =
bulwahn@36022
  1005
          let
bulwahn@36022
  1006
            fun removable_eq prem =
bulwahn@36022
  1007
              case try (HOLogic.dest_eq o HOLogic.dest_Trueprop) prem of
bulwahn@36022
  1008
                SOME (lhs, rhs) => (case lhs of
bulwahn@36022
  1009
                  Var _ => true
bulwahn@36022
  1010
                  | _ => (case rhs of Var _ => true | _ => false))
bulwahn@36022
  1011
              | NONE => false
bulwahn@36022
  1012
          in
bulwahn@36022
  1013
            case find_first removable_eq prems of
bulwahn@36022
  1014
              NONE => (prems, concl)
bulwahn@36022
  1015
            | SOME eq =>
bulwahn@36022
  1016
              let
bulwahn@36022
  1017
                val (lhs, rhs) = HOLogic.dest_eq (HOLogic.dest_Trueprop eq)
bulwahn@36022
  1018
                val prems' = remove (op =) eq prems
bulwahn@36022
  1019
                val subst = (case lhs of
bulwahn@36022
  1020
                  (v as Var _) =>
bulwahn@36022
  1021
                    (fn t => if t = v then rhs else t)
bulwahn@36022
  1022
                | _ => (case rhs of
bulwahn@36022
  1023
                   (v as Var _) => (fn t => if t = v then lhs else t)))
bulwahn@36022
  1024
              in
bulwahn@36022
  1025
                remove_eq (map (map_aterms subst) prems', map_aterms subst concl)
bulwahn@36022
  1026
              end
bulwahn@36022
  1027
          end
bulwahn@36022
  1028
      in
bulwahn@36022
  1029
        Logic.list_implies (remove_eq (prems, concl))
bulwahn@36022
  1030
      end
bulwahn@36022
  1031
  in
bulwahn@36022
  1032
    map_term thy remove_eqs intro
bulwahn@36022
  1033
  end
bulwahn@35875
  1034
bulwahn@36246
  1035
(* Some last processing *)
bulwahn@36246
  1036
bulwahn@36246
  1037
fun remove_pointless_clauses intro =
bulwahn@36246
  1038
  if Logic.strip_imp_prems (prop_of intro) = [@{prop "False"}] then
bulwahn@36246
  1039
    []
bulwahn@36246
  1040
  else [intro]
bulwahn@36246
  1041
bulwahn@36246
  1042
(* some peephole optimisations *)
bulwahn@36246
  1043
bulwahn@36246
  1044
fun peephole_optimisation thy intro =
bulwahn@36246
  1045
  let
wenzelm@36610
  1046
    val process =
wenzelm@41228
  1047
      Raw_Simplifier.rewrite_rule (Predicate_Compile_Simps.get (ProofContext.init_global thy))
bulwahn@36246
  1048
    fun process_False intro_t =
bulwahn@36246
  1049
      if member (op =) (Logic.strip_imp_prems intro_t) @{prop "False"} then NONE else SOME intro_t
bulwahn@36246
  1050
    fun process_True intro_t =
bulwahn@36246
  1051
      map_filter_premises (fn p => if p = @{prop True} then NONE else SOME p) intro_t
bulwahn@36246
  1052
  in
bulwahn@36246
  1053
    Option.map (Skip_Proof.make_thm thy)
bulwahn@36246
  1054
      (process_False (process_True (prop_of (process intro))))
bulwahn@36246
  1055
  end
bulwahn@36246
  1056
bulwahn@40101
  1057
bulwahn@40101
  1058
(* importing introduction rules *)
bulwahn@40101
  1059
bulwahn@40101
  1060
fun import_intros inp_pred [] ctxt =
bulwahn@40101
  1061
  let
bulwahn@40101
  1062
    val ([outp_pred], ctxt') = Variable.import_terms true [inp_pred] ctxt
bulwahn@40101
  1063
    val T = fastype_of outp_pred
bulwahn@40101
  1064
    val paramTs = ho_argsT_of_typ (binder_types T)
bulwahn@40101
  1065
    val (param_names, ctxt'') = Variable.variant_fixes
bulwahn@40101
  1066
      (map (fn i => "p" ^ (string_of_int i)) (1 upto (length paramTs))) ctxt'
bulwahn@40101
  1067
    val params = map2 (curry Free) param_names paramTs
bulwahn@40101
  1068
  in
bulwahn@40101
  1069
    (((outp_pred, params), []), ctxt')
bulwahn@40101
  1070
  end
bulwahn@40101
  1071
  | import_intros inp_pred (th :: ths) ctxt =
bulwahn@40101
  1072
    let
bulwahn@40101
  1073
      val ((_, [th']), ctxt') = Variable.import true [th] ctxt
bulwahn@40101
  1074
      val thy = ProofContext.theory_of ctxt'
bulwahn@40101
  1075
      val (pred, args) = strip_intro_concl th'
bulwahn@40101
  1076
      val T = fastype_of pred
bulwahn@40101
  1077
      val ho_args = ho_args_of_typ T args
bulwahn@40101
  1078
      fun subst_of (pred', pred) =
bulwahn@40101
  1079
        let
bulwahn@40101
  1080
          val subst = Sign.typ_match thy (fastype_of pred', fastype_of pred) Vartab.empty
bulwahn@40101
  1081
            handle Type.TYPE_MATCH => error ("Type mismatch of predicate " ^ fst (dest_Const pred)
bulwahn@40101
  1082
            ^ " (trying to match " ^ Syntax.string_of_typ ctxt (fastype_of pred')
bulwahn@40101
  1083
            ^ " and " ^ Syntax.string_of_typ ctxt (fastype_of pred) ^ ")"
bulwahn@40101
  1084
            ^ " in " ^ Display.string_of_thm ctxt th)
bulwahn@40101
  1085
        in map (fn (indexname, (s, T)) => ((indexname, s), T)) (Vartab.dest subst) end
bulwahn@40101
  1086
      fun instantiate_typ th =
bulwahn@40101
  1087
        let
bulwahn@40101
  1088
          val (pred', _) = strip_intro_concl th
bulwahn@40101
  1089
          val _ = if not (fst (dest_Const pred) = fst (dest_Const pred')) then
bulwahn@40101
  1090
            raise Fail "Trying to instantiate another predicate" else ()
bulwahn@40101
  1091
        in Thm.certify_instantiate (subst_of (pred', pred), []) th end;
bulwahn@40101
  1092
      fun instantiate_ho_args th =
bulwahn@40101
  1093
        let
bulwahn@40101
  1094
          val (_, args') = (strip_comb o HOLogic.dest_Trueprop o Logic.strip_imp_concl o prop_of) th
bulwahn@40101
  1095
          val ho_args' = map dest_Var (ho_args_of_typ T args')
bulwahn@40101
  1096
        in Thm.certify_instantiate ([], ho_args' ~~ ho_args) th end
bulwahn@40101
  1097
      val outp_pred =
bulwahn@40101
  1098
        Term_Subst.instantiate (subst_of (inp_pred, pred), []) inp_pred
bulwahn@40101
  1099
      val ((_, ths'), ctxt1) =
bulwahn@40101
  1100
        Variable.import false (map (instantiate_typ #> instantiate_ho_args) ths) ctxt'
bulwahn@40101
  1101
    in
bulwahn@40101
  1102
      (((outp_pred, ho_args), th' :: ths'), ctxt1)
bulwahn@40101
  1103
    end
bulwahn@40101
  1104
  
bulwahn@40101
  1105
(* generation of case rules from user-given introduction rules *)
bulwahn@40101
  1106
bulwahn@40101
  1107
fun mk_args2 (Type (@{type_name Product_Type.prod}, [T1, T2])) st =
bulwahn@40101
  1108
    let
bulwahn@40101
  1109
      val (t1, st') = mk_args2 T1 st
bulwahn@40101
  1110
      val (t2, st'') = mk_args2 T2 st'
bulwahn@40101
  1111
    in
bulwahn@40101
  1112
      (HOLogic.mk_prod (t1, t2), st'')
bulwahn@40101
  1113
    end
bulwahn@40101
  1114
  (*| mk_args2 (T as Type ("fun", _)) (params, ctxt) = 
bulwahn@40101
  1115
    let
bulwahn@40101
  1116
      val (S, U) = strip_type T
bulwahn@40101
  1117
    in
bulwahn@40101
  1118
      if U = HOLogic.boolT then
bulwahn@40101
  1119
        (hd params, (tl params, ctxt))
bulwahn@40101
  1120
      else
bulwahn@40101
  1121
        let
bulwahn@40101
  1122
          val ([x], ctxt') = Variable.variant_fixes ["x"] ctxt
bulwahn@40101
  1123
        in
bulwahn@40101
  1124
          (Free (x, T), (params, ctxt'))
bulwahn@40101
  1125
        end
bulwahn@40101
  1126
    end*)
bulwahn@40101
  1127
  | mk_args2 T (params, ctxt) =
bulwahn@40101
  1128
    let
bulwahn@40101
  1129
      val ([x], ctxt') = Variable.variant_fixes ["x"] ctxt
bulwahn@40101
  1130
    in
bulwahn@40101
  1131
      (Free (x, T), (params, ctxt'))
bulwahn@40101
  1132
    end
bulwahn@40101
  1133
bulwahn@40101
  1134
fun mk_casesrule ctxt pred introrules =
bulwahn@40101
  1135
  let
bulwahn@40101
  1136
    (* TODO: can be simplified if parameters are not treated specially ? *)
bulwahn@40101
  1137
    val (((pred, params), intros_th), ctxt1) = import_intros pred introrules ctxt
bulwahn@40101
  1138
    (* TODO: distinct required ? -- test case with more than one parameter! *)
bulwahn@40101
  1139
    val params = distinct (op aconv) params
bulwahn@40101
  1140
    val intros = map prop_of intros_th
bulwahn@40101
  1141
    val ([propname], ctxt2) = Variable.variant_fixes ["thesis"] ctxt1
bulwahn@40101
  1142
    val prop = HOLogic.mk_Trueprop (Free (propname, HOLogic.boolT))
bulwahn@40101
  1143
    val argsT = binder_types (fastype_of pred)
bulwahn@40101
  1144
    (* TODO: can be simplified if parameters are not treated specially ? <-- see uncommented code! *)
bulwahn@40101
  1145
    val (argvs, _) = fold_map mk_args2 argsT (params, ctxt2)
bulwahn@40101
  1146
    fun mk_case intro =
bulwahn@40101
  1147
      let
bulwahn@40101
  1148
        val (_, args) = (strip_comb o HOLogic.dest_Trueprop o Logic.strip_imp_concl) intro
bulwahn@40101
  1149
        val prems = Logic.strip_imp_prems intro
bulwahn@40101
  1150
        val eqprems =
bulwahn@40101
  1151
          map2 (HOLogic.mk_Trueprop oo (curry HOLogic.mk_eq)) argvs args
bulwahn@40101
  1152
        val frees = map Free (fold Term.add_frees (args @ prems) [])
bulwahn@40101
  1153
      in fold Logic.all frees (Logic.list_implies (eqprems @ prems, prop)) end
bulwahn@40101
  1154
    val assm = HOLogic.mk_Trueprop (list_comb (pred, argvs))
bulwahn@40101
  1155
    val cases = map mk_case intros
bulwahn@40101
  1156
  in Logic.list_implies (assm :: cases, prop) end;
bulwahn@40101
  1157
  
bulwahn@40101
  1158
bulwahn@40101
  1159
(* unifying constants to have the same type variables *)
bulwahn@40101
  1160
bulwahn@40101
  1161
fun unify_consts thy cs intr_ts =
bulwahn@40101
  1162
  (let
bulwahn@40101
  1163
     val add_term_consts_2 = fold_aterms (fn Const c => insert (op =) c | _ => I);
bulwahn@40101
  1164
     fun varify (t, (i, ts)) =
bulwahn@40101
  1165
       let val t' = map_types (Logic.incr_tvar (i + 1)) (#2 (Type.varify_global [] t))
bulwahn@40101
  1166
       in (maxidx_of_term t', t'::ts) end;
bulwahn@40101
  1167
     val (i, cs') = List.foldr varify (~1, []) cs;
bulwahn@40101
  1168
     val (i', intr_ts') = List.foldr varify (i, []) intr_ts;
bulwahn@40101
  1169
     val rec_consts = fold add_term_consts_2 cs' [];
bulwahn@40101
  1170
     val intr_consts = fold add_term_consts_2 intr_ts' [];
bulwahn@40101
  1171
     fun unify (cname, cT) =
bulwahn@40101
  1172
       let val consts = map snd (filter (fn c => fst c = cname) intr_consts)
bulwahn@40101
  1173
       in fold (Sign.typ_unify thy) ((replicate (length consts) cT) ~~ consts) end;
bulwahn@40101
  1174
     val (env, _) = fold unify rec_consts (Vartab.empty, i');
bulwahn@40101
  1175
     val subst = map_types (Envir.norm_type env)
bulwahn@40101
  1176
   in (map subst cs', map subst intr_ts')
bulwahn@40101
  1177
   end) handle Type.TUNIFY =>
bulwahn@40101
  1178
     (warning "Occurrences of recursive constant have non-unifiable types"; (cs, intr_ts));
bulwahn@40101
  1179
bulwahn@40101
  1180
(* preprocessing rules *)
bulwahn@40101
  1181
bulwahn@40101
  1182
fun Trueprop_conv cv ct =
bulwahn@40101
  1183
  case Thm.term_of ct of
bulwahn@40101
  1184
    Const (@{const_name Trueprop}, _) $ _ => Conv.arg_conv cv ct  
bulwahn@40101
  1185
  | _ => raise Fail "Trueprop_conv"
bulwahn@40101
  1186
bulwahn@40101
  1187
fun preprocess_equality thy rule =
bulwahn@40101
  1188
  Conv.fconv_rule
bulwahn@40101
  1189
    (imp_prems_conv
bulwahn@40101
  1190
      (Trueprop_conv (Conv.try_conv (Conv.rewr_conv (Thm.symmetric @{thm Predicate.eq_is_eq})))))
bulwahn@40101
  1191
    (Thm.transfer thy rule)
bulwahn@40101
  1192
bulwahn@40101
  1193
fun preprocess_intro thy = expand_tuples thy #> preprocess_equality thy
bulwahn@40101
  1194
bulwahn@39541
  1195
(* defining a quickcheck predicate *)
bulwahn@39541
  1196
bulwahn@39541
  1197
fun strip_imp_prems (Const(@{const_name HOL.implies}, _) $ A $ B) = A :: strip_imp_prems B
bulwahn@39541
  1198
  | strip_imp_prems _ = [];
bulwahn@39541
  1199
bulwahn@39541
  1200
fun strip_imp_concl (Const(@{const_name HOL.implies}, _) $ A $ B) = strip_imp_concl B
bulwahn@39541
  1201
  | strip_imp_concl A = A : term;
bulwahn@39541
  1202
bulwahn@39541
  1203
fun strip_horn A = (strip_imp_prems A, strip_imp_concl A);
bulwahn@39541
  1204
bulwahn@39541
  1205
fun define_quickcheck_predicate t thy =
bulwahn@39541
  1206
  let
bulwahn@39541
  1207
    val (vs, t') = strip_abs t
bulwahn@39541
  1208
    val vs' = Variable.variant_frees (ProofContext.init_global thy) [] vs
bulwahn@39541
  1209
    val t'' = subst_bounds (map Free (rev vs'), t')
bulwahn@39541
  1210
    val (prems, concl) = strip_horn t''
bulwahn@39541
  1211
    val constname = "quickcheck"
bulwahn@39541
  1212
    val full_constname = Sign.full_bname thy constname
bulwahn@39541
  1213
    val constT = map snd vs' ---> @{typ bool}
bulwahn@39541
  1214
    val thy1 = Sign.add_consts_i [(Binding.name constname, constT, NoSyn)] thy
bulwahn@39541
  1215
    val const = Const (full_constname, constT)
bulwahn@39541
  1216
    val t = Logic.list_implies
bulwahn@39541
  1217
      (map HOLogic.mk_Trueprop (prems @ [HOLogic.mk_not concl]),
bulwahn@39541
  1218
       HOLogic.mk_Trueprop (list_comb (const, map Free vs')))
bulwahn@39541
  1219
    val tac = fn _ => Skip_Proof.cheat_tac thy1
bulwahn@39541
  1220
    val intro = Goal.prove (ProofContext.init_global thy1) (map fst vs') [] t tac
bulwahn@39541
  1221
  in
bulwahn@39541
  1222
    ((((full_constname, constT), vs'), intro), thy1)
bulwahn@39541
  1223
  end
bulwahn@39541
  1224
bulwahn@33250
  1225
end;