src/HOL/BNF/Tools/bnf_fp_util.ML
author blanchet
Thu May 02 11:58:18 2013 +0200 (2013-05-02)
changeset 51858 7a08fe1e19b1
parent 51850 106afdf5806c
child 51859 09d24ea3f140
permissions -rw-r--r--
added and moved library functions (used in primrec code)
blanchet@51850
     1
(*  Title:      HOL/BNF/Tools/bnf_fp_util.ML
blanchet@48975
     2
    Author:     Dmitriy Traytel, TU Muenchen
blanchet@51823
     3
    Author:     Jasmin Blanchette, TU Muenchen
blanchet@51823
     4
    Copyright   2012, 2013
blanchet@48975
     5
blanchet@49389
     6
Shared library for the datatype and codatatype constructions.
blanchet@48975
     7
*)
blanchet@48975
     8
blanchet@51850
     9
signature BNF_FP_UTIL =
blanchet@48975
    10
sig
blanchet@49591
    11
  type fp_result =
blanchet@51837
    12
    {bnfs: BNF_Def.bnf list,
blanchet@51839
    13
     ctors: term list,
blanchet@51819
    14
     dtors: term list,
blanchet@51819
    15
     folds: term list,
blanchet@51819
    16
     recs: term list,
blanchet@51819
    17
     induct: thm,
blanchet@51819
    18
     strong_induct: thm,
blanchet@51819
    19
     dtor_ctors: thm list,
blanchet@51819
    20
     ctor_dtors: thm list,
blanchet@51819
    21
     ctor_injects: thm list,
blanchet@51819
    22
     map_thms: thm list,
blanchet@51819
    23
     set_thmss: thm list list,
blanchet@51819
    24
     rel_thms: thm list,
blanchet@51819
    25
     fold_thms: thm list,
blanchet@51819
    26
     rec_thms: thm list}
blanchet@49591
    27
blanchet@51839
    28
  val fp_name_of_ctor: term -> string
blanchet@51823
    29
  val morph_fp_result: morphism -> fp_result -> fp_result
blanchet@51823
    30
  val eq_fp_result: fp_result * fp_result -> bool
blanchet@51823
    31
blanchet@48975
    32
  val time: Timer.real_timer -> string -> Timer.real_timer
blanchet@48975
    33
blanchet@48975
    34
  val IITN: string
blanchet@48975
    35
  val LevN: string
blanchet@48975
    36
  val algN: string
blanchet@48975
    37
  val behN: string
blanchet@48975
    38
  val bisN: string
blanchet@48975
    39
  val carTN: string
blanchet@49338
    40
  val caseN: string
blanchet@48975
    41
  val coN: string
blanchet@48975
    42
  val coinductN: string
blanchet@48975
    43
  val corecN: string
blanchet@49501
    44
  val ctorN: string
blanchet@49501
    45
  val ctor_dtorN: string
blanchet@49594
    46
  val ctor_dtor_corecN: string
blanchet@49594
    47
  val ctor_dtor_unfoldN: string
blanchet@49501
    48
  val ctor_exhaustN: string
blanchet@49501
    49
  val ctor_induct2N: string
blanchet@49501
    50
  val ctor_inductN: string
blanchet@49501
    51
  val ctor_injectN: string
blanchet@49504
    52
  val ctor_foldN: string
blanchet@49504
    53
  val ctor_fold_uniqueN: string
blanchet@49541
    54
  val ctor_mapN: string
blanchet@49543
    55
  val ctor_map_uniqueN: string
blanchet@49501
    56
  val ctor_recN: string
traytel@51739
    57
  val ctor_rec_uniqueN: string
blanchet@49518
    58
  val ctor_relN: string
blanchet@49544
    59
  val ctor_set_inclN: string
blanchet@49544
    60
  val ctor_set_set_inclN: string
blanchet@49518
    61
  val ctor_srelN: string
blanchet@49594
    62
  val disc_unfoldN: string
blanchet@49594
    63
  val disc_unfold_iffN: string
blanchet@49594
    64
  val disc_corecN: string
blanchet@49594
    65
  val disc_corec_iffN: string
blanchet@49501
    66
  val dtorN: string
blanchet@49582
    67
  val dtor_coinductN: string
blanchet@49501
    68
  val dtor_corecN: string
traytel@51739
    69
  val dtor_corec_uniqueN: string
blanchet@49518
    70
  val dtor_ctorN: string
blanchet@49501
    71
  val dtor_exhaustN: string
blanchet@49501
    72
  val dtor_injectN: string
blanchet@49545
    73
  val dtor_mapN: string
blanchet@49581
    74
  val dtor_map_coinductN: string
blanchet@49581
    75
  val dtor_map_strong_coinductN: string
blanchet@49543
    76
  val dtor_map_uniqueN: string
blanchet@49545
    77
  val dtor_relN: string
blanchet@49544
    78
  val dtor_set_inclN: string
blanchet@49544
    79
  val dtor_set_set_inclN: string
blanchet@49518
    80
  val dtor_srelN: string
blanchet@49545
    81
  val dtor_srel_coinductN: string
blanchet@49545
    82
  val dtor_srel_strong_coinductN: string
blanchet@49582
    83
  val dtor_strong_coinductN: string
blanchet@49516
    84
  val dtor_unfoldN: string
blanchet@49516
    85
  val dtor_unfold_uniqueN: string
blanchet@49020
    86
  val exhaustN: string
blanchet@49504
    87
  val foldN: string
blanchet@48975
    88
  val hsetN: string
blanchet@48975
    89
  val hset_recN: string
blanchet@48975
    90
  val inductN: string
blanchet@49019
    91
  val injectN: string
blanchet@48975
    92
  val isNodeN: string
blanchet@48975
    93
  val lsbisN: string
blanchet@49594
    94
  val mapN: string
blanchet@48975
    95
  val map_uniqueN: string
blanchet@48975
    96
  val min_algN: string
blanchet@48975
    97
  val morN: string
blanchet@49020
    98
  val nchotomyN: string
blanchet@48975
    99
  val recN: string
blanchet@49592
   100
  val rel_injectN: string
blanchet@49592
   101
  val rel_distinctN: string
blanchet@48975
   102
  val rvN: string
blanchet@49594
   103
  val sel_corecN: string
blanchet@48975
   104
  val set_inclN: string
blanchet@48975
   105
  val set_set_inclN: string
blanchet@49594
   106
  val sel_unfoldN: string
blanchet@49585
   107
  val setsN: string
blanchet@49438
   108
  val simpsN: string
blanchet@48975
   109
  val strTN: string
blanchet@48975
   110
  val str_initN: string
blanchet@49591
   111
  val strong_coinductN: string
blanchet@48975
   112
  val sum_bdN: string
blanchet@48975
   113
  val sum_bdTN: string
blanchet@49504
   114
  val unfoldN: string
blanchet@48975
   115
  val uniqueN: string
blanchet@48975
   116
blanchet@49585
   117
  (* TODO: Don't index set facts. Isabelle packages traditionally generate uniform names. *)
blanchet@49584
   118
  val mk_ctor_setN: int -> string
blanchet@49584
   119
  val mk_dtor_setN: int -> string
blanchet@49542
   120
  val mk_dtor_set_inductN: int -> string
blanchet@48975
   121
  val mk_set_inductN: int -> string
blanchet@48975
   122
blanchet@51858
   123
  val base_name_of_typ: typ -> string
blanchet@49498
   124
  val mk_common_name: string list -> string
blanchet@49327
   125
blanchet@51858
   126
  val variant_types: string list -> sort list -> Proof.context ->
blanchet@51858
   127
    (string * sort) list * Proof.context
blanchet@51858
   128
  val variant_tfrees: string list -> Proof.context -> typ list * Proof.context
blanchet@51858
   129
blanchet@48975
   130
  val split_conj_thm: thm -> thm list
blanchet@48975
   131
  val split_conj_prems: int -> thm -> thm
blanchet@48975
   132
blanchet@49255
   133
  val mk_sumTN: typ list -> typ
blanchet@49264
   134
  val mk_sumTN_balanced: typ list -> typ
blanchet@49255
   135
blanchet@49368
   136
  val id_const: typ -> term
blanchet@49368
   137
blanchet@49121
   138
  val Inl_const: typ -> typ -> term
blanchet@49121
   139
  val Inr_const: typ -> typ -> term
blanchet@49121
   140
blanchet@49255
   141
  val mk_Inl: typ -> term -> term
blanchet@49255
   142
  val mk_Inr: typ -> term -> term
blanchet@49121
   143
  val mk_InN: typ list -> term -> int -> term
blanchet@49264
   144
  val mk_InN_balanced: typ -> int -> term -> int -> term
blanchet@49255
   145
  val mk_sum_case: term * term -> term
blanchet@49129
   146
  val mk_sum_caseN: term list -> term
blanchet@49264
   147
  val mk_sum_caseN_balanced: term list -> term
blanchet@49121
   148
blanchet@49255
   149
  val dest_sumT: typ -> typ * typ
blanchet@49176
   150
  val dest_sumTN: int -> typ -> typ list
blanchet@49264
   151
  val dest_sumTN_balanced: int -> typ -> typ list
blanchet@49176
   152
  val dest_tupleT: int -> typ -> typ list
blanchet@49176
   153
blanchet@48975
   154
  val mk_Field: term -> term
blanchet@49275
   155
  val mk_If: term -> term -> term -> term
blanchet@48975
   156
  val mk_union: term * term -> term
blanchet@48975
   157
blanchet@49125
   158
  val mk_sumEN: int -> thm
blanchet@49264
   159
  val mk_sumEN_balanced: int -> thm
blanchet@49335
   160
  val mk_sumEN_tupled_balanced: int list -> thm
blanchet@49130
   161
  val mk_sum_casesN: int -> int -> thm
blanchet@49264
   162
  val mk_sum_casesN_balanced: int -> int -> thm
blanchet@49125
   163
blanchet@51858
   164
  val find_minimum: ('b * 'b -> order) -> ('a -> 'b) -> 'a list -> 'a
blanchet@48975
   165
  val fixpoint: ('a * 'a -> bool) -> ('a list -> 'a list) -> 'a list -> 'a list
blanchet@48975
   166
blanchet@51758
   167
  val fp_bnf: (mixfix list -> (string * sort) list option -> binding list -> binding list ->
blanchet@51837
   168
      binding list -> binding list list -> typ list * typ list list -> BNF_Def.bnf list ->
blanchet@51767
   169
      local_theory -> 'a) ->
blanchet@51767
   170
    binding list -> mixfix list -> binding list -> binding list -> binding list list ->
blanchet@51837
   171
    (string * sort) list -> ((string * sort) * typ) list -> local_theory -> BNF_Def.bnf list * 'a
blanchet@48975
   172
end;
blanchet@48975
   173
blanchet@51850
   174
structure BNF_FP_Util : BNF_FP_UTIL =
blanchet@48975
   175
struct
blanchet@48975
   176
blanchet@48975
   177
open BNF_Comp
blanchet@48975
   178
open BNF_Def
blanchet@48975
   179
open BNF_Util
blanchet@48975
   180
blanchet@49591
   181
type fp_result =
blanchet@51837
   182
  {bnfs: BNF_Def.bnf list,
blanchet@51839
   183
   ctors: term list,
blanchet@51819
   184
   dtors: term list,
blanchet@51819
   185
   folds: term list,
blanchet@51819
   186
   recs: term list,
blanchet@51819
   187
   induct: thm,
blanchet@51819
   188
   strong_induct: thm,
blanchet@51819
   189
   dtor_ctors: thm list,
blanchet@51819
   190
   ctor_dtors: thm list,
blanchet@51819
   191
   ctor_injects: thm list,
blanchet@51819
   192
   map_thms: thm list,
blanchet@51819
   193
   set_thmss: thm list list,
blanchet@51819
   194
   rel_thms: thm list,
blanchet@51819
   195
   fold_thms: thm list,
blanchet@51819
   196
   rec_thms: thm list};
blanchet@49591
   197
blanchet@51839
   198
val fp_name_of_ctor = fst o dest_Type o range_type o fastype_of;
blanchet@51839
   199
blanchet@51839
   200
fun morph_fp_result phi {bnfs, ctors, dtors, folds, recs, induct, strong_induct, dtor_ctors,
blanchet@51823
   201
    ctor_dtors, ctor_injects, map_thms, set_thmss, rel_thms, fold_thms, rec_thms} =
blanchet@51823
   202
  {bnfs = map (morph_bnf phi) bnfs,
blanchet@51839
   203
   ctors = map (Morphism.term phi) ctors,
blanchet@51823
   204
   dtors = map (Morphism.term phi) dtors,
blanchet@51823
   205
   folds = map (Morphism.term phi) folds,
blanchet@51823
   206
   recs = map (Morphism.term phi) recs,
blanchet@51823
   207
   induct = Morphism.thm phi induct,
blanchet@51823
   208
   strong_induct = Morphism.thm phi strong_induct,
blanchet@51823
   209
   dtor_ctors = map (Morphism.thm phi) dtor_ctors,
blanchet@51823
   210
   ctor_dtors = map (Morphism.thm phi) ctor_dtors,
blanchet@51823
   211
   ctor_injects = map (Morphism.thm phi) ctor_injects,
blanchet@51823
   212
   map_thms = map (Morphism.thm phi) map_thms,
blanchet@51823
   213
   set_thmss = map (map (Morphism.thm phi)) set_thmss,
blanchet@51823
   214
   rel_thms = map (Morphism.thm phi) rel_thms,
blanchet@51823
   215
   fold_thms = map (Morphism.thm phi) fold_thms,
blanchet@51823
   216
   rec_thms = map (Morphism.thm phi) rec_thms};
blanchet@51823
   217
blanchet@51823
   218
fun eq_fp_result ({bnfs = bnfs1, ...} : fp_result, {bnfs = bnfs2, ...} : fp_result) =
blanchet@51823
   219
  eq_list eq_bnf (bnfs1, bnfs2);
blanchet@51823
   220
blanchet@48975
   221
val timing = true;
blanchet@48975
   222
fun time timer msg = (if timing
blanchet@48975
   223
  then warning (msg ^ ": " ^ ATP_Util.string_from_time (Timer.checkRealTimer timer))
blanchet@48975
   224
  else (); Timer.startRealTimer ());
blanchet@48975
   225
blanchet@49223
   226
val preN = "pre_"
blanchet@49223
   227
val rawN = "raw_"
blanchet@49218
   228
blanchet@48975
   229
val coN = "co"
blanchet@49504
   230
val unN = "un"
blanchet@48975
   231
val algN = "alg"
blanchet@48975
   232
val IITN = "IITN"
blanchet@49504
   233
val foldN = "fold"
blanchet@49504
   234
val unfoldN = unN ^ foldN
blanchet@48975
   235
val uniqueN = "_unique"
blanchet@49438
   236
val simpsN = "simps"
blanchet@49501
   237
val ctorN = "ctor"
blanchet@49501
   238
val dtorN = "dtor"
blanchet@49504
   239
val ctor_foldN = ctorN ^ "_" ^ foldN
blanchet@49504
   240
val dtor_unfoldN = dtorN ^ "_" ^ unfoldN
blanchet@49504
   241
val ctor_fold_uniqueN = ctor_foldN ^ uniqueN
blanchet@49504
   242
val dtor_unfold_uniqueN = dtor_unfoldN ^ uniqueN
blanchet@49594
   243
val ctor_dtor_unfoldN = ctorN ^ "_" ^ dtor_unfoldN
blanchet@49541
   244
val ctor_mapN = ctorN ^ "_" ^ mapN
blanchet@49541
   245
val dtor_mapN = dtorN ^ "_" ^ mapN
blanchet@48975
   246
val map_uniqueN = mapN ^ uniqueN
blanchet@49543
   247
val ctor_map_uniqueN = ctorN ^ "_" ^ map_uniqueN
blanchet@49543
   248
val dtor_map_uniqueN = dtorN ^ "_" ^ map_uniqueN
blanchet@48975
   249
val min_algN = "min_alg"
blanchet@48975
   250
val morN = "mor"
blanchet@48975
   251
val bisN = "bis"
blanchet@48975
   252
val lsbisN = "lsbis"
blanchet@48975
   253
val sum_bdTN = "sbdT"
blanchet@48975
   254
val sum_bdN = "sbd"
blanchet@48975
   255
val carTN = "carT"
blanchet@48975
   256
val strTN = "strT"
blanchet@48975
   257
val isNodeN = "isNode"
blanchet@48975
   258
val LevN = "Lev"
blanchet@48975
   259
val rvN = "recover"
blanchet@48975
   260
val behN = "beh"
blanchet@49585
   261
val setsN = "sets"
blanchet@49584
   262
val mk_ctor_setN = prefix (ctorN ^ "_") o mk_setN
blanchet@49584
   263
val mk_dtor_setN = prefix (dtorN ^ "_") o mk_setN
blanchet@48975
   264
fun mk_set_inductN i = mk_setN i ^ "_induct"
blanchet@49542
   265
val mk_dtor_set_inductN = prefix (dtorN ^ "_") o mk_set_inductN
blanchet@48975
   266
blanchet@48975
   267
val str_initN = "str_init"
blanchet@48975
   268
val recN = "rec"
blanchet@48975
   269
val corecN = coN ^ recN
blanchet@49501
   270
val ctor_recN = ctorN ^ "_" ^ recN
traytel@51739
   271
val ctor_rec_uniqueN = ctor_recN ^ uniqueN
blanchet@49501
   272
val dtor_corecN = dtorN ^ "_" ^ corecN
traytel@51739
   273
val dtor_corec_uniqueN = dtor_corecN ^ uniqueN
blanchet@49594
   274
val ctor_dtor_corecN = ctorN ^ "_" ^ dtor_corecN
blanchet@48975
   275
blanchet@49501
   276
val ctor_dtorN = ctorN ^ "_" ^ dtorN
blanchet@49501
   277
val dtor_ctorN = dtorN ^ "_" ^ ctorN
blanchet@49020
   278
val nchotomyN = "nchotomy"
blanchet@49019
   279
val injectN = "inject"
blanchet@49020
   280
val exhaustN = "exhaust"
blanchet@49585
   281
val ctor_injectN = ctorN ^ "_" ^ injectN
blanchet@49585
   282
val ctor_exhaustN = ctorN ^ "_" ^ exhaustN
blanchet@49585
   283
val dtor_injectN = dtorN ^ "_" ^ injectN
blanchet@49585
   284
val dtor_exhaustN = dtorN ^ "_" ^ exhaustN
blanchet@49545
   285
val ctor_relN = ctorN ^ "_" ^ relN
blanchet@49545
   286
val dtor_relN = dtorN ^ "_" ^ relN
blanchet@49545
   287
val ctor_srelN = ctorN ^ "_" ^ srelN
blanchet@49545
   288
val dtor_srelN = dtorN ^ "_" ^ srelN
blanchet@48975
   289
val inductN = "induct"
blanchet@48975
   290
val coinductN = coN ^ inductN
blanchet@49501
   291
val ctor_inductN = ctorN ^ "_" ^ inductN
blanchet@49501
   292
val ctor_induct2N = ctor_inductN ^ "2"
blanchet@49581
   293
val dtor_map_coinductN = dtor_mapN ^ "_" ^ coinductN
blanchet@49582
   294
val dtor_coinductN = dtorN ^ "_" ^ coinductN
blanchet@49545
   295
val dtor_srel_coinductN = dtor_srelN ^ "_" ^ coinductN
blanchet@49591
   296
val strong_coinductN = "strong_" ^ coinductN
blanchet@49591
   297
val dtor_map_strong_coinductN = dtor_mapN ^ "_" ^ strong_coinductN
blanchet@49591
   298
val dtor_strong_coinductN = dtorN ^ "_" ^ strong_coinductN
blanchet@49591
   299
val dtor_srel_strong_coinductN = dtor_srelN ^ "_" ^ strong_coinductN
blanchet@48975
   300
val hsetN = "Hset"
blanchet@48975
   301
val hset_recN = hsetN ^ "_rec"
blanchet@48975
   302
val set_inclN = "set_incl"
blanchet@49544
   303
val ctor_set_inclN = ctorN ^ "_" ^ set_inclN
blanchet@49544
   304
val dtor_set_inclN = dtorN ^ "_" ^ set_inclN
blanchet@48975
   305
val set_set_inclN = "set_set_incl"
blanchet@49544
   306
val ctor_set_set_inclN = ctorN ^ "_" ^ set_set_inclN
blanchet@49544
   307
val dtor_set_set_inclN = dtorN ^ "_" ^ set_set_inclN
blanchet@48975
   308
blanchet@49338
   309
val caseN = "case"
blanchet@49342
   310
val discN = "disc"
blanchet@49594
   311
val disc_unfoldN = discN ^ "_" ^ unfoldN
blanchet@49594
   312
val disc_corecN = discN ^ "_" ^ corecN
blanchet@49594
   313
val iffN = "_iff"
blanchet@49594
   314
val disc_unfold_iffN = discN ^ "_" ^ unfoldN ^ iffN
blanchet@49594
   315
val disc_corec_iffN = discN ^ "_" ^ corecN ^ iffN
blanchet@49592
   316
val distinctN = "distinct"
blanchet@49592
   317
val rel_distinctN = relN ^ "_" ^ distinctN
blanchet@49592
   318
val injectN = "inject"
blanchet@49592
   319
val rel_injectN = relN ^ "_" ^ injectN
blanchet@49342
   320
val selN = "sel"
blanchet@49594
   321
val sel_unfoldN = selN ^ "_" ^ unfoldN
blanchet@49594
   322
val sel_corecN = selN ^ "_" ^ corecN
blanchet@49338
   323
blanchet@51858
   324
fun add_components_of_typ (Type (s, Ts)) =
blanchet@51858
   325
    fold add_components_of_typ Ts #> cons (Long_Name.base_name s)
blanchet@51858
   326
  | add_components_of_typ _ = I;
blanchet@51858
   327
blanchet@51858
   328
fun base_name_of_typ T = space_implode "_" (add_components_of_typ T []);
blanchet@51858
   329
blanchet@49498
   330
val mk_common_name = space_implode "_";
blanchet@49327
   331
blanchet@49264
   332
fun dest_sumT (Type (@{type_name sum}, [T, T'])) = (T, T');
blanchet@49264
   333
blanchet@49264
   334
fun dest_sumTN 1 T = [T]
blanchet@49264
   335
  | dest_sumTN n (Type (@{type_name sum}, [T, T'])) = T :: dest_sumTN (n - 1) T';
blanchet@49264
   336
blanchet@49264
   337
val dest_sumTN_balanced = Balanced_Tree.dest dest_sumT;
blanchet@49264
   338
blanchet@49264
   339
(* TODO: move something like this to "HOLogic"? *)
blanchet@49264
   340
fun dest_tupleT 0 @{typ unit} = []
blanchet@49264
   341
  | dest_tupleT 1 T = [T]
blanchet@49264
   342
  | dest_tupleT n (Type (@{type_name prod}, [T, T'])) = T :: dest_tupleT (n - 1) T';
blanchet@49264
   343
blanchet@49264
   344
val mk_sumTN = Library.foldr1 mk_sumT;
blanchet@49264
   345
val mk_sumTN_balanced = Balanced_Tree.make mk_sumT;
blanchet@49255
   346
blanchet@49368
   347
fun id_const T = Const (@{const_name id}, T --> T);
blanchet@49368
   348
blanchet@49121
   349
fun Inl_const LT RT = Const (@{const_name Inl}, LT --> mk_sumT (LT, RT));
blanchet@49255
   350
fun mk_Inl RT t = Inl_const (fastype_of t) RT $ t;
blanchet@49121
   351
blanchet@49121
   352
fun Inr_const LT RT = Const (@{const_name Inr}, RT --> mk_sumT (LT, RT));
blanchet@49255
   353
fun mk_Inr LT t = Inr_const LT (fastype_of t) $ t;
blanchet@49121
   354
blanchet@49121
   355
fun mk_InN [_] t 1 = t
blanchet@49255
   356
  | mk_InN (_ :: Ts) t 1 = mk_Inl (mk_sumTN Ts) t
blanchet@49255
   357
  | mk_InN (LT :: Ts) t m = mk_Inr LT (mk_InN Ts t (m - 1))
blanchet@49121
   358
  | mk_InN Ts t _ = raise (TYPE ("mk_InN", Ts, [t]));
blanchet@49121
   359
blanchet@49264
   360
fun mk_InN_balanced sum_T n t k =
blanchet@49264
   361
  let
blanchet@49264
   362
    fun repair_types T (Const (s as @{const_name Inl}, _) $ t) = repair_inj_types T s fst t
blanchet@49264
   363
      | repair_types T (Const (s as @{const_name Inr}, _) $ t) = repair_inj_types T s snd t
blanchet@49264
   364
      | repair_types _ t = t
blanchet@49264
   365
    and repair_inj_types T s get t =
blanchet@49264
   366
      let val T' = get (dest_sumT T) in
blanchet@49264
   367
        Const (s, T' --> T) $ repair_types T' t
blanchet@49264
   368
      end;
blanchet@49264
   369
  in
blanchet@49264
   370
    Balanced_Tree.access {left = mk_Inl dummyT, right = mk_Inr dummyT, init = t} n k
blanchet@49264
   371
    |> repair_types sum_T
blanchet@49264
   372
  end;
blanchet@49264
   373
blanchet@49255
   374
fun mk_sum_case (f, g) =
blanchet@49129
   375
  let
blanchet@49129
   376
    val fT = fastype_of f;
blanchet@49129
   377
    val gT = fastype_of g;
blanchet@49129
   378
  in
blanchet@49129
   379
    Const (@{const_name sum_case},
blanchet@49129
   380
      fT --> gT --> mk_sumT (domain_type fT, domain_type gT) --> range_type fT) $ f $ g
blanchet@49129
   381
  end;
blanchet@49129
   382
blanchet@49264
   383
val mk_sum_caseN = Library.foldr1 mk_sum_case;
blanchet@49264
   384
val mk_sum_caseN_balanced = Balanced_Tree.make mk_sum_case;
blanchet@49176
   385
blanchet@49275
   386
fun mk_If p t f =
blanchet@49275
   387
  let val T = fastype_of t;
blanchet@49275
   388
  in Const (@{const_name If}, HOLogic.boolT --> T --> T --> T) $ p $ t $ f end;
blanchet@49275
   389
blanchet@48975
   390
fun mk_Field r =
blanchet@48975
   391
  let val T = fst (dest_relT (fastype_of r));
blanchet@48975
   392
  in Const (@{const_name Field}, mk_relT (T, T) --> HOLogic.mk_setT T) $ r end;
blanchet@48975
   393
blanchet@48975
   394
val mk_union = HOLogic.mk_binop @{const_name sup};
blanchet@48975
   395
blanchet@51858
   396
fun find_minimum _ _ [] = raise Empty
blanchet@51858
   397
  | find_minimum _ _ [x] = x
blanchet@51858
   398
  | find_minimum ord f xs =
blanchet@51858
   399
    let
blanchet@51858
   400
      fun find [x] = (f x, x)
blanchet@51858
   401
        | find (x :: xs) =
blanchet@51858
   402
          let
blanchet@51858
   403
            val y = f x;
blanchet@51858
   404
            val p' as (y', _) = find xs;
blanchet@51858
   405
          in
blanchet@51858
   406
            if ord (y', y) = LESS then p' else (y, x)
blanchet@51858
   407
          end;
blanchet@51858
   408
    in snd (find xs) end;
blanchet@51858
   409
blanchet@48975
   410
(*dangerous; use with monotonic, converging functions only!*)
blanchet@48975
   411
fun fixpoint eq f X = if subset eq (f X, X) then X else fixpoint eq f (f X);
blanchet@48975
   412
blanchet@51858
   413
fun variant_types ss Ss ctxt =
blanchet@51858
   414
  let
blanchet@51858
   415
    val (tfrees, _) =
blanchet@51858
   416
      fold_map2 (fn s => fn S => Name.variant s #> apfst (rpair S)) ss Ss (Variable.names_of ctxt);
blanchet@51858
   417
    val ctxt' = fold (Variable.declare_constraints o Logic.mk_type o TFree) tfrees ctxt;
blanchet@51858
   418
  in (tfrees, ctxt') end;
blanchet@51858
   419
blanchet@51858
   420
fun variant_tfrees ss =
blanchet@51858
   421
  apfst (map TFree) o variant_types (map (prefix "'") ss) (replicate (length ss) HOLogic.typeS);
blanchet@51858
   422
blanchet@48975
   423
(* stolen from "~~/src/HOL/Tools/Datatype/datatype_aux.ML" *)
blanchet@48975
   424
fun split_conj_thm th =
blanchet@49119
   425
  ((th RS conjunct1) :: split_conj_thm (th RS conjunct2)) handle THM _ => [th];
blanchet@48975
   426
blanchet@48975
   427
fun split_conj_prems limit th =
blanchet@48975
   428
  let
blanchet@48975
   429
    fun split n i th =
blanchet@48975
   430
      if i = n then th else split n (i + 1) (conjI RSN (i, th)) handle THM _ => th;
blanchet@48975
   431
  in split limit 1 th end;
blanchet@48975
   432
blanchet@49255
   433
fun mk_sumEN 1 = @{thm one_pointE}
traytel@49240
   434
  | mk_sumEN 2 = @{thm sumE}
traytel@49240
   435
  | mk_sumEN n =
traytel@49240
   436
    (fold (fn i => fn thm => @{thm obj_sum_step} RSN (i, thm)) (2 upto n - 1) @{thm obj_sumE}) OF
traytel@49240
   437
      replicate n (impI RS allI);
blanchet@49125
   438
blanchet@49335
   439
fun mk_obj_sumEN_balanced n =
blanchet@49335
   440
  Balanced_Tree.make (fn (thm1, thm2) => thm1 RSN (1, thm2 RSN (2, @{thm obj_sumE_f})))
blanchet@49335
   441
    (replicate n asm_rl);
blanchet@49335
   442
blanchet@49335
   443
fun mk_sumEN_balanced' n all_impIs = mk_obj_sumEN_balanced n OF all_impIs RS @{thm obj_one_pointE};
blanchet@49335
   444
blanchet@49335
   445
fun mk_sumEN_balanced 1 = @{thm one_pointE} (*optimization*)
blanchet@49264
   446
  | mk_sumEN_balanced 2 = @{thm sumE} (*optimization*)
blanchet@49335
   447
  | mk_sumEN_balanced n = mk_sumEN_balanced' n (replicate n (impI RS allI));
blanchet@49335
   448
blanchet@49335
   449
fun mk_tupled_allIN 0 = @{thm unit_all_impI}
blanchet@49335
   450
  | mk_tupled_allIN 1 = @{thm impI[THEN allI]}
blanchet@49335
   451
  | mk_tupled_allIN 2 = @{thm prod_all_impI} (*optimization*)
blanchet@49335
   452
  | mk_tupled_allIN n = mk_tupled_allIN (n - 1) RS @{thm prod_all_impI_step};
blanchet@49335
   453
blanchet@49335
   454
fun mk_sumEN_tupled_balanced ms =
blanchet@49335
   455
  let val n = length ms in
blanchet@49335
   456
    if forall (curry (op =) 1) ms then mk_sumEN_balanced n
blanchet@49335
   457
    else mk_sumEN_balanced' n (map mk_tupled_allIN ms)
blanchet@49335
   458
  end;
blanchet@49264
   459
blanchet@49264
   460
fun mk_sum_casesN 1 1 = refl
blanchet@49130
   461
  | mk_sum_casesN _ 1 = @{thm sum.cases(1)}
blanchet@49130
   462
  | mk_sum_casesN 2 2 = @{thm sum.cases(2)}
blanchet@49264
   463
  | mk_sum_casesN n k = trans OF [@{thm sum_case_step(2)}, mk_sum_casesN (n - 1) (k - 1)];
blanchet@49264
   464
blanchet@49264
   465
fun mk_sum_step base step thm =
blanchet@49264
   466
  if Thm.eq_thm_prop (thm, refl) then base else trans OF [step, thm];
blanchet@49264
   467
blanchet@49264
   468
fun mk_sum_casesN_balanced 1 1 = refl
blanchet@49264
   469
  | mk_sum_casesN_balanced n k =
blanchet@49264
   470
    Balanced_Tree.access {left = mk_sum_step @{thm sum.cases(1)} @{thm sum_case_step(1)},
blanchet@49264
   471
      right = mk_sum_step @{thm sum.cases(2)} @{thm sum_case_step(2)}, init = refl} n k;
blanchet@49130
   472
blanchet@49141
   473
(* FIXME: because of "@ lhss", the output could contain type variables that are not in the input;
blanchet@49141
   474
   also, "fp_sort" should put the "resBs" first and in the order in which they appear *)
traytel@49185
   475
fun fp_sort lhss NONE Ass = Library.sort (Term_Ord.typ_ord o pairself TFree)
traytel@49185
   476
    (subtract (op =) lhss (fold (fold (insert (op =))) Ass [])) @ lhss
traytel@49185
   477
  | fp_sort lhss (SOME resBs) Ass =
traytel@49185
   478
    (subtract (op =) lhss (filter (fn T => exists (fn Ts => member (op =) Ts T) Ass) resBs)) @ lhss;
blanchet@48975
   479
blanchet@51767
   480
fun mk_fp_bnf timer construct_fp resBs bs map_bs rel_bs set_bss sort lhss bnfs deadss livess
blanchet@51767
   481
    unfold_set lthy =
blanchet@48975
   482
  let
blanchet@49498
   483
    val name = mk_common_name (map Binding.name_of bs);
traytel@49425
   484
    fun qualify i =
traytel@49425
   485
      let val namei = name ^ nonzero_string_of_int i;
traytel@49425
   486
      in Binding.qualify true namei end;
blanchet@48975
   487
blanchet@49132
   488
    val Ass = map (map dest_TFree) livess;
traytel@49185
   489
    val resDs = (case resBs of NONE => [] | SOME Ts => fold (subtract (op =)) Ass Ts);
traytel@49185
   490
    val Ds = fold (fold Term.add_tfreesT) deadss [];
blanchet@49132
   491
traytel@49156
   492
    val _ = (case Library.inter (op =) Ds lhss of [] => ()
blanchet@49591
   493
      | A :: _ => error ("Inadmissible type recursion (cannot take fixed point of dead type \
blanchet@49132
   494
        \variable " ^ quote (Syntax.string_of_typ lthy (TFree A)) ^ ")"));
blanchet@48975
   495
blanchet@48975
   496
    val timer = time (timer "Construction of BNFs");
blanchet@48975
   497
blanchet@49502
   498
    val ((kill_poss, _), (bnfs', (unfold_set', lthy'))) =
blanchet@49502
   499
      normalize_bnfs qualify Ass Ds sort bnfs unfold_set lthy;
blanchet@48975
   500
blanchet@49132
   501
    val Dss = map3 (append oo map o nth) livess kill_poss deadss;
blanchet@48975
   502
traytel@49185
   503
    val ((bnfs'', deadss), lthy'') =
blanchet@49502
   504
      fold_map3 (seal_bnf unfold_set') (map (Binding.prefix_name preN) bs) Dss bnfs' lthy'
traytel@49185
   505
      |>> split_list;
blanchet@48975
   506
blanchet@48975
   507
    val timer = time (timer "Normalization & sealing of BNFs");
blanchet@48975
   508
blanchet@51767
   509
    val res = construct_fp resBs bs map_bs rel_bs set_bss (map TFree resDs, deadss) bnfs'' lthy'';
blanchet@48975
   510
blanchet@48975
   511
    val timer = time (timer "FP construction in total");
blanchet@48975
   512
  in
blanchet@49308
   513
    timer; (bnfs'', res)
blanchet@48975
   514
  end;
blanchet@48975
   515
blanchet@51767
   516
fun fp_bnf construct_fp bs mixfixes map_bs rel_bs set_bss resBs eqs lthy =
blanchet@48975
   517
  let
blanchet@48975
   518
    val timer = time (Timer.startRealTimer ());
blanchet@48975
   519
    val (lhss, rhss) = split_list eqs;
traytel@49185
   520
    val sort = fp_sort lhss (SOME resBs);
traytel@49425
   521
    fun qualify b = Binding.qualify true (Binding.name_of (Binding.prefix_name rawN b));
blanchet@49502
   522
    val ((bnfs, (Dss, Ass)), (unfold_set, lthy')) = apfst (apsnd split_list o split_list)
traytel@49425
   523
      (fold_map2 (fn b => bnf_of_typ Smart_Inline (qualify b) sort) bs rhss
blanchet@49502
   524
        (empty_unfolds, lthy));
blanchet@48975
   525
  in
blanchet@51767
   526
    mk_fp_bnf timer (construct_fp mixfixes) (SOME resBs) bs map_bs rel_bs set_bss sort lhss bnfs Dss
blanchet@51767
   527
      Ass unfold_set lthy'
blanchet@48975
   528
  end;
blanchet@48975
   529
blanchet@48975
   530
end;