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