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