src/HOL/Codatatype/Tools/bnf_fp_util.ML
author traytel
Mon Sep 10 09:56:06 2012 +0200 (2012-09-10)
changeset 49240 f7e75b802ef2
parent 49231 43d2df313559
child 49255 2ecc533d6697
permissions -rw-r--r--
stabilized generation of parameterized theorem
blanchet@48975
     1
(*  Title:      HOL/Codatatype/Tools/bnf_fp_util.ML
blanchet@48975
     2
    Author:     Dmitriy Traytel, TU Muenchen
blanchet@48975
     3
    Copyright   2012
blanchet@48975
     4
blanchet@48975
     5
Shared library for the datatype and the codatatype construction.
blanchet@48975
     6
*)
blanchet@48975
     7
blanchet@48975
     8
signature BNF_FP_UTIL =
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@48975
    18
  val coN: string
blanchet@48975
    19
  val coinductN: string
blanchet@48975
    20
  val coiterN: string
blanchet@49128
    21
  val unf_coiter_uniqueN: string
blanchet@48975
    22
  val corecN: string
blanchet@49020
    23
  val exhaustN: string
blanchet@48975
    24
  val fldN: string
blanchet@48975
    25
  val fld_exhaustN: string
blanchet@48975
    26
  val fld_induct2N: string
blanchet@48975
    27
  val fld_inductN: string
blanchet@48975
    28
  val fld_injectN: string
blanchet@49128
    29
  val fld_iterN: string
blanchet@49222
    30
  val fld_itersN: string
blanchet@49128
    31
  val fld_recN: string
blanchet@49222
    32
  val fld_recsN: string
blanchet@48975
    33
  val fld_unfN: string
blanchet@49231
    34
  val fld_unf_coitersN: string
blanchet@49231
    35
  val fld_unf_corecsN: string
blanchet@48975
    36
  val hsetN: string
blanchet@48975
    37
  val hset_recN: string
blanchet@48975
    38
  val inductN: string
blanchet@49019
    39
  val injectN: string
blanchet@48975
    40
  val isNodeN: string
blanchet@48975
    41
  val iterN: string
blanchet@49128
    42
  val fld_iter_uniqueN: string
blanchet@48975
    43
  val lsbisN: string
blanchet@48975
    44
  val map_simpsN: string
blanchet@48975
    45
  val map_uniqueN: string
blanchet@48975
    46
  val min_algN: string
blanchet@48975
    47
  val morN: string
blanchet@49020
    48
  val nchotomyN: string
blanchet@48975
    49
  val pred_coinductN: string
blanchet@48975
    50
  val pred_coinduct_uptoN: string
blanchet@48975
    51
  val recN: string
blanchet@48975
    52
  val rel_coinductN: string
blanchet@48975
    53
  val rel_coinduct_uptoN: string
blanchet@48975
    54
  val rvN: string
blanchet@48975
    55
  val set_inclN: string
blanchet@48975
    56
  val set_set_inclN: string
blanchet@48975
    57
  val strTN: string
blanchet@48975
    58
  val str_initN: string
blanchet@48975
    59
  val sum_bdN: string
blanchet@48975
    60
  val sum_bdTN: string
blanchet@48975
    61
  val unfN: string
blanchet@48975
    62
  val unf_coinductN: string
blanchet@48975
    63
  val unf_coinduct_uptoN: string
blanchet@49128
    64
  val unf_coiterN: string
blanchet@49222
    65
  val unf_coitersN: string
blanchet@49128
    66
  val unf_corecN: string
blanchet@49222
    67
  val unf_corecsN: string
blanchet@48975
    68
  val unf_exhaustN: string
blanchet@48975
    69
  val unf_fldN: string
blanchet@48975
    70
  val unf_injectN: string
blanchet@48975
    71
  val uniqueN: string
blanchet@48975
    72
  val uptoN: string
blanchet@48975
    73
blanchet@48975
    74
  val mk_exhaustN: string -> string
blanchet@48975
    75
  val mk_injectN: string -> string
blanchet@48975
    76
  val mk_nchotomyN: string -> string
blanchet@48975
    77
  val mk_set_simpsN: int -> string
blanchet@48975
    78
  val mk_set_minimalN: int -> string
blanchet@48975
    79
  val mk_set_inductN: int -> string
blanchet@48975
    80
blanchet@48975
    81
  val split_conj_thm: thm -> thm list
blanchet@48975
    82
  val split_conj_prems: int -> thm -> thm
blanchet@48975
    83
blanchet@49121
    84
  val Inl_const: typ -> typ -> term
blanchet@49121
    85
  val Inr_const: typ -> typ -> term
blanchet@49121
    86
blanchet@49121
    87
  val mk_Inl: term -> typ -> term
blanchet@49121
    88
  val mk_Inr: term -> typ -> term
blanchet@49121
    89
  val mk_InN: typ list -> term -> int -> term
blanchet@49129
    90
  val mk_sum_case: term -> term -> term
blanchet@49129
    91
  val mk_sum_caseN: term list -> term
blanchet@49121
    92
blanchet@49176
    93
  val dest_sumTN: int -> typ -> typ list
blanchet@49176
    94
  val dest_tupleT: int -> typ -> typ list
blanchet@49176
    95
blanchet@48975
    96
  val mk_Field: term -> term
blanchet@48975
    97
  val mk_union: term * term -> term
blanchet@48975
    98
blanchet@49125
    99
  val mk_sumEN: int -> thm
blanchet@49130
   100
  val mk_sum_casesN: int -> int -> thm
blanchet@49125
   101
blanchet@48975
   102
  val mk_tactics: 'a -> 'a -> 'a -> 'a list -> 'a -> 'a -> 'a list -> 'a -> 'a -> 'a list
blanchet@48975
   103
blanchet@48975
   104
  val fixpoint: ('a * 'a -> bool) -> ('a list -> 'a list) -> 'a list -> 'a list
blanchet@48975
   105
traytel@49185
   106
  val fp_bnf: (mixfix list -> (string * sort) list option -> binding list ->
traytel@49185
   107
    typ list * typ list list -> BNF_Def.BNF list -> local_theory -> 'a) ->
blanchet@49169
   108
    binding list -> mixfix list -> (string * sort) list -> ((string * sort) * typ) list ->
blanchet@49226
   109
    local_theory -> BNF_Def.BNF list * 'a
traytel@49185
   110
  val fp_bnf_cmd: (mixfix list -> (string * sort) list option -> binding list ->
traytel@49185
   111
    typ list * typ list list -> BNF_Def.BNF list -> local_theory -> 'a) ->
blanchet@49134
   112
    binding list * (string list * string list) -> local_theory -> 'a
blanchet@48975
   113
end;
blanchet@48975
   114
blanchet@48975
   115
structure BNF_FP_Util : BNF_FP_UTIL =
blanchet@48975
   116
struct
blanchet@48975
   117
blanchet@48975
   118
open BNF_Comp
blanchet@48975
   119
open BNF_Def
blanchet@48975
   120
open BNF_Util
blanchet@48975
   121
blanchet@48975
   122
val timing = true;
blanchet@48975
   123
fun time timer msg = (if timing
blanchet@48975
   124
  then warning (msg ^ ": " ^ ATP_Util.string_from_time (Timer.checkRealTimer timer))
blanchet@48975
   125
  else (); Timer.startRealTimer ());
blanchet@48975
   126
blanchet@49223
   127
val preN = "pre_"
blanchet@49223
   128
val rawN = "raw_"
blanchet@49218
   129
blanchet@48975
   130
val coN = "co"
blanchet@48975
   131
val algN = "alg"
blanchet@48975
   132
val IITN = "IITN"
blanchet@48975
   133
val iterN = "iter"
blanchet@48975
   134
val coiterN = coN ^ iterN
blanchet@48975
   135
val uniqueN = "_unique"
blanchet@48975
   136
val fldN = "fld"
blanchet@48975
   137
val unfN = "unf"
blanchet@49128
   138
val fld_iterN = fldN ^ "_" ^ iterN
blanchet@49222
   139
val fld_itersN = fld_iterN ^ "s"
blanchet@49128
   140
val unf_coiterN = unfN ^ "_" ^ coiterN
blanchet@49222
   141
val unf_coitersN = unf_coiterN ^ "s"
blanchet@49128
   142
val fld_iter_uniqueN = fld_iterN ^ uniqueN
blanchet@49128
   143
val unf_coiter_uniqueN = unf_coiterN ^ uniqueN
blanchet@49225
   144
val fld_unf_coitersN = fldN ^ "_" ^ unf_coiterN ^ "s"
blanchet@48975
   145
val map_simpsN = mapN ^ "_simps"
blanchet@48975
   146
val map_uniqueN = mapN ^ uniqueN
blanchet@48975
   147
val min_algN = "min_alg"
blanchet@48975
   148
val morN = "mor"
blanchet@48975
   149
val bisN = "bis"
blanchet@48975
   150
val lsbisN = "lsbis"
blanchet@48975
   151
val sum_bdTN = "sbdT"
blanchet@48975
   152
val sum_bdN = "sbd"
blanchet@48975
   153
val carTN = "carT"
blanchet@48975
   154
val strTN = "strT"
blanchet@48975
   155
val isNodeN = "isNode"
blanchet@48975
   156
val LevN = "Lev"
blanchet@48975
   157
val rvN = "recover"
blanchet@48975
   158
val behN = "beh"
blanchet@48975
   159
fun mk_set_simpsN i = mk_setN i ^ "_simps"
blanchet@48975
   160
fun mk_set_minimalN i = mk_setN i ^ "_minimal"
blanchet@48975
   161
fun mk_set_inductN i = mk_setN i ^ "_induct"
blanchet@48975
   162
blanchet@48975
   163
val str_initN = "str_init"
blanchet@48975
   164
val recN = "rec"
blanchet@48975
   165
val corecN = coN ^ recN
blanchet@49128
   166
val fld_recN = fldN ^ "_" ^ recN
blanchet@49222
   167
val fld_recsN = fld_recN ^ "s"
blanchet@49128
   168
val unf_corecN = unfN ^ "_" ^ corecN
blanchet@49222
   169
val unf_corecsN = unf_corecN ^ "s"
blanchet@49231
   170
val fld_unf_corecsN = fldN ^ "_" ^ unf_corecN ^ "s"
blanchet@48975
   171
blanchet@48975
   172
val fld_unfN = fldN ^ "_" ^ unfN
blanchet@48975
   173
val unf_fldN = unfN ^ "_" ^ fldN
blanchet@49020
   174
val nchotomyN = "nchotomy"
blanchet@49020
   175
fun mk_nchotomyN s = s ^ "_" ^ nchotomyN
blanchet@49019
   176
val injectN = "inject"
blanchet@49019
   177
fun mk_injectN s = s ^ "_" ^ injectN
blanchet@49020
   178
val exhaustN = "exhaust"
blanchet@49020
   179
fun mk_exhaustN s = s ^ "_" ^ exhaustN
blanchet@48975
   180
val fld_injectN = mk_injectN fldN
blanchet@48975
   181
val fld_exhaustN = mk_exhaustN fldN
blanchet@48975
   182
val unf_injectN = mk_injectN unfN
blanchet@48975
   183
val unf_exhaustN = mk_exhaustN unfN
blanchet@48975
   184
val inductN = "induct"
blanchet@48975
   185
val coinductN = coN ^ inductN
blanchet@48975
   186
val fld_inductN = fldN ^ "_" ^ inductN
blanchet@48975
   187
val fld_induct2N = fld_inductN ^ "2"
blanchet@48975
   188
val unf_coinductN = unfN ^ "_" ^ coinductN
blanchet@48975
   189
val rel_coinductN = relN ^ "_" ^ coinductN
blanchet@48975
   190
val pred_coinductN = predN ^ "_" ^ coinductN
blanchet@48975
   191
val uptoN = "upto"
blanchet@48975
   192
val unf_coinduct_uptoN = unf_coinductN ^ "_" ^ uptoN
blanchet@48975
   193
val rel_coinduct_uptoN = rel_coinductN ^ "_" ^ uptoN
blanchet@48975
   194
val pred_coinduct_uptoN = pred_coinductN ^ "_" ^ uptoN
blanchet@48975
   195
val hsetN = "Hset"
blanchet@48975
   196
val hset_recN = hsetN ^ "_rec"
blanchet@48975
   197
val set_inclN = "set_incl"
blanchet@48975
   198
val set_set_inclN = "set_set_incl"
blanchet@48975
   199
blanchet@49121
   200
fun Inl_const LT RT = Const (@{const_name Inl}, LT --> mk_sumT (LT, RT));
blanchet@49121
   201
fun mk_Inl t RT = Inl_const (fastype_of t) RT $ t;
blanchet@49121
   202
blanchet@49121
   203
fun Inr_const LT RT = Const (@{const_name Inr}, RT --> mk_sumT (LT, RT));
blanchet@49121
   204
fun mk_Inr t LT = Inr_const LT (fastype_of t) $ t;
blanchet@49121
   205
blanchet@49121
   206
fun mk_InN [_] t 1 = t
blanchet@49121
   207
  | mk_InN (_ :: Ts) t 1 = mk_Inl t (mk_sumTN Ts)
blanchet@49121
   208
  | mk_InN (LT :: Ts) t m = mk_Inr (mk_InN Ts t (m - 1)) LT
blanchet@49121
   209
  | mk_InN Ts t _ = raise (TYPE ("mk_InN", Ts, [t]));
blanchet@49121
   210
blanchet@49129
   211
fun mk_sum_case f g =
blanchet@49129
   212
  let
blanchet@49129
   213
    val fT = fastype_of f;
blanchet@49129
   214
    val gT = fastype_of g;
blanchet@49129
   215
  in
blanchet@49129
   216
    Const (@{const_name sum_case},
blanchet@49129
   217
      fT --> gT --> mk_sumT (domain_type fT, domain_type gT) --> range_type fT) $ f $ g
blanchet@49129
   218
  end;
blanchet@49129
   219
blanchet@49129
   220
fun mk_sum_caseN [f] = f
blanchet@49129
   221
  | mk_sum_caseN (f :: fs) = mk_sum_case f (mk_sum_caseN fs);
blanchet@49129
   222
blanchet@49176
   223
fun dest_sumTN 1 T = [T]
blanchet@49176
   224
  | dest_sumTN n (Type (@{type_name sum}, [T, T'])) = T :: dest_sumTN (n - 1) T';
blanchet@49176
   225
blanchet@49176
   226
(* TODO: move something like this to "HOLogic"? *)
blanchet@49176
   227
fun dest_tupleT 0 @{typ unit} = []
blanchet@49176
   228
  | dest_tupleT 1 T = [T]
blanchet@49176
   229
  | dest_tupleT n (Type (@{type_name prod}, [T, T'])) = T :: dest_tupleT (n - 1) T';
blanchet@49176
   230
blanchet@48975
   231
fun mk_Field r =
blanchet@48975
   232
  let val T = fst (dest_relT (fastype_of r));
blanchet@48975
   233
  in Const (@{const_name Field}, mk_relT (T, T) --> HOLogic.mk_setT T) $ r end;
blanchet@48975
   234
blanchet@48975
   235
val mk_union = HOLogic.mk_binop @{const_name sup};
blanchet@48975
   236
blanchet@48975
   237
(*dangerous; use with monotonic, converging functions only!*)
blanchet@48975
   238
fun fixpoint eq f X = if subset eq (f X, X) then X else fixpoint eq f (f X);
blanchet@48975
   239
blanchet@48975
   240
(* stolen from "~~/src/HOL/Tools/Datatype/datatype_aux.ML" *)
blanchet@48975
   241
fun split_conj_thm th =
blanchet@49119
   242
  ((th RS conjunct1) :: split_conj_thm (th RS conjunct2)) handle THM _ => [th];
blanchet@48975
   243
blanchet@48975
   244
fun split_conj_prems limit th =
blanchet@48975
   245
  let
blanchet@48975
   246
    fun split n i th =
blanchet@48975
   247
      if i = n then th else split n (i + 1) (conjI RSN (i, th)) handle THM _ => th;
blanchet@48975
   248
  in split limit 1 th end;
blanchet@48975
   249
traytel@49240
   250
fun mk_sumEN 1 = @{thm obj_sum_base}
traytel@49240
   251
  | mk_sumEN 2 = @{thm sumE}
traytel@49240
   252
  | mk_sumEN n =
traytel@49240
   253
    (fold (fn i => fn thm => @{thm obj_sum_step} RSN (i, thm)) (2 upto n - 1) @{thm obj_sumE}) OF
traytel@49240
   254
      replicate n (impI RS allI);
blanchet@49125
   255
blanchet@49130
   256
fun mk_sum_casesN 1 1 = @{thm refl}
blanchet@49130
   257
  | mk_sum_casesN _ 1 = @{thm sum.cases(1)}
blanchet@49130
   258
  | mk_sum_casesN 2 2 = @{thm sum.cases(2)}
blanchet@49130
   259
  | mk_sum_casesN n m = trans OF [@{thm sum_case_step(2)}, mk_sum_casesN (n - 1) (m - 1)];
blanchet@49130
   260
blanchet@48975
   261
fun mk_tactics mid mcomp mcong snat bdco bdinf sbd inbd wpull =
blanchet@48975
   262
  [mid, mcomp, mcong] @ snat @ [bdco, bdinf] @ sbd @ [inbd, wpull];
blanchet@48975
   263
blanchet@49141
   264
(* FIXME: because of "@ lhss", the output could contain type variables that are not in the input;
blanchet@49141
   265
   also, "fp_sort" should put the "resBs" first and in the order in which they appear *)
traytel@49185
   266
fun fp_sort lhss NONE Ass = Library.sort (Term_Ord.typ_ord o pairself TFree)
traytel@49185
   267
    (subtract (op =) lhss (fold (fold (insert (op =))) Ass [])) @ lhss
traytel@49185
   268
  | fp_sort lhss (SOME resBs) Ass =
traytel@49185
   269
    (subtract (op =) lhss (filter (fn T => exists (fn Ts => member (op =) Ts T) Ass) resBs)) @ lhss;
blanchet@48975
   270
traytel@49185
   271
fun mk_fp_bnf timer construct resBs bs sort lhss bnfs deadss livess unfold lthy =
blanchet@48975
   272
  let
blanchet@48975
   273
    val name = fold_rev (fn b => fn s => Binding.name_of b ^ s) bs "";
blanchet@48975
   274
    fun qualify i bind =
blanchet@48975
   275
      let val namei = if i > 0 then name ^ string_of_int i else name;
blanchet@48975
   276
      in
blanchet@48975
   277
        if member (op =) (#2 (Binding.dest bind)) (namei, true) then bind
blanchet@48975
   278
        else Binding.prefix_name namei bind
blanchet@48975
   279
      end;
blanchet@48975
   280
blanchet@49132
   281
    val Ass = map (map dest_TFree) livess;
traytel@49185
   282
    val resDs = (case resBs of NONE => [] | SOME Ts => fold (subtract (op =)) Ass Ts);
traytel@49185
   283
    val Ds = fold (fold Term.add_tfreesT) deadss [];
blanchet@49132
   284
traytel@49156
   285
    val _ = (case Library.inter (op =) Ds lhss of [] => ()
blanchet@49132
   286
      | A :: _ => error ("Nonadmissible type recursion (cannot take fixed point of dead type \
blanchet@49132
   287
        \variable " ^ quote (Syntax.string_of_typ lthy (TFree A)) ^ ")"));
blanchet@48975
   288
blanchet@48975
   289
    val timer = time (timer "Construction of BNFs");
blanchet@48975
   290
blanchet@48975
   291
    val ((kill_poss, _), (bnfs', (unfold', lthy'))) =
blanchet@48975
   292
      normalize_bnfs qualify Ass Ds sort bnfs unfold lthy;
blanchet@48975
   293
blanchet@49132
   294
    val Dss = map3 (append oo map o nth) livess kill_poss deadss;
blanchet@48975
   295
traytel@49185
   296
    val ((bnfs'', deadss), lthy'') =
blanchet@49223
   297
      fold_map3 (seal_bnf unfold') (map (Binding.prefix_name preN) bs) Dss bnfs' lthy'
traytel@49185
   298
      |>> split_list;
blanchet@48975
   299
blanchet@48975
   300
    val timer = time (timer "Normalization & sealing of BNFs");
blanchet@48975
   301
traytel@49185
   302
    val res = construct resBs bs (map TFree resDs, deadss) bnfs'' lthy'';
blanchet@48975
   303
blanchet@48975
   304
    val timer = time (timer "FP construction in total");
blanchet@48975
   305
  in
blanchet@49226
   306
    (bnfs'', res)
blanchet@48975
   307
  end;
blanchet@48975
   308
blanchet@49169
   309
fun fp_bnf construct bs mixfixes resBs eqs lthy =
blanchet@48975
   310
  let
blanchet@48975
   311
    val timer = time (Timer.startRealTimer ());
blanchet@48975
   312
    val (lhss, rhss) = split_list eqs;
traytel@49185
   313
    val sort = fp_sort lhss (SOME resBs);
blanchet@48975
   314
    val ((bnfs, (Dss, Ass)), (unfold, lthy')) = apfst (apsnd split_list o split_list)
blanchet@49223
   315
      (fold_map2 (fn b => bnf_of_typ Smart_Inline (Binding.prefix_name rawN b) I sort) bs rhss
blanchet@48975
   316
        (empty_unfold, lthy));
blanchet@48975
   317
  in
traytel@49185
   318
    mk_fp_bnf timer (construct mixfixes) (SOME resBs) bs sort lhss bnfs Dss Ass unfold lthy'
blanchet@48975
   319
  end;
blanchet@48975
   320
blanchet@48975
   321
fun fp_bnf_cmd construct (bs, (raw_lhss, raw_bnfs)) lthy =
blanchet@48975
   322
  let
blanchet@48975
   323
    val timer = time (Timer.startRealTimer ());
blanchet@48975
   324
    val lhss = map (dest_TFree o Syntax.read_typ lthy) raw_lhss;
traytel@49185
   325
    val sort = fp_sort lhss NONE;
blanchet@48975
   326
    val ((bnfs, (Dss, Ass)), (unfold, lthy')) = apfst (apsnd split_list o split_list)
blanchet@48975
   327
      (fold_map2 (fn b => fn rawT =>
blanchet@49223
   328
        (bnf_of_typ Smart_Inline (Binding.prefix_name rawN b) I sort (Syntax.read_typ lthy rawT)))
traytel@49185
   329
      bs raw_bnfs (empty_unfold, lthy));
blanchet@48975
   330
  in
blanchet@49207
   331
    snd (mk_fp_bnf timer (construct (map (K NoSyn) bs)) NONE bs sort lhss bnfs Dss Ass unfold lthy')
blanchet@48975
   332
  end;
blanchet@48975
   333
blanchet@48975
   334
end;