src/HOL/Tools/Nitpick/nitpick_hol.ML
author blanchet
Tue Dec 07 11:56:53 2010 +0100 (2010-12-07)
changeset 41052 3db267a01c1d
parent 41049 0edd245892ed
child 41472 f6ab14e61604
permissions -rw-r--r--
remove the "fin_fun" optimization in Nitpick -- it was always a hack and didn't help much
blanchet@33978
     1
(*  Title:      HOL/Tools/Nitpick/nitpick_hol.ML
blanchet@33192
     2
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@34982
     3
    Copyright   2008, 2009, 2010
blanchet@33192
     4
blanchet@33192
     5
Auxiliary HOL-related functions used by Nitpick.
blanchet@33192
     6
*)
blanchet@33192
     7
blanchet@33192
     8
signature NITPICK_HOL =
blanchet@33192
     9
sig
blanchet@33705
    10
  type styp = Nitpick_Util.styp
blanchet@33192
    11
  type const_table = term list Symtab.table
blanchet@33192
    12
  type special_fun = (styp * int list * term list) * styp
blanchet@33192
    13
  type unrolled = styp * styp
blanchet@33192
    14
  type wf_cache = (styp * (bool * bool)) list
blanchet@33192
    15
blanchet@36390
    16
  type hol_context =
blanchet@36390
    17
    {thy: theory,
blanchet@36390
    18
     ctxt: Proof.context,
blanchet@36390
    19
     max_bisim_depth: int,
blanchet@36390
    20
     boxes: (typ option * bool option) list,
blanchet@36390
    21
     stds: (typ option * bool) list,
blanchet@36390
    22
     wfs: (styp option * bool option) list,
blanchet@36390
    23
     user_axioms: bool option,
blanchet@36390
    24
     debug: bool,
blanchet@38209
    25
     whacks: term list,
blanchet@36390
    26
     binary_ints: bool option,
blanchet@36390
    27
     destroy_constrs: bool,
blanchet@36390
    28
     specialize: bool,
blanchet@36390
    29
     star_linear_preds: bool,
blanchet@36390
    30
     tac_timeout: Time.time option,
blanchet@36390
    31
     evals: term list,
blanchet@36390
    32
     case_names: (string * int) list,
blanchet@36390
    33
     def_table: const_table,
blanchet@36390
    34
     nondef_table: const_table,
blanchet@36390
    35
     user_nondefs: term list,
blanchet@36390
    36
     simp_table: const_table Unsynchronized.ref,
blanchet@36390
    37
     psimp_table: const_table,
blanchet@36390
    38
     choice_spec_table: const_table,
blanchet@36390
    39
     intro_table: const_table,
blanchet@36390
    40
     ground_thm_table: term list Inttab.table,
blanchet@36390
    41
     ersatz_table: (string * string) list,
blanchet@36390
    42
     skolems: (string * string list) list Unsynchronized.ref,
blanchet@36390
    43
     special_funs: special_fun list Unsynchronized.ref,
blanchet@36390
    44
     unrolled_preds: unrolled list Unsynchronized.ref,
blanchet@36390
    45
     wf_cache: wf_cache Unsynchronized.ref,
blanchet@36390
    46
     constr_cache: (typ * styp list) list Unsynchronized.ref}
blanchet@33192
    47
blanchet@35070
    48
  datatype fixpoint_kind = Lfp | Gfp | NoFp
blanchet@35070
    49
  datatype boxability =
blanchet@35070
    50
    InConstr | InSel | InExpr | InPair | InFunLHS | InFunRHS1 | InFunRHS2
blanchet@35070
    51
blanchet@33192
    52
  val name_sep : string
blanchet@33192
    53
  val numeral_prefix : string
blanchet@35718
    54
  val base_prefix : string
blanchet@35718
    55
  val step_prefix : string
blanchet@35718
    56
  val unrolled_prefix : string
blanchet@35070
    57
  val ubfp_prefix : string
blanchet@35070
    58
  val lbfp_prefix : string
blanchet@35311
    59
  val quot_normal_prefix : string
blanchet@33192
    60
  val skolem_prefix : string
blanchet@35070
    61
  val special_prefix : string
blanchet@35070
    62
  val uncurry_prefix : string
blanchet@33192
    63
  val eval_prefix : string
blanchet@35718
    64
  val iter_var_prefix : string
blanchet@35718
    65
  val strip_first_name_sep : string -> string * string
blanchet@33192
    66
  val original_name : string -> string
blanchet@37476
    67
  val abs_var : indexname * typ -> term -> term
blanchet@41045
    68
  val is_higher_order_type : typ -> bool
blanchet@37476
    69
  val s_let : string -> int -> typ -> typ -> (term -> term) -> term -> term
blanchet@37476
    70
  val s_betapply : typ list -> term * term -> term
blanchet@37476
    71
  val s_betapplys : typ list -> term * term list -> term
blanchet@34998
    72
  val s_conj : term * term -> term
blanchet@35070
    73
  val s_disj : term * term -> term
blanchet@35070
    74
  val strip_any_connective : term -> term list * term
blanchet@35070
    75
  val conjuncts_of : term -> term list
blanchet@35070
    76
  val disjuncts_of : term -> term list
blanchet@35665
    77
  val unarize_unbox_etc_type : typ -> typ
blanchet@35665
    78
  val uniterize_unarize_unbox_etc_type : typ -> typ
blanchet@33192
    79
  val string_for_type : Proof.context -> typ -> string
blanchet@38188
    80
  val pretty_for_type : Proof.context -> typ -> Pretty.T
blanchet@33192
    81
  val prefix_name : string -> string -> string
blanchet@34121
    82
  val shortest_name : string -> string
blanchet@33192
    83
  val short_name : string -> string
blanchet@34121
    84
  val shorten_names_in_term : term -> term
blanchet@35711
    85
  val strict_type_match : theory -> typ * typ -> bool
blanchet@33192
    86
  val type_match : theory -> typ * typ -> bool
blanchet@33192
    87
  val const_match : theory -> styp * styp -> bool
blanchet@33192
    88
  val term_match : theory -> term * term -> bool
blanchet@35711
    89
  val frac_from_term_pair : typ -> term -> term -> term
blanchet@33192
    90
  val is_TFree : typ -> bool
blanchet@33192
    91
  val is_fun_type : typ -> bool
blanchet@33192
    92
  val is_set_type : typ -> bool
blanchet@33192
    93
  val is_pair_type : typ -> bool
blanchet@33192
    94
  val is_lfp_iterator_type : typ -> bool
blanchet@33192
    95
  val is_gfp_iterator_type : typ -> bool
blanchet@33192
    96
  val is_fp_iterator_type : typ -> bool
blanchet@35280
    97
  val is_iterator_type : typ -> bool
blanchet@33192
    98
  val is_boolean_type : typ -> bool
blanchet@33192
    99
  val is_integer_type : typ -> bool
blanchet@34124
   100
  val is_bit_type : typ -> bool
blanchet@34124
   101
  val is_word_type : typ -> bool
blanchet@35220
   102
  val is_integer_like_type : typ -> bool
blanchet@33192
   103
  val is_record_type : typ -> bool
blanchet@38240
   104
  val is_number_type : Proof.context -> typ -> bool
blanchet@33192
   105
  val const_for_iterator_type : typ -> styp
blanchet@35070
   106
  val strip_n_binders : int -> typ -> typ list * typ
blanchet@33192
   107
  val nth_range_type : int -> typ -> typ
blanchet@33192
   108
  val num_factors_in_type : typ -> int
blanchet@33192
   109
  val num_binder_types : typ -> int
blanchet@33192
   110
  val curried_binder_types : typ -> typ list
blanchet@33192
   111
  val mk_flat_tuple : typ -> term list -> term
blanchet@33192
   112
  val dest_n_tuple : int -> term -> term list
blanchet@33978
   113
  val is_real_datatype : theory -> string -> bool
blanchet@35220
   114
  val is_standard_datatype : theory -> (typ option * bool) list -> typ -> bool
blanchet@38240
   115
  val is_codatatype : Proof.context -> typ -> bool
blanchet@38240
   116
  val is_quot_type : Proof.context -> typ -> bool
blanchet@37256
   117
  val is_pure_typedef : Proof.context -> typ -> bool
blanchet@37256
   118
  val is_univ_typedef : Proof.context -> typ -> bool
blanchet@37256
   119
  val is_datatype : Proof.context -> (typ option * bool) list -> typ -> bool
blanchet@33192
   120
  val is_record_constr : styp -> bool
blanchet@33192
   121
  val is_record_get : theory -> styp -> bool
blanchet@33192
   122
  val is_record_update : theory -> styp -> bool
blanchet@37256
   123
  val is_abs_fun : Proof.context -> styp -> bool
blanchet@37256
   124
  val is_rep_fun : Proof.context -> styp -> bool
blanchet@34936
   125
  val is_quot_abs_fun : Proof.context -> styp -> bool
blanchet@34936
   126
  val is_quot_rep_fun : Proof.context -> styp -> bool
blanchet@37256
   127
  val mate_of_rep_fun : Proof.context -> styp -> styp
blanchet@37256
   128
  val is_constr_like : Proof.context -> styp -> bool
blanchet@37256
   129
  val is_constr : Proof.context -> (typ option * bool) list -> styp -> bool
blanchet@33192
   130
  val is_sel : string -> bool
blanchet@34124
   131
  val is_sel_like_and_no_discr : string -> bool
blanchet@35070
   132
  val box_type : hol_context -> boxability -> typ -> typ
blanchet@35190
   133
  val binarize_nat_and_int_in_type : typ -> typ
blanchet@35190
   134
  val binarize_nat_and_int_in_term : term -> term
blanchet@33192
   135
  val discr_for_constr : styp -> styp
blanchet@33192
   136
  val num_sels_for_constr_type : typ -> int
blanchet@33192
   137
  val nth_sel_name_for_constr_name : string -> int -> string
blanchet@33192
   138
  val nth_sel_for_constr : styp -> int -> styp
blanchet@35190
   139
  val binarized_and_boxed_nth_sel_for_constr :
blanchet@35190
   140
    hol_context -> bool -> styp -> int -> styp
blanchet@33192
   141
  val sel_no_from_name : string -> int
blanchet@35078
   142
  val close_form : term -> term
blanchet@33192
   143
  val distinctness_formula : typ -> term list -> term
blanchet@38240
   144
  val register_frac_type :
blanchet@38284
   145
    string -> (string * string) list -> morphism -> Context.generic
blanchet@38284
   146
    -> Context.generic
blanchet@38240
   147
  val register_frac_type_global :
blanchet@38240
   148
    string -> (string * string) list -> theory -> theory
blanchet@38284
   149
  val unregister_frac_type :
blanchet@38284
   150
    string -> morphism -> Context.generic -> Context.generic
blanchet@38240
   151
  val unregister_frac_type_global : string -> theory -> theory
blanchet@38240
   152
  val register_codatatype :
blanchet@38284
   153
    typ -> string -> styp list -> morphism -> Context.generic -> Context.generic
blanchet@38240
   154
  val register_codatatype_global :
blanchet@38240
   155
    typ -> string -> styp list -> theory -> theory
blanchet@38284
   156
  val unregister_codatatype :
blanchet@38284
   157
    typ -> morphism -> Context.generic -> Context.generic
blanchet@38240
   158
  val unregister_codatatype_global : typ -> theory -> theory
blanchet@35070
   159
  val datatype_constrs : hol_context -> typ -> styp list
blanchet@35190
   160
  val binarized_and_boxed_datatype_constrs :
blanchet@35190
   161
    hol_context -> bool -> typ -> styp list
blanchet@35070
   162
  val num_datatype_constrs : hol_context -> typ -> int
blanchet@33192
   163
  val constr_name_for_sel_like : string -> string
blanchet@35190
   164
  val binarized_and_boxed_constr_for_sel : hol_context -> bool -> styp -> styp
blanchet@35070
   165
  val discriminate_value : hol_context -> styp -> term -> term
blanchet@35220
   166
  val select_nth_constr_arg :
blanchet@37256
   167
    Proof.context -> (typ option * bool) list -> styp -> term -> int -> typ
blanchet@37256
   168
    -> term
blanchet@35220
   169
  val construct_value :
blanchet@37256
   170
    Proof.context -> (typ option * bool) list -> styp -> term list -> term
blanchet@35665
   171
  val coerce_term : hol_context -> typ list -> typ -> typ -> term -> term
blanchet@33192
   172
  val card_of_type : (typ * int) list -> typ -> int
blanchet@33192
   173
  val bounded_card_of_type : int -> int -> (typ * int) list -> typ -> int
blanchet@34123
   174
  val bounded_exact_card_of_type :
blanchet@35385
   175
    hol_context -> typ list -> int -> int -> (typ * int) list -> typ -> int
blanchet@35070
   176
  val is_finite_type : hol_context -> typ -> bool
blanchet@35665
   177
  val is_small_finite_type : hol_context -> typ -> bool
blanchet@35070
   178
  val special_bounds : term list -> (indexname * typ) list
blanchet@38240
   179
  val is_funky_typedef : Proof.context -> typ -> bool
blanchet@35335
   180
  val all_axioms_of :
blanchet@37256
   181
    Proof.context -> (term * term) list -> term list * term list * term list
blanchet@35220
   182
  val arity_of_built_in_const :
blanchet@39359
   183
    theory -> (typ option * bool) list -> styp -> int option
blanchet@35220
   184
  val is_built_in_const :
blanchet@39359
   185
    theory -> (typ option * bool) list -> styp -> bool
blanchet@35070
   186
  val term_under_def : term -> term
blanchet@35220
   187
  val case_const_names :
blanchet@38240
   188
    Proof.context -> (typ option * bool) list -> (string * int) list
blanchet@35718
   189
  val unfold_defs_in_term : hol_context -> term -> term
blanchet@35335
   190
  val const_def_table :
blanchet@35335
   191
    Proof.context -> (term * term) list -> term list -> const_table
blanchet@33192
   192
  val const_nondef_table : term list -> const_table
blanchet@35335
   193
  val const_simp_table : Proof.context -> (term * term) list -> const_table
blanchet@35335
   194
  val const_psimp_table : Proof.context -> (term * term) list -> const_table
blanchet@35807
   195
  val const_choice_spec_table :
blanchet@35807
   196
    Proof.context -> (term * term) list -> const_table
blanchet@35335
   197
  val inductive_intro_table :
blanchet@35335
   198
    Proof.context -> (term * term) list -> const_table -> const_table
blanchet@33192
   199
  val ground_theorem_table : theory -> term list Inttab.table
blanchet@38240
   200
  val ersatz_table : Proof.context -> (string * string) list
blanchet@35070
   201
  val add_simps : const_table Unsynchronized.ref -> string -> term list -> unit
blanchet@37256
   202
  val inverse_axioms_for_rep_fun : Proof.context -> styp -> term list
blanchet@37256
   203
  val optimized_typedef_axioms : Proof.context -> string * typ list -> term list
blanchet@35220
   204
  val optimized_quot_type_axioms :
blanchet@35311
   205
    Proof.context -> (typ option * bool) list -> string * typ list -> term list
blanchet@33192
   206
  val def_of_const : theory -> const_table -> styp -> term option
blanchet@35718
   207
  val fixpoint_kind_of_rhs : term -> fixpoint_kind
blanchet@35070
   208
  val fixpoint_kind_of_const :
blanchet@35070
   209
    theory -> const_table -> string * typ -> fixpoint_kind
blanchet@38205
   210
  val is_real_inductive_pred : hol_context -> styp -> bool
blanchet@37256
   211
  val is_constr_pattern_lhs : Proof.context -> term -> bool
blanchet@37256
   212
  val is_constr_pattern_formula : Proof.context -> term -> bool
blanchet@35807
   213
  val nondef_props_for_const :
blanchet@35807
   214
    theory -> bool -> const_table -> styp -> term list
blanchet@35807
   215
  val is_choice_spec_fun : hol_context -> styp -> bool
blanchet@35807
   216
  val is_choice_spec_axiom : theory -> const_table -> term -> bool
blanchet@38205
   217
  val is_real_equational_fun : hol_context -> styp -> bool
blanchet@38202
   218
  val is_equational_fun_but_no_plain_def : hol_context -> styp -> bool
blanchet@35070
   219
  val codatatype_bisim_axioms : hol_context -> typ -> term list
blanchet@35070
   220
  val is_well_founded_inductive_pred : hol_context -> styp -> bool
blanchet@35070
   221
  val unrolled_inductive_pred_const : hol_context -> bool -> styp -> term
blanchet@35070
   222
  val equational_fun_axioms : hol_context -> styp -> term list
blanchet@35070
   223
  val is_equational_fun_surely_complete : hol_context -> styp -> bool
blanchet@38212
   224
  val merged_type_var_table_for_terms :
blanchet@38212
   225
    theory -> term list -> (sort * string) list
blanchet@38212
   226
  val merge_type_vars_in_term :
blanchet@38212
   227
    theory -> bool -> (sort * string) list -> term -> term
blanchet@35190
   228
  val ground_types_in_type : hol_context -> bool -> typ -> typ list
blanchet@35190
   229
  val ground_types_in_terms : hol_context -> bool -> term list -> typ list
blanchet@33192
   230
end;
blanchet@33192
   231
blanchet@33232
   232
structure Nitpick_HOL : NITPICK_HOL =
blanchet@33192
   233
struct
blanchet@33192
   234
blanchet@33232
   235
open Nitpick_Util
blanchet@33192
   236
blanchet@33192
   237
type const_table = term list Symtab.table
blanchet@33192
   238
type special_fun = (styp * int list * term list) * styp
blanchet@33192
   239
type unrolled = styp * styp
blanchet@33192
   240
type wf_cache = (styp * (bool * bool)) list
blanchet@33192
   241
blanchet@36390
   242
type hol_context =
blanchet@36390
   243
  {thy: theory,
blanchet@36390
   244
   ctxt: Proof.context,
blanchet@36390
   245
   max_bisim_depth: int,
blanchet@36390
   246
   boxes: (typ option * bool option) list,
blanchet@36390
   247
   stds: (typ option * bool) list,
blanchet@36390
   248
   wfs: (styp option * bool option) list,
blanchet@36390
   249
   user_axioms: bool option,
blanchet@36390
   250
   debug: bool,
blanchet@38209
   251
   whacks: term list,
blanchet@36390
   252
   binary_ints: bool option,
blanchet@36390
   253
   destroy_constrs: bool,
blanchet@36390
   254
   specialize: bool,
blanchet@36390
   255
   star_linear_preds: bool,
blanchet@36390
   256
   tac_timeout: Time.time option,
blanchet@36390
   257
   evals: term list,
blanchet@36390
   258
   case_names: (string * int) list,
blanchet@36390
   259
   def_table: const_table,
blanchet@36390
   260
   nondef_table: const_table,
blanchet@36390
   261
   user_nondefs: term list,
blanchet@36390
   262
   simp_table: const_table Unsynchronized.ref,
blanchet@36390
   263
   psimp_table: const_table,
blanchet@36390
   264
   choice_spec_table: const_table,
blanchet@36390
   265
   intro_table: const_table,
blanchet@36390
   266
   ground_thm_table: term list Inttab.table,
blanchet@36390
   267
   ersatz_table: (string * string) list,
blanchet@36390
   268
   skolems: (string * string list) list Unsynchronized.ref,
blanchet@36390
   269
   special_funs: special_fun list Unsynchronized.ref,
blanchet@36390
   270
   unrolled_preds: unrolled list Unsynchronized.ref,
blanchet@36390
   271
   wf_cache: wf_cache Unsynchronized.ref,
blanchet@36390
   272
   constr_cache: (typ * styp list) list Unsynchronized.ref}
blanchet@33192
   273
blanchet@35070
   274
datatype fixpoint_kind = Lfp | Gfp | NoFp
blanchet@35070
   275
datatype boxability =
blanchet@35070
   276
  InConstr | InSel | InExpr | InPair | InFunLHS | InFunRHS1 | InFunRHS2
blanchet@35070
   277
blanchet@38240
   278
structure Data = Generic_Data(
blanchet@33192
   279
  type T = {frac_types: (string * (string * string) list) list,
blanchet@33192
   280
            codatatypes: (string * (string * styp list)) list}
blanchet@33192
   281
  val empty = {frac_types = [], codatatypes = []}
blanchet@33192
   282
  val extend = I
wenzelm@33522
   283
  fun merge ({frac_types = fs1, codatatypes = cs1},
blanchet@36391
   284
             {frac_types = fs2, codatatypes = cs2}) : T =
wenzelm@33699
   285
    {frac_types = AList.merge (op =) (K true) (fs1, fs2),
wenzelm@33699
   286
     codatatypes = AList.merge (op =) (K true) (cs1, cs2)})
blanchet@33192
   287
blanchet@33192
   288
val name_sep = "$"
blanchet@33192
   289
val numeral_prefix = nitpick_prefix ^ "num" ^ name_sep
blanchet@33192
   290
val sel_prefix = nitpick_prefix ^ "sel"
blanchet@33192
   291
val discr_prefix = nitpick_prefix ^ "is" ^ name_sep
blanchet@33192
   292
val set_prefix = nitpick_prefix ^ "set" ^ name_sep
blanchet@33192
   293
val lfp_iterator_prefix = nitpick_prefix ^ "lfpit" ^ name_sep
blanchet@33192
   294
val gfp_iterator_prefix = nitpick_prefix ^ "gfpit" ^ name_sep
blanchet@33192
   295
val unrolled_prefix = nitpick_prefix ^ "unroll" ^ name_sep
blanchet@33192
   296
val base_prefix = nitpick_prefix ^ "base" ^ name_sep
blanchet@33192
   297
val step_prefix = nitpick_prefix ^ "step" ^ name_sep
blanchet@33192
   298
val ubfp_prefix = nitpick_prefix ^ "ubfp" ^ name_sep
blanchet@33192
   299
val lbfp_prefix = nitpick_prefix ^ "lbfp" ^ name_sep
blanchet@35311
   300
val quot_normal_prefix = nitpick_prefix ^ "qn" ^ name_sep
blanchet@33192
   301
val skolem_prefix = nitpick_prefix ^ "sk"
blanchet@33192
   302
val special_prefix = nitpick_prefix ^ "sp"
blanchet@33192
   303
val uncurry_prefix = nitpick_prefix ^ "unc"
blanchet@33192
   304
val eval_prefix = nitpick_prefix ^ "eval"
blanchet@33192
   305
val iter_var_prefix = "i"
blanchet@35718
   306
blanchet@35718
   307
(** Constant/type information and term/type manipulation **)
blanchet@33192
   308
blanchet@33192
   309
fun sel_prefix_for j = sel_prefix ^ string_of_int j ^ name_sep
blanchet@35311
   310
fun quot_normal_name_for_type ctxt T =
blanchet@35311
   311
  quot_normal_prefix ^ unyxml (Syntax.string_of_typ ctxt T)
blanchet@33192
   312
blanchet@33192
   313
val strip_first_name_sep =
blanchet@33192
   314
  Substring.full #> Substring.position name_sep ##> Substring.triml 1
blanchet@33192
   315
  #> pairself Substring.string
blanchet@33192
   316
fun original_name s =
blanchet@33192
   317
  if String.isPrefix nitpick_prefix s then
blanchet@33192
   318
    case strip_first_name_sep s of (s1, "") => s1 | (_, s2) => original_name s2
blanchet@33192
   319
  else
blanchet@33192
   320
    s
blanchet@35718
   321
blanchet@41045
   322
fun is_higher_order_type (Type (@{type_name fun}, _)) = true
blanchet@41045
   323
  | is_higher_order_type (Type (_, Ts)) = exists is_higher_order_type Ts
blanchet@41045
   324
  | is_higher_order_type _ = false
blanchet@41045
   325
blanchet@37476
   326
fun abs_var ((s, j), T) body = Abs (s, T, abstract_over (Var ((s, j), T), body))
blanchet@37476
   327
blanchet@37476
   328
fun let_var s = (nitpick_prefix ^ s, 999)
blanchet@37476
   329
val let_inline_threshold = 20
blanchet@37476
   330
blanchet@37476
   331
fun s_let s n abs_T body_T f t =
blanchet@41045
   332
  if (n - 1) * (size_of_term t - 1) <= let_inline_threshold orelse
blanchet@41045
   333
     is_higher_order_type abs_T then
blanchet@37476
   334
    f t
blanchet@37476
   335
  else
blanchet@37476
   336
    let val z = (let_var s, abs_T) in
blanchet@37476
   337
      Const (@{const_name Let}, abs_T --> (abs_T --> body_T) --> body_T)
blanchet@37476
   338
      $ t $ abs_var z (incr_boundvars 1 (f (Var z)))
blanchet@37476
   339
    end
blanchet@37476
   340
blanchet@37476
   341
fun loose_bvar1_count (Bound i, k) = if i = k then 1 else 0
blanchet@37476
   342
  | loose_bvar1_count (t1 $ t2, k) =
blanchet@37476
   343
    loose_bvar1_count (t1, k) + loose_bvar1_count (t2, k)
blanchet@37476
   344
  | loose_bvar1_count (Abs (_, _, t), k) = loose_bvar1_count (t, k + 1)
blanchet@37476
   345
  | loose_bvar1_count _ = 0
blanchet@37476
   346
blanchet@37476
   347
fun s_betapply _ (Const (@{const_name If}, _) $ @{const True} $ t1', _) = t1'
blanchet@37476
   348
  | s_betapply _ (Const (@{const_name If}, _) $ @{const False} $ _, t2) = t2
blanchet@37476
   349
  | s_betapply Ts (Const (@{const_name Let},
blanchet@37476
   350
                          Type (_, [bound_T, Type (_, [_, body_T])]))
blanchet@37476
   351
                   $ t12 $ Abs (s, T, t13'), t2) =
blanchet@37476
   352
    let val body_T' = range_type body_T in
blanchet@37476
   353
      Const (@{const_name Let}, bound_T --> (bound_T --> body_T') --> body_T')
blanchet@37476
   354
      $ t12 $ Abs (s, T, s_betapply (T :: Ts) (t13', incr_boundvars 1 t2))
blanchet@37476
   355
    end
blanchet@37476
   356
  | s_betapply Ts (t1 as Abs (s1, T1, t1'), t2) =
blanchet@37476
   357
    (s_let s1 (loose_bvar1_count (t1', 0)) T1 (fastype_of1 (T1 :: Ts, t1'))
blanchet@37476
   358
              (curry betapply t1) t2
blanchet@37476
   359
     handle TERM _ => betapply (t1, t2)) (* FIXME: fix all uses *)
blanchet@37476
   360
  | s_betapply _ (t1, t2) = t1 $ t2
blanchet@37476
   361
fun s_betapplys Ts = Library.foldl (s_betapply Ts)
blanchet@37476
   362
blanchet@37476
   363
fun s_beta_norm Ts t =
blanchet@37476
   364
  let
blanchet@37476
   365
    fun aux _ (Var _) = raise Same.SAME
blanchet@37476
   366
      | aux Ts (Abs (s, T, t')) = Abs (s, T, aux (T :: Ts) t')
blanchet@37476
   367
      | aux Ts ((t1 as Abs _) $ t2) =
blanchet@37476
   368
        Same.commit (aux Ts) (s_betapply Ts (t1, t2))
blanchet@37476
   369
      | aux Ts (t1 $ t2) =
blanchet@37476
   370
        ((case aux Ts t1 of
blanchet@37476
   371
           t1 as Abs _ => Same.commit (aux Ts) (s_betapply Ts (t1, t2))
blanchet@37476
   372
         | t1 => t1 $ Same.commit (aux Ts) t2)
blanchet@37476
   373
        handle Same.SAME => t1 $ aux Ts t2)
blanchet@37476
   374
      | aux _ _ = raise Same.SAME
blanchet@37476
   375
  in aux Ts t handle Same.SAME => t end
blanchet@33192
   376
blanchet@34998
   377
fun s_conj (t1, @{const True}) = t1
blanchet@34998
   378
  | s_conj (@{const True}, t2) = t2
blanchet@34998
   379
  | s_conj (t1, t2) =
blanchet@34998
   380
    if t1 = @{const False} orelse t2 = @{const False} then @{const False}
blanchet@34998
   381
    else HOLogic.mk_conj (t1, t2)
blanchet@34998
   382
fun s_disj (t1, @{const False}) = t1
blanchet@34998
   383
  | s_disj (@{const False}, t2) = t2
blanchet@34998
   384
  | s_disj (t1, t2) =
blanchet@34998
   385
    if t1 = @{const True} orelse t2 = @{const True} then @{const True}
blanchet@34998
   386
    else HOLogic.mk_disj (t1, t2)
blanchet@34998
   387
blanchet@34998
   388
fun strip_connective conn_t (t as (t0 $ t1 $ t2)) =
blanchet@34998
   389
    if t0 = conn_t then strip_connective t0 t2 @ strip_connective t0 t1 else [t]
blanchet@34998
   390
  | strip_connective _ t = [t]
blanchet@35280
   391
fun strip_any_connective (t as (t0 $ _ $ _)) =
haftmann@38795
   392
    if t0 = @{const HOL.conj} orelse t0 = @{const HOL.disj} then
blanchet@34998
   393
      (strip_connective t0 t, t0)
blanchet@34998
   394
    else
blanchet@34998
   395
      ([t], @{const Not})
blanchet@34998
   396
  | strip_any_connective t = ([t], @{const Not})
haftmann@38795
   397
val conjuncts_of = strip_connective @{const HOL.conj}
haftmann@38795
   398
val disjuncts_of = strip_connective @{const HOL.disj}
blanchet@34998
   399
blanchet@33192
   400
(* When you add constants to these lists, make sure to handle them in
blanchet@33232
   401
   "Nitpick_Nut.nut_from_term", and perhaps in "Nitpick_Mono.consider_term" as
blanchet@33192
   402
   well. *)
blanchet@33192
   403
val built_in_consts =
blanchet@33192
   404
  [(@{const_name all}, 1),
blanchet@33192
   405
   (@{const_name "=="}, 2),
blanchet@33192
   406
   (@{const_name "==>"}, 2),
blanchet@33192
   407
   (@{const_name Pure.conjunction}, 2),
blanchet@33192
   408
   (@{const_name Trueprop}, 1),
blanchet@33192
   409
   (@{const_name Not}, 1),
blanchet@33192
   410
   (@{const_name False}, 0),
blanchet@33192
   411
   (@{const_name True}, 0),
blanchet@33192
   412
   (@{const_name All}, 1),
blanchet@33192
   413
   (@{const_name Ex}, 1),
haftmann@38864
   414
   (@{const_name HOL.eq}, 1),
haftmann@38795
   415
   (@{const_name HOL.conj}, 2),
haftmann@38795
   416
   (@{const_name HOL.disj}, 2),
haftmann@38786
   417
   (@{const_name HOL.implies}, 2),
blanchet@33192
   418
   (@{const_name If}, 3),
blanchet@33192
   419
   (@{const_name Let}, 2),
blanchet@33192
   420
   (@{const_name Pair}, 2),
blanchet@33192
   421
   (@{const_name fst}, 1),
blanchet@33192
   422
   (@{const_name snd}, 1),
blanchet@33192
   423
   (@{const_name Id}, 0),
blanchet@33192
   424
   (@{const_name converse}, 1),
blanchet@33192
   425
   (@{const_name trancl}, 1),
blanchet@33192
   426
   (@{const_name rel_comp}, 2),
blanchet@33192
   427
   (@{const_name finite}, 1),
blanchet@34936
   428
   (@{const_name unknown}, 0),
blanchet@34936
   429
   (@{const_name is_unknown}, 1),
blanchet@35671
   430
   (@{const_name safe_The}, 1),
blanchet@33192
   431
   (@{const_name Frac}, 0),
blanchet@33192
   432
   (@{const_name norm_frac}, 0)]
blanchet@35220
   433
val built_in_nat_consts =
blanchet@35220
   434
  [(@{const_name Suc}, 0),
blanchet@35220
   435
   (@{const_name nat}, 0),
blanchet@35220
   436
   (@{const_name nat_gcd}, 0),
blanchet@35220
   437
   (@{const_name nat_lcm}, 0)]
blanchet@33192
   438
val built_in_typed_consts =
blanchet@35220
   439
  [((@{const_name zero_class.zero}, int_T), 0),
blanchet@35220
   440
   ((@{const_name one_class.one}, int_T), 0),
blanchet@35220
   441
   ((@{const_name plus_class.plus}, int_T --> int_T --> int_T), 0),
blanchet@35220
   442
   ((@{const_name minus_class.minus}, int_T --> int_T --> int_T), 0),
blanchet@35220
   443
   ((@{const_name times_class.times}, int_T --> int_T --> int_T), 0),
blanchet@35220
   444
   ((@{const_name div_class.div}, int_T --> int_T --> int_T), 0),
blanchet@35220
   445
   ((@{const_name uminus_class.uminus}, int_T --> int_T), 0),
blanchet@35220
   446
   ((@{const_name ord_class.less}, int_T --> int_T --> bool_T), 2),
blanchet@35220
   447
   ((@{const_name ord_class.less_eq}, int_T --> int_T --> bool_T), 2)]
blanchet@35220
   448
val built_in_typed_nat_consts =
blanchet@35220
   449
  [((@{const_name zero_class.zero}, nat_T), 0),
blanchet@35220
   450
   ((@{const_name one_class.one}, nat_T), 0),
blanchet@35220
   451
   ((@{const_name plus_class.plus}, nat_T --> nat_T --> nat_T), 0),
blanchet@35220
   452
   ((@{const_name minus_class.minus}, nat_T --> nat_T --> nat_T), 0),
blanchet@35220
   453
   ((@{const_name times_class.times}, nat_T --> nat_T --> nat_T), 0),
blanchet@35220
   454
   ((@{const_name div_class.div}, nat_T --> nat_T --> nat_T), 0),
blanchet@35220
   455
   ((@{const_name ord_class.less}, nat_T --> nat_T --> bool_T), 2),
blanchet@35220
   456
   ((@{const_name ord_class.less_eq}, nat_T --> nat_T --> bool_T), 2),
blanchet@35220
   457
   ((@{const_name of_nat}, nat_T --> int_T), 0)]
blanchet@33192
   458
val built_in_set_consts =
blanchet@37476
   459
  [(@{const_name ord_class.less_eq}, 2)]
blanchet@33192
   460
blanchet@35190
   461
fun unarize_type @{typ "unsigned_bit word"} = nat_T
blanchet@35190
   462
  | unarize_type @{typ "signed_bit word"} = int_T
blanchet@35190
   463
  | unarize_type (Type (s, Ts as _ :: _)) = Type (s, map unarize_type Ts)
blanchet@35190
   464
  | unarize_type T = T
blanchet@41052
   465
fun unarize_unbox_etc_type (Type (@{type_name fun_box}, Ts)) =
blanchet@35665
   466
    unarize_unbox_etc_type (Type (@{type_name fun}, Ts))
blanchet@35665
   467
  | unarize_unbox_etc_type (Type (@{type_name pair_box}, Ts)) =
blanchet@38190
   468
    Type (@{type_name prod}, map unarize_unbox_etc_type Ts)
blanchet@35665
   469
  | unarize_unbox_etc_type @{typ "unsigned_bit word"} = nat_T
blanchet@35665
   470
  | unarize_unbox_etc_type @{typ "signed_bit word"} = int_T
blanchet@35665
   471
  | unarize_unbox_etc_type (Type (s, Ts as _ :: _)) =
blanchet@35665
   472
    Type (s, map unarize_unbox_etc_type Ts)
blanchet@35665
   473
  | unarize_unbox_etc_type T = T
blanchet@35280
   474
fun uniterize_type (Type (s, Ts as _ :: _)) = Type (s, map uniterize_type Ts)
blanchet@35280
   475
  | uniterize_type @{typ bisim_iterator} = nat_T
blanchet@35280
   476
  | uniterize_type T = T
blanchet@35665
   477
val uniterize_unarize_unbox_etc_type = uniterize_type o unarize_unbox_etc_type
blanchet@35280
   478
blanchet@35665
   479
fun string_for_type ctxt = Syntax.string_of_typ ctxt o unarize_unbox_etc_type
blanchet@38188
   480
fun pretty_for_type ctxt = Syntax.pretty_typ ctxt o unarize_unbox_etc_type
blanchet@33192
   481
blanchet@33192
   482
val prefix_name = Long_Name.qualify o Long_Name.base_name
blanchet@34121
   483
fun shortest_name s = List.last (space_explode "." s) handle List.Empty => ""
blanchet@33192
   484
val prefix_abs_vars = Term.map_abs_vars o prefix_name
blanchet@34121
   485
fun short_name s =
blanchet@33192
   486
  case space_explode name_sep s of
blanchet@33192
   487
    [_] => s |> String.isPrefix nitpick_prefix s ? unprefix nitpick_prefix
blanchet@34121
   488
  | ss => map shortest_name ss |> space_implode "_"
blanchet@34121
   489
fun shorten_names_in_type (Type (s, Ts)) =
blanchet@34121
   490
    Type (short_name s, map shorten_names_in_type Ts)
blanchet@34121
   491
  | shorten_names_in_type T = T
blanchet@34121
   492
val shorten_names_in_term =
blanchet@34121
   493
  map_aterms (fn Const (s, T) => Const (short_name s, T) | t => t)
blanchet@34121
   494
  #> map_types shorten_names_in_type
blanchet@33192
   495
blanchet@35665
   496
fun strict_type_match thy (T1, T2) =
blanchet@33192
   497
  (Sign.typ_match thy (T2, T1) Vartab.empty; true)
blanchet@33192
   498
  handle Type.TYPE_MATCH => false
blanchet@35665
   499
fun type_match thy = strict_type_match thy o pairself unarize_unbox_etc_type
blanchet@33192
   500
fun const_match thy ((s1, T1), (s2, T2)) =
blanchet@33192
   501
  s1 = s2 andalso type_match thy (T1, T2)
blanchet@33192
   502
fun term_match thy (Const x1, Const x2) = const_match thy (x1, x2)
blanchet@33192
   503
  | term_match thy (Free (s1, T1), Free (s2, T2)) =
blanchet@34121
   504
    const_match thy ((shortest_name s1, T1), (shortest_name s2, T2))
blanchet@35280
   505
  | term_match _ (t1, t2) = t1 aconv t2
blanchet@33192
   506
blanchet@35711
   507
fun frac_from_term_pair T t1 t2 =
blanchet@35711
   508
  case snd (HOLogic.dest_number t1) of
blanchet@35711
   509
    0 => HOLogic.mk_number T 0
blanchet@35711
   510
  | n1 => case snd (HOLogic.dest_number t2) of
blanchet@35711
   511
            1 => HOLogic.mk_number T n1
blanchet@35711
   512
          | n2 => Const (@{const_name divide}, T --> T --> T)
blanchet@35711
   513
                  $ HOLogic.mk_number T n1 $ HOLogic.mk_number T n2
blanchet@35711
   514
blanchet@33192
   515
fun is_TFree (TFree _) = true
blanchet@33192
   516
  | is_TFree _ = false
blanchet@35665
   517
fun is_fun_type (Type (@{type_name fun}, _)) = true
blanchet@33192
   518
  | is_fun_type _ = false
blanchet@35665
   519
fun is_set_type (Type (@{type_name fun}, [_, @{typ bool}])) = true
blanchet@33192
   520
  | is_set_type _ = false
blanchet@38190
   521
fun is_pair_type (Type (@{type_name prod}, _)) = true
blanchet@33192
   522
  | is_pair_type _ = false
blanchet@33192
   523
fun is_lfp_iterator_type (Type (s, _)) = String.isPrefix lfp_iterator_prefix s
blanchet@33192
   524
  | is_lfp_iterator_type _ = false
blanchet@33192
   525
fun is_gfp_iterator_type (Type (s, _)) = String.isPrefix gfp_iterator_prefix s
blanchet@33192
   526
  | is_gfp_iterator_type _ = false
blanchet@33192
   527
val is_fp_iterator_type = is_lfp_iterator_type orf is_gfp_iterator_type
blanchet@35280
   528
fun is_iterator_type T =
blanchet@35280
   529
  (T = @{typ bisim_iterator} orelse is_fp_iterator_type T)
blanchet@34121
   530
fun is_boolean_type T = (T = prop_T orelse T = bool_T)
blanchet@35220
   531
fun is_integer_type T = (T = nat_T orelse T = int_T)
blanchet@34124
   532
fun is_bit_type T = (T = @{typ unsigned_bit} orelse T = @{typ signed_bit})
blanchet@34124
   533
fun is_word_type (Type (@{type_name word}, _)) = true
blanchet@34124
   534
  | is_word_type _ = false
blanchet@35280
   535
val is_integer_like_type = is_iterator_type orf is_integer_type orf is_word_type
blanchet@33192
   536
val is_record_type = not o null o Record.dest_recTs
blanchet@38240
   537
fun is_frac_type ctxt (Type (s, [])) =
blanchet@38240
   538
    s |> AList.lookup (op =) (#frac_types (Data.get (Context.Proof ctxt)))
blanchet@38240
   539
      |> these |> null |> not
blanchet@33192
   540
  | is_frac_type _ _ = false
blanchet@38240
   541
fun is_number_type ctxt = is_integer_like_type orf is_frac_type ctxt
blanchet@33192
   542
blanchet@33192
   543
fun iterator_type_for_const gfp (s, T) =
blanchet@33192
   544
  Type ((if gfp then gfp_iterator_prefix else lfp_iterator_prefix) ^ s,
blanchet@33192
   545
        binder_types T)
blanchet@35718
   546
fun const_for_iterator_type (Type (s, Ts)) =
blanchet@35718
   547
    (strip_first_name_sep s |> snd, Ts ---> bool_T)
blanchet@33192
   548
  | const_for_iterator_type T =
blanchet@33232
   549
    raise TYPE ("Nitpick_HOL.const_for_iterator_type", [T], [])
blanchet@33192
   550
blanchet@33192
   551
fun strip_n_binders 0 T = ([], T)
blanchet@35665
   552
  | strip_n_binders n (Type (@{type_name fun}, [T1, T2])) =
blanchet@33192
   553
    strip_n_binders (n - 1) T2 |>> cons T1
blanchet@33192
   554
  | strip_n_binders n (Type (@{type_name fun_box}, Ts)) =
blanchet@35665
   555
    strip_n_binders n (Type (@{type_name fun}, Ts))
blanchet@33232
   556
  | strip_n_binders _ T = raise TYPE ("Nitpick_HOL.strip_n_binders", [T], [])
blanchet@33192
   557
val nth_range_type = snd oo strip_n_binders
blanchet@33192
   558
blanchet@38190
   559
fun num_factors_in_type (Type (@{type_name prod}, [T1, T2])) =
blanchet@33192
   560
    fold (Integer.add o num_factors_in_type) [T1, T2] 0
blanchet@33192
   561
  | num_factors_in_type _ = 1
blanchet@35665
   562
fun num_binder_types (Type (@{type_name fun}, [_, T2])) =
blanchet@35665
   563
    1 + num_binder_types T2
blanchet@33192
   564
  | num_binder_types _ = 0
blanchet@33192
   565
val curried_binder_types = maps HOLogic.flatten_tupleT o binder_types
blanchet@33192
   566
fun maybe_curried_binder_types T =
blanchet@33192
   567
  (if is_pair_type (body_type T) then binder_types else curried_binder_types) T
blanchet@33192
   568
blanchet@33192
   569
fun mk_flat_tuple _ [t] = t
blanchet@38190
   570
  | mk_flat_tuple (Type (@{type_name prod}, [T1, T2])) (t :: ts) =
blanchet@33192
   571
    HOLogic.pair_const T1 T2 $ t $ (mk_flat_tuple T2 ts)
blanchet@33232
   572
  | mk_flat_tuple T ts = raise TYPE ("Nitpick_HOL.mk_flat_tuple", [T], ts)
blanchet@33192
   573
fun dest_n_tuple 1 t = [t]
blanchet@33192
   574
  | dest_n_tuple n t = HOLogic.dest_prod t ||> dest_n_tuple (n - 1) |> op ::
blanchet@33192
   575
blanchet@35220
   576
type typedef_info =
blanchet@35220
   577
  {rep_type: typ, abs_type: typ, Rep_name: string, Abs_name: string,
blanchet@35220
   578
   set_def: thm option, prop_of_Rep: thm, set_name: string,
blanchet@35220
   579
   Abs_inverse: thm option, Rep_inverse: thm option}
blanchet@35220
   580
blanchet@37256
   581
fun typedef_info ctxt s =
blanchet@38240
   582
  if is_frac_type ctxt (Type (s, [])) then
blanchet@38240
   583
    SOME {abs_type = Type (s, []), rep_type = @{typ "int * int"},
blanchet@38240
   584
          Abs_name = @{const_name Abs_Frac}, Rep_name = @{const_name Rep_Frac},
blanchet@38240
   585
          set_def = NONE, prop_of_Rep = @{prop "Rep_Frac x \<in> Frac"}
blanchet@38240
   586
                          |> Logic.varify_global,
blanchet@38240
   587
          set_name = @{const_name Frac}, Abs_inverse = NONE, Rep_inverse = NONE}
blanchet@38240
   588
  else case Typedef.get_info ctxt s of
blanchet@38240
   589
    (* When several entries are returned, it shouldn't matter much which one
blanchet@38240
   590
       we take (according to Florian Haftmann). *)
blanchet@39315
   591
    (* The "Logic.varifyT_global" calls are a temporary hack because these
blanchet@39315
   592
       types's type variables sometimes clash with locally fixed type variables.
blanchet@39315
   593
       Remove these calls once "Typedef" is fully localized. *)
blanchet@38240
   594
    ({abs_type, rep_type, Abs_name, Rep_name, ...},
blanchet@38240
   595
     {set_def, Rep, Abs_inverse, Rep_inverse, ...}) :: _ =>
blanchet@39315
   596
    SOME {abs_type = Logic.varifyT_global abs_type,
blanchet@39315
   597
          rep_type = Logic.varifyT_global rep_type, Abs_name = Abs_name,
blanchet@38240
   598
          Rep_name = Rep_name, set_def = set_def, prop_of_Rep = prop_of Rep,
blanchet@38240
   599
          set_name = set_prefix ^ s, Abs_inverse = SOME Abs_inverse,
blanchet@38240
   600
          Rep_inverse = SOME Rep_inverse}
blanchet@38240
   601
  | _ => NONE
blanchet@35220
   602
blanchet@35220
   603
val is_typedef = is_some oo typedef_info
blanchet@35220
   604
val is_real_datatype = is_some oo Datatype.get_info
blanchet@35220
   605
fun is_standard_datatype thy = the oo triple_lookup (type_match thy)
blanchet@35220
   606
blanchet@34121
   607
(* FIXME: Use antiquotation for "code_numeral" below or detect "rep_datatype",
blanchet@34121
   608
   e.g., by adding a field to "Datatype_Aux.info". *)
blanchet@35220
   609
fun is_basic_datatype thy stds s =
blanchet@38190
   610
  member (op =) [@{type_name prod}, @{type_name bool}, @{type_name int},
blanchet@38190
   611
                 "Code_Numeral.code_numeral"] s orelse
blanchet@35220
   612
  (s = @{type_name nat} andalso is_standard_datatype thy stds nat_T)
blanchet@34121
   613
blanchet@38240
   614
(* TODO: use "Term_Subst.instantiateT" instead? *)
blanchet@33192
   615
fun instantiate_type thy T1 T1' T2 =
blanchet@33192
   616
  Same.commit (Envir.subst_type_same
blanchet@35311
   617
                   (Sign.typ_match thy (T1, T1') Vartab.empty)) T2
blanchet@33192
   618
  handle Type.TYPE_MATCH =>
blanchet@33232
   619
         raise TYPE ("Nitpick_HOL.instantiate_type", [T1, T1'], [])
blanchet@38240
   620
fun varify_and_instantiate_type ctxt T1 T1' T2 =
blanchet@38240
   621
  let val thy = ProofContext.theory_of ctxt in
blanchet@38240
   622
    instantiate_type thy (varify_type ctxt T1) T1' (varify_type ctxt T2)
blanchet@38240
   623
  end
blanchet@33192
   624
blanchet@38240
   625
fun repair_constr_type ctxt body_T' T =
blanchet@38240
   626
  varify_and_instantiate_type ctxt (body_type T) body_T' T
blanchet@33192
   627
blanchet@38240
   628
fun register_frac_type_generic frac_s ersaetze generic =
blanchet@33192
   629
  let
blanchet@38240
   630
    val {frac_types, codatatypes} = Data.get generic
blanchet@33192
   631
    val frac_types = AList.update (op =) (frac_s, ersaetze) frac_types
blanchet@38240
   632
  in Data.put {frac_types = frac_types, codatatypes = codatatypes} generic end
blanchet@38284
   633
(* TODO: Consider morphism. *)
blanchet@38284
   634
fun register_frac_type frac_s ersaetze (_ : morphism) =
blanchet@38284
   635
  register_frac_type_generic frac_s ersaetze
blanchet@38240
   636
val register_frac_type_global = Context.theory_map oo register_frac_type_generic
blanchet@33192
   637
blanchet@38240
   638
fun unregister_frac_type_generic frac_s = register_frac_type_generic frac_s []
blanchet@38284
   639
(* TODO: Consider morphism. *)
blanchet@38284
   640
fun unregister_frac_type frac_s (_ : morphism) =
blanchet@38284
   641
  unregister_frac_type_generic frac_s
blanchet@38240
   642
val unregister_frac_type_global =
blanchet@38240
   643
  Context.theory_map o unregister_frac_type_generic
blanchet@38240
   644
blanchet@38240
   645
fun register_codatatype_generic co_T case_name constr_xs generic =
blanchet@33192
   646
  let
blanchet@38240
   647
    val ctxt = Context.proof_of generic
blanchet@38240
   648
    val thy = Context.theory_of generic
blanchet@38240
   649
    val {frac_types, codatatypes} = Data.get generic
blanchet@38240
   650
    val constr_xs = map (apsnd (repair_constr_type ctxt co_T)) constr_xs
blanchet@33192
   651
    val (co_s, co_Ts) = dest_Type co_T
blanchet@33192
   652
    val _ =
blanchet@34936
   653
      if forall is_TFree co_Ts andalso not (has_duplicates (op =) co_Ts) andalso
blanchet@35665
   654
         co_s <> @{type_name fun} andalso
blanchet@35220
   655
         not (is_basic_datatype thy [(NONE, true)] co_s) then
blanchet@34121
   656
        ()
blanchet@34121
   657
      else
blanchet@38242
   658
        raise TYPE ("Nitpick_HOL.register_codatatype_generic", [co_T], [])
blanchet@33192
   659
    val codatatypes = AList.update (op =) (co_s, (case_name, constr_xs))
blanchet@33192
   660
                                   codatatypes
blanchet@38240
   661
  in Data.put {frac_types = frac_types, codatatypes = codatatypes} generic end
blanchet@38284
   662
(* TODO: Consider morphism. *)
blanchet@38284
   663
fun register_codatatype co_T case_name constr_xs (_ : morphism) =
blanchet@38284
   664
  register_codatatype_generic co_T case_name constr_xs
blanchet@38240
   665
val register_codatatype_global =
blanchet@38240
   666
  Context.theory_map ooo register_codatatype_generic
blanchet@33192
   667
blanchet@38240
   668
fun unregister_codatatype_generic co_T = register_codatatype_generic co_T "" []
blanchet@38284
   669
(* TODO: Consider morphism. *)
blanchet@38284
   670
fun unregister_codatatype co_T (_ : morphism) =
blanchet@38284
   671
  unregister_codatatype_generic co_T
blanchet@38240
   672
val unregister_codatatype_global =
blanchet@38240
   673
  Context.theory_map o unregister_codatatype_generic
blanchet@38240
   674
blanchet@38240
   675
fun is_codatatype ctxt (Type (s, _)) =
blanchet@38240
   676
    s |> AList.lookup (op =) (#codatatypes (Data.get (Context.Proof ctxt)))
blanchet@38240
   677
      |> Option.map snd |> these |> null |> not
blanchet@33192
   678
  | is_codatatype _ _ = false
blanchet@38215
   679
fun is_real_quot_type thy (Type (s, _)) =
blanchet@38215
   680
    is_some (Quotient_Info.quotdata_lookup_raw thy s)
blanchet@38215
   681
  | is_real_quot_type _ _ = false
blanchet@38240
   682
fun is_quot_type ctxt T =
blanchet@38240
   683
  let val thy = ProofContext.theory_of ctxt in
blanchet@38240
   684
    is_real_quot_type thy T andalso not (is_codatatype ctxt T)
blanchet@38240
   685
  end
blanchet@37256
   686
fun is_pure_typedef ctxt (T as Type (s, _)) =
blanchet@37256
   687
    let val thy = ProofContext.theory_of ctxt in
blanchet@37256
   688
      is_typedef ctxt s andalso
blanchet@38215
   689
      not (is_real_datatype thy s orelse is_real_quot_type thy T orelse
blanchet@38240
   690
           is_codatatype ctxt T orelse is_record_type T orelse
blanchet@37256
   691
           is_integer_like_type T)
blanchet@37256
   692
    end
blanchet@33192
   693
  | is_pure_typedef _ _ = false
blanchet@37256
   694
fun is_univ_typedef ctxt (Type (s, _)) =
blanchet@37256
   695
    (case typedef_info ctxt s of
blanchet@33192
   696
       SOME {set_def, prop_of_Rep, ...} =>
blanchet@35332
   697
       let
blanchet@35332
   698
         val t_opt =
blanchet@35332
   699
           case set_def of
blanchet@35332
   700
             SOME thm => try (snd o Logic.dest_equals o prop_of) thm
blanchet@35332
   701
           | NONE => try (snd o HOLogic.dest_mem o HOLogic.dest_Trueprop)
blanchet@35332
   702
                         prop_of_Rep
blanchet@35332
   703
       in
blanchet@35332
   704
         case t_opt of
blanchet@35332
   705
           SOME (Const (@{const_name top}, _)) => true
blanchet@35386
   706
           (* "Multiset.multiset" *)
blanchet@35332
   707
         | SOME (Const (@{const_name Collect}, _)
blanchet@35332
   708
                 $ Abs (_, _, Const (@{const_name finite}, _) $ _)) => true
blanchet@35386
   709
           (* "FinFun.finfun" *)
blanchet@35386
   710
         | SOME (Const (@{const_name Collect}, _) $ Abs (_, _,
blanchet@35386
   711
                     Const (@{const_name Ex}, _) $ Abs (_, _,
blanchet@35386
   712
                         Const (@{const_name finite}, _) $ _))) => true
blanchet@35332
   713
         | _ => false
blanchet@35332
   714
       end
blanchet@33192
   715
     | NONE => false)
blanchet@33192
   716
  | is_univ_typedef _ _ = false
blanchet@37256
   717
fun is_datatype ctxt stds (T as Type (s, _)) =
blanchet@37256
   718
    let val thy = ProofContext.theory_of ctxt in
blanchet@38240
   719
      (is_typedef ctxt s orelse is_codatatype ctxt T orelse
blanchet@38240
   720
       T = @{typ ind} orelse is_real_quot_type thy T) andalso
blanchet@38240
   721
      not (is_basic_datatype thy stds s)
blanchet@37256
   722
    end
blanchet@35220
   723
  | is_datatype _ _ _ = false
blanchet@33192
   724
blanchet@33192
   725
fun all_record_fields thy T =
blanchet@33192
   726
  let val (recs, more) = Record.get_extT_fields thy T in
blanchet@33192
   727
    recs @ more :: all_record_fields thy (snd more)
blanchet@33192
   728
  end
blanchet@33192
   729
  handle TYPE _ => []
blanchet@35280
   730
fun is_record_constr (s, T) =
blanchet@33192
   731
  String.isSuffix Record.extN s andalso
blanchet@33192
   732
  let val dataT = body_type T in
blanchet@33192
   733
    is_record_type dataT andalso
blanchet@33192
   734
    s = unsuffix Record.ext_typeN (fst (dest_Type dataT)) ^ Record.extN
blanchet@33192
   735
  end
blanchet@33192
   736
val num_record_fields = Integer.add 1 o length o fst oo Record.get_extT_fields
blanchet@33192
   737
fun no_of_record_field thy s T1 =
blanchet@34121
   738
  find_index (curry (op =) s o fst)
blanchet@34121
   739
             (Record.get_extT_fields thy T1 ||> single |> op @)
blanchet@35665
   740
fun is_record_get thy (s, Type (@{type_name fun}, [T1, _])) =
blanchet@34121
   741
    exists (curry (op =) s o fst) (all_record_fields thy T1)
blanchet@33192
   742
  | is_record_get _ _ = false
blanchet@33192
   743
fun is_record_update thy (s, T) =
blanchet@33192
   744
  String.isSuffix Record.updateN s andalso
blanchet@34121
   745
  exists (curry (op =) (unsuffix Record.updateN s) o fst)
blanchet@33192
   746
         (all_record_fields thy (body_type T))
blanchet@33192
   747
  handle TYPE _ => false
blanchet@37256
   748
fun is_abs_fun ctxt (s, Type (@{type_name fun}, [_, Type (s', _)])) =
blanchet@37256
   749
    (case typedef_info ctxt s' of
blanchet@33192
   750
       SOME {Abs_name, ...} => s = Abs_name
blanchet@33192
   751
     | NONE => false)
blanchet@33192
   752
  | is_abs_fun _ _ = false
blanchet@37256
   753
fun is_rep_fun ctxt (s, Type (@{type_name fun}, [Type (s', _), _])) =
blanchet@37256
   754
    (case typedef_info ctxt s' of
blanchet@33192
   755
       SOME {Rep_name, ...} => s = Rep_name
blanchet@33192
   756
     | NONE => false)
blanchet@33192
   757
  | is_rep_fun _ _ = false
blanchet@38215
   758
fun is_quot_abs_fun ctxt (x as (_, Type (@{type_name fun},
blanchet@38215
   759
                                         [_, abs_T as Type (s', _)]))) =
blanchet@38240
   760
    try (Quotient_Term.absrep_const_chk Quotient_Term.AbsF ctxt) s'
blanchet@38240
   761
    = SOME (Const x) andalso not (is_codatatype ctxt abs_T)
blanchet@34936
   762
  | is_quot_abs_fun _ _ = false
blanchet@38215
   763
fun is_quot_rep_fun ctxt (x as (_, Type (@{type_name fun},
blanchet@38215
   764
                                         [abs_T as Type (s', _), _]))) =
blanchet@38240
   765
    try (Quotient_Term.absrep_const_chk Quotient_Term.RepF ctxt) s'
blanchet@38240
   766
    = SOME (Const x) andalso not (is_codatatype ctxt abs_T)
blanchet@34936
   767
  | is_quot_rep_fun _ _ = false
blanchet@33192
   768
blanchet@37256
   769
fun mate_of_rep_fun ctxt (x as (_, Type (@{type_name fun},
blanchet@37256
   770
                                         [T1 as Type (s', _), T2]))) =
blanchet@37256
   771
    (case typedef_info ctxt s' of
blanchet@35665
   772
       SOME {Abs_name, ...} => (Abs_name, Type (@{type_name fun}, [T2, T1]))
blanchet@33232
   773
     | NONE => raise TERM ("Nitpick_HOL.mate_of_rep_fun", [Const x]))
blanchet@33232
   774
  | mate_of_rep_fun _ x = raise TERM ("Nitpick_HOL.mate_of_rep_fun", [Const x])
blanchet@35284
   775
fun rep_type_for_quot_type thy (T as Type (s, _)) =
blanchet@39345
   776
    let val {qtyp, rtyp, ...} = Quotient_Info.quotdata_lookup thy s in
blanchet@39345
   777
      instantiate_type thy qtyp T rtyp
blanchet@39345
   778
    end
blanchet@39345
   779
  | rep_type_for_quot_type _ T =
blanchet@39345
   780
    raise TYPE ("Nitpick_HOL.rep_type_for_quot_type", [T], [])
blanchet@35284
   781
fun equiv_relation_for_quot_type thy (Type (s, Ts)) =
blanchet@35284
   782
    let
blanchet@38243
   783
      val {qtyp, equiv_rel, equiv_thm, ...} =
blanchet@38243
   784
        Quotient_Info.quotdata_lookup thy s
blanchet@38243
   785
      val partial =
blanchet@38243
   786
        case prop_of equiv_thm of
blanchet@38243
   787
          @{const Trueprop} $ (Const (@{const_name equivp}, _) $ _) => false
blanchet@38243
   788
        | @{const Trueprop} $ (Const (@{const_name part_equivp}, _) $ _) => true
blanchet@38243
   789
        | _ => raise NOT_SUPPORTED "Ill-formed quotient type equivalence \
blanchet@38243
   790
                                   \relation theorem"
blanchet@35284
   791
      val Ts' = qtyp |> dest_Type |> snd
blanchet@38243
   792
    in (subst_atomic_types (Ts' ~~ Ts) equiv_rel, partial) end
blanchet@34936
   793
  | equiv_relation_for_quot_type _ T =
blanchet@34936
   794
    raise TYPE ("Nitpick_HOL.equiv_relation_for_quot_type", [T], [])
blanchet@33192
   795
blanchet@38240
   796
fun is_coconstr ctxt (s, T) =
blanchet@38240
   797
  case body_type T of
blanchet@38240
   798
    co_T as Type (co_s, _) =>
blanchet@38240
   799
    let val {codatatypes, ...} = Data.get (Context.Proof ctxt) in
blanchet@38240
   800
      exists (fn (s', T') => s = s' andalso repair_constr_type ctxt co_T T' = T)
blanchet@38240
   801
             (AList.lookup (op =) codatatypes co_s |> Option.map snd |> these)
blanchet@38240
   802
    end
blanchet@38240
   803
  | _ => false
blanchet@37256
   804
fun is_constr_like ctxt (s, T) =
blanchet@41052
   805
  member (op =) [@{const_name FunBox}, @{const_name PairBox},
blanchet@41052
   806
                 @{const_name Quot}, @{const_name Zero_Rep},
blanchet@41052
   807
                 @{const_name Suc_Rep}] s orelse
blanchet@37256
   808
  let
blanchet@37256
   809
    val thy = ProofContext.theory_of ctxt
blanchet@37256
   810
    val (x as (_, T)) = (s, unarize_unbox_etc_type T)
blanchet@37256
   811
  in
blanchet@37260
   812
    is_real_constr thy x orelse is_record_constr x orelse
blanchet@37256
   813
    (is_abs_fun ctxt x andalso is_pure_typedef ctxt (range_type T)) orelse
blanchet@38240
   814
    is_coconstr ctxt x
blanchet@33192
   815
  end
blanchet@37256
   816
fun is_stale_constr ctxt (x as (_, T)) =
blanchet@38240
   817
  is_codatatype ctxt (body_type T) andalso is_constr_like ctxt x andalso
blanchet@38240
   818
  not (is_coconstr ctxt x)
blanchet@37256
   819
fun is_constr ctxt stds (x as (_, T)) =
blanchet@37256
   820
  let val thy = ProofContext.theory_of ctxt in
blanchet@37256
   821
    is_constr_like ctxt x andalso
blanchet@37256
   822
    not (is_basic_datatype thy stds
blanchet@35220
   823
                         (fst (dest_Type (unarize_type (body_type T))))) andalso
blanchet@37256
   824
    not (is_stale_constr ctxt x)
blanchet@37256
   825
  end
blanchet@33192
   826
val is_sel = String.isPrefix discr_prefix orf String.isPrefix sel_prefix
blanchet@33192
   827
val is_sel_like_and_no_discr =
blanchet@35665
   828
  String.isPrefix sel_prefix orf
blanchet@35665
   829
  (member (op =) [@{const_name fst}, @{const_name snd}])
blanchet@33192
   830
blanchet@33192
   831
fun in_fun_lhs_for InConstr = InSel
blanchet@33192
   832
  | in_fun_lhs_for _ = InFunLHS
blanchet@33192
   833
fun in_fun_rhs_for InConstr = InConstr
blanchet@33192
   834
  | in_fun_rhs_for InSel = InSel
blanchet@33192
   835
  | in_fun_rhs_for InFunRHS1 = InFunRHS2
blanchet@33192
   836
  | in_fun_rhs_for _ = InFunRHS1
blanchet@33192
   837
blanchet@35070
   838
fun is_boxing_worth_it (hol_ctxt : hol_context) boxy T =
blanchet@33192
   839
  case T of
blanchet@35665
   840
    Type (@{type_name fun}, _) =>
blanchet@34936
   841
    (boxy = InPair orelse boxy = InFunLHS) andalso
blanchet@34936
   842
    not (is_boolean_type (body_type T))
blanchet@38190
   843
  | Type (@{type_name prod}, Ts) =>
blanchet@34936
   844
    boxy = InPair orelse boxy = InFunRHS1 orelse boxy = InFunRHS2 orelse
blanchet@34936
   845
    ((boxy = InExpr orelse boxy = InFunLHS) andalso
blanchet@35070
   846
     exists (is_boxing_worth_it hol_ctxt InPair)
blanchet@35070
   847
            (map (box_type hol_ctxt InPair) Ts))
blanchet@33192
   848
  | _ => false
blanchet@35280
   849
and should_box_type (hol_ctxt as {thy, boxes, ...}) boxy z =
blanchet@33192
   850
  case triple_lookup (type_match thy) boxes (Type z) of
blanchet@33192
   851
    SOME (SOME box_me) => box_me
blanchet@35070
   852
  | _ => is_boxing_worth_it hol_ctxt boxy (Type z)
blanchet@35070
   853
and box_type hol_ctxt boxy T =
blanchet@33192
   854
  case T of
blanchet@35665
   855
    Type (z as (@{type_name fun}, [T1, T2])) =>
blanchet@34936
   856
    if boxy <> InConstr andalso boxy <> InSel andalso
blanchet@35070
   857
       should_box_type hol_ctxt boxy z then
blanchet@33192
   858
      Type (@{type_name fun_box},
blanchet@35070
   859
            [box_type hol_ctxt InFunLHS T1, box_type hol_ctxt InFunRHS1 T2])
blanchet@33192
   860
    else
blanchet@35070
   861
      box_type hol_ctxt (in_fun_lhs_for boxy) T1
blanchet@35070
   862
      --> box_type hol_ctxt (in_fun_rhs_for boxy) T2
blanchet@38190
   863
  | Type (z as (@{type_name prod}, Ts)) =>
blanchet@34982
   864
    if boxy <> InConstr andalso boxy <> InSel
blanchet@35070
   865
       andalso should_box_type hol_ctxt boxy z then
blanchet@35070
   866
      Type (@{type_name pair_box}, map (box_type hol_ctxt InSel) Ts)
blanchet@33192
   867
    else
blanchet@38190
   868
      Type (@{type_name prod},
blanchet@35665
   869
            map (box_type hol_ctxt
blanchet@34121
   870
                          (if boxy = InConstr orelse boxy = InSel then boxy
blanchet@34121
   871
                           else InPair)) Ts)
blanchet@33192
   872
  | _ => T
blanchet@33192
   873
blanchet@35190
   874
fun binarize_nat_and_int_in_type @{typ nat} = @{typ "unsigned_bit word"}
blanchet@35190
   875
  | binarize_nat_and_int_in_type @{typ int} = @{typ "signed_bit word"}
blanchet@35190
   876
  | binarize_nat_and_int_in_type (Type (s, Ts)) =
blanchet@35190
   877
    Type (s, map binarize_nat_and_int_in_type Ts)
blanchet@35190
   878
  | binarize_nat_and_int_in_type T = T
blanchet@35190
   879
val binarize_nat_and_int_in_term = map_types binarize_nat_and_int_in_type
blanchet@35190
   880
blanchet@33192
   881
fun discr_for_constr (s, T) = (discr_prefix ^ s, body_type T --> bool_T)
blanchet@33192
   882
blanchet@33192
   883
fun num_sels_for_constr_type T = length (maybe_curried_binder_types T)
blanchet@33192
   884
fun nth_sel_name_for_constr_name s n =
blanchet@33192
   885
  if s = @{const_name Pair} then
blanchet@33192
   886
    if n = 0 then @{const_name fst} else @{const_name snd}
blanchet@33192
   887
  else
blanchet@33192
   888
    sel_prefix_for n ^ s
blanchet@33192
   889
fun nth_sel_for_constr x ~1 = discr_for_constr x
blanchet@33192
   890
  | nth_sel_for_constr (s, T) n =
blanchet@33192
   891
    (nth_sel_name_for_constr_name s n,
blanchet@33192
   892
     body_type T --> nth (maybe_curried_binder_types T) n)
blanchet@35190
   893
fun binarized_and_boxed_nth_sel_for_constr hol_ctxt binarize =
blanchet@35190
   894
  apsnd ((binarize ? binarize_nat_and_int_in_type) o box_type hol_ctxt InSel)
blanchet@35190
   895
  oo nth_sel_for_constr
blanchet@33192
   896
blanchet@33192
   897
fun sel_no_from_name s =
blanchet@33192
   898
  if String.isPrefix discr_prefix s then
blanchet@33192
   899
    ~1
blanchet@33192
   900
  else if String.isPrefix sel_prefix s then
blanchet@33192
   901
    s |> unprefix sel_prefix |> Int.fromString |> the
blanchet@33192
   902
  else if s = @{const_name snd} then
blanchet@33192
   903
    1
blanchet@33192
   904
  else
blanchet@33192
   905
    0
blanchet@33192
   906
blanchet@35078
   907
val close_form =
blanchet@35078
   908
  let
blanchet@35078
   909
    fun close_up zs zs' =
blanchet@35078
   910
      fold (fn (z as ((s, _), T)) => fn t' =>
blanchet@35078
   911
               Term.all T $ Abs (s, T, abstract_over (Var z, t')))
blanchet@35078
   912
           (take (length zs' - length zs) zs')
blanchet@35078
   913
    fun aux zs (@{const "==>"} $ t1 $ t2) =
blanchet@35078
   914
        let val zs' = Term.add_vars t1 zs in
blanchet@35078
   915
          close_up zs zs' (Logic.mk_implies (t1, aux zs' t2))
blanchet@35078
   916
        end
blanchet@35078
   917
      | aux zs t = close_up zs (Term.add_vars t zs) t
blanchet@35078
   918
  in aux [] end
blanchet@35078
   919
blanchet@33192
   920
fun distinctness_formula T =
blanchet@33192
   921
  all_distinct_unordered_pairs_of
blanchet@33192
   922
  #> map (fn (t1, t2) => @{const Not} $ (HOLogic.eq_const T $ t1 $ t2))
blanchet@33192
   923
  #> List.foldr (s_conj o swap) @{const True}
blanchet@33192
   924
blanchet@35220
   925
fun zero_const T = Const (@{const_name zero_class.zero}, T)
blanchet@33192
   926
fun suc_const T = Const (@{const_name Suc}, T --> T)
blanchet@33192
   927
blanchet@37256
   928
fun uncached_datatype_constrs ({thy, ctxt, stds, ...} : hol_context)
blanchet@35220
   929
                              (T as Type (s, Ts)) =
blanchet@38240
   930
    (case AList.lookup (op =) (#codatatypes (Data.get (Context.Proof ctxt)))
blanchet@38240
   931
                       s of
blanchet@38240
   932
       SOME (_, xs' as (_ :: _)) => map (apsnd (repair_constr_type ctxt T)) xs'
blanchet@33581
   933
     | _ =>
blanchet@37256
   934
       if is_datatype ctxt stds T then
blanchet@33581
   935
         case Datatype.get_info thy s of
blanchet@33581
   936
           SOME {index, descr, ...} =>
blanchet@33581
   937
           let
blanchet@33581
   938
             val (_, dtyps, constrs) = AList.lookup (op =) descr index |> the
blanchet@33581
   939
           in
blanchet@37260
   940
             map (apsnd (fn Us =>
blanchet@37260
   941
                            map (typ_of_dtyp descr (dtyps ~~ Ts)) Us ---> T))
blanchet@37260
   942
                 constrs
blanchet@33581
   943
           end
blanchet@33581
   944
         | NONE =>
blanchet@33581
   945
           if is_record_type T then
blanchet@33581
   946
             let
blanchet@33581
   947
               val s' = unsuffix Record.ext_typeN s ^ Record.extN
blanchet@33581
   948
               val T' = (Record.get_extT_fields thy T
blanchet@33581
   949
                        |> apsnd single |> uncurry append |> map snd) ---> T
blanchet@33581
   950
             in [(s', T')] end
blanchet@38215
   951
           else if is_real_quot_type thy T then
blanchet@34936
   952
             [(@{const_name Quot}, rep_type_for_quot_type thy T --> T)]
blanchet@37256
   953
           else case typedef_info ctxt s of
blanchet@33581
   954
             SOME {abs_type, rep_type, Abs_name, ...} =>
blanchet@35311
   955
             [(Abs_name,
blanchet@38240
   956
               varify_and_instantiate_type ctxt abs_type T rep_type --> T)]
blanchet@33581
   957
           | NONE =>
blanchet@33581
   958
             if T = @{typ ind} then
blanchet@33581
   959
               [dest_Const @{const Zero_Rep}, dest_Const @{const Suc_Rep}]
blanchet@33581
   960
             else
blanchet@33581
   961
               []
blanchet@33581
   962
       else
blanchet@33581
   963
         [])
blanchet@33580
   964
  | uncached_datatype_constrs _ _ = []
blanchet@35220
   965
fun datatype_constrs (hol_ctxt as {constr_cache, ...}) T =
blanchet@33580
   966
  case AList.lookup (op =) (!constr_cache) T of
blanchet@33580
   967
    SOME xs => xs
blanchet@33580
   968
  | NONE =>
blanchet@35220
   969
    let val xs = uncached_datatype_constrs hol_ctxt T in
blanchet@33580
   970
      (Unsynchronized.change constr_cache (cons (T, xs)); xs)
blanchet@33580
   971
    end
blanchet@35190
   972
fun binarized_and_boxed_datatype_constrs hol_ctxt binarize =
blanchet@35190
   973
  map (apsnd ((binarize ? binarize_nat_and_int_in_type)
blanchet@35190
   974
              o box_type hol_ctxt InConstr)) o datatype_constrs hol_ctxt
blanchet@33192
   975
val num_datatype_constrs = length oo datatype_constrs
blanchet@33192
   976
blanchet@33192
   977
fun constr_name_for_sel_like @{const_name fst} = @{const_name Pair}
blanchet@33192
   978
  | constr_name_for_sel_like @{const_name snd} = @{const_name Pair}
blanchet@33192
   979
  | constr_name_for_sel_like s' = original_name s'
blanchet@35190
   980
fun binarized_and_boxed_constr_for_sel hol_ctxt binarize (s', T') =
blanchet@33192
   981
  let val s = constr_name_for_sel_like s' in
blanchet@35190
   982
    AList.lookup (op =)
blanchet@35190
   983
        (binarized_and_boxed_datatype_constrs hol_ctxt binarize (domain_type T'))
blanchet@35190
   984
        s
blanchet@33192
   985
    |> the |> pair s
blanchet@33192
   986
  end
blanchet@34982
   987
blanchet@35070
   988
fun discr_term_for_constr hol_ctxt (x as (s, T)) =
blanchet@33192
   989
  let val dataT = body_type T in
blanchet@33192
   990
    if s = @{const_name Suc} then
blanchet@33192
   991
      Abs (Name.uu, dataT,
blanchet@33192
   992
           @{const Not} $ HOLogic.mk_eq (zero_const dataT, Bound 0))
blanchet@35070
   993
    else if num_datatype_constrs hol_ctxt dataT >= 2 then
blanchet@33192
   994
      Const (discr_for_constr x)
blanchet@33192
   995
    else
blanchet@33192
   996
      Abs (Name.uu, dataT, @{const True})
blanchet@33192
   997
  end
blanchet@37256
   998
fun discriminate_value (hol_ctxt as {ctxt, ...}) x t =
blanchet@35280
   999
  case head_of t of
blanchet@35280
  1000
    Const x' =>
blanchet@33192
  1001
    if x = x' then @{const True}
blanchet@37256
  1002
    else if is_constr_like ctxt x' then @{const False}
blanchet@37476
  1003
    else s_betapply [] (discr_term_for_constr hol_ctxt x, t)
blanchet@37476
  1004
  | _ => s_betapply [] (discr_term_for_constr hol_ctxt x, t)
blanchet@33192
  1005
blanchet@35220
  1006
fun nth_arg_sel_term_for_constr thy stds (x as (s, T)) n =
blanchet@33192
  1007
  let val (arg_Ts, dataT) = strip_type T in
blanchet@35220
  1008
    if dataT = nat_T andalso is_standard_datatype thy stds nat_T then
blanchet@35220
  1009
      @{term "%n::nat. n - 1"}
blanchet@33192
  1010
    else if is_pair_type dataT then
blanchet@33192
  1011
      Const (nth_sel_for_constr x n)
blanchet@33192
  1012
    else
blanchet@33192
  1013
      let
blanchet@38190
  1014
        fun aux m (Type (@{type_name prod}, [T1, T2])) =
blanchet@33192
  1015
            let
blanchet@33192
  1016
              val (m, t1) = aux m T1
blanchet@33192
  1017
              val (m, t2) = aux m T2
blanchet@33192
  1018
            in (m, HOLogic.mk_prod (t1, t2)) end
blanchet@33192
  1019
          | aux m T =
blanchet@33192
  1020
            (m + 1, Const (nth_sel_name_for_constr_name s m, dataT --> T)
blanchet@33192
  1021
                    $ Bound 0)
blanchet@33192
  1022
        val m = fold (Integer.add o num_factors_in_type)
blanchet@33192
  1023
                     (List.take (arg_Ts, n)) 0
blanchet@33192
  1024
      in Abs ("x", dataT, aux m (nth arg_Ts n) |> snd) end
blanchet@33192
  1025
  end
blanchet@37256
  1026
fun select_nth_constr_arg ctxt stds x t n res_T =
blanchet@37256
  1027
  let val thy = ProofContext.theory_of ctxt in
blanchet@37256
  1028
    (case strip_comb t of
blanchet@37256
  1029
       (Const x', args) =>
blanchet@37256
  1030
       if x = x' then nth args n
blanchet@37256
  1031
       else if is_constr_like ctxt x' then Const (@{const_name unknown}, res_T)
blanchet@37256
  1032
       else raise SAME ()
blanchet@37256
  1033
     | _ => raise SAME())
blanchet@37476
  1034
    handle SAME () =>
blanchet@37476
  1035
           s_betapply [] (nth_arg_sel_term_for_constr thy stds x n, t)
blanchet@37256
  1036
  end
blanchet@33192
  1037
blanchet@35220
  1038
fun construct_value _ _ x [] = Const x
blanchet@37256
  1039
  | construct_value ctxt stds (x as (s, _)) args =
blanchet@33192
  1040
    let val args = map Envir.eta_contract args in
blanchet@33192
  1041
      case hd args of
blanchet@35280
  1042
        Const (s', _) $ t =>
blanchet@34936
  1043
        if is_sel_like_and_no_discr s' andalso
blanchet@34936
  1044
           constr_name_for_sel_like s' = s andalso
blanchet@35220
  1045
           forall (fn (n, t') =>
blanchet@37256
  1046
                      select_nth_constr_arg ctxt stds x t n dummyT = t')
blanchet@34936
  1047
                  (index_seq 0 (length args) ~~ args) then
blanchet@33192
  1048
          t
blanchet@33192
  1049
        else
blanchet@33192
  1050
          list_comb (Const x, args)
blanchet@33192
  1051
      | _ => list_comb (Const x, args)
blanchet@33192
  1052
    end
blanchet@33192
  1053
blanchet@37256
  1054
fun constr_expand (hol_ctxt as {ctxt, stds, ...}) T t =
blanchet@35665
  1055
  (case head_of t of
blanchet@37256
  1056
     Const x => if is_constr_like ctxt x then t else raise SAME ()
blanchet@35665
  1057
   | _ => raise SAME ())
blanchet@35665
  1058
  handle SAME () =>
blanchet@35665
  1059
         let
blanchet@35665
  1060
           val x' as (_, T') =
blanchet@35665
  1061
             if is_pair_type T then
blanchet@35665
  1062
               let val (T1, T2) = HOLogic.dest_prodT T in
blanchet@35665
  1063
                 (@{const_name Pair}, T1 --> T2 --> T)
blanchet@35665
  1064
               end
blanchet@35665
  1065
             else
blanchet@35665
  1066
               datatype_constrs hol_ctxt T |> hd
blanchet@35665
  1067
           val arg_Ts = binder_types T'
blanchet@35665
  1068
         in
blanchet@37256
  1069
           list_comb (Const x', map2 (select_nth_constr_arg ctxt stds x' t)
blanchet@35665
  1070
                                     (index_seq 0 (length arg_Ts)) arg_Ts)
blanchet@35665
  1071
         end
blanchet@35665
  1072
blanchet@35665
  1073
fun coerce_bound_no f j t =
blanchet@35665
  1074
  case t of
blanchet@35665
  1075
    t1 $ t2 => coerce_bound_no f j t1 $ coerce_bound_no f j t2
blanchet@35665
  1076
  | Abs (s, T, t') => Abs (s, T, coerce_bound_no f (j + 1) t')
blanchet@35665
  1077
  | Bound j' => if j' = j then f t else t
blanchet@35665
  1078
  | _ => t
blanchet@35665
  1079
fun coerce_bound_0_in_term hol_ctxt new_T old_T =
blanchet@35665
  1080
  old_T <> new_T ? coerce_bound_no (coerce_term hol_ctxt [new_T] old_T new_T) 0
blanchet@39345
  1081
and coerce_term (hol_ctxt as {ctxt, stds, ...}) Ts new_T old_T t =
blanchet@35665
  1082
  if old_T = new_T then
blanchet@35665
  1083
    t
blanchet@35665
  1084
  else
blanchet@35665
  1085
    case (new_T, old_T) of
blanchet@35665
  1086
      (Type (new_s, new_Ts as [new_T1, new_T2]),
blanchet@35665
  1087
       Type (@{type_name fun}, [old_T1, old_T2])) =>
blanchet@35665
  1088
      (case eta_expand Ts t 1 of
blanchet@35665
  1089
         Abs (s, _, t') =>
blanchet@35665
  1090
         Abs (s, new_T1,
blanchet@35665
  1091
              t' |> coerce_bound_0_in_term hol_ctxt new_T1 old_T1
blanchet@35665
  1092
                 |> coerce_term hol_ctxt (new_T1 :: Ts) new_T2 old_T2)
blanchet@35665
  1093
         |> Envir.eta_contract
blanchet@35665
  1094
         |> new_s <> @{type_name fun}
blanchet@37256
  1095
            ? construct_value ctxt stds
blanchet@41052
  1096
                  (@{const_name FunBox},
blanchet@35665
  1097
                   Type (@{type_name fun}, new_Ts) --> new_T)
blanchet@35665
  1098
              o single
blanchet@35665
  1099
       | t' => raise TERM ("Nitpick_HOL.coerce_term", [t']))
blanchet@35665
  1100
    | (Type (new_s, new_Ts as [new_T1, new_T2]),
blanchet@35665
  1101
       Type (old_s, old_Ts as [old_T1, old_T2])) =>
blanchet@41052
  1102
      if old_s = @{type_name fun_box} orelse
blanchet@38190
  1103
         old_s = @{type_name pair_box} orelse old_s = @{type_name prod} then
blanchet@35665
  1104
        case constr_expand hol_ctxt old_T t of
blanchet@35665
  1105
          Const (old_s, _) $ t1 =>
blanchet@35665
  1106
          if new_s = @{type_name fun} then
blanchet@35665
  1107
            coerce_term hol_ctxt Ts new_T (Type (@{type_name fun}, old_Ts)) t1
blanchet@35665
  1108
          else
blanchet@37256
  1109
            construct_value ctxt stds
blanchet@35665
  1110
                (old_s, Type (@{type_name fun}, new_Ts) --> new_T)
blanchet@35665
  1111
                [coerce_term hol_ctxt Ts (Type (@{type_name fun}, new_Ts))
blanchet@35665
  1112
                             (Type (@{type_name fun}, old_Ts)) t1]
blanchet@35665
  1113
        | Const _ $ t1 $ t2 =>
blanchet@37256
  1114
          construct_value ctxt stds
blanchet@38190
  1115
              (if new_s = @{type_name prod} then @{const_name Pair}
blanchet@35665
  1116
               else @{const_name PairBox}, new_Ts ---> new_T)
blanchet@35665
  1117
              (map3 (coerce_term hol_ctxt Ts) [new_T1, new_T2] [old_T1, old_T2]
blanchet@35665
  1118
                    [t1, t2])
blanchet@35665
  1119
        | t' => raise TERM ("Nitpick_HOL.coerce_term", [t'])
blanchet@35665
  1120
      else
blanchet@35665
  1121
        raise TYPE ("Nitpick_HOL.coerce_term", [new_T, old_T], [t])
blanchet@35665
  1122
    | _ => raise TYPE ("Nitpick_HOL.coerce_term", [new_T, old_T], [t])
blanchet@35665
  1123
blanchet@35665
  1124
fun card_of_type assigns (Type (@{type_name fun}, [T1, T2])) =
blanchet@34123
  1125
    reasonable_power (card_of_type assigns T2) (card_of_type assigns T1)
blanchet@38190
  1126
  | card_of_type assigns (Type (@{type_name prod}, [T1, T2])) =
blanchet@34123
  1127
    card_of_type assigns T1 * card_of_type assigns T2
blanchet@33192
  1128
  | card_of_type _ (Type (@{type_name itself}, _)) = 1
blanchet@33192
  1129
  | card_of_type _ @{typ prop} = 2
blanchet@33192
  1130
  | card_of_type _ @{typ bool} = 2
blanchet@34123
  1131
  | card_of_type assigns T =
blanchet@34123
  1132
    case AList.lookup (op =) assigns T of
blanchet@33192
  1133
      SOME k => k
blanchet@33192
  1134
    | NONE => if T = @{typ bisim_iterator} then 0
blanchet@33232
  1135
              else raise TYPE ("Nitpick_HOL.card_of_type", [T], [])
blanchet@35665
  1136
fun bounded_card_of_type max default_card assigns
blanchet@35665
  1137
                         (Type (@{type_name fun}, [T1, T2])) =
blanchet@33192
  1138
    let
blanchet@34123
  1139
      val k1 = bounded_card_of_type max default_card assigns T1
blanchet@34123
  1140
      val k2 = bounded_card_of_type max default_card assigns T2
blanchet@33192
  1141
    in
blanchet@33192
  1142
      if k1 = max orelse k2 = max then max
blanchet@33192
  1143
      else Int.min (max, reasonable_power k2 k1)
blanchet@33192
  1144
    end
blanchet@35665
  1145
  | bounded_card_of_type max default_card assigns
blanchet@38190
  1146
                         (Type (@{type_name prod}, [T1, T2])) =
blanchet@33192
  1147
    let
blanchet@34123
  1148
      val k1 = bounded_card_of_type max default_card assigns T1
blanchet@34123
  1149
      val k2 = bounded_card_of_type max default_card assigns T2
blanchet@33192
  1150
    in if k1 = max orelse k2 = max then max else Int.min (max, k1 * k2) end
blanchet@34123
  1151
  | bounded_card_of_type max default_card assigns T =
blanchet@33192
  1152
    Int.min (max, if default_card = ~1 then
blanchet@34123
  1153
                    card_of_type assigns T
blanchet@33192
  1154
                  else
blanchet@34123
  1155
                    card_of_type assigns T
blanchet@33232
  1156
                    handle TYPE ("Nitpick_HOL.card_of_type", _, _) =>
blanchet@33192
  1157
                           default_card)
blanchet@35385
  1158
fun bounded_exact_card_of_type hol_ctxt finitizable_dataTs max default_card
blanchet@35385
  1159
                               assigns T =
blanchet@33192
  1160
  let
blanchet@33192
  1161
    fun aux avoid T =
blanchet@34121
  1162
      (if member (op =) avoid T then
blanchet@33192
  1163
         0
blanchet@35385
  1164
       else if member (op =) finitizable_dataTs T then
blanchet@35385
  1165
         raise SAME ()
blanchet@33192
  1166
       else case T of
blanchet@35665
  1167
         Type (@{type_name fun}, [T1, T2]) =>
blanchet@33192
  1168
         let
blanchet@33192
  1169
           val k1 = aux avoid T1
blanchet@33192
  1170
           val k2 = aux avoid T2
blanchet@33192
  1171
         in
blanchet@33192
  1172
           if k1 = 0 orelse k2 = 0 then 0
blanchet@33192
  1173
           else if k1 >= max orelse k2 >= max then max
blanchet@33192
  1174
           else Int.min (max, reasonable_power k2 k1)
blanchet@33192
  1175
         end
blanchet@38190
  1176
       | Type (@{type_name prod}, [T1, T2]) =>
blanchet@33192
  1177
         let
blanchet@33192
  1178
           val k1 = aux avoid T1
blanchet@33192
  1179
           val k2 = aux avoid T2
blanchet@33192
  1180
         in
blanchet@33192
  1181
           if k1 = 0 orelse k2 = 0 then 0
blanchet@33192
  1182
           else if k1 >= max orelse k2 >= max then max
blanchet@33192
  1183
           else Int.min (max, k1 * k2)
blanchet@33192
  1184
         end
blanchet@33192
  1185
       | Type (@{type_name itself}, _) => 1
blanchet@33192
  1186
       | @{typ prop} => 2
blanchet@33192
  1187
       | @{typ bool} => 2
blanchet@33192
  1188
       | Type _ =>
blanchet@35070
  1189
         (case datatype_constrs hol_ctxt T of
blanchet@34126
  1190
            [] => if is_integer_type T orelse is_bit_type T then 0
blanchet@34126
  1191
                  else raise SAME ()
blanchet@33192
  1192
          | constrs =>
blanchet@33192
  1193
            let
blanchet@33192
  1194
              val constr_cards =
blanchet@35280
  1195
                map (Integer.prod o map (aux (T :: avoid)) o binder_types o snd)
blanchet@35280
  1196
                    constrs
blanchet@33192
  1197
            in
blanchet@34121
  1198
              if exists (curry (op =) 0) constr_cards then 0
blanchet@33192
  1199
              else Integer.sum constr_cards
blanchet@33192
  1200
            end)
blanchet@33192
  1201
       | _ => raise SAME ())
blanchet@34123
  1202
      handle SAME () =>
blanchet@34123
  1203
             AList.lookup (op =) assigns T |> the_default default_card
blanchet@33192
  1204
  in Int.min (max, aux [] T) end
blanchet@33192
  1205
blanchet@35665
  1206
val small_type_max_card = 5
blanchet@35665
  1207
blanchet@35384
  1208
fun is_finite_type hol_ctxt T =
blanchet@35665
  1209
  bounded_exact_card_of_type hol_ctxt [] 1 2 [] T > 0
blanchet@35665
  1210
fun is_small_finite_type hol_ctxt T =
blanchet@35665
  1211
  let val n = bounded_exact_card_of_type hol_ctxt [] 1 2 [] T in
blanchet@35665
  1212
    n > 0 andalso n <= small_type_max_card
blanchet@35665
  1213
  end
blanchet@33192
  1214
blanchet@33192
  1215
fun is_ground_term (t1 $ t2) = is_ground_term t1 andalso is_ground_term t2
blanchet@33192
  1216
  | is_ground_term (Const _) = true
blanchet@33192
  1217
  | is_ground_term _ = false
blanchet@33192
  1218
blanchet@36062
  1219
fun hashw_term (t1 $ t2) = hashw (hashw_term t1, hashw_term t2)
blanchet@36062
  1220
  | hashw_term (Const (s, _)) = hashw_string (s, 0w0)
blanchet@33192
  1221
  | hashw_term _ = 0w0
blanchet@33192
  1222
val hash_term = Word.toInt o hashw_term
blanchet@33192
  1223
blanchet@33192
  1224
fun special_bounds ts =
wenzelm@35408
  1225
  fold Term.add_vars ts [] |> sort (Term_Ord.fast_indexname_ord o pairself fst)
blanchet@33192
  1226
blanchet@38190
  1227
(* FIXME: detect "rep_datatype"? *)
blanchet@38240
  1228
fun is_funky_typedef_name ctxt s =
blanchet@38190
  1229
  member (op =) [@{type_name unit}, @{type_name prod},
blanchet@38190
  1230
                 @{type_name Sum_Type.sum}, @{type_name int}] s orelse
blanchet@38240
  1231
  is_frac_type ctxt (Type (s, []))
blanchet@38240
  1232
fun is_funky_typedef ctxt (Type (s, _)) = is_funky_typedef_name ctxt s
blanchet@33571
  1233
  | is_funky_typedef _ _ = false
blanchet@33192
  1234
fun is_arity_type_axiom (Const (@{const_name HOL.type_class}, _)
blanchet@33192
  1235
                         $ Const (@{const_name TYPE}, _)) = true
blanchet@33192
  1236
  | is_arity_type_axiom _ = false
blanchet@37256
  1237
fun is_typedef_axiom ctxt boring (@{const "==>"} $ _ $ t2) =
blanchet@37256
  1238
    is_typedef_axiom ctxt boring t2
blanchet@37256
  1239
  | is_typedef_axiom ctxt boring
blanchet@33192
  1240
        (@{const Trueprop} $ (Const (@{const_name Typedef.type_definition}, _)
blanchet@35665
  1241
         $ Const (_, Type (@{type_name fun}, [Type (s, _), _]))
blanchet@35665
  1242
         $ Const _ $ _)) =
blanchet@38240
  1243
    boring <> is_funky_typedef_name ctxt s andalso is_typedef ctxt s
blanchet@33192
  1244
  | is_typedef_axiom _ _ _ = false
blanchet@36126
  1245
val is_class_axiom =
blanchet@36126
  1246
  Logic.strip_horn #> swap #> op :: #> forall (can Logic.dest_of_class)
blanchet@33192
  1247
blanchet@33192
  1248
(* Distinguishes between (1) constant definition axioms, (2) type arity and
blanchet@33192
  1249
   typedef axioms, and (3) other axioms, and returns the pair ((1), (3)).
blanchet@33192
  1250
   Typedef axioms are uninteresting to Nitpick, because it can retrieve them
blanchet@33192
  1251
   using "typedef_info". *)
blanchet@37256
  1252
fun partition_axioms_by_definitionality ctxt axioms def_names =
blanchet@33192
  1253
  let
blanchet@33192
  1254
    val axioms = sort (fast_string_ord o pairself fst) axioms
wenzelm@39687
  1255
    val defs = Ord_List.inter (fast_string_ord o apsnd fst) def_names axioms
blanchet@33192
  1256
    val nondefs =
wenzelm@39687
  1257
      Ord_List.subtract (fast_string_ord o apsnd fst) def_names axioms
blanchet@37256
  1258
      |> filter_out ((is_arity_type_axiom orf is_typedef_axiom ctxt true) o snd)
blanchet@33192
  1259
  in pairself (map snd) (defs, nondefs) end
blanchet@33192
  1260
blanchet@33197
  1261
(* Ideally we would check against "Complex_Main", not "Refute", but any theory
blanchet@33197
  1262
   will do as long as it contains all the "axioms" and "axiomatization"
blanchet@33192
  1263
   commands. *)
blanchet@33192
  1264
fun is_built_in_theory thy = Theory.subthy (thy, @{theory Refute})
blanchet@33192
  1265
blanchet@35283
  1266
val is_trivial_definition =
blanchet@35283
  1267
  the_default false o try (op aconv o Logic.dest_equals)
blanchet@33192
  1268
val is_plain_definition =
blanchet@33192
  1269
  let
blanchet@33192
  1270
    fun do_lhs t1 =
blanchet@33192
  1271
      case strip_comb t1 of
blanchet@34936
  1272
        (Const _, args) =>
blanchet@34936
  1273
        forall is_Var args andalso not (has_duplicates (op =) args)
blanchet@33192
  1274
      | _ => false
blanchet@33192
  1275
    fun do_eq (Const (@{const_name "=="}, _) $ t1 $ _) = do_lhs t1
haftmann@38864
  1276
      | do_eq (@{const Trueprop} $ (Const (@{const_name HOL.eq}, _) $ t1 $ _)) =
blanchet@33192
  1277
        do_lhs t1
blanchet@33192
  1278
      | do_eq _ = false
blanchet@33192
  1279
  in do_eq end
blanchet@33192
  1280
blanchet@37256
  1281
fun all_axioms_of ctxt subst =
blanchet@33192
  1282
  let
blanchet@37256
  1283
    val thy = ProofContext.theory_of ctxt
blanchet@35335
  1284
    val axioms_of_thys =
blanchet@35893
  1285
      maps Thm.axioms_of
blanchet@35893
  1286
      #> map (apsnd (subst_atomic subst o prop_of))
blanchet@35893
  1287
      #> filter_out (is_class_axiom o snd)
blanchet@33192
  1288
    val specs = Defs.all_specifications_of (Theory.defs_of thy)
wenzelm@33701
  1289
    val def_names = specs |> maps snd |> map_filter #def
wenzelm@39687
  1290
                    |> Ord_List.make fast_string_ord
blanchet@33192
  1291
    val thys = thy :: Theory.ancestors_of thy
blanchet@33192
  1292
    val (built_in_thys, user_thys) = List.partition is_built_in_theory thys
blanchet@33192
  1293
    val built_in_axioms = axioms_of_thys built_in_thys
blanchet@33192
  1294
    val user_axioms = axioms_of_thys user_thys
blanchet@33192
  1295
    val (built_in_defs, built_in_nondefs) =
blanchet@37256
  1296
      partition_axioms_by_definitionality ctxt built_in_axioms def_names
blanchet@37256
  1297
      ||> filter (is_typedef_axiom ctxt false)
blanchet@33192
  1298
    val (user_defs, user_nondefs) =
blanchet@37256
  1299
      partition_axioms_by_definitionality ctxt user_axioms def_names
blanchet@33197
  1300
    val (built_in_nondefs, user_nondefs) =
blanchet@37256
  1301
      List.partition (is_typedef_axiom ctxt false) user_nondefs
blanchet@33197
  1302
      |>> append built_in_nondefs
blanchet@34121
  1303
    val defs =
wenzelm@39557
  1304
      (thy |> Global_Theory.all_thms_of
blanchet@34121
  1305
           |> filter (curry (op =) Thm.definitionK o Thm.get_kind o snd)
blanchet@35283
  1306
           |> map (prop_of o snd)
blanchet@35283
  1307
           |> filter_out is_trivial_definition
blanchet@35283
  1308
           |> filter is_plain_definition) @
blanchet@34121
  1309
      user_defs @ built_in_defs
blanchet@33192
  1310
  in (defs, built_in_nondefs, user_nondefs) end
blanchet@33192
  1311
blanchet@39359
  1312
fun arity_of_built_in_const thy stds (s, T) =
blanchet@33192
  1313
  if s = @{const_name If} then
blanchet@33192
  1314
    if nth_range_type 3 T = @{typ bool} then NONE else SOME 3
blanchet@35220
  1315
  else
blanchet@35220
  1316
    let val std_nats = is_standard_datatype thy stds nat_T in
blanchet@35220
  1317
      case AList.lookup (op =)
blanchet@35220
  1318
                    (built_in_consts
blanchet@39359
  1319
                     |> std_nats ? append built_in_nat_consts) s of
blanchet@35220
  1320
        SOME n => SOME n
blanchet@35220
  1321
      | NONE =>
blanchet@35220
  1322
        case AList.lookup (op =)
blanchet@35220
  1323
                 (built_in_typed_consts
blanchet@35220
  1324
                  |> std_nats ? append built_in_typed_nat_consts)
blanchet@35220
  1325
                 (s, unarize_type T) of
blanchet@35220
  1326
          SOME n => SOME n
blanchet@35220
  1327
        | NONE =>
blanchet@35280
  1328
          case s of
blanchet@35280
  1329
            @{const_name zero_class.zero} =>
blanchet@35280
  1330
            if is_iterator_type T then SOME 0 else NONE
blanchet@35280
  1331
          | @{const_name Suc} =>
blanchet@35280
  1332
            if is_iterator_type (domain_type T) then SOME 0 else NONE
blanchet@35280
  1333
          | _ => if is_fun_type T andalso is_set_type (domain_type T) then
blanchet@35280
  1334
                   AList.lookup (op =) built_in_set_consts s
blanchet@35280
  1335
                 else
blanchet@35280
  1336
                   NONE
blanchet@35220
  1337
    end
blanchet@39359
  1338
val is_built_in_const = is_some ooo arity_of_built_in_const
blanchet@33192
  1339
blanchet@33192
  1340
(* This function is designed to work for both real definition axioms and
blanchet@33192
  1341
   simplification rules (equational specifications). *)
blanchet@33192
  1342
fun term_under_def t =
blanchet@33192
  1343
  case t of
blanchet@33192
  1344
    @{const "==>"} $ _ $ t2 => term_under_def t2
blanchet@33192
  1345
  | Const (@{const_name "=="}, _) $ t1 $ _ => term_under_def t1
blanchet@33192
  1346
  | @{const Trueprop} $ t1 => term_under_def t1
haftmann@38864
  1347
  | Const (@{const_name HOL.eq}, _) $ t1 $ _ => term_under_def t1
blanchet@33192
  1348
  | Abs (_, _, t') => term_under_def t'
blanchet@33192
  1349
  | t1 $ _ => term_under_def t1
blanchet@33192
  1350
  | _ => t
blanchet@33192
  1351
blanchet@36555
  1352
(* Here we crucially rely on "specialize_type" performing a preorder traversal
blanchet@36555
  1353
   of the term, without which the wrong occurrence of a constant could be
blanchet@36555
  1354
   matched in the face of overloading. *)
blanchet@39359
  1355
fun def_props_for_const thy stds table (x as (s, _)) =
blanchet@39359
  1356
  if is_built_in_const thy stds x then
blanchet@33192
  1357
    []
blanchet@33192
  1358
  else
blanchet@33192
  1359
    these (Symtab.lookup table s)
blanchet@36555
  1360
    |> map_filter (try (specialize_type thy x))
blanchet@34121
  1361
    |> filter (curry (op =) (Const x) o term_under_def)
blanchet@33192
  1362
blanchet@35280
  1363
fun normalized_rhs_of t =
blanchet@33192
  1364
  let
blanchet@33743
  1365
    fun aux (v as Var _) (SOME t) = SOME (lambda v t)
blanchet@35280
  1366
      | aux (c as Const (@{const_name TYPE}, _)) (SOME t) = SOME (lambda c t)
blanchet@33743
  1367
      | aux _ _ = NONE
blanchet@33192
  1368
    val (lhs, rhs) =
blanchet@33192
  1369
      case t of
blanchet@33192
  1370
        Const (@{const_name "=="}, _) $ t1 $ t2 => (t1, t2)
haftmann@38864
  1371
      | @{const Trueprop} $ (Const (@{const_name HOL.eq}, _) $ t1 $ t2) =>
blanchet@33192
  1372
        (t1, t2)
blanchet@33232
  1373
      | _ => raise TERM ("Nitpick_HOL.normalized_rhs_of", [t])
blanchet@33192
  1374
    val args = strip_comb lhs |> snd
blanchet@33743
  1375
  in fold_rev aux args (SOME rhs) end
blanchet@33192
  1376
blanchet@33192
  1377
fun def_of_const thy table (x as (s, _)) =
blanchet@39359
  1378
  if is_built_in_const thy [(NONE, false)] x orelse
blanchet@35220
  1379
     original_name s <> s then
blanchet@33192
  1380
    NONE
blanchet@33192
  1381
  else
blanchet@39359
  1382
    x |> def_props_for_const thy [(NONE, false)] table |> List.last
blanchet@35280
  1383
      |> normalized_rhs_of |> Option.map (prefix_abs_vars s)
blanchet@33192
  1384
    handle List.Empty => NONE
blanchet@33192
  1385
blanchet@33192
  1386
fun fixpoint_kind_of_rhs (Abs (_, _, t)) = fixpoint_kind_of_rhs t
blanchet@33192
  1387
  | fixpoint_kind_of_rhs (Const (@{const_name lfp}, _) $ Abs _) = Lfp
blanchet@33192
  1388
  | fixpoint_kind_of_rhs (Const (@{const_name gfp}, _) $ Abs _) = Gfp
blanchet@33192
  1389
  | fixpoint_kind_of_rhs _ = NoFp
blanchet@33192
  1390
blanchet@33192
  1391
fun is_mutually_inductive_pred_def thy table t =
blanchet@33192
  1392
  let
blanchet@33192
  1393
    fun is_good_arg (Bound _) = true
blanchet@33192
  1394
      | is_good_arg (Const (s, _)) =
blanchet@34936
  1395
        s = @{const_name True} orelse s = @{const_name False} orelse
blanchet@34936
  1396
        s = @{const_name undefined}
blanchet@33192
  1397
      | is_good_arg _ = false
blanchet@33192
  1398
  in
blanchet@33192
  1399
    case t |> strip_abs_body |> strip_comb of
blanchet@33192
  1400
      (Const x, ts as (_ :: _)) =>
blanchet@33192
  1401
      (case def_of_const thy table x of
blanchet@38180
  1402
         SOME t' => fixpoint_kind_of_rhs t' <> NoFp andalso
blanchet@38180
  1403
                    forall is_good_arg ts
blanchet@33192
  1404
       | NONE => false)
blanchet@33192
  1405
    | _ => false
blanchet@33192
  1406
  end
blanchet@33192
  1407
fun unfold_mutually_inductive_preds thy table =
blanchet@33192
  1408
  map_aterms (fn t as Const x =>
blanchet@33192
  1409
                 (case def_of_const thy table x of
blanchet@33192
  1410
                    SOME t' =>
blanchet@33192
  1411
                    let val t' = Envir.eta_contract t' in
blanchet@33192
  1412
                      if is_mutually_inductive_pred_def thy table t' then t'
blanchet@33192
  1413
                      else t
blanchet@33192
  1414
                    end
blanchet@33192
  1415
                 | NONE => t)
blanchet@33192
  1416
               | t => t)
blanchet@33192
  1417
blanchet@38240
  1418
fun case_const_names ctxt stds =
blanchet@38240
  1419
  let val thy = ProofContext.theory_of ctxt in
blanchet@38240
  1420
    Symtab.fold (fn (dtype_s, {index, descr, case_name, ...}) =>
blanchet@38240
  1421
                    if is_basic_datatype thy stds dtype_s then
blanchet@38240
  1422
                      I
blanchet@38240
  1423
                    else
blanchet@38240
  1424
                      cons (case_name, AList.lookup (op =) descr index
blanchet@38240
  1425
                                       |> the |> #3 |> length))
blanchet@38240
  1426
                (Datatype.get_all thy) [] @
blanchet@38240
  1427
    map (apsnd length o snd) (#codatatypes (Data.get (Context.Proof ctxt)))
blanchet@38240
  1428
  end
blanchet@33192
  1429
blanchet@35718
  1430
fun fixpoint_kind_of_const thy table x =
blanchet@39359
  1431
  if is_built_in_const thy [(NONE, false)] x then NoFp
blanchet@39359
  1432
  else fixpoint_kind_of_rhs (the (def_of_const thy table x))
blanchet@39359
  1433
  handle Option.Option => NoFp
blanchet@33192
  1434
blanchet@39359
  1435
fun is_real_inductive_pred ({thy, stds, def_table, intro_table, ...}
blanchet@39359
  1436
                            : hol_context) x =
blanchet@35718
  1437
  fixpoint_kind_of_const thy def_table x <> NoFp andalso
blanchet@39359
  1438
  not (null (def_props_for_const thy stds intro_table x))
blanchet@38205
  1439
fun is_inductive_pred hol_ctxt (x as (s, _)) =
blanchet@38205
  1440
  is_real_inductive_pred hol_ctxt x orelse String.isPrefix ubfp_prefix s orelse
blanchet@38205
  1441
  String.isPrefix lbfp_prefix s
blanchet@33192
  1442
blanchet@35718
  1443
fun lhs_of_equation t =
blanchet@35718
  1444
  case t of
blanchet@35718
  1445
    Const (@{const_name all}, _) $ Abs (_, _, t1) => lhs_of_equation t1
blanchet@35718
  1446
  | Const (@{const_name "=="}, _) $ t1 $ _ => SOME t1
blanchet@35718
  1447
  | @{const "==>"} $ _ $ t2 => lhs_of_equation t2
blanchet@35718
  1448
  | @{const Trueprop} $ t1 => lhs_of_equation t1
blanchet@35718
  1449
  | Const (@{const_name All}, _) $ Abs (_, _, t1) => lhs_of_equation t1
haftmann@38864
  1450
  | Const (@{const_name HOL.eq}, _) $ t1 $ _ => SOME t1
haftmann@38786
  1451
  | @{const HOL.implies} $ _ $ t2 => lhs_of_equation t2
blanchet@35718
  1452
  | _ => NONE
blanchet@35718
  1453
fun is_constr_pattern _ (Bound _) = true
blanchet@35718
  1454
  | is_constr_pattern _ (Var _) = true
blanchet@37256
  1455
  | is_constr_pattern ctxt t =
blanchet@35718
  1456
    case strip_comb t of
blanchet@35718
  1457
      (Const x, args) =>
blanchet@37256
  1458
      is_constr_like ctxt x andalso forall (is_constr_pattern ctxt) args
blanchet@35718
  1459
    | _ => false
blanchet@37256
  1460
fun is_constr_pattern_lhs ctxt t =
blanchet@37256
  1461
  forall (is_constr_pattern ctxt) (snd (strip_comb t))
blanchet@37256
  1462
fun is_constr_pattern_formula ctxt t =
blanchet@35718
  1463
  case lhs_of_equation t of
blanchet@37256
  1464
    SOME t' => is_constr_pattern_lhs ctxt t'
blanchet@35718
  1465
  | NONE => false
blanchet@35718
  1466
blanchet@36555
  1467
(* Similar to "specialize_type" but returns all matches rather than only the
blanchet@36555
  1468
   first (preorder) match. *)
blanchet@35807
  1469
fun multi_specialize_type thy slack (s, T) t =
blanchet@35807
  1470
  let
blanchet@35807
  1471
    fun aux (Const (s', T')) ys =
blanchet@35807
  1472
        if s = s' then
blanchet@35807
  1473
          ys |> (if AList.defined (op =) ys T' then
blanchet@35807
  1474
                   I
blanchet@35807
  1475
                 else
blanchet@36555
  1476
                   cons (T', monomorphic_term (Sign.typ_match thy (T', T)
blanchet@36555
  1477
                                                              Vartab.empty) t)
blanchet@35807
  1478
                   handle Type.TYPE_MATCH => I
blanchet@36575
  1479
                        | TERM _ =>
blanchet@35807
  1480
                          if slack then
blanchet@35807
  1481
                            I
blanchet@35807
  1482
                          else
blanchet@37253
  1483
                            raise NOT_SUPPORTED
blanchet@37253
  1484
                                      ("too much polymorphism in axiom \"" ^
blanchet@37253
  1485
                                       Syntax.string_of_term_global thy t ^
blanchet@37253
  1486
                                       "\" involving " ^ quote s))
blanchet@35807
  1487
        else
blanchet@35807
  1488
          ys
blanchet@35807
  1489
      | aux _ ys = ys
blanchet@35807
  1490
  in map snd (fold_aterms aux t []) end
blanchet@35807
  1491
fun nondef_props_for_const thy slack table (x as (s, _)) =
blanchet@35807
  1492
  these (Symtab.lookup table s) |> maps (multi_specialize_type thy slack x)
blanchet@35807
  1493
blanchet@35807
  1494
fun unvarify_term (t1 $ t2) = unvarify_term t1 $ unvarify_term t2
blanchet@35807
  1495
  | unvarify_term (Var ((s, 0), T)) = Free (s, T)
blanchet@35807
  1496
  | unvarify_term (Abs (s, T, t')) = Abs (s, T, unvarify_term t')
blanchet@35807
  1497
  | unvarify_term t = t
blanchet@35807
  1498
fun axiom_for_choice_spec thy =
blanchet@35807
  1499
  unvarify_term
blanchet@35807
  1500
  #> Object_Logic.atomize_term thy
blanchet@35807
  1501
  #> Choice_Specification.close_form
blanchet@35807
  1502
  #> HOLogic.mk_Trueprop
blanchet@35807
  1503
fun is_choice_spec_fun ({thy, def_table, nondef_table, choice_spec_table, ...}
blanchet@35807
  1504
                        : hol_context) x =
blanchet@35807
  1505
  case nondef_props_for_const thy true choice_spec_table x of
blanchet@35807
  1506
    [] => false
blanchet@35807
  1507
  | ts => case def_of_const thy def_table x of
blanchet@35807
  1508
            SOME (Const (@{const_name Eps}, _) $ _) => true
blanchet@35807
  1509
          | SOME _ => false
blanchet@35807
  1510
          | NONE =>
blanchet@35807
  1511
            let val ts' = nondef_props_for_const thy true nondef_table x in
blanchet@35807
  1512
              length ts' = length ts andalso
blanchet@35807
  1513
              forall (fn t =>
blanchet@35807
  1514
                         exists (curry (op aconv) (axiom_for_choice_spec thy t))
blanchet@35807
  1515
                                ts') ts
blanchet@35807
  1516
            end
blanchet@35807
  1517
blanchet@35807
  1518
fun is_choice_spec_axiom thy choice_spec_table t =
blanchet@35807
  1519
  Symtab.exists (fn (_, ts) =>
blanchet@35807
  1520
                    exists (curry (op aconv) t o axiom_for_choice_spec thy) ts)
blanchet@35807
  1521
                choice_spec_table
blanchet@35807
  1522
blanchet@39359
  1523
fun is_real_equational_fun ({thy, stds, simp_table, psimp_table, ...}
blanchet@39359
  1524
                            : hol_context) x =
blanchet@39359
  1525
  exists (fn table => not (null (def_props_for_const thy stds table x)))
blanchet@38205
  1526
         [!simp_table, psimp_table]
blanchet@38202
  1527
fun is_equational_fun_but_no_plain_def hol_ctxt =
blanchet@38205
  1528
  is_real_equational_fun hol_ctxt orf is_inductive_pred hol_ctxt
blanchet@38202
  1529
blanchet@35718
  1530
(** Constant unfolding **)
blanchet@33192
  1531
blanchet@37476
  1532
fun constr_case_body ctxt stds (func_t, (x as (_, T))) =
blanchet@33192
  1533
  let val arg_Ts = binder_types T in
blanchet@37476
  1534
    s_betapplys [] (func_t, map2 (select_nth_constr_arg ctxt stds x (Bound 0))
blanchet@37476
  1535
                                 (index_seq 0 (length arg_Ts)) arg_Ts)
blanchet@33192
  1536
  end
blanchet@37476
  1537
fun add_constr_case res_T (body_t, guard_t) res_t =
blanchet@37476
  1538
  if res_T = bool_T then
blanchet@37476
  1539
    s_conj (HOLogic.mk_imp (guard_t, body_t), res_t)
blanchet@37476
  1540
  else
blanchet@37476
  1541
    Const (@{const_name If}, bool_T --> res_T --> res_T --> res_T)
blanchet@37476
  1542
    $ guard_t $ body_t $ res_t
blanchet@37476
  1543
fun optimized_case_def (hol_ctxt as {ctxt, stds, ...}) dataT res_T func_ts =
blanchet@33192
  1544
  let
blanchet@35070
  1545
    val xs = datatype_constrs hol_ctxt dataT
blanchet@37476
  1546
    val cases =
blanchet@37476
  1547
      func_ts ~~ xs
blanchet@37476
  1548
      |> map (fn (func_t, x) =>
blanchet@37476
  1549
                 (constr_case_body ctxt stds (incr_boundvars 1 func_t, x),
blanchet@37476
  1550
                  discriminate_value hol_ctxt x (Bound 0)))
blanchet@37476
  1551
      |> AList.group (op aconv)
blanchet@37476
  1552
      |> map (apsnd (List.foldl s_disj @{const False}))
blanchet@37482
  1553
      |> sort (int_ord o pairself (size_of_term o snd))
blanchet@37476
  1554
      |> rev
blanchet@33192
  1555
  in
blanchet@37476
  1556
    if res_T = bool_T then
blanchet@37476
  1557
      if forall (member (op =) [@{const False}, @{const True}] o fst) cases then
blanchet@37476
  1558
        case cases of
blanchet@37476
  1559
          [(body_t, _)] => body_t
blanchet@37476
  1560
        | [_, (@{const True}, head_t2)] => head_t2
blanchet@37476
  1561
        | [_, (@{const False}, head_t2)] => @{const Not} $ head_t2
blanchet@37476
  1562
        | _ => raise BAD ("Nitpick_HOL.optimized_case_def", "impossible cases")
blanchet@39315
  1563
      else
blanchet@37476
  1564
        @{const True} |> fold_rev (add_constr_case res_T) cases
blanchet@37476
  1565
    else
blanchet@37476
  1566
      fst (hd cases) |> fold_rev (add_constr_case res_T) (tl cases)
blanchet@33192
  1567
  end
blanchet@37476
  1568
  |> curry absdummy dataT
blanchet@37476
  1569
blanchet@37256
  1570
fun optimized_record_get (hol_ctxt as {thy, ctxt, stds, ...}) s rec_T res_T t =
blanchet@35070
  1571
  let val constr_x = hd (datatype_constrs hol_ctxt rec_T) in
blanchet@33192
  1572
    case no_of_record_field thy s rec_T of
blanchet@33192
  1573
      ~1 => (case rec_T of
blanchet@33192
  1574
               Type (_, Ts as _ :: _) =>
blanchet@33192
  1575
               let
blanchet@33192
  1576
                 val rec_T' = List.last Ts
blanchet@33192
  1577
                 val j = num_record_fields thy rec_T - 1
blanchet@33192
  1578
               in
blanchet@37256
  1579
                 select_nth_constr_arg ctxt stds constr_x t j res_T
blanchet@35070
  1580
                 |> optimized_record_get hol_ctxt s rec_T' res_T
blanchet@33192
  1581
               end
blanchet@33232
  1582
             | _ => raise TYPE ("Nitpick_HOL.optimized_record_get", [rec_T],
blanchet@33232
  1583
                                []))
blanchet@37256
  1584
    | j => select_nth_constr_arg ctxt stds constr_x t j res_T
blanchet@33192
  1585
  end
blanchet@37256
  1586
fun optimized_record_update (hol_ctxt as {thy, ctxt, stds, ...}) s rec_T fun_t
blanchet@37256
  1587
                            rec_t =
blanchet@33192
  1588
  let
blanchet@35070
  1589
    val constr_x as (_, constr_T) = hd (datatype_constrs hol_ctxt rec_T)
blanchet@33192
  1590
    val Ts = binder_types constr_T
blanchet@33192
  1591
    val n = length Ts
blanchet@33192
  1592
    val special_j = no_of_record_field thy s rec_T
blanchet@35220
  1593
    val ts =
blanchet@35220
  1594
      map2 (fn j => fn T =>
blanchet@37256
  1595
               let val t = select_nth_constr_arg ctxt stds constr_x rec_t j T in
blanchet@35220
  1596
                 if j = special_j then
blanchet@37476
  1597
                   s_betapply [] (fun_t, t)
blanchet@35220
  1598
                 else if j = n - 1 andalso special_j = ~1 then
blanchet@35220
  1599
                   optimized_record_update hol_ctxt s
blanchet@35220
  1600
                       (rec_T |> dest_Type |> snd |> List.last) fun_t t
blanchet@35220
  1601
                 else
blanchet@35220
  1602
                   t
blanchet@35220
  1603
               end) (index_seq 0 n) Ts
blanchet@33192
  1604
  in list_comb (Const constr_x, ts) end
blanchet@33192
  1605
blanchet@35070
  1606
(* Prevents divergence in case of cyclic or infinite definition dependencies. *)
blanchet@33747
  1607
val unfold_max_depth = 255
blanchet@33192
  1608
blanchet@38206
  1609
(* Inline definitions or define as an equational constant? Booleans tend to
blanchet@38206
  1610
   benefit more from inlining, due to the polarity analysis. *)
blanchet@38206
  1611
val def_inline_threshold_for_booleans = 50
blanchet@38206
  1612
val def_inline_threshold_for_non_booleans = 20
blanchet@38202
  1613
blanchet@38209
  1614
fun unfold_defs_in_term
blanchet@39359
  1615
        (hol_ctxt as {thy, ctxt, stds, whacks, case_names, def_table,
blanchet@39359
  1616
                      ground_thm_table, ersatz_table, ...}) =
blanchet@33192
  1617
  let
blanchet@33192
  1618
    fun do_term depth Ts t =
blanchet@33192
  1619
      case t of
blanchet@33192
  1620
        (t0 as Const (@{const_name Int.number_class.number_of},
blanchet@35665
  1621
                      Type (@{type_name fun}, [_, ran_T]))) $ t1 =>
blanchet@38240
  1622
        ((if is_number_type ctxt ran_T then
blanchet@33192
  1623
            let
blanchet@33192
  1624
              val j = t1 |> HOLogic.dest_numeral
blanchet@33882
  1625
                         |> ran_T = nat_T ? Integer.max 0
blanchet@33192
  1626
              val s = numeral_prefix ^ signed_string_of_int j
blanchet@33192
  1627
            in
blanchet@35220
  1628
              if is_integer_like_type ran_T then
blanchet@35220
  1629
                if is_standard_datatype thy stds ran_T then
blanchet@35220
  1630
                  Const (s, ran_T)
blanchet@35220
  1631
                else
blanchet@35220
  1632
                  funpow j (curry (op $) (suc_const ran_T)) (zero_const ran_T)
blanchet@33192
  1633
              else
blanchet@33192
  1634
                do_term depth Ts (Const (@{const_name of_int}, int_T --> ran_T)
blanchet@33192
  1635
                                  $ Const (s, int_T))
blanchet@33192
  1636
            end
blanchet@33192
  1637
            handle TERM _ => raise SAME ()
blanchet@33192
  1638
          else
blanchet@33192
  1639
            raise SAME ())
blanchet@37476
  1640
         handle SAME () =>
blanchet@37476
  1641
                s_betapply [] (do_term depth Ts t0, do_term depth Ts t1))
blanchet@33864
  1642
      | Const (@{const_name refl_on}, T) $ Const (@{const_name top}, _) $ t2 =>
blanchet@33192
  1643
        do_const depth Ts t (@{const_name refl'}, range_type T) [t2]
blanchet@41046
  1644
      | (t0 as Const (@{const_name Sigma}, Type (_, [T1, Type (_, [T2, T3])])))
blanchet@41046
  1645
        $ t1 $ (t2 as Abs (_, _, t2')) =>
blanchet@41046
  1646
        if loose_bvar1 (t2', 0) then
blanchet@41046
  1647
          s_betapplys Ts (do_term depth Ts t0, map (do_term depth Ts) [t1, t2])
blanchet@41046
  1648
        else
blanchet@41046
  1649
          do_term depth Ts
blanchet@41046
  1650
                  (Const (@{const_name prod}, T1 --> range_type T2 --> T3)
blanchet@41046
  1651
                   $ t1 $ incr_boundvars ~1 t2')
blanchet@33192
  1652
      | Const (x as (@{const_name distinct},
blanchet@35665
  1653
               Type (@{type_name fun}, [Type (@{type_name list}, [T']), _])))
blanchet@33192
  1654
        $ (t1 as _ $ _) =>
blanchet@33192
  1655
        (t1 |> HOLogic.dest_list |> distinctness_formula T'
blanchet@33192
  1656
         handle TERM _ => do_const depth Ts t x [t1])
blanchet@35280
  1657
      | Const (x as (@{const_name If}, _)) $ t1 $ t2 $ t3 =>
blanchet@34936
  1658
        if is_ground_term t1 andalso
blanchet@34936
  1659
           exists (Pattern.matches thy o rpair t1)
blanchet@34936
  1660
                  (Inttab.lookup_list ground_thm_table (hash_term t1)) then
blanchet@33192
  1661
          do_term depth Ts t2
blanchet@33192
  1662
        else
blanchet@33192
  1663
          do_const depth Ts t x [t1, t2, t3]
blanchet@41045
  1664
      | Const (@{const_name Let}, _) $ t1 $ t2 =>
blanchet@41045
  1665
        s_betapply Ts (pairself (do_term depth Ts) (t2, t1))
blanchet@33192
  1666
      | Const x => do_const depth Ts t x []
blanchet@37476
  1667
      | t1 $ t2 =>
blanchet@37476
  1668
        (case strip_comb t of
blanchet@37476
  1669
           (Const x, ts) => do_const depth Ts t x ts
blanchet@37476
  1670
         | _ => s_betapply [] (do_term depth Ts t1, do_term depth Ts t2))
blanchet@33192
  1671
      | Bound _ => t
blanchet@33192
  1672
      | Abs (s, T, body) => Abs (s, T, do_term depth (T :: Ts) body)
blanchet@38209
  1673
      | _ => if member (term_match thy) whacks t then
blanchet@38209
  1674
               Const (@{const_name unknown}, fastype_of1 (Ts, t))
blanchet@38209
  1675
             else
blanchet@38209
  1676
               t
blanchet@33192
  1677
    and select_nth_constr_arg_with_args _ _ (x as (_, T)) [] n res_T =
blanchet@33192
  1678
        (Abs (Name.uu, body_type T,
blanchet@37256
  1679
              select_nth_constr_arg ctxt stds x (Bound 0) n res_T), [])
blanchet@33192
  1680
      | select_nth_constr_arg_with_args depth Ts x (t :: ts) n res_T =
blanchet@37256
  1681
        (select_nth_constr_arg ctxt stds x (do_term depth Ts t) n res_T, ts)
blanchet@38207
  1682
    and quot_rep_of depth Ts abs_T rep_T ts =
blanchet@38207
  1683
      select_nth_constr_arg_with_args depth Ts
blanchet@38207
  1684
          (@{const_name Quot}, rep_T --> abs_T) ts 0 rep_T
blanchet@33192
  1685
    and do_const depth Ts t (x as (s, T)) ts =
blanchet@38209
  1686
      if member (term_match thy) whacks (Const x) then
blanchet@38209
  1687
        Const (@{const_name unknown}, fastype_of1 (Ts, t))
blanchet@38209
  1688
      else case AList.lookup (op =) ersatz_table s of
blanchet@33192
  1689
        SOME s' =>
blanchet@33192
  1690
        do_const (depth + 1) Ts (list_comb (Const (s', T), ts)) (s', T) ts
blanchet@33192
  1691
      | NONE =>
blanchet@33192
  1692
        let
blanchet@38206
  1693
          fun def_inline_threshold () =
blanchet@38206
  1694
            if is_boolean_type (nth_range_type (length ts) T) then
blanchet@38206
  1695
              def_inline_threshold_for_booleans
blanchet@38206
  1696
            else
blanchet@38206
  1697
              def_inline_threshold_for_non_booleans
blanchet@33192
  1698
          val (const, ts) =
blanchet@39359
  1699
            if is_built_in_const thy stds x then
blanchet@33877
  1700
              (Const x, ts)
blanchet@33192
  1701
            else case AList.lookup (op =) case_names s of
blanchet@33192
  1702
              SOME n =>
blanchet@37476
  1703
              if length ts < n then
blanchet@37476
  1704
                (do_term depth Ts (eta_expand Ts t (n - length ts)), [])
blanchet@37476
  1705
              else
blanchet@37476
  1706
                let
blanchet@37476
  1707
                  val (dataT, res_T) = nth_range_type n T
blanchet@37476
  1708
                                       |> pairf domain_type range_type
blanchet@37476
  1709
                in
blanchet@37476
  1710
                  (optimized_case_def hol_ctxt dataT res_T
blanchet@37476
  1711
                                      (map (do_term depth Ts) (take n ts)),
blanchet@37476
  1712
                   drop n ts)
blanchet@37476
  1713
                end
blanchet@33192
  1714
            | _ =>
blanchet@37256
  1715
              if is_constr ctxt stds x then
blanchet@33192
  1716
                (Const x, ts)
blanchet@37256
  1717
              else if is_stale_constr ctxt x then
blanchet@34936
  1718
                raise NOT_SUPPORTED ("(non-co)constructors of codatatypes \
blanchet@33581
  1719
                                     \(\"" ^ s ^ "\")")
blanchet@35284
  1720
              else if is_quot_abs_fun ctxt x then
blanchet@34936
  1721
                let
blanchet@34936
  1722
                  val rep_T = domain_type T
blanchet@34936
  1723
                  val abs_T = range_type T
blanchet@34936
  1724
                in
blanchet@34936
  1725
                  (Abs (Name.uu, rep_T,
blanchet@34936
  1726
                        Const (@{const_name Quot}, rep_T --> abs_T)
blanchet@35311
  1727
                               $ (Const (quot_normal_name_for_type ctxt abs_T,
blanchet@34936
  1728
                                         rep_T --> rep_T) $ Bound 0)), ts)
blanchet@34936
  1729
                end
blanchet@35284
  1730
              else if is_quot_rep_fun ctxt x then
blanchet@38207
  1731
                quot_rep_of depth Ts (domain_type T) (range_type T) ts
blanchet@33192
  1732
              else if is_record_get thy x then
blanchet@33192
  1733
                case length ts of
blanchet@33192
  1734
                  0 => (do_term depth Ts (eta_expand Ts t 1), [])
blanchet@35070
  1735
                | _ => (optimized_record_get hol_ctxt s (domain_type T)
blanchet@34982
  1736
                            (range_type T) (do_term depth Ts (hd ts)), tl ts)
blanchet@33192
  1737
              else if is_record_update thy x then
blanchet@33192
  1738
                case length ts of
blanchet@35070
  1739
                  2 => (optimized_record_update hol_ctxt
blanchet@33580
  1740
                            (unsuffix Record.updateN s) (nth_range_type 2 T)
blanchet@33580
  1741
                            (do_term depth Ts (hd ts))
blanchet@33580
  1742
                            (do_term depth Ts (nth ts 1)), [])
blanchet@33192
  1743
                | n => (do_term depth Ts (eta_expand Ts t (2 - n)), [])
blanchet@38207
  1744
              else if is_abs_fun ctxt x andalso
blanchet@38240
  1745
                      is_quot_type ctxt (range_type T) then
blanchet@38207
  1746
                let
blanchet@38207
  1747
                  val abs_T = range_type T
blanchet@38207
  1748
                  val rep_T = domain_type (domain_type T)
blanchet@38207
  1749
                  val eps_fun = Const (@{const_name Eps},
blanchet@38207
  1750
                                       (rep_T --> bool_T) --> rep_T)
blanchet@39315
  1751
                  val normal_fun =
blanchet@38207
  1752
                    Const (quot_normal_name_for_type ctxt abs_T,
blanchet@38207
  1753
                           rep_T --> rep_T)
blanchet@38207
  1754
                  val abs_fun = Const (@{const_name Quot}, rep_T --> abs_T)
blanchet@38207
  1755
                in
blanchet@38207
  1756
                  (Abs (Name.uu, rep_T --> bool_T,
blanchet@38207
  1757
                        abs_fun $ (normal_fun $ (eps_fun $ Bound 0)))
blanchet@38207
  1758
                   |> do_term (depth + 1) Ts, ts)
blanchet@38207
  1759
                end
blanchet@37256
  1760
              else if is_rep_fun ctxt x then
blanchet@37256
  1761
                let val x' = mate_of_rep_fun ctxt x in
blanchet@37256
  1762
                  if is_constr ctxt stds x' then
blanchet@33192
  1763
                    select_nth_constr_arg_with_args depth Ts x' ts 0
blanchet@33192
  1764
                                                    (range_type T)
blanchet@38240
  1765
                  else if is_quot_type ctxt (domain_type T) then
blanchet@38207
  1766
                    let
blanchet@38207
  1767
                      val abs_T = domain_type T
blanchet@38207
  1768
                      val rep_T = domain_type (range_type T)
blanchet@38207
  1769
                      val (rep_fun, _) = quot_rep_of depth Ts abs_T rep_T []
blanchet@38243
  1770
                      val (equiv_rel, _) =
blanchet@38243
  1771
                        equiv_relation_for_quot_type thy abs_T
blanchet@38207
  1772
                    in
blanchet@38207
  1773
                      (Abs (Name.uu, abs_T, equiv_rel $ (rep_fun $ Bound 0)),
blanchet@38207
  1774
                       ts)
blanchet@38207
  1775
                    end
blanchet@33192
  1776
                  else
blanchet@38208
  1777
                    (Const x, ts)
blanchet@33192
  1778
                end
blanchet@38202
  1779
              else if is_equational_fun_but_no_plain_def hol_ctxt x orelse
blanchet@35807
  1780
                      is_choice_spec_fun hol_ctxt x then
blanchet@33192
  1781
                (Const x, ts)
blanchet@33192
  1782
              else case def_of_const thy def_table x of
blanchet@33192
  1783
                SOME def =>
blanchet@33192
  1784
                if depth > unfold_max_depth then
blanchet@34124
  1785
                  raise TOO_LARGE ("Nitpick_HOL.unfold_defs_in_term",
blanchet@34124
  1786
                                   "too many nested definitions (" ^
blanchet@34124
  1787
                                   string_of_int depth ^ ") while expanding " ^
blanchet@34124
  1788
                                   quote s)
blanchet@33192
  1789
                else if s = @{const_name wfrec'} then
blanchet@37476
  1790
                  (do_term (depth + 1) Ts (s_betapplys Ts (def, ts)), [])
blanchet@38206
  1791
                else if size_of_term def > def_inline_threshold () then
blanchet@38202
  1792
                  (Const x, ts)
blanchet@33192
  1793
                else
blanchet@33192
  1794
                  (do_term (depth + 1) Ts def, ts)
blanchet@33192
  1795
              | NONE => (Const x, ts)
blanchet@37476
  1796
        in
blanchet@37476
  1797
          s_betapplys Ts (const, map (do_term depth Ts) ts)
blanchet@37476
  1798
          |> s_beta_norm Ts
blanchet@37476
  1799
        end
blanchet@33192
  1800
  in do_term 0 [] end
blanchet@33192
  1801
blanchet@35718
  1802
(** Axiom extraction/generation **)
blanchet@35718
  1803
blanchet@38206
  1804
fun extensional_equal j (Type (@{type_name fun}, [dom_T, ran_T])) t1 t2 =
blanchet@38206
  1805
    let val var_t = Var (("x", j), dom_T) in
blanchet@38206
  1806
      extensional_equal (j + 1) ran_T (betapply (t1, var_t))
blanchet@38206
  1807
                        (betapply (t2, var_t))
blanchet@38206
  1808
    end
blanchet@38206
  1809
  | extensional_equal _ T t1 t2 =
haftmann@38864
  1810
    Const (@{const_name HOL.eq}, T --> T --> bool_T) $ t1 $ t2
blanchet@38206
  1811
blanchet@38202
  1812
fun equationalize_term ctxt tag t =
blanchet@38206
  1813
  let
blanchet@38206
  1814
    val j = maxidx_of_term t + 1
blanchet@38206
  1815
    val (prems, concl) = Logic.strip_horn t
blanchet@38206
  1816
  in
blanchet@38174
  1817
    Logic.list_implies (prems,
blanchet@38200
  1818
        case concl of
haftmann@38864
  1819
          @{const Trueprop} $ (Const (@{const_name HOL.eq}, Type (_, [T, _]))
blanchet@38206
  1820
                               $ t1 $ t2) =>
blanchet@38206
  1821
          @{const Trueprop} $ extensional_equal j T t1 t2
blanchet@38200
  1822
        | @{const Trueprop} $ t' =>
blanchet@38200
  1823
          @{const Trueprop} $ HOLogic.mk_eq (t', @{const True})
blanchet@38201
  1824
        | Const (@{const_name "=="}, Type (_, [T, _])) $ t1 $ t2 =>
blanchet@38206
  1825
          @{const Trueprop} $ extensional_equal j T t1 t2
blanchet@38201
  1826
        | _ => (warning ("Ignoring " ^ quote tag ^ " for non-equation" ^
blanchet@38201
  1827
                         quote (Syntax.string_of_term ctxt t) ^ ".");
blanchet@38201
  1828
                raise SAME ()))
blanchet@38201
  1829
    |> SOME
blanchet@38200
  1830
  end
blanchet@38201
  1831
  handle SAME () => NONE
blanchet@38172
  1832
blanchet@35807
  1833
fun pair_for_prop t =
blanchet@35807
  1834
  case term_under_def t of
blanchet@35807
  1835
    Const (s, _) => (s, t)
blanchet@35807
  1836
  | t' => raise TERM ("Nitpick_HOL.pair_for_prop", [t, t'])
blanchet@38172
  1837
blanchet@35807
  1838
fun def_table_for get ctxt subst =
blanchet@35807
  1839
  ctxt |> get |> map (pair_for_prop o subst_atomic subst)
blanchet@35807
  1840
       |> AList.group (op =) |> Symtab.make
blanchet@38172
  1841
blanchet@35718
  1842
fun const_def_table ctxt subst ts =
blanchet@35807
  1843
  def_table_for (map prop_of o Nitpick_Defs.get) ctxt subst
blanchet@35718
  1844
  |> fold (fn (s, t) => Symtab.map_default (s, []) (cons t))
blanchet@35718
  1845
          (map pair_for_prop ts)
blanchet@38172
  1846
blanchet@38172
  1847
fun paired_with_consts t = map (rpair t) (Term.add_const_names t [])
blanchet@35718
  1848
fun const_nondef_table ts =
blanchet@35807
  1849
  fold (append o paired_with_consts) ts [] |> AList.group (op =) |> Symtab.make
blanchet@38172
  1850
blanchet@38201
  1851
fun const_simp_table ctxt =
blanchet@38202
  1852
  def_table_for (map_filter (equationalize_term ctxt "nitpick_simp" o prop_of)
blanchet@38201
  1853
                 o Nitpick_Simps.get) ctxt
blanchet@38201
  1854
fun const_psimp_table ctxt =
blanchet@38202
  1855
  def_table_for (map_filter (equationalize_term ctxt "nitpick_psimp" o prop_of)
blanchet@38201
  1856
                 o Nitpick_Psimps.get) ctxt
blanchet@38172
  1857
blanchet@35807
  1858
fun const_choice_spec_table ctxt subst =
blanchet@35807
  1859
  map (subst_atomic subst o prop_of) (Nitpick_Choice_Specs.get ctxt)
blanchet@35807
  1860
  |> const_nondef_table
blanchet@38172
  1861
blanchet@35718
  1862
fun inductive_intro_table ctxt subst def_table =
blanchet@37264
  1863
  let val thy = ProofContext.theory_of ctxt in
blanchet@37264
  1864
    def_table_for
blanchet@37264
  1865
        (maps (map (unfold_mutually_inductive_preds thy def_table o prop_of)
blanchet@37264
  1866
               o snd o snd)
blanchet@37264
  1867
         o filter (fn (cat, _) => cat = Spec_Rules.Inductive orelse
blanchet@37264
  1868
                                  cat = Spec_Rules.Co_Inductive)
blanchet@37264
  1869
         o Spec_Rules.get) ctxt subst
blanchet@37264
  1870
  end
blanchet@38172
  1871
blanchet@35718
  1872
fun ground_theorem_table thy =
blanchet@35718
  1873
  fold ((fn @{const Trueprop} $ t1 =>
blanchet@35718
  1874
            is_ground_term t1 ? Inttab.map_default (hash_term t1, []) (cons t1)
wenzelm@39557
  1875
          | _ => I) o prop_of o snd) (Global_Theory.all_thms_of thy) Inttab.empty
blanchet@35718
  1876
blanchet@35807
  1877
(* TODO: Move to "Nitpick.thy" *)
blanchet@35718
  1878
val basic_ersatz_table =
blanchet@37213
  1879
  [(@{const_name card}, @{const_name card'}),
blanchet@35718
  1880
   (@{const_name setsum}, @{const_name setsum'}),
blanchet@35718
  1881
   (@{const_name fold_graph}, @{const_name fold_graph'}),
blanchet@35718
  1882
   (@{const_name wf}, @{const_name wf'}),
blanchet@35718
  1883
   (@{const_name wf_wfrec}, @{const_name wf_wfrec'}),
blanchet@35718
  1884
   (@{const_name wfrec}, @{const_name wfrec'})]
blanchet@35718
  1885
blanchet@38240
  1886
fun ersatz_table ctxt =
blanchet@38240
  1887
 basic_ersatz_table
blanchet@38240
  1888
 |> fold (append o snd) (#frac_types (Data.get (Context.Proof ctxt)))
blanchet@35718
  1889
blanchet@35718
  1890
fun add_simps simp_table s eqs =
blanchet@35718
  1891
  Unsynchronized.change simp_table
blanchet@35718
  1892
      (Symtab.update (s, eqs @ these (Symtab.lookup (!simp_table) s)))
blanchet@35718
  1893
blanchet@37256
  1894
fun inverse_axioms_for_rep_fun ctxt (x as (_, T)) =
blanchet@37256
  1895
  let
blanchet@37256
  1896
    val thy = ProofContext.theory_of ctxt
blanchet@37256
  1897
    val abs_T = domain_type T
blanchet@37256
  1898
  in
blanchet@37256
  1899
    typedef_info ctxt (fst (dest_Type abs_T)) |> the
blanchet@35718
  1900
    |> pairf #Abs_inverse #Rep_inverse
blanchet@36555
  1901
    |> pairself (specialize_type thy x o prop_of o the)
blanchet@35718
  1902
    ||> single |> op ::
blanchet@35718
  1903
  end
blanchet@37256
  1904
fun optimized_typedef_axioms ctxt (abs_z as (abs_s, _)) =
blanchet@37256
  1905
  let
blanchet@37256
  1906
    val thy = ProofContext.theory_of ctxt
blanchet@37256
  1907
    val abs_T = Type abs_z
blanchet@37256
  1908
  in
blanchet@37256
  1909
    if is_univ_typedef ctxt abs_T then
blanchet@35718
  1910
      []
blanchet@37256
  1911
    else case typedef_info ctxt abs_s of
blanchet@35718
  1912
      SOME {abs_type, rep_type, Rep_name, prop_of_Rep, set_name, ...} =>
blanchet@35718
  1913
      let
blanchet@38240
  1914
        val rep_T = varify_and_instantiate_type ctxt abs_type abs_T rep_type
blanchet@35718
  1915
        val rep_t = Const (Rep_name, abs_T --> rep_T)
blanchet@35718
  1916
        val set_t = Const (set_name, rep_T --> bool_T)
blanchet@35718
  1917
        val set_t' =
blanchet@35718
  1918
          prop_of_Rep |> HOLogic.dest_Trueprop
blanchet@36555
  1919
                      |> specialize_type thy (dest_Const rep_t)
blanchet@35718
  1920
                      |> HOLogic.dest_mem |> snd
blanchet@35718
  1921
      in
blanchet@35718
  1922
        [HOLogic.all_const abs_T
blanchet@35718
  1923
         $ Abs (Name.uu, abs_T, set_t $ (rep_t $ Bound 0))]
blanchet@35718
  1924
        |> set_t <> set_t' ? cons (HOLogic.mk_eq (set_t, set_t'))
blanchet@35718
  1925
        |> map HOLogic.mk_Trueprop
blanchet@35718
  1926
      end
blanchet@35718
  1927
    | NONE => []
blanchet@35718
  1928
  end
blanchet@35718
  1929
fun optimized_quot_type_axioms ctxt stds abs_z =
blanchet@35718
  1930
  let
blanchet@35718
  1931
    val thy = ProofContext.theory_of ctxt
blanchet@35718
  1932
    val abs_T = Type abs_z
blanchet@35718
  1933
    val rep_T = rep_type_for_quot_type thy abs_T
blanchet@38243
  1934
    val (equiv_rel, partial) = equiv_relation_for_quot_type thy abs_T
blanchet@35718
  1935
    val a_var = Var (("a", 0), abs_T)
blanchet@35718
  1936
    val x_var = Var (("x", 0), rep_T)
blanchet@35718
  1937
    val y_var = Var (("y", 0), rep_T)
blanchet@35718
  1938
    val x = (@{const_name Quot}, rep_T --> abs_T)
blanchet@37256
  1939
    val sel_a_t = select_nth_constr_arg ctxt stds x a_var 0 rep_T
blanchet@38207
  1940
    val normal_fun =
blanchet@38207
  1941
      Const (quot_normal_name_for_type ctxt abs_T, rep_T --> rep_T)
blanchet@38207
  1942
    val normal_x = normal_fun $ x_var
blanchet@38207
  1943
    val normal_y = normal_fun $ y_var
blanchet@35718
  1944
    val is_unknown_t = Const (@{const_name is_unknown}, rep_T --> bool_T)
blanchet@35718
  1945
  in
blanchet@38207
  1946
    [Logic.mk_equals (normal_fun $ sel_a_t, sel_a_t),
blanchet@35718
  1947
     Logic.list_implies
blanchet@35718
  1948
         ([@{const Not} $ (is_unknown_t $ normal_x),
blanchet@35718
  1949
           @{const Not} $ (is_unknown_t $ normal_y),
blanchet@35718
  1950
           equiv_rel $ x_var $ y_var] |> map HOLogic.mk_Trueprop,
blanchet@35718
  1951
           Logic.mk_equals (normal_x, normal_y)),
blanchet@35718
  1952
     Logic.list_implies
blanchet@35718
  1953
         ([HOLogic.mk_Trueprop (@{const Not} $ (is_unknown_t $ normal_x)),
blanchet@35718
  1954
           HOLogic.mk_Trueprop (@{const Not} $ HOLogic.mk_eq (normal_x, x_var))],
blanchet@35718
  1955
          HOLogic.mk_Trueprop (equiv_rel $ x_var $ normal_x))]
blanchet@38243
  1956
    |> partial ? cons (HOLogic.mk_Trueprop (equiv_rel $ sel_a_t $ sel_a_t))
blanchet@35718
  1957
  end
blanchet@35718
  1958
blanchet@39345
  1959
fun codatatype_bisim_axioms (hol_ctxt as {ctxt, stds, ...}) T =
blanchet@33192
  1960
  let
blanchet@35070
  1961
    val xs = datatype_constrs hol_ctxt T
blanchet@33192
  1962
    val set_T = T --> bool_T
blanchet@33192
  1963
    val iter_T = @{typ bisim_iterator}
blanchet@33192
  1964
    val bisim_max = @{const bisim_iterator_max}
blanchet@33192
  1965
    val n_var = Var (("n", 0), iter_T)
blanchet@33192
  1966
    val n_var_minus_1 =
blanchet@35671
  1967
      Const (@{const_name safe_The}, (iter_T --> bool_T) --> iter_T)
blanchet@33192
  1968
      $ Abs ("m", iter_T, HOLogic.eq_const iter_T
blanchet@33192
  1969
                          $ (suc_const iter_T $ Bound 0) $ n_var)
blanchet@33192
  1970
    val x_var = Var (("x", 0), T)
blanchet@33192
  1971
    val y_var = Var (("y", 0), T)
blanchet@38161
  1972
    fun bisim_const T =
blanchet@38161
  1973
      Const (@{const_name bisim}, iter_T --> T --> T --> bool_T)
blanchet@33192
  1974
    fun nth_sub_bisim x n nth_T =
blanchet@38240
  1975
      (if is_codatatype ctxt nth_T then bisim_const nth_T $ n_var_minus_1
blanchet@33192
  1976
       else HOLogic.eq_const nth_T)
blanchet@37256
  1977
      $ select_nth_constr_arg ctxt stds x x_var n nth_T
blanchet@37256
  1978
      $ select_nth_constr_arg ctxt stds x y_var n nth_T
blanchet@33192
  1979
    fun case_func (x as (_, T)) =
blanchet@33192
  1980
      let
blanchet@33192
  1981
        val arg_Ts = binder_types T
blanchet@33192
  1982
        val core_t =
blanchet@35070
  1983
          discriminate_value hol_ctxt x y_var ::
blanchet@33192
  1984
          map2 (nth_sub_bisim x) (index_seq 0 (length arg_Ts)) arg_Ts
blanchet@33192
  1985
          |> foldr1 s_conj
blanchet@33192
  1986
      in List.foldr absdummy core_t arg_Ts end
blanchet@33192
  1987
  in
blanchet@38163
  1988
    [HOLogic.mk_imp
blanchet@38163
  1989
       (HOLogic.mk_disj (HOLogic.eq_const iter_T $ n_var $ zero_const iter_T,
blanchet@38163
  1990
            s_betapply [] (optimized_case_def hol_ctxt T bool_T
blanchet@38163
  1991
                                              (map case_func xs), x_var)),
blanchet@38163
  1992
        bisim_const T $ n_var $ x_var $ y_var),
blanchet@38161
  1993
     HOLogic.eq_const set_T $ (bisim_const T $ bisim_max $ x_var)
blanchet@34124
  1994
     $ (Const (@{const_name insert}, T --> set_T --> set_T)
blanchet@35220
  1995
        $ x_var $ Const (@{const_name bot_class.bot}, set_T))]
blanchet@33192
  1996
    |> map HOLogic.mk_Trueprop
blanchet@33192
  1997
  end
blanchet@33192
  1998
blanchet@33192
  1999
exception NO_TRIPLE of unit
blanchet@33192
  2000
blanchet@33192
  2001
fun triple_for_intro_rule thy x t =
blanchet@33192
  2002
  let
wenzelm@35625
  2003
    val prems = Logic.strip_imp_prems t |> map (Object_Logic.atomize_term thy)
wenzelm@35625
  2004
    val concl = Logic.strip_imp_concl t |> Object_Logic.atomize_term thy
blanchet@34121
  2005
    val (main, side) = List.partition (exists_Const (curry (op =) x)) prems
blanchet@36385
  2006
    val is_good_head = curry (op =) (Const x) o head_of
blanchet@33192
  2007
  in
blanchet@33192
  2008
    if forall is_good_head main then (side, main, concl) else raise NO_TRIPLE ()
blanchet@33192
  2009
  end
blanchet@33192
  2010
blanchet@33192
  2011
val tuple_for_args = HOLogic.mk_tuple o snd o strip_comb
blanchet@33192
  2012
fun wf_constraint_for rel side concl main =
blanchet@33192
  2013
  let
blanchet@37269
  2014
    val core = HOLogic.mk_mem (HOLogic.mk_prod
blanchet@37269
  2015
                               (pairself tuple_for_args (main, concl)), Var rel)
blanchet@33192
  2016
    val t = List.foldl HOLogic.mk_imp core side
blanchet@37269
  2017
    val vars = filter_out (curry (op =) rel) (Term.add_vars t [])
blanchet@33192
  2018
  in
blanchet@33192
  2019
    Library.foldl (fn (t', ((x, j), T)) =>
blanchet@33192
  2020
                      HOLogic.all_const T
blanchet@33192
  2021
                      $ Abs (x, T, abstract_over (Var ((x, j), T), t')))
blanchet@33192
  2022
                  (t, vars)
blanchet@33192
  2023
  end
blanchet@33192
  2024
fun wf_constraint_for_triple rel (side, main, concl) =
blanchet@33192
  2025
  map (wf_constraint_for rel side concl) main |> foldr1 s_conj
blanchet@33192
  2026
blanchet@33192
  2027
fun terminates_by ctxt timeout goal tac =
blanchet@33192
  2028
  can (SINGLE (Classical.safe_tac (claset_of ctxt)) #> the
blanchet@33192
  2029
       #> SINGLE (DETERM_TIMEOUT timeout
blanchet@33192
  2030
                                 (tac ctxt (auto_tac (clasimpset_of ctxt))))
blanchet@33192
  2031
       #> the #> Goal.finish ctxt) goal
blanchet@33192
  2032
blanchet@35181
  2033
val max_cached_wfs = 50
blanchet@35181
  2034
val cached_timeout =
blanchet@35181
  2035
  Synchronized.var "Nitpick_HOL.cached_timeout" (SOME Time.zeroTime)
blanchet@35181
  2036
val cached_wf_props =
blanchet@35181
  2037
  Synchronized.var "Nitpick_HOL.cached_wf_props" ([] : (term * bool) list)
blanchet@33192
  2038
krauss@33351
  2039
val termination_tacs = [Lexicographic_Order.lex_order_tac true,
blanchet@33192
  2040
                        ScnpReconstruct.sizechange_tac]
blanchet@33192
  2041
blanchet@33580
  2042
fun uncached_is_well_founded_inductive_pred
blanchet@39359
  2043
        ({thy, ctxt, stds, debug, tac_timeout, intro_table, ...} : hol_context)
blanchet@39359
  2044
        (x as (_, T)) =
blanchet@39359
  2045
  case def_props_for_const thy stds intro_table x of
blanchet@33580
  2046
    [] => raise TERM ("Nitpick_HOL.uncached_is_well_founded_inductive",
blanchet@33232
  2047
                      [Const x])
blanchet@33192
  2048
  | intro_ts =>
blanchet@33192
  2049
    (case map (triple_for_intro_rule thy x) intro_ts
blanchet@33192
  2050
          |> filter_out (null o #2) of
blanchet@33192
  2051
       [] => true
blanchet@33192
  2052
     | triples =>
blanchet@33192
  2053
       let
blanchet@33192
  2054
         val binders_T = HOLogic.mk_tupleT (binder_types T)
blanchet@33192
  2055
         val rel_T = HOLogic.mk_prodT (binders_T, binders_T) --> bool_T
blanchet@33882
  2056
         val j = fold Integer.max (map maxidx_of_term intro_ts) 0 + 1
blanchet@33192
  2057
         val rel = (("R", j), rel_T)
blanchet@33192
  2058
         val prop = Const (@{const_name wf}, rel_T --> bool_T) $ Var rel ::
blanchet@33192
  2059
                    map (wf_constraint_for_triple rel) triples
blanchet@33192
  2060
                    |> foldr1 s_conj |> HOLogic.mk_Trueprop
blanchet@33192
  2061
         val _ = if debug then
wenzelm@40132
  2062
                   Output.urgent_message ("Wellfoundedness goal: " ^
blanchet@33192
  2063
                             Syntax.string_of_term ctxt prop ^ ".")
blanchet@33192
  2064
                 else
blanchet@33192
  2065
                   ()
blanchet@33192
  2066
       in
blanchet@35181
  2067
         if tac_timeout = Synchronized.value cached_timeout andalso
blanchet@35181
  2068
            length (Synchronized.value cached_wf_props) < max_cached_wfs then
blanchet@33557
  2069
           ()
blanchet@33557
  2070
         else
blanchet@35181
  2071
           (Synchronized.change cached_wf_props (K []);
blanchet@35181
  2072
            Synchronized.change cached_timeout (K tac_timeout));
blanchet@35181
  2073
         case AList.lookup (op =) (Synchronized.value cached_wf_props) prop of
blanchet@33192
  2074
           SOME wf => wf
blanchet@33192
  2075
         | NONE =>
blanchet@33192
  2076
           let
blanchet@33192
  2077
             val goal = prop |> cterm_of thy |> Goal.init
blanchet@33705
  2078
             val wf = exists (terminates_by ctxt tac_timeout goal)
blanchet@33705
  2079
                             termination_tacs
blanchet@35181
  2080
           in Synchronized.change cached_wf_props (cons (prop, wf)); wf end
blanchet@33192
  2081
       end)
blanchet@35309
  2082
    handle List.Empty => false | NO_TRIPLE () => false
blanchet@33192
  2083
blanchet@35070
  2084
(* The type constraint below is a workaround for a Poly/ML crash. *)
blanchet@33192
  2085
blanchet@33192
  2086
fun is_well_founded_inductive_pred
blanchet@35070
  2087
        (hol_ctxt as {thy, wfs, def_table, wf_cache, ...} : hol_context)
blanchet@33192
  2088
        (x as (s, _)) =
blanchet@33192
  2089
  case triple_lookup (const_match thy) wfs x of
blanchet@33192
  2090
    SOME (SOME b) => b
blanchet@34936
  2091
  | _ => s = @{const_name Nats} orelse s = @{const_name fold_graph'} orelse
blanchet@34936
  2092
         case AList.lookup (op =) (!wf_cache) x of
blanchet@35181
  2093
           SOME (_, wf) => wf
blanchet@35181
  2094
         | NONE =>
blanchet@35181
  2095
           let
blanchet@35181
  2096
             val gfp = (fixpoint_kind_of_const thy def_table x = Gfp)
blanchet@35181
  2097
             val wf = uncached_is_well_founded_inductive_pred hol_ctxt x
blanchet@35181
  2098
           in
blanchet@35181
  2099
             Unsynchronized.change wf_cache (cons (x, (gfp, wf))); wf
blanchet@35181
  2100
           end
blanchet@33192
  2101
blanchet@35280
  2102
fun ap_curry [_] _ t = t
blanchet@35280
  2103
  | ap_curry arg_Ts tuple_T t =
blanchet@33192
  2104
    let val n = length arg_Ts in
blanchet@33192
  2105
      list_abs (map (pair "c") arg_Ts,
blanchet@33192
  2106
                incr_boundvars n t
blanchet@33192
  2107
                $ mk_flat_tuple tuple_T (map Bound (n - 1 downto 0)))
blanchet@33192
  2108
    end
blanchet@33192
  2109
blanchet@33192
  2110
fun num_occs_of_bound_in_term j (t1 $ t2) =
blanchet@33192
  2111
    op + (pairself (num_occs_of_bound_in_term j) (t1, t2))
blanchet@35280
  2112
  | num_occs_of_bound_in_term j (Abs (_, _, t')) =
blanchet@33192
  2113
    num_occs_of_bound_in_term (j + 1) t'
blanchet@33192
  2114
  | num_occs_of_bound_in_term j (Bound j') = if j' = j then 1 else 0
blanchet@33192
  2115
  | num_occs_of_bound_in_term _ _ = 0
blanchet@33192
  2116
blanchet@33192
  2117
val is_linear_inductive_pred_def =
blanchet@33192
  2118
  let
blanchet@33192
  2119
    fun do_disjunct j (Const (@{const_name Ex}, _) $ Abs (_, _, t2)) =
blanchet@33192
  2120
        do_disjunct (j + 1) t2
blanchet@33192
  2121
      | do_disjunct j t =
blanchet@33192
  2122
        case num_occs_of_bound_in_term j t of
blanchet@33192
  2123
          0 => true
blanchet@35070
  2124
        | 1 => exists (curry (op =) (Bound j) o head_of) (conjuncts_of t)
blanchet@33192
  2125
        | _ => false
blanchet@33192
  2126
    fun do_lfp_def (Const (@{const_name lfp}, _) $ t2) =
blanchet@33192
  2127
        let val (xs, body) = strip_abs t2 in
blanchet@33192
  2128
          case length xs of
blanchet@33192
  2129
            1 => false
blanchet@35070
  2130
          | n => forall (do_disjunct (n - 1)) (disjuncts_of body)
blanchet@33192
  2131
        end
blanchet@33192
  2132
      | do_lfp_def _ = false
blanchet@33192
  2133
  in do_lfp_def o strip_abs_body end
blanchet@33192
  2134
blanchet@33851
  2135
fun n_ptuple_paths 0 = []
blanchet@33851
  2136
  | n_ptuple_paths 1 = []
blanchet@33851
  2137
  | n_ptuple_paths n = [] :: map (cons 2) (n_ptuple_paths (n - 1))
blanchet@33851
  2138
val ap_n_split = HOLogic.mk_psplits o n_ptuple_paths
blanchet@33192
  2139
blanchet@33192
  2140
val linear_pred_base_and_step_rhss =
blanchet@33192
  2141
  let
blanchet@33192
  2142
    fun aux (Const (@{const_name lfp}, _) $ t2) =
blanchet@33192
  2143
        let
blanchet@33192
  2144
          val (xs, body) = strip_abs t2
blanchet@33192
  2145
          val arg_Ts = map snd (tl xs)
blanchet@33192
  2146
          val tuple_T = HOLogic.mk_tupleT arg_Ts
blanchet@33192
  2147
          val j = length arg_Ts
blanchet@33192
  2148
          fun repair_rec j (Const (@{const_name Ex}, T1) $ Abs (s2, T2, t2')) =
blanchet@33192
  2149
              Const (@{const_name Ex}, T1)
blanchet@33192
  2150
              $ Abs (s2, T2, repair_rec (j + 1) t2')
haftmann@38795