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