src/HOLCF/Tools/Domain/domain_take_proofs.ML
author huffman
Tue Nov 09 05:23:34 2010 -0800 (2010-11-09)
changeset 40489 0f37a553bc1a
parent 40326 73d45866dbda
child 40737 2037021f034f
permissions -rw-r--r--
implement map_of_typ using Pattern.rewrite_term
haftmann@37744
     1
(*  Title:      HOLCF/Tools/Domain/domain_take_proofs.ML
huffman@35514
     2
    Author:     Brian Huffman
huffman@35514
     3
huffman@35514
     4
Defines take functions for the given domain equation
huffman@35514
     5
and proves related theorems.
huffman@35514
     6
*)
huffman@35514
     7
huffman@35514
     8
signature DOMAIN_TAKE_PROOFS =
huffman@35514
     9
sig
huffman@35514
    10
  type iso_info =
huffman@35514
    11
    {
huffman@35514
    12
      absT : typ,
huffman@35514
    13
      repT : typ,
huffman@35514
    14
      abs_const : term,
huffman@35514
    15
      rep_const : term,
huffman@35514
    16
      abs_inverse : thm,
huffman@35514
    17
      rep_inverse : thm
huffman@35514
    18
    }
huffman@35651
    19
  type take_info =
huffman@35659
    20
    {
huffman@35659
    21
      take_consts : term list,
huffman@35514
    22
      take_defs : thm list,
huffman@35514
    23
      chain_take_thms : thm list,
huffman@35514
    24
      take_0_thms : thm list,
huffman@35514
    25
      take_Suc_thms : thm list,
huffman@35515
    26
      deflation_take_thms : thm list,
huffman@40015
    27
      take_strict_thms : thm list,
huffman@35515
    28
      finite_consts : term list,
huffman@35515
    29
      finite_defs : thm list
huffman@35651
    30
    }
huffman@35656
    31
  type take_induct_info =
huffman@35656
    32
    {
huffman@35659
    33
      take_consts         : term list,
huffman@35659
    34
      take_defs           : thm list,
huffman@35659
    35
      chain_take_thms     : thm list,
huffman@35659
    36
      take_0_thms         : thm list,
huffman@35659
    37
      take_Suc_thms       : thm list,
huffman@35659
    38
      deflation_take_thms : thm list,
huffman@40015
    39
      take_strict_thms    : thm list,
huffman@35659
    40
      finite_consts       : term list,
huffman@35659
    41
      finite_defs         : thm list,
huffman@35659
    42
      lub_take_thms       : thm list,
huffman@35659
    43
      reach_thms          : thm list,
huffman@35659
    44
      take_lemma_thms     : thm list,
huffman@35659
    45
      is_finite           : bool,
huffman@35659
    46
      take_induct_thms    : thm list
huffman@35656
    47
    }
huffman@35651
    48
  val define_take_functions :
huffman@35651
    49
    (binding * iso_info) list -> theory -> take_info * theory
huffman@35514
    50
huffman@35654
    51
  val add_lub_take_theorems :
huffman@35654
    52
    (binding * iso_info) list -> take_info -> thm list ->
huffman@35656
    53
    theory -> take_induct_info * theory
huffman@35654
    54
huffman@35514
    55
  val map_of_typ :
huffman@35514
    56
    theory -> (typ * term) list -> typ -> term
huffman@35514
    57
huffman@40218
    58
  val add_map_function : (string * string * bool list) -> theory -> theory
huffman@40218
    59
  val get_map_tab : theory -> (string * bool list) Symtab.table
huffman@40216
    60
  val add_deflation_thm : thm -> theory -> theory
huffman@35514
    61
  val get_deflation_thms : theory -> thm list
huffman@40489
    62
  val map_ID_add : attribute
huffman@40489
    63
  val get_map_ID_thms : theory -> thm list
huffman@40216
    64
  val setup : theory -> theory
huffman@35514
    65
end;
huffman@35514
    66
huffman@35514
    67
structure Domain_Take_Proofs : DOMAIN_TAKE_PROOFS =
huffman@35514
    68
struct
huffman@35514
    69
huffman@35514
    70
type iso_info =
huffman@35514
    71
  {
huffman@35514
    72
    absT : typ,
huffman@35514
    73
    repT : typ,
huffman@35514
    74
    abs_const : term,
huffman@35514
    75
    rep_const : term,
huffman@35514
    76
    abs_inverse : thm,
huffman@35514
    77
    rep_inverse : thm
huffman@35514
    78
  };
huffman@35514
    79
huffman@35651
    80
type take_info =
huffman@35651
    81
  { take_consts : term list,
huffman@35651
    82
    take_defs : thm list,
huffman@35651
    83
    chain_take_thms : thm list,
huffman@35651
    84
    take_0_thms : thm list,
huffman@35651
    85
    take_Suc_thms : thm list,
huffman@35651
    86
    deflation_take_thms : thm list,
huffman@40015
    87
    take_strict_thms : thm list,
huffman@35651
    88
    finite_consts : term list,
huffman@35651
    89
    finite_defs : thm list
huffman@35651
    90
  };
huffman@35651
    91
huffman@35656
    92
type take_induct_info =
huffman@35656
    93
  {
huffman@35659
    94
    take_consts         : term list,
huffman@35659
    95
    take_defs           : thm list,
huffman@35659
    96
    chain_take_thms     : thm list,
huffman@35659
    97
    take_0_thms         : thm list,
huffman@35659
    98
    take_Suc_thms       : thm list,
huffman@35659
    99
    deflation_take_thms : thm list,
huffman@40015
   100
    take_strict_thms    : thm list,
huffman@35659
   101
    finite_consts       : term list,
huffman@35659
   102
    finite_defs         : thm list,
huffman@35659
   103
    lub_take_thms       : thm list,
huffman@35659
   104
    reach_thms          : thm list,
huffman@35659
   105
    take_lemma_thms     : thm list,
huffman@35659
   106
    is_finite           : bool,
huffman@35659
   107
    take_induct_thms    : thm list
huffman@35656
   108
  };
huffman@35656
   109
huffman@37078
   110
val beta_rules =
huffman@40326
   111
  @{thms beta_cfun cont_id cont_const cont2cont_APP cont2cont_LAM'} @
huffman@37078
   112
  @{thms cont2cont_fst cont2cont_snd cont2cont_Pair};
huffman@37078
   113
huffman@37078
   114
val beta_ss = HOL_basic_ss addsimps (simp_thms @ beta_rules);
huffman@35514
   115
huffman@35514
   116
val beta_tac = simp_tac beta_ss;
huffman@35514
   117
huffman@35514
   118
(******************************************************************************)
huffman@35514
   119
(******************************** theory data *********************************)
huffman@35514
   120
(******************************************************************************)
huffman@35514
   121
huffman@35514
   122
structure MapData = Theory_Data
huffman@35514
   123
(
huffman@35514
   124
  (* constant names like "foo_map" *)
huffman@40218
   125
  (* list indicates which type arguments correspond to map arguments *)
huffman@40218
   126
  (* alternatively, which type arguments allow indirect recursion *)
huffman@40218
   127
  type T = (string * bool list) Symtab.table;
huffman@35514
   128
  val empty = Symtab.empty;
huffman@35514
   129
  val extend = I;
huffman@35514
   130
  fun merge data = Symtab.merge (K true) data;
huffman@35514
   131
);
huffman@35514
   132
huffman@40216
   133
structure DeflMapData = Named_Thms
huffman@35514
   134
(
huffman@40216
   135
  val name = "domain_deflation"
huffman@40216
   136
  val description = "theorems like deflation a ==> deflation (foo_map$a)"
huffman@35514
   137
);
huffman@35514
   138
huffman@40489
   139
structure Map_Id_Data = Named_Thms
huffman@40489
   140
(
huffman@40489
   141
  val name = "domain_map_ID"
huffman@40489
   142
  val description = "theorems like foo_map$ID = ID"
huffman@40489
   143
);
huffman@40489
   144
huffman@40218
   145
fun add_map_function (tname, map_name, bs) =
huffman@40218
   146
    MapData.map (Symtab.insert (K true) (tname, (map_name, bs)));
huffman@40216
   147
huffman@40216
   148
fun add_deflation_thm thm =
huffman@40216
   149
    Context.theory_map (DeflMapData.add_thm thm);
huffman@35514
   150
huffman@35514
   151
val get_map_tab = MapData.get;
huffman@40216
   152
fun get_deflation_thms thy = DeflMapData.get (ProofContext.init_global thy);
huffman@40216
   153
huffman@40489
   154
val map_ID_add = Map_Id_Data.add;
huffman@40489
   155
val get_map_ID_thms = Map_Id_Data.get o ProofContext.init_global;
huffman@40489
   156
huffman@40489
   157
val setup = DeflMapData.setup #> Map_Id_Data.setup;
huffman@35514
   158
huffman@35514
   159
(******************************************************************************)
huffman@35514
   160
(************************** building types and terms **************************)
huffman@35514
   161
(******************************************************************************)
huffman@35514
   162
huffman@35514
   163
open HOLCF_Library;
huffman@35514
   164
huffman@35514
   165
infixr 6 ->>;
huffman@35514
   166
infix -->>;
huffman@35515
   167
infix 9 `;
huffman@35514
   168
huffman@35514
   169
fun mapT (T as Type (_, Ts)) =
huffman@35514
   170
    (map (fn T => T ->> T) Ts) -->> (T ->> T)
huffman@35514
   171
  | mapT T = T ->> T;
huffman@35514
   172
huffman@35514
   173
fun mk_deflation t =
huffman@35514
   174
  Const (@{const_name deflation}, Term.fastype_of t --> boolT) $ t;
huffman@35514
   175
huffman@35514
   176
fun mk_eqs (t, u) = HOLogic.mk_Trueprop (HOLogic.mk_eq (t, u));
huffman@35514
   177
huffman@35514
   178
(******************************************************************************)
huffman@35514
   179
(****************************** isomorphism info ******************************)
huffman@35514
   180
(******************************************************************************)
huffman@35514
   181
huffman@35514
   182
fun deflation_abs_rep (info : iso_info) : thm =
huffman@35514
   183
  let
huffman@35514
   184
    val abs_iso = #abs_inverse info;
huffman@35514
   185
    val rep_iso = #rep_inverse info;
huffman@35514
   186
    val thm = @{thm deflation_abs_rep} OF [abs_iso, rep_iso];
huffman@35514
   187
  in
huffman@36241
   188
    Drule.zero_var_indexes thm
huffman@35514
   189
  end
huffman@35514
   190
huffman@35514
   191
(******************************************************************************)
huffman@35514
   192
(********************* building map functions over types **********************)
huffman@35514
   193
(******************************************************************************)
huffman@35514
   194
huffman@35514
   195
fun map_of_typ (thy : theory) (sub : (typ * term) list) (T : typ) : term =
huffman@35514
   196
  let
huffman@40489
   197
    val thms = get_map_ID_thms thy;
huffman@40489
   198
    val rules = map (Thm.concl_of #> HOLogic.dest_Trueprop #> HOLogic.dest_eq) thms;
huffman@40489
   199
    val rules' = map (apfst mk_ID) sub @ map swap rules;
huffman@35514
   200
  in
huffman@40489
   201
    mk_ID T
huffman@40489
   202
    |> Pattern.rewrite_term thy rules' []
huffman@40489
   203
    |> Pattern.rewrite_term thy rules []
huffman@35514
   204
  end;
huffman@35514
   205
huffman@35514
   206
(******************************************************************************)
huffman@35514
   207
(********************* declaring definitions and theorems *********************)
huffman@35514
   208
(******************************************************************************)
huffman@35514
   209
huffman@35773
   210
fun add_qualified_def name (dbind, eqn) =
wenzelm@39557
   211
    yield_singleton (Global_Theory.add_defs false)
huffman@35773
   212
     ((Binding.qualified true name dbind, eqn), []);
huffman@35514
   213
huffman@35773
   214
fun add_qualified_thm name (dbind, thm) =
wenzelm@39557
   215
    yield_singleton Global_Theory.add_thms
huffman@35773
   216
      ((Binding.qualified true name dbind, thm), []);
huffman@35650
   217
huffman@35773
   218
fun add_qualified_simp_thm name (dbind, thm) =
wenzelm@39557
   219
    yield_singleton Global_Theory.add_thms
huffman@35773
   220
      ((Binding.qualified true name dbind, thm), [Simplifier.simp_add]);
huffman@35573
   221
huffman@35514
   222
(******************************************************************************)
huffman@35514
   223
(************************** defining take functions ***************************)
huffman@35514
   224
(******************************************************************************)
huffman@35514
   225
huffman@35514
   226
fun define_take_functions
huffman@35514
   227
    (spec : (binding * iso_info) list)
huffman@35514
   228
    (thy : theory) =
huffman@35514
   229
  let
huffman@35514
   230
huffman@35514
   231
    (* retrieve components of spec *)
huffman@35773
   232
    val dbinds = map fst spec;
huffman@35514
   233
    val iso_infos = map snd spec;
huffman@35514
   234
    val dom_eqns = map (fn x => (#absT x, #repT x)) iso_infos;
huffman@35514
   235
    val rep_abs_consts = map (fn x => (#rep_const x, #abs_const x)) iso_infos;
huffman@35514
   236
huffman@35514
   237
    fun mk_projs []      t = []
huffman@35514
   238
      | mk_projs (x::[]) t = [(x, t)]
huffman@35514
   239
      | mk_projs (x::xs) t = (x, mk_fst t) :: mk_projs xs (mk_snd t);
huffman@35514
   240
huffman@35514
   241
    fun mk_cfcomp2 ((rep_const, abs_const), f) =
huffman@35514
   242
        mk_cfcomp (abs_const, mk_cfcomp (f, rep_const));
huffman@35514
   243
huffman@35514
   244
    (* define take functional *)
huffman@35514
   245
    val newTs : typ list = map fst dom_eqns;
huffman@35514
   246
    val copy_arg_type = mk_tupleT (map (fn T => T ->> T) newTs);
huffman@35514
   247
    val copy_arg = Free ("f", copy_arg_type);
huffman@35773
   248
    val copy_args = map snd (mk_projs dbinds copy_arg);
huffman@35514
   249
    fun one_copy_rhs (rep_abs, (lhsT, rhsT)) =
huffman@35514
   250
      let
huffman@35514
   251
        val body = map_of_typ thy (newTs ~~ copy_args) rhsT;
huffman@35514
   252
      in
huffman@35514
   253
        mk_cfcomp2 (rep_abs, body)
huffman@35514
   254
      end;
huffman@35514
   255
    val take_functional =
huffman@35514
   256
        big_lambda copy_arg
huffman@35514
   257
          (mk_tuple (map one_copy_rhs (rep_abs_consts ~~ dom_eqns)));
huffman@35514
   258
    val take_rhss =
huffman@35514
   259
      let
huffman@35557
   260
        val n = Free ("n", HOLogic.natT);
huffman@35557
   261
        val rhs = mk_iterate (n, take_functional);
huffman@35514
   262
      in
huffman@35773
   263
        map (lambda n o snd) (mk_projs dbinds rhs)
huffman@35514
   264
      end;
huffman@35514
   265
huffman@35514
   266
    (* define take constants *)
huffman@35773
   267
    fun define_take_const ((dbind, take_rhs), (lhsT, rhsT)) thy =
huffman@35514
   268
      let
huffman@35514
   269
        val take_type = HOLogic.natT --> lhsT ->> lhsT;
huffman@35773
   270
        val take_bind = Binding.suffix_name "_take" dbind;
huffman@35514
   271
        val (take_const, thy) =
huffman@35514
   272
          Sign.declare_const ((take_bind, take_type), NoSyn) thy;
huffman@35514
   273
        val take_eqn = Logic.mk_equals (take_const, take_rhs);
huffman@35514
   274
        val (take_def_thm, thy) =
huffman@35773
   275
            add_qualified_def "take_def" (dbind, take_eqn) thy;
huffman@35514
   276
      in ((take_const, take_def_thm), thy) end;
huffman@35514
   277
    val ((take_consts, take_defs), thy) = thy
huffman@35773
   278
      |> fold_map define_take_const (dbinds ~~ take_rhss ~~ dom_eqns)
huffman@35514
   279
      |>> ListPair.unzip;
huffman@35514
   280
huffman@35514
   281
    (* prove chain_take lemmas *)
huffman@35773
   282
    fun prove_chain_take (take_const, dbind) thy =
huffman@35514
   283
      let
huffman@35514
   284
        val goal = mk_trp (mk_chain take_const);
huffman@35514
   285
        val rules = take_defs @ @{thms chain_iterate ch2ch_fst ch2ch_snd};
huffman@35514
   286
        val tac = simp_tac (HOL_basic_ss addsimps rules) 1;
huffman@35572
   287
        val thm = Goal.prove_global thy [] [] goal (K tac);
huffman@35514
   288
      in
huffman@35773
   289
        add_qualified_simp_thm "chain_take" (dbind, thm) thy
huffman@35514
   290
      end;
huffman@35514
   291
    val (chain_take_thms, thy) =
huffman@35773
   292
      fold_map prove_chain_take (take_consts ~~ dbinds) thy;
huffman@35514
   293
huffman@35514
   294
    (* prove take_0 lemmas *)
huffman@35773
   295
    fun prove_take_0 ((take_const, dbind), (lhsT, rhsT)) thy =
huffman@35514
   296
      let
huffman@35514
   297
        val lhs = take_const $ @{term "0::nat"};
huffman@35514
   298
        val goal = mk_eqs (lhs, mk_bottom (lhsT ->> lhsT));
huffman@35514
   299
        val rules = take_defs @ @{thms iterate_0 fst_strict snd_strict};
huffman@35514
   300
        val tac = simp_tac (HOL_basic_ss addsimps rules) 1;
huffman@35514
   301
        val take_0_thm = Goal.prove_global thy [] [] goal (K tac);
huffman@35514
   302
      in
huffman@40016
   303
        add_qualified_simp_thm "take_0" (dbind, take_0_thm) thy
huffman@35514
   304
      end;
huffman@35514
   305
    val (take_0_thms, thy) =
huffman@35773
   306
      fold_map prove_take_0 (take_consts ~~ dbinds ~~ dom_eqns) thy;
huffman@35514
   307
huffman@35514
   308
    (* prove take_Suc lemmas *)
huffman@35557
   309
    val n = Free ("n", natT);
huffman@35557
   310
    val take_is = map (fn t => t $ n) take_consts;
huffman@35514
   311
    fun prove_take_Suc
huffman@35773
   312
          (((take_const, rep_abs), dbind), (lhsT, rhsT)) thy =
huffman@35514
   313
      let
huffman@35557
   314
        val lhs = take_const $ (@{term Suc} $ n);
huffman@35514
   315
        val body = map_of_typ thy (newTs ~~ take_is) rhsT;
huffman@35514
   316
        val rhs = mk_cfcomp2 (rep_abs, body);
huffman@35514
   317
        val goal = mk_eqs (lhs, rhs);
huffman@35514
   318
        val simps = @{thms iterate_Suc fst_conv snd_conv}
huffman@35514
   319
        val rules = take_defs @ simps;
huffman@35514
   320
        val tac = simp_tac (beta_ss addsimps rules) 1;
huffman@35514
   321
        val take_Suc_thm = Goal.prove_global thy [] [] goal (K tac);
huffman@35514
   322
      in
huffman@35773
   323
        add_qualified_thm "take_Suc" (dbind, take_Suc_thm) thy
huffman@35514
   324
      end;
huffman@35514
   325
    val (take_Suc_thms, thy) =
huffman@35514
   326
      fold_map prove_take_Suc
huffman@35773
   327
        (take_consts ~~ rep_abs_consts ~~ dbinds ~~ dom_eqns) thy;
huffman@35514
   328
huffman@35514
   329
    (* prove deflation theorems for take functions *)
huffman@35514
   330
    val deflation_abs_rep_thms = map deflation_abs_rep iso_infos;
huffman@35514
   331
    val deflation_take_thm =
huffman@35514
   332
      let
huffman@35557
   333
        val n = Free ("n", natT);
huffman@35557
   334
        fun mk_goal take_const = mk_deflation (take_const $ n);
huffman@35514
   335
        val goal = mk_trp (foldr1 mk_conj (map mk_goal take_consts));
huffman@35514
   336
        val adm_rules =
huffman@35514
   337
          @{thms adm_conj adm_subst [OF _ adm_deflation]
huffman@35514
   338
                 cont2cont_fst cont2cont_snd cont_id};
huffman@35514
   339
        val bottom_rules =
huffman@35514
   340
          take_0_thms @ @{thms deflation_UU simp_thms};
huffman@35514
   341
        val deflation_rules =
huffman@35514
   342
          @{thms conjI deflation_ID}
huffman@35514
   343
          @ deflation_abs_rep_thms
huffman@40216
   344
          @ get_deflation_thms thy;
huffman@35514
   345
      in
huffman@35514
   346
        Goal.prove_global thy [] [] goal (fn _ =>
huffman@35514
   347
         EVERY
huffman@35514
   348
          [rtac @{thm nat.induct} 1,
huffman@35514
   349
           simp_tac (HOL_basic_ss addsimps bottom_rules) 1,
huffman@35514
   350
           asm_simp_tac (HOL_basic_ss addsimps take_Suc_thms) 1,
huffman@35514
   351
           REPEAT (etac @{thm conjE} 1
huffman@35514
   352
                   ORELSE resolve_tac deflation_rules 1
huffman@35514
   353
                   ORELSE atac 1)])
huffman@35514
   354
      end;
huffman@35514
   355
    fun conjuncts [] thm = []
huffman@35514
   356
      | conjuncts (n::[]) thm = [(n, thm)]
huffman@35514
   357
      | conjuncts (n::ns) thm = let
huffman@35514
   358
          val thmL = thm RS @{thm conjunct1};
huffman@35514
   359
          val thmR = thm RS @{thm conjunct2};
huffman@35514
   360
        in (n, thmL):: conjuncts ns thmR end;
huffman@35514
   361
    val (deflation_take_thms, thy) =
huffman@35514
   362
      fold_map (add_qualified_thm "deflation_take")
huffman@36241
   363
        (map (apsnd Drule.zero_var_indexes)
huffman@35773
   364
          (conjuncts dbinds deflation_take_thm)) thy;
huffman@35514
   365
huffman@35514
   366
    (* prove strictness of take functions *)
huffman@35773
   367
    fun prove_take_strict (deflation_take, dbind) thy =
huffman@35514
   368
      let
huffman@35572
   369
        val take_strict_thm =
huffman@36241
   370
            Drule.zero_var_indexes
huffman@36241
   371
              (@{thm deflation_strict} OF [deflation_take]);
huffman@35514
   372
      in
huffman@40016
   373
        add_qualified_simp_thm "take_strict" (dbind, take_strict_thm) thy
huffman@35514
   374
      end;
huffman@35514
   375
    val (take_strict_thms, thy) =
huffman@35572
   376
      fold_map prove_take_strict
huffman@35773
   377
        (deflation_take_thms ~~ dbinds) thy;
huffman@35514
   378
huffman@35514
   379
    (* prove take/take rules *)
huffman@35773
   380
    fun prove_take_take ((chain_take, deflation_take), dbind) thy =
huffman@35514
   381
      let
huffman@35514
   382
        val take_take_thm =
huffman@36241
   383
            Drule.zero_var_indexes
huffman@36241
   384
              (@{thm deflation_chain_min} OF [chain_take, deflation_take]);
huffman@35514
   385
      in
huffman@35773
   386
        add_qualified_thm "take_take" (dbind, take_take_thm) thy
huffman@35514
   387
      end;
huffman@35514
   388
    val (take_take_thms, thy) =
huffman@35514
   389
      fold_map prove_take_take
huffman@35773
   390
        (chain_take_thms ~~ deflation_take_thms ~~ dbinds) thy;
huffman@35514
   391
huffman@35572
   392
    (* prove take_below rules *)
huffman@35773
   393
    fun prove_take_below (deflation_take, dbind) thy =
huffman@35572
   394
      let
huffman@35572
   395
        val take_below_thm =
huffman@36241
   396
            Drule.zero_var_indexes
huffman@36241
   397
              (@{thm deflation.below} OF [deflation_take]);
huffman@35572
   398
      in
huffman@35773
   399
        add_qualified_thm "take_below" (dbind, take_below_thm) thy
huffman@35572
   400
      end;
huffman@35572
   401
    val (take_below_thms, thy) =
huffman@35572
   402
      fold_map prove_take_below
huffman@35773
   403
        (deflation_take_thms ~~ dbinds) thy;
huffman@35572
   404
huffman@35515
   405
    (* define finiteness predicates *)
huffman@35773
   406
    fun define_finite_const ((dbind, take_const), (lhsT, rhsT)) thy =
huffman@35515
   407
      let
huffman@35515
   408
        val finite_type = lhsT --> boolT;
huffman@35773
   409
        val finite_bind = Binding.suffix_name "_finite" dbind;
huffman@35515
   410
        val (finite_const, thy) =
huffman@35515
   411
          Sign.declare_const ((finite_bind, finite_type), NoSyn) thy;
huffman@35515
   412
        val x = Free ("x", lhsT);
huffman@35557
   413
        val n = Free ("n", natT);
huffman@35515
   414
        val finite_rhs =
huffman@35515
   415
          lambda x (HOLogic.exists_const natT $
huffman@35557
   416
            (lambda n (mk_eq (mk_capply (take_const $ n, x), x))));
huffman@35515
   417
        val finite_eqn = Logic.mk_equals (finite_const, finite_rhs);
huffman@35515
   418
        val (finite_def_thm, thy) =
huffman@35773
   419
            add_qualified_def "finite_def" (dbind, finite_eqn) thy;
huffman@35515
   420
      in ((finite_const, finite_def_thm), thy) end;
huffman@35515
   421
    val ((finite_consts, finite_defs), thy) = thy
huffman@35773
   422
      |> fold_map define_finite_const (dbinds ~~ take_consts ~~ dom_eqns)
huffman@35515
   423
      |>> ListPair.unzip;
huffman@35515
   424
huffman@35514
   425
    val result =
huffman@35514
   426
      {
huffman@35514
   427
        take_consts = take_consts,
huffman@35514
   428
        take_defs = take_defs,
huffman@35514
   429
        chain_take_thms = chain_take_thms,
huffman@35514
   430
        take_0_thms = take_0_thms,
huffman@35514
   431
        take_Suc_thms = take_Suc_thms,
huffman@35515
   432
        deflation_take_thms = deflation_take_thms,
huffman@40015
   433
        take_strict_thms = take_strict_thms,
huffman@35515
   434
        finite_consts = finite_consts,
huffman@35515
   435
        finite_defs = finite_defs
huffman@35514
   436
      };
huffman@35514
   437
huffman@35514
   438
  in
huffman@35514
   439
    (result, thy)
huffman@35514
   440
  end;
huffman@35514
   441
huffman@35655
   442
fun prove_finite_take_induct
huffman@35655
   443
    (spec : (binding * iso_info) list)
huffman@35655
   444
    (take_info : take_info)
huffman@35655
   445
    (lub_take_thms : thm list)
huffman@35655
   446
    (thy : theory) =
huffman@35655
   447
  let
huffman@35773
   448
    val dbinds = map fst spec;
huffman@35655
   449
    val iso_infos = map snd spec;
huffman@35655
   450
    val absTs = map #absT iso_infos;
huffman@35655
   451
    val {take_consts, ...} = take_info;
huffman@35655
   452
    val {chain_take_thms, take_0_thms, take_Suc_thms, ...} = take_info;
huffman@35655
   453
    val {finite_consts, finite_defs, ...} = take_info;
huffman@35655
   454
huffman@35655
   455
    val decisive_lemma =
huffman@35655
   456
      let
wenzelm@37165
   457
        fun iso_locale (info : iso_info) =
huffman@35655
   458
            @{thm iso.intro} OF [#abs_inverse info, #rep_inverse info];
huffman@35655
   459
        val iso_locale_thms = map iso_locale iso_infos;
huffman@35655
   460
        val decisive_abs_rep_thms =
huffman@35655
   461
            map (fn x => @{thm decisive_abs_rep} OF [x]) iso_locale_thms;
huffman@35655
   462
        val n = Free ("n", @{typ nat});
huffman@35655
   463
        fun mk_decisive t =
huffman@35655
   464
            Const (@{const_name decisive}, fastype_of t --> boolT) $ t;
huffman@35655
   465
        fun f take_const = mk_decisive (take_const $ n);
huffman@35655
   466
        val goal = mk_trp (foldr1 mk_conj (map f take_consts));
huffman@35655
   467
        val rules0 = @{thm decisive_bottom} :: take_0_thms;
huffman@35655
   468
        val rules1 =
huffman@35655
   469
            take_Suc_thms @ decisive_abs_rep_thms
huffman@35655
   470
            @ @{thms decisive_ID decisive_ssum_map decisive_sprod_map};
huffman@35655
   471
        val tac = EVERY [
huffman@35655
   472
            rtac @{thm nat.induct} 1,
huffman@35655
   473
            simp_tac (HOL_ss addsimps rules0) 1,
huffman@35655
   474
            asm_simp_tac (HOL_ss addsimps rules1) 1];
huffman@35655
   475
      in Goal.prove_global thy [] [] goal (K tac) end;
huffman@35655
   476
    fun conjuncts 1 thm = [thm]
huffman@35655
   477
      | conjuncts n thm = let
huffman@35655
   478
          val thmL = thm RS @{thm conjunct1};
huffman@35655
   479
          val thmR = thm RS @{thm conjunct2};
huffman@35655
   480
        in thmL :: conjuncts (n-1) thmR end;
huffman@35655
   481
    val decisive_thms = conjuncts (length spec) decisive_lemma;
huffman@35655
   482
huffman@35655
   483
    fun prove_finite_thm (absT, finite_const) =
huffman@35655
   484
      let
huffman@35655
   485
        val goal = mk_trp (finite_const $ Free ("x", absT));
huffman@35655
   486
        val tac =
huffman@35655
   487
            EVERY [
huffman@35655
   488
            rewrite_goals_tac finite_defs,
huffman@35655
   489
            rtac @{thm lub_ID_finite} 1,
huffman@35655
   490
            resolve_tac chain_take_thms 1,
huffman@35655
   491
            resolve_tac lub_take_thms 1,
huffman@35655
   492
            resolve_tac decisive_thms 1];
huffman@35655
   493
      in
huffman@35655
   494
        Goal.prove_global thy [] [] goal (K tac)
huffman@35655
   495
      end;
huffman@35655
   496
    val finite_thms =
huffman@35655
   497
        map prove_finite_thm (absTs ~~ finite_consts);
huffman@35655
   498
huffman@35655
   499
    fun prove_take_induct ((ch_take, lub_take), decisive) =
huffman@35655
   500
        Drule.export_without_context
huffman@35655
   501
          (@{thm lub_ID_finite_take_induct} OF [ch_take, lub_take, decisive]);
huffman@35655
   502
    val take_induct_thms =
huffman@35655
   503
        map prove_take_induct
huffman@35655
   504
          (chain_take_thms ~~ lub_take_thms ~~ decisive_thms);
huffman@35655
   505
huffman@35655
   506
    val thy = thy
huffman@35655
   507
        |> fold (snd oo add_qualified_thm "finite")
huffman@35773
   508
            (dbinds ~~ finite_thms)
huffman@35655
   509
        |> fold (snd oo add_qualified_thm "take_induct")
huffman@35773
   510
            (dbinds ~~ take_induct_thms);
huffman@35655
   511
  in
huffman@35655
   512
    ((finite_thms, take_induct_thms), thy)
huffman@35655
   513
  end;
huffman@35655
   514
huffman@35654
   515
fun add_lub_take_theorems
huffman@35654
   516
    (spec : (binding * iso_info) list)
huffman@35654
   517
    (take_info : take_info)
huffman@35654
   518
    (lub_take_thms : thm list)
huffman@35654
   519
    (thy : theory) =
huffman@35654
   520
  let
huffman@35654
   521
huffman@35654
   522
    (* retrieve components of spec *)
huffman@35773
   523
    val dbinds = map fst spec;
huffman@35654
   524
    val iso_infos = map snd spec;
huffman@35655
   525
    val absTs = map #absT iso_infos;
huffman@35655
   526
    val repTs = map #repT iso_infos;
huffman@35655
   527
    val {take_consts, take_0_thms, take_Suc_thms, ...} = take_info;
huffman@35654
   528
    val {chain_take_thms, deflation_take_thms, ...} = take_info;
huffman@35654
   529
huffman@35654
   530
    (* prove take lemmas *)
huffman@35773
   531
    fun prove_take_lemma ((chain_take, lub_take), dbind) thy =
huffman@35654
   532
      let
huffman@35654
   533
        val take_lemma =
huffman@35654
   534
            Drule.export_without_context
huffman@35654
   535
              (@{thm lub_ID_take_lemma} OF [chain_take, lub_take]);
huffman@35654
   536
      in
huffman@35773
   537
        add_qualified_thm "take_lemma" (dbind, take_lemma) thy
huffman@35654
   538
      end;
huffman@35654
   539
    val (take_lemma_thms, thy) =
huffman@35654
   540
      fold_map prove_take_lemma
huffman@35773
   541
        (chain_take_thms ~~ lub_take_thms ~~ dbinds) thy;
huffman@35654
   542
huffman@35654
   543
    (* prove reach lemmas *)
huffman@35773
   544
    fun prove_reach_lemma ((chain_take, lub_take), dbind) thy =
huffman@35654
   545
      let
huffman@35654
   546
        val thm =
huffman@36241
   547
            Drule.zero_var_indexes
huffman@35654
   548
              (@{thm lub_ID_reach} OF [chain_take, lub_take]);
huffman@35654
   549
      in
huffman@35773
   550
        add_qualified_thm "reach" (dbind, thm) thy
huffman@35654
   551
      end;
huffman@35654
   552
    val (reach_thms, thy) =
huffman@35654
   553
      fold_map prove_reach_lemma
huffman@35773
   554
        (chain_take_thms ~~ lub_take_thms ~~ dbinds) thy;
huffman@35654
   555
huffman@35655
   556
    (* test for finiteness of domain definitions *)
huffman@35655
   557
    local
huffman@35655
   558
      val types = [@{type_name ssum}, @{type_name sprod}];
haftmann@36692
   559
      fun finite d T = if member (op =) absTs T then d else finite' d T
huffman@35655
   560
      and finite' d (Type (c, Ts)) =
haftmann@36692
   561
          let val d' = d andalso member (op =) types c;
huffman@35655
   562
          in forall (finite d') Ts end
huffman@35655
   563
        | finite' d _ = true;
huffman@35655
   564
    in
huffman@35655
   565
      val is_finite = forall (finite true) repTs;
huffman@35655
   566
    end;
huffman@35654
   567
huffman@35655
   568
    val ((finite_thms, take_induct_thms), thy) =
huffman@35655
   569
      if is_finite
huffman@35655
   570
      then
huffman@35655
   571
        let
huffman@35655
   572
          val ((finites, take_inducts), thy) =
huffman@35655
   573
              prove_finite_take_induct spec take_info lub_take_thms thy;
huffman@35655
   574
        in
huffman@35655
   575
          ((SOME finites, take_inducts), thy)
huffman@35655
   576
        end
huffman@35655
   577
      else
huffman@35655
   578
        let
huffman@35655
   579
          fun prove_take_induct (chain_take, lub_take) =
huffman@36241
   580
              Drule.zero_var_indexes
huffman@35655
   581
                (@{thm lub_ID_take_induct} OF [chain_take, lub_take]);
huffman@35655
   582
          val take_inducts =
huffman@35655
   583
              map prove_take_induct (chain_take_thms ~~ lub_take_thms);
huffman@35655
   584
          val thy = fold (snd oo add_qualified_thm "take_induct")
huffman@35773
   585
                         (dbinds ~~ take_inducts) thy;
huffman@35655
   586
        in
huffman@35655
   587
          ((NONE, take_inducts), thy)
huffman@35655
   588
        end;
huffman@35655
   589
huffman@35656
   590
    val result =
huffman@35656
   591
      {
huffman@35659
   592
        take_consts         = #take_consts take_info,
huffman@35659
   593
        take_defs           = #take_defs take_info,
huffman@35659
   594
        chain_take_thms     = #chain_take_thms take_info,
huffman@35659
   595
        take_0_thms         = #take_0_thms take_info,
huffman@35659
   596
        take_Suc_thms       = #take_Suc_thms take_info,
huffman@35659
   597
        deflation_take_thms = #deflation_take_thms take_info,
huffman@40015
   598
        take_strict_thms    = #take_strict_thms take_info,
huffman@35659
   599
        finite_consts       = #finite_consts take_info,
huffman@35659
   600
        finite_defs         = #finite_defs take_info,
huffman@35659
   601
        lub_take_thms       = lub_take_thms,
huffman@35659
   602
        reach_thms          = reach_thms,
huffman@35659
   603
        take_lemma_thms     = take_lemma_thms,
huffman@35659
   604
        is_finite           = is_finite,
huffman@35659
   605
        take_induct_thms    = take_induct_thms
huffman@35656
   606
      };
huffman@35654
   607
  in
huffman@35654
   608
    (result, thy)
huffman@35654
   609
  end;
huffman@35654
   610
huffman@35514
   611
end;