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