src/HOL/Nominal/nominal_package.ML
author berghofe
Fri Apr 28 15:54:34 2006 +0200 (2006-04-28)
changeset 19494 2e909d5309f4
parent 19489 4441b637871b
child 19635 f7aa7d174343
permissions -rw-r--r--
Renamed "nominal" theory to "Nominal".
berghofe@19494
     1
(*  Title:      HOL/Nominal/nominal_package.ML
berghofe@19494
     2
    ID:         $Id$
berghofe@19494
     3
    Author:     Stefan Berghofer and Christian Urban, TU Muenchen
berghofe@19494
     4
berghofe@19494
     5
Nominal datatype package for Isabelle/HOL.
berghofe@19494
     6
*)
berghofe@17870
     7
berghofe@17870
     8
signature NOMINAL_PACKAGE =
berghofe@17870
     9
sig
berghofe@17870
    10
  val add_nominal_datatype : bool -> string list -> (string list * bstring * mixfix *
berghofe@18068
    11
    (bstring * string list * mixfix) list) list -> theory -> theory
berghofe@17870
    12
end
berghofe@17870
    13
berghofe@18068
    14
structure NominalPackage : NOMINAL_PACKAGE =
berghofe@17870
    15
struct
berghofe@17870
    16
berghofe@17870
    17
open DatatypeAux;
berghofe@18068
    18
open NominalAtoms;
berghofe@17870
    19
berghofe@18016
    20
(** FIXME: DatatypePackage should export this function **)
berghofe@18016
    21
berghofe@18016
    22
local
berghofe@18016
    23
berghofe@18016
    24
fun dt_recs (DtTFree _) = []
berghofe@18016
    25
  | dt_recs (DtType (_, dts)) = List.concat (map dt_recs dts)
berghofe@18016
    26
  | dt_recs (DtRec i) = [i];
berghofe@18016
    27
berghofe@18016
    28
fun dt_cases (descr: descr) (_, args, constrs) =
berghofe@18016
    29
  let
berghofe@18016
    30
    fun the_bname i = Sign.base_name (#1 (valOf (AList.lookup (op =) descr i)));
berghofe@19133
    31
    val bnames = map the_bname (distinct op = (List.concat (map dt_recs args)));
berghofe@18016
    32
  in map (fn (c, _) => space_implode "_" (Sign.base_name c :: bnames)) constrs end;
berghofe@18016
    33
berghofe@18016
    34
berghofe@18016
    35
fun induct_cases descr =
berghofe@18016
    36
  DatatypeProp.indexify_names (List.concat (map (dt_cases descr) (map #2 descr)));
berghofe@18016
    37
berghofe@18016
    38
fun exhaust_cases descr i = dt_cases descr (valOf (AList.lookup (op =) descr i));
berghofe@18016
    39
berghofe@18016
    40
in
berghofe@18016
    41
berghofe@18016
    42
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr);
berghofe@18016
    43
berghofe@18016
    44
fun mk_case_names_exhausts descr new =
berghofe@18016
    45
  map (RuleCases.case_names o exhaust_cases descr o #1)
berghofe@18016
    46
    (List.filter (fn ((_, (name, _, _))) => name mem_string new) descr);
berghofe@18016
    47
berghofe@18016
    48
end;
berghofe@18016
    49
berghofe@18016
    50
(*******************************)
berghofe@18016
    51
berghofe@17870
    52
val (_ $ (_ $ (_ $ (distinct_f $ _) $ _))) = hd (prems_of distinct_lemma);
berghofe@17870
    53
berghofe@17870
    54
fun read_typ sign ((Ts, sorts), str) =
berghofe@17870
    55
  let
berghofe@17870
    56
    val T = Type.no_tvars (Sign.read_typ (sign, (AList.lookup op =)
berghofe@17870
    57
      (map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg
berghofe@17870
    58
  in (Ts @ [T], add_typ_tfrees (T, sorts)) end;
berghofe@17870
    59
berghofe@17870
    60
(** taken from HOL/Tools/datatype_aux.ML **)
berghofe@17870
    61
berghofe@17870
    62
fun indtac indrule indnames i st =
berghofe@17870
    63
  let
berghofe@17870
    64
    val ts = HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of indrule));
berghofe@17870
    65
    val ts' = HOLogic.dest_conj (HOLogic.dest_Trueprop
berghofe@17870
    66
      (Logic.strip_imp_concl (List.nth (prems_of st, i - 1))));
berghofe@17870
    67
    val getP = if can HOLogic.dest_imp (hd ts) then
berghofe@17870
    68
      (apfst SOME) o HOLogic.dest_imp else pair NONE;
berghofe@17870
    69
    fun abstr (t1, t2) = (case t1 of
berghofe@17870
    70
        NONE => (case filter (fn Free (s, _) => s mem indnames | _ => false)
berghofe@17870
    71
              (term_frees t2) of
berghofe@17870
    72
            [Free (s, T)] => absfree (s, T, t2)
berghofe@17870
    73
          | _ => sys_error "indtac")
berghofe@17870
    74
      | SOME (_ $ t' $ _) => Abs ("x", fastype_of t', abstract_over (t', t2)))
berghofe@17870
    75
    val cert = cterm_of (Thm.sign_of_thm st);
berghofe@17870
    76
    val Ps = map (cert o head_of o snd o getP) ts;
berghofe@17870
    77
    val indrule' = cterm_instantiate (Ps ~~
berghofe@17870
    78
      (map (cert o abstr o getP) ts')) indrule
berghofe@17870
    79
  in
berghofe@17870
    80
    rtac indrule' i st
berghofe@17870
    81
  end;
berghofe@17870
    82
berghofe@18658
    83
fun mk_subgoal i f st =
berghofe@18658
    84
  let
berghofe@18658
    85
    val cg = List.nth (cprems_of st, i - 1);
berghofe@18658
    86
    val g = term_of cg;
berghofe@18658
    87
    val revcut_rl' = Thm.lift_rule cg revcut_rl;
berghofe@18658
    88
    val v = head_of (Logic.strip_assums_concl (hd (prems_of revcut_rl')));
berghofe@18658
    89
    val ps = Logic.strip_params g;
berghofe@18658
    90
    val cert = cterm_of (sign_of_thm st);
berghofe@18658
    91
  in
berghofe@18658
    92
    compose_tac (false,
berghofe@18658
    93
      Thm.instantiate ([], [(cert v, cert (list_abs (ps,
berghofe@18658
    94
        f (rev ps) (Logic.strip_assums_hyp g) (Logic.strip_assums_concl g))))])
berghofe@18658
    95
      revcut_rl', 2) i st
berghofe@18658
    96
  end;
berghofe@18658
    97
berghofe@18658
    98
(** simplification procedure for sorting permutations **)
berghofe@18658
    99
berghofe@18658
   100
val dj_cp = thm "dj_cp";
berghofe@18658
   101
berghofe@18658
   102
fun dest_permT (Type ("fun", [Type ("List.list", [Type ("*", [T, _])]),
berghofe@18658
   103
      Type ("fun", [_, U])])) = (T, U);
berghofe@18658
   104
berghofe@19494
   105
fun permTs_of (Const ("Nominal.perm", T) $ t $ u) = fst (dest_permT T) :: permTs_of u
berghofe@18658
   106
  | permTs_of _ = [];
berghofe@18658
   107
berghofe@19494
   108
fun perm_simproc' thy ss (Const ("Nominal.perm", T) $ t $ (u as Const ("Nominal.perm", U) $ r $ s)) =
berghofe@18658
   109
      let
berghofe@18658
   110
        val (aT as Type (a, []), S) = dest_permT T;
berghofe@18658
   111
        val (bT as Type (b, []), _) = dest_permT U
berghofe@18658
   112
      in if aT mem permTs_of u andalso aT <> bT then
berghofe@18658
   113
          let
berghofe@18658
   114
            val a' = Sign.base_name a;
berghofe@18658
   115
            val b' = Sign.base_name b;
berghofe@18658
   116
            val cp = PureThy.get_thm thy (Name ("cp_" ^ a' ^ "_" ^ b' ^ "_inst"));
berghofe@18658
   117
            val dj = PureThy.get_thm thy (Name ("dj_" ^ b' ^ "_" ^ a'));
berghofe@18658
   118
            val dj_cp' = [cp, dj] MRS dj_cp;
berghofe@18658
   119
            val cert = SOME o cterm_of thy
berghofe@18658
   120
          in
berghofe@18658
   121
            SOME (mk_meta_eq (Drule.instantiate' [SOME (ctyp_of thy S)]
berghofe@18658
   122
              [cert t, cert r, cert s] dj_cp'))
berghofe@18658
   123
          end
berghofe@18658
   124
        else NONE
berghofe@18658
   125
      end
berghofe@18658
   126
  | perm_simproc' thy ss _ = NONE;
berghofe@18658
   127
berghofe@18658
   128
val perm_simproc =
berghofe@18658
   129
  Simplifier.simproc (the_context ()) "perm_simp" ["pi1 \\<bullet> (pi2 \\<bullet> x)"] perm_simproc';
berghofe@18658
   130
berghofe@18658
   131
val allE_Nil = read_instantiate_sg (the_context()) [("x", "[]")] allE;
berghofe@18658
   132
berghofe@18658
   133
val meta_spec = thm "meta_spec";
berghofe@18658
   134
wenzelm@18582
   135
fun projections rule =
wenzelm@18582
   136
  ProjectRule.projections rule
wenzelm@18582
   137
  |> map (standard #> RuleCases.save rule);
wenzelm@18582
   138
berghofe@18658
   139
fun norm_sort thy = Sorts.norm_sort (snd (#classes (Type.rep_tsig (Sign.tsig_of thy))));
berghofe@18658
   140
berghofe@17870
   141
fun gen_add_nominal_datatype prep_typ err flat_names new_type_names dts thy =
berghofe@17870
   142
  let
berghofe@17870
   143
    (* this theory is used just for parsing *)
berghofe@17870
   144
  
berghofe@17870
   145
    val tmp_thy = thy |>
berghofe@17870
   146
      Theory.copy |>
berghofe@17870
   147
      Theory.add_types (map (fn (tvs, tname, mx, _) =>
berghofe@17870
   148
        (tname, length tvs, mx)) dts);
berghofe@17870
   149
berghofe@17870
   150
    val sign = Theory.sign_of tmp_thy;
berghofe@17870
   151
berghofe@17870
   152
    val atoms = atoms_of thy;
berghofe@17870
   153
    val classes = map (NameSpace.map_base (fn s => "pt_" ^ s)) atoms;
berghofe@17870
   154
    val cp_classes = List.concat (map (fn atom1 => map (fn atom2 =>
berghofe@17870
   155
      Sign.intern_class thy ("cp_" ^ Sign.base_name atom1 ^ "_" ^
berghofe@17870
   156
        Sign.base_name atom2)) atoms) atoms);
berghofe@17870
   157
    fun augment_sort S = S union classes;
berghofe@17870
   158
    val augment_sort_typ = map_type_tfree (fn (s, S) => TFree (s, augment_sort S));
berghofe@17870
   159
berghofe@17870
   160
    fun prep_constr ((constrs, sorts), (cname, cargs, mx)) =
berghofe@17870
   161
      let val (cargs', sorts') = Library.foldl (prep_typ sign) (([], sorts), cargs)
berghofe@17870
   162
      in (constrs @ [(cname, cargs', mx)], sorts') end
berghofe@17870
   163
berghofe@17870
   164
    fun prep_dt_spec ((dts, sorts), (tvs, tname, mx, constrs)) =
berghofe@17870
   165
      let val (constrs', sorts') = Library.foldl prep_constr (([], sorts), constrs)
berghofe@17870
   166
      in (dts @ [(tvs, tname, mx, constrs')], sorts') end
berghofe@17870
   167
berghofe@17870
   168
    val (dts', sorts) = Library.foldl prep_dt_spec (([], []), dts);
berghofe@17870
   169
    val sorts' = map (apsnd augment_sort) sorts;
berghofe@17870
   170
    val tyvars = map #1 dts';
berghofe@17870
   171
berghofe@17870
   172
    val types_syntax = map (fn (tvs, tname, mx, constrs) => (tname, mx)) dts';
berghofe@17870
   173
    val constr_syntax = map (fn (tvs, tname, mx, constrs) =>
berghofe@17870
   174
      map (fn (cname, cargs, mx) => (cname, mx)) constrs) dts';
berghofe@17870
   175
berghofe@17870
   176
    val ps = map (fn (_, n, _, _) =>
berghofe@17870
   177
      (Sign.full_name sign n, Sign.full_name sign (n ^ "_Rep"))) dts;
berghofe@17870
   178
    val rps = map Library.swap ps;
berghofe@17870
   179
berghofe@19494
   180
    fun replace_types (Type ("Nominal.ABS", [T, U])) = 
berghofe@19494
   181
          Type ("fun", [T, Type ("Nominal.noption", [replace_types U])])
berghofe@17870
   182
      | replace_types (Type (s, Ts)) =
berghofe@17870
   183
          Type (getOpt (AList.lookup op = ps s, s), map replace_types Ts)
berghofe@17870
   184
      | replace_types T = T;
berghofe@17870
   185
berghofe@17870
   186
    fun replace_types' (Type (s, Ts)) =
berghofe@17870
   187
          Type (getOpt (AList.lookup op = rps s, s), map replace_types' Ts)
berghofe@17870
   188
      | replace_types' T = T;
berghofe@17870
   189
berghofe@17870
   190
    val dts'' = map (fn (tvs, tname, mx, constrs) => (tvs, tname ^ "_Rep", NoSyn,
berghofe@17870
   191
      map (fn (cname, cargs, mx) => (cname,
berghofe@17870
   192
        map (augment_sort_typ o replace_types) cargs, NoSyn)) constrs)) dts';
berghofe@17870
   193
berghofe@17870
   194
    val new_type_names' = map (fn n => n ^ "_Rep") new_type_names;
berghofe@17870
   195
    val full_new_type_names' = map (Sign.full_name (sign_of thy)) new_type_names';
berghofe@17870
   196
urbanc@18045
   197
    val ({induction, ...},thy1) =
berghofe@17870
   198
      DatatypePackage.add_datatype_i err flat_names new_type_names' dts'' thy;
berghofe@17870
   199
berghofe@17870
   200
    val SOME {descr, ...} = Symtab.lookup
berghofe@17870
   201
      (DatatypePackage.get_datatypes thy1) (hd full_new_type_names');
berghofe@18107
   202
    fun nth_dtyp i = typ_of_dtyp descr sorts' (DtRec i);
berghofe@18107
   203
berghofe@17870
   204
    (**** define permutation functions ****)
berghofe@17870
   205
berghofe@17870
   206
    val permT = mk_permT (TFree ("'x", HOLogic.typeS));
berghofe@17870
   207
    val pi = Free ("pi", permT);
berghofe@17870
   208
    val perm_types = map (fn (i, _) =>
berghofe@17870
   209
      let val T = nth_dtyp i
berghofe@17870
   210
      in permT --> T --> T end) descr;
berghofe@19494
   211
    val perm_names = replicate (length new_type_names) "Nominal.perm" @
berghofe@17870
   212
      DatatypeProp.indexify_names (map (fn i => Sign.full_name (sign_of thy1)
berghofe@17870
   213
        ("perm_" ^ name_of_typ (nth_dtyp i)))
berghofe@17870
   214
          (length new_type_names upto length descr - 1));
berghofe@17870
   215
    val perm_names_types = perm_names ~~ perm_types;
berghofe@17870
   216
berghofe@17870
   217
    val perm_eqs = List.concat (map (fn (i, (_, _, constrs)) =>
berghofe@17870
   218
      let val T = nth_dtyp i
berghofe@17870
   219
      in map (fn (cname, dts) => 
berghofe@17870
   220
        let
berghofe@18107
   221
          val Ts = map (typ_of_dtyp descr sorts') dts;
berghofe@17870
   222
          val names = DatatypeProp.make_tnames Ts;
berghofe@17870
   223
          val args = map Free (names ~~ Ts);
berghofe@17870
   224
          val c = Const (cname, Ts ---> T);
berghofe@17870
   225
          fun perm_arg (dt, x) =
berghofe@17870
   226
            let val T = type_of x
berghofe@17870
   227
            in if is_rec_type dt then
berghofe@17870
   228
                let val (Us, _) = strip_type T
berghofe@17870
   229
                in list_abs (map (pair "x") Us,
berghofe@17870
   230
                  Const (List.nth (perm_names_types, body_index dt)) $ pi $
berghofe@17870
   231
                    list_comb (x, map (fn (i, U) =>
berghofe@19494
   232
                      Const ("Nominal.perm", permT --> U --> U) $
berghofe@17870
   233
                        (Const ("List.rev", permT --> permT) $ pi) $
berghofe@17870
   234
                        Bound i) ((length Us - 1 downto 0) ~~ Us)))
berghofe@17870
   235
                end
berghofe@19494
   236
              else Const ("Nominal.perm", permT --> T --> T) $ pi $ x
berghofe@17870
   237
            end;  
berghofe@17870
   238
        in
berghofe@17870
   239
          (("", HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17870
   240
            (Const (List.nth (perm_names_types, i)) $
berghofe@17870
   241
               Free ("pi", mk_permT (TFree ("'x", HOLogic.typeS))) $
berghofe@17870
   242
               list_comb (c, args),
berghofe@17870
   243
             list_comb (c, map perm_arg (dts ~~ args))))), [])
berghofe@17870
   244
        end) constrs
berghofe@17870
   245
      end) descr);
berghofe@17870
   246
berghofe@17870
   247
    val (thy2, perm_simps) = thy1 |>
berghofe@17870
   248
      Theory.add_consts_i (map (fn (s, T) => (Sign.base_name s, T, NoSyn))
berghofe@17870
   249
        (List.drop (perm_names_types, length new_type_names))) |>
berghofe@17870
   250
      PrimrecPackage.add_primrec_i "" perm_eqs;
berghofe@17870
   251
berghofe@17870
   252
    (**** prove that permutation functions introduced by unfolding are ****)
berghofe@17870
   253
    (**** equivalent to already existing permutation functions         ****)
berghofe@17870
   254
berghofe@17870
   255
    val _ = warning ("length descr: " ^ string_of_int (length descr));
berghofe@17870
   256
    val _ = warning ("length new_type_names: " ^ string_of_int (length new_type_names));
berghofe@17870
   257
berghofe@17870
   258
    val perm_indnames = DatatypeProp.make_tnames (map body_type perm_types);
berghofe@17870
   259
    val perm_fun_def = PureThy.get_thm thy2 (Name "perm_fun_def");
berghofe@17870
   260
berghofe@17870
   261
    val unfolded_perm_eq_thms =
berghofe@17870
   262
      if length descr = length new_type_names then []
berghofe@17870
   263
      else map standard (List.drop (split_conj_thm
berghofe@18010
   264
        (Goal.prove thy2 [] []
berghofe@17870
   265
          (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   266
            (map (fn (c as (s, T), x) =>
berghofe@17870
   267
               let val [T1, T2] = binder_types T
berghofe@17870
   268
               in HOLogic.mk_eq (Const c $ pi $ Free (x, T2),
berghofe@19494
   269
                 Const ("Nominal.perm", T) $ pi $ Free (x, T2))
berghofe@17870
   270
               end)
berghofe@18010
   271
             (perm_names_types ~~ perm_indnames))))
berghofe@18010
   272
          (fn _ => EVERY [indtac induction perm_indnames 1,
berghofe@17870
   273
            ALLGOALS (asm_full_simp_tac
berghofe@17870
   274
              (simpset_of thy2 addsimps [perm_fun_def]))])),
berghofe@17870
   275
        length new_type_names));
berghofe@17870
   276
berghofe@17870
   277
    (**** prove [] \<bullet> t = t ****)
berghofe@17870
   278
berghofe@17870
   279
    val _ = warning "perm_empty_thms";
berghofe@17870
   280
berghofe@17870
   281
    val perm_empty_thms = List.concat (map (fn a =>
berghofe@17870
   282
      let val permT = mk_permT (Type (a, []))
berghofe@17870
   283
      in map standard (List.take (split_conj_thm
berghofe@18010
   284
        (Goal.prove thy2 [] []
berghofe@17870
   285
          (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   286
            (map (fn ((s, T), x) => HOLogic.mk_eq
berghofe@17870
   287
                (Const (s, permT --> T --> T) $
berghofe@17870
   288
                   Const ("List.list.Nil", permT) $ Free (x, T),
berghofe@17870
   289
                 Free (x, T)))
berghofe@17870
   290
             (perm_names ~~
berghofe@18010
   291
              map body_type perm_types ~~ perm_indnames))))
berghofe@18010
   292
          (fn _ => EVERY [indtac induction perm_indnames 1,
berghofe@17870
   293
            ALLGOALS (asm_full_simp_tac (simpset_of thy2))])),
berghofe@17870
   294
        length new_type_names))
berghofe@17870
   295
      end)
berghofe@17870
   296
      atoms);
berghofe@17870
   297
berghofe@17870
   298
    (**** prove (pi1 @ pi2) \<bullet> t = pi1 \<bullet> (pi2 \<bullet> t) ****)
berghofe@17870
   299
berghofe@17870
   300
    val _ = warning "perm_append_thms";
berghofe@17870
   301
berghofe@17870
   302
    (*FIXME: these should be looked up statically*)
berghofe@17870
   303
    val at_pt_inst = PureThy.get_thm thy2 (Name "at_pt_inst");
berghofe@17870
   304
    val pt2 = PureThy.get_thm thy2 (Name "pt2");
berghofe@17870
   305
berghofe@17870
   306
    val perm_append_thms = List.concat (map (fn a =>
berghofe@17870
   307
      let
berghofe@17870
   308
        val permT = mk_permT (Type (a, []));
berghofe@17870
   309
        val pi1 = Free ("pi1", permT);
berghofe@17870
   310
        val pi2 = Free ("pi2", permT);
berghofe@17870
   311
        val pt_inst = PureThy.get_thm thy2 (Name ("pt_" ^ Sign.base_name a ^ "_inst"));
berghofe@17870
   312
        val pt2' = pt_inst RS pt2;
berghofe@17870
   313
        val pt2_ax = PureThy.get_thm thy2
berghofe@17870
   314
          (Name (NameSpace.map_base (fn s => "pt_" ^ s ^ "2") a));
berghofe@17870
   315
      in List.take (map standard (split_conj_thm
berghofe@18010
   316
        (Goal.prove thy2 [] []
berghofe@17870
   317
             (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   318
                (map (fn ((s, T), x) =>
berghofe@17870
   319
                    let val perm = Const (s, permT --> T --> T)
berghofe@17870
   320
                    in HOLogic.mk_eq
berghofe@17870
   321
                      (perm $ (Const ("List.op @", permT --> permT --> permT) $
berghofe@17870
   322
                         pi1 $ pi2) $ Free (x, T),
berghofe@17870
   323
                       perm $ pi1 $ (perm $ pi2 $ Free (x, T)))
berghofe@17870
   324
                    end)
berghofe@17870
   325
                  (perm_names ~~
berghofe@18010
   326
                   map body_type perm_types ~~ perm_indnames))))
berghofe@18010
   327
           (fn _ => EVERY [indtac induction perm_indnames 1,
berghofe@17870
   328
              ALLGOALS (asm_full_simp_tac (simpset_of thy2 addsimps [pt2', pt2_ax]))]))),
berghofe@17870
   329
         length new_type_names)
berghofe@17870
   330
      end) atoms);
berghofe@17870
   331
berghofe@17870
   332
    (**** prove pi1 ~ pi2 ==> pi1 \<bullet> t = pi2 \<bullet> t ****)
berghofe@17870
   333
berghofe@17870
   334
    val _ = warning "perm_eq_thms";
berghofe@17870
   335
berghofe@17870
   336
    val pt3 = PureThy.get_thm thy2 (Name "pt3");
berghofe@17870
   337
    val pt3_rev = PureThy.get_thm thy2 (Name "pt3_rev");
berghofe@17870
   338
berghofe@17870
   339
    val perm_eq_thms = List.concat (map (fn a =>
berghofe@17870
   340
      let
berghofe@17870
   341
        val permT = mk_permT (Type (a, []));
berghofe@17870
   342
        val pi1 = Free ("pi1", permT);
berghofe@17870
   343
        val pi2 = Free ("pi2", permT);
berghofe@17870
   344
        (*FIXME: not robust - better access these theorems using NominalData?*)
berghofe@17870
   345
        val at_inst = PureThy.get_thm thy2 (Name ("at_" ^ Sign.base_name a ^ "_inst"));
berghofe@17870
   346
        val pt_inst = PureThy.get_thm thy2 (Name ("pt_" ^ Sign.base_name a ^ "_inst"));
berghofe@17870
   347
        val pt3' = pt_inst RS pt3;
berghofe@17870
   348
        val pt3_rev' = at_inst RS (pt_inst RS pt3_rev);
berghofe@17870
   349
        val pt3_ax = PureThy.get_thm thy2
berghofe@17870
   350
          (Name (NameSpace.map_base (fn s => "pt_" ^ s ^ "3") a));
berghofe@17870
   351
      in List.take (map standard (split_conj_thm
berghofe@18010
   352
        (Goal.prove thy2 [] [] (Logic.mk_implies
berghofe@19494
   353
             (HOLogic.mk_Trueprop (Const ("Nominal.prm_eq",
berghofe@17870
   354
                permT --> permT --> HOLogic.boolT) $ pi1 $ pi2),
berghofe@17870
   355
              HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   356
                (map (fn ((s, T), x) =>
berghofe@17870
   357
                    let val perm = Const (s, permT --> T --> T)
berghofe@17870
   358
                    in HOLogic.mk_eq
berghofe@17870
   359
                      (perm $ pi1 $ Free (x, T),
berghofe@17870
   360
                       perm $ pi2 $ Free (x, T))
berghofe@17870
   361
                    end)
berghofe@17870
   362
                  (perm_names ~~
berghofe@18010
   363
                   map body_type perm_types ~~ perm_indnames)))))
berghofe@18010
   364
           (fn _ => EVERY [indtac induction perm_indnames 1,
berghofe@17870
   365
              ALLGOALS (asm_full_simp_tac (simpset_of thy2 addsimps [pt3', pt3_rev', pt3_ax]))]))),
berghofe@17870
   366
         length new_type_names)
berghofe@17870
   367
      end) atoms);
berghofe@17870
   368
berghofe@17870
   369
    (**** prove pi1 \<bullet> (pi2 \<bullet> t) = (pi1 \<bullet> pi2) \<bullet> (pi1 \<bullet> t) ****)
berghofe@17870
   370
berghofe@17870
   371
    val cp1 = PureThy.get_thm thy2 (Name "cp1");
berghofe@17870
   372
    val dj_cp = PureThy.get_thm thy2 (Name "dj_cp");
berghofe@17870
   373
    val pt_perm_compose = PureThy.get_thm thy2 (Name "pt_perm_compose");
berghofe@17870
   374
    val pt_perm_compose_rev = PureThy.get_thm thy2 (Name "pt_perm_compose_rev");
berghofe@17870
   375
    val dj_perm_perm_forget = PureThy.get_thm thy2 (Name "dj_perm_perm_forget");
berghofe@17870
   376
berghofe@17870
   377
    fun composition_instance name1 name2 thy =
berghofe@17870
   378
      let
berghofe@17870
   379
        val name1' = Sign.base_name name1;
berghofe@17870
   380
        val name2' = Sign.base_name name2;
berghofe@17870
   381
        val cp_class = Sign.intern_class thy ("cp_" ^ name1' ^ "_" ^ name2');
berghofe@17870
   382
        val permT1 = mk_permT (Type (name1, []));
berghofe@17870
   383
        val permT2 = mk_permT (Type (name2, []));
berghofe@17870
   384
        val augment = map_type_tfree
berghofe@17870
   385
          (fn (x, S) => TFree (x, cp_class :: S));
berghofe@17870
   386
        val Ts = map (augment o body_type) perm_types;
berghofe@17870
   387
        val cp_inst = PureThy.get_thm thy
berghofe@17870
   388
          (Name ("cp_" ^ name1' ^ "_" ^ name2' ^ "_inst"));
berghofe@17870
   389
        val simps = simpset_of thy addsimps (perm_fun_def ::
berghofe@17870
   390
          (if name1 <> name2 then
berghofe@17870
   391
             let val dj = PureThy.get_thm thy (Name ("dj_" ^ name2' ^ "_" ^ name1'))
berghofe@17870
   392
             in [dj RS (cp_inst RS dj_cp), dj RS dj_perm_perm_forget] end
berghofe@17870
   393
           else
berghofe@17870
   394
             let
berghofe@17870
   395
               val at_inst = PureThy.get_thm thy (Name ("at_" ^ name1' ^ "_inst"));
berghofe@17870
   396
               val pt_inst = PureThy.get_thm thy (Name ("pt_" ^ name1' ^ "_inst"))
berghofe@17870
   397
             in
berghofe@17870
   398
               [cp_inst RS cp1 RS sym,
berghofe@17870
   399
                at_inst RS (pt_inst RS pt_perm_compose) RS sym,
berghofe@17870
   400
                at_inst RS (pt_inst RS pt_perm_compose_rev) RS sym]
berghofe@17870
   401
            end))
berghofe@18010
   402
        val thms = split_conj_thm (standard (Goal.prove thy [] []
berghofe@17870
   403
            (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   404
              (map (fn ((s, T), x) =>
berghofe@17870
   405
                  let
berghofe@17870
   406
                    val pi1 = Free ("pi1", permT1);
berghofe@17870
   407
                    val pi2 = Free ("pi2", permT2);
berghofe@17870
   408
                    val perm1 = Const (s, permT1 --> T --> T);
berghofe@17870
   409
                    val perm2 = Const (s, permT2 --> T --> T);
berghofe@19494
   410
                    val perm3 = Const ("Nominal.perm", permT1 --> permT2 --> permT2)
berghofe@17870
   411
                  in HOLogic.mk_eq
berghofe@17870
   412
                    (perm1 $ pi1 $ (perm2 $ pi2 $ Free (x, T)),
berghofe@17870
   413
                     perm2 $ (perm3 $ pi1 $ pi2) $ (perm1 $ pi1 $ Free (x, T)))
berghofe@17870
   414
                  end)
berghofe@18010
   415
                (perm_names ~~ Ts ~~ perm_indnames))))
berghofe@18010
   416
          (fn _ => EVERY [indtac induction perm_indnames 1,
berghofe@18010
   417
             ALLGOALS (asm_full_simp_tac simps)])))
berghofe@17870
   418
      in
berghofe@19275
   419
        foldl (fn ((s, tvs), thy) => AxClass.prove_arity
berghofe@17870
   420
            (s, replicate (length tvs) (cp_class :: classes), [cp_class])
berghofe@19133
   421
            (ClassPackage.intro_classes_tac [] THEN ALLGOALS (resolve_tac thms)) thy)
berghofe@17870
   422
          thy (full_new_type_names' ~~ tyvars)
berghofe@17870
   423
      end;
berghofe@17870
   424
urbanc@18381
   425
    val (perm_thmss,thy3) = thy2 |>
berghofe@17870
   426
      fold (fn name1 => fold (composition_instance name1) atoms) atoms |>
berghofe@17870
   427
      curry (Library.foldr (fn ((i, (tyname, args, _)), thy) =>
berghofe@19275
   428
        AxClass.prove_arity (tyname, replicate (length args) classes, classes)
berghofe@19133
   429
        (ClassPackage.intro_classes_tac [] THEN REPEAT (EVERY
berghofe@17870
   430
           [resolve_tac perm_empty_thms 1,
berghofe@17870
   431
            resolve_tac perm_append_thms 1,
berghofe@17870
   432
            resolve_tac perm_eq_thms 1, assume_tac 1])) thy))
berghofe@17870
   433
        (List.take (descr, length new_type_names)) |>
berghofe@17870
   434
      PureThy.add_thmss
berghofe@17870
   435
        [((space_implode "_" new_type_names ^ "_unfolded_perm_eq",
krauss@18759
   436
          unfolded_perm_eq_thms), [Simplifier.simp_add]),
berghofe@17870
   437
         ((space_implode "_" new_type_names ^ "_perm_empty",
krauss@18759
   438
          perm_empty_thms), [Simplifier.simp_add]),
berghofe@17870
   439
         ((space_implode "_" new_type_names ^ "_perm_append",
krauss@18759
   440
          perm_append_thms), [Simplifier.simp_add]),
berghofe@17870
   441
         ((space_implode "_" new_type_names ^ "_perm_eq",
krauss@18759
   442
          perm_eq_thms), [Simplifier.simp_add])];
berghofe@17870
   443
  
berghofe@17870
   444
    (**** Define representing sets ****)
berghofe@17870
   445
berghofe@17870
   446
    val _ = warning "representing sets";
berghofe@17870
   447
berghofe@17870
   448
    val rep_set_names = map (Sign.full_name thy3) (DatatypeProp.indexify_names
berghofe@17870
   449
      (map (fn (i, _) => name_of_typ (nth_dtyp i) ^ "_set") descr));
berghofe@17870
   450
    val big_rep_name =
berghofe@17870
   451
      space_implode "_" (DatatypeProp.indexify_names (List.mapPartial
berghofe@19494
   452
        (fn (i, ("Nominal.noption", _, _)) => NONE
berghofe@17870
   453
          | (i, _) => SOME (name_of_typ (nth_dtyp i))) descr)) ^ "_set";
berghofe@17870
   454
    val _ = warning ("big_rep_name: " ^ big_rep_name);
berghofe@17870
   455
berghofe@17870
   456
    fun strip_option (dtf as DtType ("fun", [dt, DtRec i])) =
berghofe@17870
   457
          (case AList.lookup op = descr i of
berghofe@19494
   458
             SOME ("Nominal.noption", _, [(_, [dt']), _]) =>
berghofe@17870
   459
               apfst (cons dt) (strip_option dt')
berghofe@17870
   460
           | _ => ([], dtf))
berghofe@19494
   461
      | strip_option (DtType ("fun", [dt, DtType ("Nominal.noption", [dt'])])) =
berghofe@18261
   462
          apfst (cons dt) (strip_option dt')
berghofe@17870
   463
      | strip_option dt = ([], dt);
berghofe@17870
   464
berghofe@19133
   465
    val dt_atomTs = distinct op = (map (typ_of_dtyp descr sorts')
berghofe@18280
   466
      (List.concat (map (fn (_, (_, _, cs)) => List.concat
berghofe@18280
   467
        (map (List.concat o map (fst o strip_option) o snd) cs)) descr)));
berghofe@18280
   468
berghofe@17870
   469
    fun make_intr s T (cname, cargs) =
berghofe@17870
   470
      let
berghofe@17870
   471
        fun mk_prem (dt, (j, j', prems, ts)) = 
berghofe@17870
   472
          let
berghofe@17870
   473
            val (dts, dt') = strip_option dt;
berghofe@17870
   474
            val (dts', dt'') = strip_dtyp dt';
berghofe@18107
   475
            val Ts = map (typ_of_dtyp descr sorts') dts;
berghofe@18107
   476
            val Us = map (typ_of_dtyp descr sorts') dts';
berghofe@18107
   477
            val T = typ_of_dtyp descr sorts' dt'';
berghofe@17870
   478
            val free = mk_Free "x" (Us ---> T) j;
berghofe@17870
   479
            val free' = app_bnds free (length Us);
berghofe@17870
   480
            fun mk_abs_fun (T, (i, t)) =
berghofe@17870
   481
              let val U = fastype_of t
berghofe@19494
   482
              in (i + 1, Const ("Nominal.abs_fun", [T, U, T] --->
berghofe@19494
   483
                Type ("Nominal.noption", [U])) $ mk_Free "y" T i $ t)
berghofe@17870
   484
              end
berghofe@17870
   485
          in (j + 1, j' + length Ts,
berghofe@17870
   486
            case dt'' of
berghofe@17870
   487
                DtRec k => list_all (map (pair "x") Us,
berghofe@17870
   488
                  HOLogic.mk_Trueprop (HOLogic.mk_mem (free',
berghofe@17870
   489
                    Const (List.nth (rep_set_names, k),
berghofe@17870
   490
                      HOLogic.mk_setT T)))) :: prems
berghofe@17870
   491
              | _ => prems,
berghofe@17870
   492
            snd (foldr mk_abs_fun (j', free) Ts) :: ts)
berghofe@17870
   493
          end;
berghofe@17870
   494
berghofe@17870
   495
        val (_, _, prems, ts) = foldr mk_prem (1, 1, [], []) cargs;
berghofe@17870
   496
        val concl = HOLogic.mk_Trueprop (HOLogic.mk_mem
berghofe@17870
   497
          (list_comb (Const (cname, map fastype_of ts ---> T), ts),
berghofe@17870
   498
           Const (s, HOLogic.mk_setT T)))
berghofe@17870
   499
      in Logic.list_implies (prems, concl)
berghofe@17870
   500
      end;
berghofe@17870
   501
berghofe@17870
   502
    val (intr_ts, ind_consts) =
berghofe@17870
   503
      apfst List.concat (ListPair.unzip (List.mapPartial
berghofe@19494
   504
        (fn ((_, ("Nominal.noption", _, _)), _) => NONE
berghofe@17870
   505
          | ((i, (_, _, constrs)), rep_set_name) =>
berghofe@17870
   506
              let val T = nth_dtyp i
berghofe@17870
   507
              in SOME (map (make_intr rep_set_name T) constrs,
berghofe@17870
   508
                Const (rep_set_name, HOLogic.mk_setT T))
berghofe@17870
   509
              end)
berghofe@17870
   510
                (descr ~~ rep_set_names)));
berghofe@17870
   511
berghofe@17870
   512
    val (thy4, {raw_induct = rep_induct, intrs = rep_intrs, ...}) =
berghofe@17870
   513
      setmp InductivePackage.quiet_mode false
berghofe@17870
   514
        (InductivePackage.add_inductive_i false true big_rep_name false true false
berghofe@17870
   515
           ind_consts (map (fn x => (("", x), [])) intr_ts) []) thy3;
berghofe@17870
   516
berghofe@17870
   517
    (**** Prove that representing set is closed under permutation ****)
berghofe@17870
   518
berghofe@17870
   519
    val _ = warning "proving closure under permutation...";
berghofe@17870
   520
berghofe@17870
   521
    val perm_indnames' = List.mapPartial
berghofe@19494
   522
      (fn (x, (_, ("Nominal.noption", _, _))) => NONE | (x, _) => SOME x)
berghofe@17870
   523
      (perm_indnames ~~ descr);
berghofe@17870
   524
berghofe@17870
   525
    fun mk_perm_closed name = map (fn th => standard (th RS mp))
berghofe@18010
   526
      (List.take (split_conj_thm (Goal.prove thy4 [] []
berghofe@17870
   527
        (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj (map
berghofe@17870
   528
           (fn (S, x) =>
berghofe@17870
   529
              let
berghofe@17870
   530
                val S = map_term_types (map_type_tfree
berghofe@17870
   531
                  (fn (s, cs) => TFree (s, cs union cp_classes))) S;
berghofe@17870
   532
                val T = HOLogic.dest_setT (fastype_of S);
berghofe@17870
   533
                val permT = mk_permT (Type (name, []))
berghofe@17870
   534
              in HOLogic.mk_imp (HOLogic.mk_mem (Free (x, T), S),
berghofe@19494
   535
                HOLogic.mk_mem (Const ("Nominal.perm", permT --> T --> T) $
berghofe@17870
   536
                  Free ("pi", permT) $ Free (x, T), S))
berghofe@18010
   537
              end) (ind_consts ~~ perm_indnames'))))
berghofe@18010
   538
        (fn _ => EVERY (* CU: added perm_fun_def in the final tactic in order to deal with funs *)
berghofe@17870
   539
           [indtac rep_induct [] 1,
berghofe@17870
   540
            ALLGOALS (simp_tac (simpset_of thy4 addsimps
berghofe@17870
   541
              (symmetric perm_fun_def :: PureThy.get_thms thy4 (Name ("abs_perm"))))),
berghofe@17870
   542
            ALLGOALS (resolve_tac rep_intrs 
berghofe@17870
   543
               THEN_ALL_NEW (asm_full_simp_tac (simpset_of thy4 addsimps [perm_fun_def])))])),
berghofe@17870
   544
        length new_type_names));
berghofe@17870
   545
berghofe@17870
   546
    (* FIXME: theorems are stored in database for testing only *)
berghofe@17870
   547
    val perm_closed_thmss = map mk_perm_closed atoms;
urbanc@18381
   548
    val (_,thy5) = PureThy.add_thmss [(("perm_closed", List.concat perm_closed_thmss), [])] thy4;
berghofe@17870
   549
berghofe@17870
   550
    (**** typedef ****)
berghofe@17870
   551
berghofe@17870
   552
    val _ = warning "defining type...";
berghofe@17870
   553
berghofe@18366
   554
    val (typedefs, thy6) =
berghofe@18366
   555
      fold_map (fn ((((name, mx), tvs), c), name') => fn thy =>
berghofe@17870
   556
        setmp TypedefPackage.quiet_mode true
berghofe@17870
   557
          (TypedefPackage.add_typedef_i false (SOME name') (name, tvs, mx) c NONE
berghofe@17870
   558
            (rtac exI 1 THEN
berghofe@17870
   559
              QUIET_BREADTH_FIRST (has_fewer_prems 1)
berghofe@19403
   560
              (resolve_tac rep_intrs 1))) thy |> (fn (r, thy) =>
berghofe@17870
   561
        let
berghofe@17870
   562
          val permT = mk_permT (TFree (variant tvs "'a", HOLogic.typeS));
berghofe@17870
   563
          val pi = Free ("pi", permT);
berghofe@17870
   564
          val tvs' = map (fn s => TFree (s, the (AList.lookup op = sorts' s))) tvs;
berghofe@17870
   565
          val T = Type (Sign.intern_type thy name, tvs');
berghofe@17870
   566
          val Const (_, Type (_, [U])) = c
berghofe@18366
   567
        in apfst (pair r o hd)
berghofe@17870
   568
          (PureThy.add_defs_i true [(("prm_" ^ name ^ "_def", Logic.mk_equals
berghofe@19494
   569
            (Const ("Nominal.perm", permT --> T --> T) $ pi $ Free ("x", T),
berghofe@17870
   570
             Const (Sign.intern_const thy ("Abs_" ^ name), U --> T) $
berghofe@19494
   571
               (Const ("Nominal.perm", permT --> U --> U) $ pi $
berghofe@17870
   572
                 (Const (Sign.intern_const thy ("Rep_" ^ name), T --> U) $
berghofe@17870
   573
                   Free ("x", T))))), [])] thy)
berghofe@17870
   574
        end))
berghofe@18366
   575
          (types_syntax ~~ tyvars ~~
berghofe@18366
   576
            (List.take (ind_consts, length new_type_names)) ~~ new_type_names) thy5;
berghofe@17870
   577
berghofe@17870
   578
    val perm_defs = map snd typedefs;
berghofe@17870
   579
    val Abs_inverse_thms = map (#Abs_inverse o fst) typedefs;
berghofe@18016
   580
    val Rep_inverse_thms = map (#Rep_inverse o fst) typedefs;
berghofe@17870
   581
    val Rep_thms = map (#Rep o fst) typedefs;
berghofe@17870
   582
berghofe@18016
   583
    val big_name = space_implode "_" new_type_names;
berghofe@18016
   584
berghofe@18016
   585
berghofe@17870
   586
    (** prove that new types are in class pt_<name> **)
berghofe@17870
   587
berghofe@17870
   588
    val _ = warning "prove that new types are in class pt_<name> ...";
berghofe@17870
   589
berghofe@17870
   590
    fun pt_instance ((class, atom), perm_closed_thms) =
berghofe@17870
   591
      fold (fn (((({Abs_inverse, Rep_inverse, Rep, ...},
berghofe@17870
   592
        perm_def), name), tvs), perm_closed) => fn thy =>
berghofe@19275
   593
          AxClass.prove_arity
berghofe@17870
   594
            (Sign.intern_type thy name,
berghofe@17870
   595
              replicate (length tvs) (classes @ cp_classes), [class])
berghofe@19133
   596
            (EVERY [ClassPackage.intro_classes_tac [],
berghofe@17870
   597
              rewrite_goals_tac [perm_def],
berghofe@17870
   598
              asm_full_simp_tac (simpset_of thy addsimps [Rep_inverse]) 1,
berghofe@17870
   599
              asm_full_simp_tac (simpset_of thy addsimps
berghofe@17870
   600
                [Rep RS perm_closed RS Abs_inverse]) 1,
berghofe@17870
   601
              asm_full_simp_tac (HOL_basic_ss addsimps [PureThy.get_thm thy
berghofe@17870
   602
                (Name ("pt_" ^ Sign.base_name atom ^ "3"))]) 1]) thy)
berghofe@17870
   603
        (typedefs ~~ new_type_names ~~ tyvars ~~ perm_closed_thms);
berghofe@17870
   604
berghofe@17870
   605
berghofe@17870
   606
    (** prove that new types are in class cp_<name1>_<name2> **)
berghofe@17870
   607
berghofe@17870
   608
    val _ = warning "prove that new types are in class cp_<name1>_<name2> ...";
berghofe@17870
   609
berghofe@17870
   610
    fun cp_instance (atom1, perm_closed_thms1) (atom2, perm_closed_thms2) thy =
berghofe@17870
   611
      let
berghofe@17870
   612
        val name = "cp_" ^ Sign.base_name atom1 ^ "_" ^ Sign.base_name atom2;
berghofe@17870
   613
        val class = Sign.intern_class thy name;
berghofe@17870
   614
        val cp1' = PureThy.get_thm thy (Name (name ^ "_inst")) RS cp1
berghofe@17870
   615
      in fold (fn ((((({Abs_inverse, Rep_inverse, Rep, ...},
berghofe@17870
   616
        perm_def), name), tvs), perm_closed1), perm_closed2) => fn thy =>
berghofe@19275
   617
          AxClass.prove_arity
berghofe@17870
   618
            (Sign.intern_type thy name,
berghofe@17870
   619
              replicate (length tvs) (classes @ cp_classes), [class])
berghofe@19133
   620
            (EVERY [ClassPackage.intro_classes_tac [],
berghofe@17870
   621
              rewrite_goals_tac [perm_def],
berghofe@17870
   622
              asm_full_simp_tac (simpset_of thy addsimps
berghofe@17870
   623
                ((Rep RS perm_closed1 RS Abs_inverse) ::
berghofe@17870
   624
                 (if atom1 = atom2 then []
berghofe@17870
   625
                  else [Rep RS perm_closed2 RS Abs_inverse]))) 1,
berghofe@18016
   626
              cong_tac 1,
berghofe@17870
   627
              rtac refl 1,
berghofe@17870
   628
              rtac cp1' 1]) thy)
berghofe@17870
   629
        (typedefs ~~ new_type_names ~~ tyvars ~~ perm_closed_thms1 ~~
berghofe@17870
   630
          perm_closed_thms2) thy
berghofe@17870
   631
      end;
berghofe@17870
   632
berghofe@17870
   633
    val thy7 = fold (fn x => fn thy => thy |>
berghofe@17870
   634
      pt_instance x |>
berghofe@17870
   635
      fold (cp_instance (apfst snd x)) (atoms ~~ perm_closed_thmss))
berghofe@17870
   636
        (classes ~~ atoms ~~ perm_closed_thmss) thy6;
berghofe@17870
   637
berghofe@17870
   638
    (**** constructors ****)
berghofe@17870
   639
berghofe@17870
   640
    fun mk_abs_fun (x, t) =
berghofe@17870
   641
      let
berghofe@17870
   642
        val T = fastype_of x;
berghofe@17870
   643
        val U = fastype_of t
berghofe@17870
   644
      in
berghofe@19494
   645
        Const ("Nominal.abs_fun", T --> U --> T -->
berghofe@19494
   646
          Type ("Nominal.noption", [U])) $ x $ t
berghofe@17870
   647
      end;
berghofe@17870
   648
berghofe@18016
   649
    val (ty_idxs, _) = foldl
berghofe@19494
   650
      (fn ((i, ("Nominal.noption", _, _)), p) => p
berghofe@18016
   651
        | ((i, _), (ty_idxs, j)) => (ty_idxs @ [(i, j)], j + 1)) ([], 0) descr;
berghofe@18016
   652
berghofe@18016
   653
    fun reindex (DtType (s, dts)) = DtType (s, map reindex dts)
berghofe@18016
   654
      | reindex (DtRec i) = DtRec (the (AList.lookup op = ty_idxs i))
berghofe@18016
   655
      | reindex dt = dt;
berghofe@18016
   656
berghofe@18016
   657
    fun strip_suffix i s = implode (List.take (explode s, size s - i));
berghofe@18016
   658
berghofe@18016
   659
    (** strips the "_Rep" in type names *)
urbanc@18045
   660
    fun strip_nth_name i s = 
urbanc@18045
   661
      let val xs = NameSpace.unpack s; 
urbanc@18045
   662
      in NameSpace.pack (Library.nth_map (length xs - i) (strip_suffix 4) xs) end;
berghofe@18016
   663
berghofe@18107
   664
    val (descr'', ndescr) = ListPair.unzip (List.mapPartial
berghofe@19494
   665
      (fn (i, ("Nominal.noption", _, _)) => NONE
berghofe@18107
   666
        | (i, (s, dts, constrs)) =>
berghofe@18107
   667
             let
berghofe@18107
   668
               val SOME index = AList.lookup op = ty_idxs i;
berghofe@18107
   669
               val (constrs1, constrs2) = ListPair.unzip
berghofe@18107
   670
                 (map (fn (cname, cargs) => apfst (pair (strip_nth_name 2 cname))
berghofe@18107
   671
                   (foldl_map (fn (dts, dt) =>
berghofe@18107
   672
                     let val (dts', dt') = strip_option dt
berghofe@18107
   673
                     in (dts @ dts' @ [reindex dt'], (length dts, length dts')) end)
berghofe@18107
   674
                       ([], cargs))) constrs)
berghofe@18107
   675
             in SOME ((index, (strip_nth_name 1 s,  map reindex dts, constrs1)),
berghofe@18107
   676
               (index, constrs2))
berghofe@18107
   677
             end) descr);
urbanc@18045
   678
berghofe@19489
   679
    val (descr1, descr2) = chop (length new_type_names) descr'';
berghofe@18016
   680
    val descr' = [descr1, descr2];
berghofe@18016
   681
berghofe@18107
   682
    val typ_of_dtyp' = replace_types' o typ_of_dtyp descr sorts';
berghofe@17870
   683
berghofe@17870
   684
    val rep_names = map (fn s =>
berghofe@17870
   685
      Sign.intern_const thy7 ("Rep_" ^ s)) new_type_names;
berghofe@17870
   686
    val abs_names = map (fn s =>
berghofe@17870
   687
      Sign.intern_const thy7 ("Abs_" ^ s)) new_type_names;
berghofe@17870
   688
berghofe@18016
   689
    val recTs' = List.mapPartial
berghofe@19494
   690
      (fn ((_, ("Nominal.noption", _, _)), T) => NONE
berghofe@18016
   691
        | (_, T) => SOME T) (descr ~~ get_rec_types descr sorts');
berghofe@18107
   692
    val recTs = get_rec_types descr'' sorts';
berghofe@18016
   693
    val newTs' = Library.take (length new_type_names, recTs');
berghofe@18016
   694
    val newTs = Library.take (length new_type_names, recTs);
berghofe@17870
   695
berghofe@17870
   696
    val full_new_type_names = map (Sign.full_name (sign_of thy)) new_type_names;
berghofe@17870
   697
berghofe@17870
   698
    fun make_constr_def tname T T' ((thy, defs, eqns), ((cname, cargs), (cname', mx))) =
berghofe@17870
   699
      let
berghofe@17870
   700
        fun constr_arg (dt, (j, l_args, r_args)) =
berghofe@17870
   701
          let
berghofe@17870
   702
            val x' = mk_Free "x" (typ_of_dtyp' dt) j;
berghofe@17870
   703
            val (dts, dt') = strip_option dt;
berghofe@17870
   704
            val xs = map (fn (dt, i) => mk_Free "x" (typ_of_dtyp' dt) i)
berghofe@17870
   705
              (dts ~~ (j upto j + length dts - 1))
berghofe@17870
   706
            val x = mk_Free "x" (typ_of_dtyp' dt') (j + length dts)
berghofe@17870
   707
            val (dts', dt'') = strip_dtyp dt'
berghofe@18261
   708
          in
berghofe@18261
   709
            (j + length dts + 1,
berghofe@18261
   710
             xs @ x :: l_args,
berghofe@18261
   711
             foldr mk_abs_fun
berghofe@18261
   712
               (case dt'' of
berghofe@18261
   713
                  DtRec k => if k < length new_type_names then
berghofe@18261
   714
                      list_abs (map (pair "z" o typ_of_dtyp') dts',
berghofe@18261
   715
                        Const (List.nth (rep_names, k), typ_of_dtyp' dt'' -->
berghofe@18261
   716
                          typ_of_dtyp descr sorts' dt'') $ app_bnds x (length dts'))
berghofe@18261
   717
                    else error "nested recursion not (yet) supported"
berghofe@18261
   718
                | _ => x) xs :: r_args)
berghofe@17870
   719
          end
berghofe@17870
   720
berghofe@17870
   721
        val (_, l_args, r_args) = foldr constr_arg (1, [], []) cargs;
berghofe@17870
   722
        val abs_name = Sign.intern_const (Theory.sign_of thy) ("Abs_" ^ tname);
berghofe@17870
   723
        val rep_name = Sign.intern_const (Theory.sign_of thy) ("Rep_" ^ tname);
berghofe@17870
   724
        val constrT = map fastype_of l_args ---> T;
berghofe@17870
   725
        val lhs = list_comb (Const (Sign.full_name thy (Sign.base_name cname),
berghofe@17870
   726
          constrT), l_args);
berghofe@17870
   727
        val rhs = list_comb (Const (cname, map fastype_of r_args ---> T'), r_args);
berghofe@17870
   728
        val def = Logic.mk_equals (lhs, Const (abs_name, T' --> T) $ rhs);
berghofe@17870
   729
        val eqn = HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17870
   730
          (Const (rep_name, T --> T') $ lhs, rhs));
berghofe@17870
   731
        val def_name = (Sign.base_name cname) ^ "_def";
berghofe@18366
   732
        val ([def_thm], thy') = thy |>
berghofe@17870
   733
          Theory.add_consts_i [(cname', constrT, mx)] |>
berghofe@17870
   734
          (PureThy.add_defs_i false o map Thm.no_attributes) [(def_name, def)]
berghofe@17870
   735
      in (thy', defs @ [def_thm], eqns @ [eqn]) end;
berghofe@17870
   736
berghofe@17870
   737
    fun dt_constr_defs ((thy, defs, eqns, dist_lemmas),
berghofe@17870
   738
        (((((_, (_, _, constrs)), tname), T), T'), constr_syntax)) =
berghofe@17870
   739
      let
berghofe@17870
   740
        val rep_const = cterm_of thy
berghofe@17870
   741
          (Const (Sign.intern_const thy ("Rep_" ^ tname), T --> T'));
berghofe@17870
   742
        val dist = standard (cterm_instantiate [(cterm_of thy distinct_f, rep_const)] distinct_lemma);
berghofe@17870
   743
        val (thy', defs', eqns') = Library.foldl (make_constr_def tname T T')
berghofe@17870
   744
          ((Theory.add_path tname thy, defs, []), constrs ~~ constr_syntax)
berghofe@17870
   745
      in
berghofe@17870
   746
        (parent_path flat_names thy', defs', eqns @ [eqns'], dist_lemmas @ [dist])
berghofe@17870
   747
      end;
berghofe@17870
   748
berghofe@17870
   749
    val (thy8, constr_defs, constr_rep_eqns, dist_lemmas) = Library.foldl dt_constr_defs
berghofe@17870
   750
      ((thy7, [], [], []), List.take (descr, length new_type_names) ~~
berghofe@17870
   751
        new_type_names ~~ newTs ~~ newTs' ~~ constr_syntax);
berghofe@17870
   752
berghofe@17870
   753
    val abs_inject_thms = map (fn tname =>
berghofe@17870
   754
      PureThy.get_thm thy8 (Name ("Abs_" ^ tname ^ "_inject"))) new_type_names;
berghofe@17870
   755
berghofe@17870
   756
    val rep_inject_thms = map (fn tname =>
berghofe@17870
   757
      PureThy.get_thm thy8 (Name ("Rep_" ^ tname ^ "_inject"))) new_type_names;
berghofe@17870
   758
berghofe@17870
   759
    val rep_thms = map (fn tname =>
berghofe@17870
   760
      PureThy.get_thm thy8 (Name ("Rep_" ^ tname))) new_type_names;
berghofe@17870
   761
berghofe@17870
   762
    val rep_inverse_thms = map (fn tname =>
berghofe@17870
   763
      PureThy.get_thm thy8 (Name ("Rep_" ^ tname ^ "_inverse"))) new_type_names;
berghofe@17870
   764
berghofe@17870
   765
    (* prove theorem  Rep_i (Constr_j ...) = Constr'_j ...  *)
berghofe@17870
   766
    
berghofe@17870
   767
    fun prove_constr_rep_thm eqn =
berghofe@17870
   768
      let
berghofe@17870
   769
        val inj_thms = map (fn r => r RS iffD1) abs_inject_thms;
berghofe@17870
   770
        val rewrites = constr_defs @ map mk_meta_eq rep_inverse_thms
berghofe@18010
   771
      in standard (Goal.prove thy8 [] [] eqn (fn _ => EVERY
berghofe@17870
   772
        [resolve_tac inj_thms 1,
berghofe@17870
   773
         rewrite_goals_tac rewrites,
berghofe@17870
   774
         rtac refl 3,
berghofe@17870
   775
         resolve_tac rep_intrs 2,
berghofe@18010
   776
         REPEAT (resolve_tac rep_thms 1)]))
berghofe@17870
   777
      end;
berghofe@17870
   778
berghofe@17870
   779
    val constr_rep_thmss = map (map prove_constr_rep_thm) constr_rep_eqns;
berghofe@17870
   780
berghofe@17870
   781
    (* prove theorem  pi \<bullet> Rep_i x = Rep_i (pi \<bullet> x) *)
berghofe@17870
   782
berghofe@17870
   783
    fun prove_perm_rep_perm (atom, perm_closed_thms) = map (fn th =>
berghofe@17870
   784
      let
berghofe@17870
   785
        val _ $ (_ $ (Rep $ x) $ _) = Logic.unvarify (prop_of th);
berghofe@17870
   786
        val Type ("fun", [T, U]) = fastype_of Rep;
berghofe@17870
   787
        val permT = mk_permT (Type (atom, []));
berghofe@17870
   788
        val pi = Free ("pi", permT);
berghofe@17870
   789
      in
berghofe@18010
   790
        standard (Goal.prove thy8 [] [] (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@19494
   791
            (Const ("Nominal.perm", permT --> U --> U) $ pi $ (Rep $ x),
berghofe@19494
   792
             Rep $ (Const ("Nominal.perm", permT --> T --> T) $ pi $ x))))
berghofe@18010
   793
          (fn _ => simp_tac (HOL_basic_ss addsimps (perm_defs @ Abs_inverse_thms @
berghofe@18010
   794
            perm_closed_thms @ Rep_thms)) 1))
berghofe@17870
   795
      end) Rep_thms;
berghofe@17870
   796
berghofe@17870
   797
    val perm_rep_perm_thms = List.concat (map prove_perm_rep_perm
berghofe@17870
   798
      (atoms ~~ perm_closed_thmss));
berghofe@17870
   799
berghofe@17870
   800
    (* prove distinctness theorems *)
berghofe@17870
   801
berghofe@18016
   802
    val distinct_props = setmp DatatypeProp.dtK 1000
berghofe@18016
   803
      (DatatypeProp.make_distincts new_type_names descr' sorts') thy8;
berghofe@17870
   804
berghofe@17870
   805
    val dist_rewrites = map (fn (rep_thms, dist_lemma) =>
berghofe@17870
   806
      dist_lemma::(rep_thms @ [In0_eq, In1_eq, In0_not_In1, In1_not_In0]))
berghofe@17870
   807
        (constr_rep_thmss ~~ dist_lemmas);
berghofe@17870
   808
berghofe@17870
   809
    fun prove_distinct_thms (_, []) = []
berghofe@17870
   810
      | prove_distinct_thms (p as (rep_thms, dist_lemma), t::ts) =
berghofe@17870
   811
          let
berghofe@18010
   812
            val dist_thm = standard (Goal.prove thy8 [] [] t (fn _ =>
berghofe@18010
   813
              simp_tac (simpset_of thy8 addsimps (dist_lemma :: rep_thms)) 1))
berghofe@17870
   814
          in dist_thm::(standard (dist_thm RS not_sym))::
berghofe@17870
   815
            (prove_distinct_thms (p, ts))
berghofe@17870
   816
          end;
berghofe@17870
   817
berghofe@17870
   818
    val distinct_thms = map prove_distinct_thms
berghofe@17870
   819
      (constr_rep_thmss ~~ dist_lemmas ~~ distinct_props);
berghofe@17870
   820
berghofe@17870
   821
    (** prove equations for permutation functions **)
berghofe@17870
   822
berghofe@17870
   823
    val abs_perm = PureThy.get_thms thy8 (Name "abs_perm"); (* FIXME *)
berghofe@17870
   824
berghofe@17870
   825
    val perm_simps' = map (fn (((i, (_, _, constrs)), tname), constr_rep_thms) =>
berghofe@17870
   826
      let val T = replace_types' (nth_dtyp i)
berghofe@17870
   827
      in List.concat (map (fn (atom, perm_closed_thms) =>
berghofe@17870
   828
          map (fn ((cname, dts), constr_rep_thm) => 
berghofe@17870
   829
        let
berghofe@17870
   830
          val cname = Sign.intern_const thy8
berghofe@17870
   831
            (NameSpace.append tname (Sign.base_name cname));
berghofe@17870
   832
          val permT = mk_permT (Type (atom, []));
berghofe@17870
   833
          val pi = Free ("pi", permT);
berghofe@17870
   834
berghofe@17870
   835
          fun perm t =
berghofe@17870
   836
            let val T = fastype_of t
berghofe@19494
   837
            in Const ("Nominal.perm", permT --> T --> T) $ pi $ t end;
berghofe@17870
   838
berghofe@17870
   839
          fun constr_arg (dt, (j, l_args, r_args)) =
berghofe@17870
   840
            let
berghofe@17870
   841
              val x' = mk_Free "x" (typ_of_dtyp' dt) j;
berghofe@17870
   842
              val (dts, dt') = strip_option dt;
berghofe@17870
   843
              val Ts = map typ_of_dtyp' dts;
berghofe@17870
   844
              val xs = map (fn (T, i) => mk_Free "x" T i)
berghofe@17870
   845
                (Ts ~~ (j upto j + length dts - 1))
berghofe@17870
   846
              val x = mk_Free "x" (typ_of_dtyp' dt') (j + length dts);
berghofe@17870
   847
              val (dts', dt'') = strip_dtyp dt';
berghofe@18261
   848
            in
berghofe@18261
   849
              (j + length dts + 1,
berghofe@18261
   850
               xs @ x :: l_args,
berghofe@18261
   851
               map perm (xs @ [x]) @ r_args)
berghofe@17870
   852
            end
berghofe@17870
   853
berghofe@17870
   854
          val (_, l_args, r_args) = foldr constr_arg (1, [], []) dts;
berghofe@17870
   855
          val c = Const (cname, map fastype_of l_args ---> T)
berghofe@17870
   856
        in
berghofe@18010
   857
          standard (Goal.prove thy8 [] []
berghofe@17870
   858
            (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@18010
   859
              (perm (list_comb (c, l_args)), list_comb (c, r_args))))
berghofe@18010
   860
            (fn _ => EVERY
berghofe@17870
   861
              [simp_tac (simpset_of thy8 addsimps (constr_rep_thm :: perm_defs)) 1,
berghofe@17870
   862
               simp_tac (HOL_basic_ss addsimps (Rep_thms @ Abs_inverse_thms @
berghofe@17870
   863
                 constr_defs @ perm_closed_thms)) 1,
berghofe@17870
   864
               TRY (simp_tac (HOL_basic_ss addsimps
berghofe@17870
   865
                 (symmetric perm_fun_def :: abs_perm)) 1),
berghofe@17870
   866
               TRY (simp_tac (HOL_basic_ss addsimps
berghofe@17870
   867
                 (perm_fun_def :: perm_defs @ Rep_thms @ Abs_inverse_thms @
berghofe@18010
   868
                    perm_closed_thms)) 1)]))
berghofe@17870
   869
        end) (constrs ~~ constr_rep_thms)) (atoms ~~ perm_closed_thmss))
berghofe@17870
   870
      end) (List.take (descr, length new_type_names) ~~ new_type_names ~~ constr_rep_thmss);
berghofe@17870
   871
berghofe@17870
   872
    (** prove injectivity of constructors **)
berghofe@17870
   873
berghofe@17870
   874
    val rep_inject_thms' = map (fn th => th RS sym) rep_inject_thms;
berghofe@17870
   875
    val alpha = PureThy.get_thms thy8 (Name "alpha");
berghofe@17870
   876
    val abs_fresh = PureThy.get_thms thy8 (Name "abs_fresh");
berghofe@17870
   877
    val fresh_def = PureThy.get_thm thy8 (Name "fresh_def");
berghofe@17870
   878
    val supp_def = PureThy.get_thm thy8 (Name "supp_def");
berghofe@17870
   879
berghofe@17870
   880
    val inject_thms = map (fn (((i, (_, _, constrs)), tname), constr_rep_thms) =>
berghofe@17870
   881
      let val T = replace_types' (nth_dtyp i)
berghofe@17870
   882
      in List.mapPartial (fn ((cname, dts), constr_rep_thm) =>
berghofe@17870
   883
        if null dts then NONE else SOME
berghofe@17870
   884
        let
berghofe@17870
   885
          val cname = Sign.intern_const thy8
berghofe@17870
   886
            (NameSpace.append tname (Sign.base_name cname));
berghofe@17870
   887
berghofe@17870
   888
          fun make_inj (dt, (j, args1, args2, eqs)) =
berghofe@17870
   889
            let
berghofe@17870
   890
              val x' = mk_Free "x" (typ_of_dtyp' dt) j;
berghofe@17870
   891
              val y' = mk_Free "y" (typ_of_dtyp' dt) j;
berghofe@17870
   892
              val (dts, dt') = strip_option dt;
berghofe@17870
   893
              val Ts_idx = map typ_of_dtyp' dts ~~ (j upto j + length dts - 1);
berghofe@17870
   894
              val xs = map (fn (T, i) => mk_Free "x" T i) Ts_idx;
berghofe@17870
   895
              val ys = map (fn (T, i) => mk_Free "y" T i) Ts_idx;
berghofe@17870
   896
              val x = mk_Free "x" (typ_of_dtyp' dt') (j + length dts);
berghofe@17870
   897
              val y = mk_Free "y" (typ_of_dtyp' dt') (j + length dts);
berghofe@17870
   898
              val (dts', dt'') = strip_dtyp dt';
berghofe@18261
   899
            in
berghofe@18261
   900
              (j + length dts + 1,
berghofe@18261
   901
               xs @ (x :: args1), ys @ (y :: args2),
berghofe@18261
   902
               HOLogic.mk_eq
berghofe@18261
   903
                 (foldr mk_abs_fun x xs, foldr mk_abs_fun y ys) :: eqs)
berghofe@17870
   904
            end;
berghofe@17870
   905
berghofe@17870
   906
          val (_, args1, args2, eqs) = foldr make_inj (1, [], [], []) dts;
berghofe@17870
   907
          val Ts = map fastype_of args1;
berghofe@17870
   908
          val c = Const (cname, Ts ---> T)
berghofe@17870
   909
        in
berghofe@18010
   910
          standard (Goal.prove thy8 [] [] (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17870
   911
              (HOLogic.mk_eq (list_comb (c, args1), list_comb (c, args2)),
berghofe@18010
   912
               foldr1 HOLogic.mk_conj eqs)))
berghofe@18010
   913
            (fn _ => EVERY
berghofe@17870
   914
               [asm_full_simp_tac (simpset_of thy8 addsimps (constr_rep_thm ::
berghofe@17870
   915
                  rep_inject_thms')) 1,
berghofe@17870
   916
                TRY (asm_full_simp_tac (HOL_basic_ss addsimps (fresh_def :: supp_def ::
berghofe@17870
   917
                  alpha @ abs_perm @ abs_fresh @ rep_inject_thms @
berghofe@17874
   918
                  perm_rep_perm_thms)) 1),
berghofe@17874
   919
                TRY (asm_full_simp_tac (HOL_basic_ss addsimps (perm_fun_def ::
berghofe@18010
   920
                  expand_fun_eq :: rep_inject_thms @ perm_rep_perm_thms)) 1)]))
berghofe@17870
   921
        end) (constrs ~~ constr_rep_thms)
berghofe@17870
   922
      end) (List.take (descr, length new_type_names) ~~ new_type_names ~~ constr_rep_thmss);
berghofe@17870
   923
berghofe@17872
   924
    (** equations for support and freshness **)
berghofe@17872
   925
berghofe@17872
   926
    val Un_assoc = PureThy.get_thm thy8 (Name "Un_assoc");
berghofe@17872
   927
    val de_Morgan_conj = PureThy.get_thm thy8 (Name "de_Morgan_conj");
berghofe@17872
   928
    val Collect_disj_eq = PureThy.get_thm thy8 (Name "Collect_disj_eq");
berghofe@17872
   929
    val finite_Un = PureThy.get_thm thy8 (Name "finite_Un");
berghofe@17872
   930
berghofe@17872
   931
    val (supp_thms, fresh_thms) = ListPair.unzip (map ListPair.unzip
berghofe@17872
   932
      (map (fn ((((i, (_, _, constrs)), tname), inject_thms'), perm_thms') =>
berghofe@17872
   933
      let val T = replace_types' (nth_dtyp i)
berghofe@17872
   934
      in List.concat (map (fn (cname, dts) => map (fn atom =>
berghofe@17872
   935
        let
berghofe@17872
   936
          val cname = Sign.intern_const thy8
berghofe@17872
   937
            (NameSpace.append tname (Sign.base_name cname));
berghofe@17872
   938
          val atomT = Type (atom, []);
berghofe@17872
   939
berghofe@17872
   940
          fun process_constr (dt, (j, args1, args2)) =
berghofe@17872
   941
            let
berghofe@17872
   942
              val x' = mk_Free "x" (typ_of_dtyp' dt) j;
berghofe@17872
   943
              val (dts, dt') = strip_option dt;
berghofe@17872
   944
              val Ts_idx = map typ_of_dtyp' dts ~~ (j upto j + length dts - 1);
berghofe@17872
   945
              val xs = map (fn (T, i) => mk_Free "x" T i) Ts_idx;
berghofe@17872
   946
              val x = mk_Free "x" (typ_of_dtyp' dt') (j + length dts);
berghofe@17872
   947
              val (dts', dt'') = strip_dtyp dt';
berghofe@18261
   948
            in
berghofe@18261
   949
              (j + length dts + 1,
berghofe@18261
   950
               xs @ (x :: args1), foldr mk_abs_fun x xs :: args2)
berghofe@17872
   951
            end;
berghofe@17872
   952
berghofe@17872
   953
          val (_, args1, args2) = foldr process_constr (1, [], []) dts;
berghofe@17872
   954
          val Ts = map fastype_of args1;
berghofe@17872
   955
          val c = list_comb (Const (cname, Ts ---> T), args1);
berghofe@17872
   956
          fun supp t =
berghofe@19494
   957
            Const ("Nominal.supp", fastype_of t --> HOLogic.mk_setT atomT) $ t;
berghofe@17872
   958
          fun fresh t =
berghofe@19494
   959
            Const ("Nominal.fresh", atomT --> fastype_of t --> HOLogic.boolT) $
berghofe@17872
   960
              Free ("a", atomT) $ t;
berghofe@18010
   961
          val supp_thm = standard (Goal.prove thy8 [] []
berghofe@17872
   962
              (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17872
   963
                (supp c,
berghofe@17872
   964
                 if null dts then Const ("{}", HOLogic.mk_setT atomT)
berghofe@18010
   965
                 else foldr1 (HOLogic.mk_binop "op Un") (map supp args2))))
berghofe@17872
   966
            (fn _ =>
berghofe@18010
   967
              simp_tac (HOL_basic_ss addsimps (supp_def ::
berghofe@17872
   968
                 Un_assoc :: de_Morgan_conj :: Collect_disj_eq :: finite_Un ::
berghofe@17874
   969
                 symmetric empty_def :: Finites.emptyI :: simp_thms @
berghofe@18010
   970
                 abs_perm @ abs_fresh @ inject_thms' @ perm_thms')) 1))
berghofe@17872
   971
        in
berghofe@17872
   972
          (supp_thm,
berghofe@18010
   973
           standard (Goal.prove thy8 [] [] (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17872
   974
              (fresh c,
berghofe@17872
   975
               if null dts then HOLogic.true_const
berghofe@18010
   976
               else foldr1 HOLogic.mk_conj (map fresh args2))))
berghofe@17872
   977
             (fn _ =>
berghofe@18010
   978
               simp_tac (simpset_of thy8 addsimps [fresh_def, supp_thm]) 1)))
berghofe@17872
   979
        end) atoms) constrs)
berghofe@17872
   980
      end) (List.take (descr, length new_type_names) ~~ new_type_names ~~ inject_thms ~~ perm_simps')));
berghofe@17872
   981
berghofe@18107
   982
    (**** weak induction theorem ****)
berghofe@18016
   983
berghofe@18107
   984
    val arities = get_arities descr'';
berghofe@18016
   985
berghofe@18016
   986
    fun mk_funs_inv thm =
berghofe@18016
   987
      let
berghofe@18016
   988
        val {sign, prop, ...} = rep_thm thm;
berghofe@18016
   989
        val _ $ (_ $ (Const (_, Type (_, [U, _])) $ _ $ S)) $
berghofe@18016
   990
          (_ $ (_ $ (r $ (a $ _)) $ _)) = Type.freeze prop;
berghofe@18016
   991
        val used = add_term_tfree_names (a, []);
berghofe@18016
   992
berghofe@18016
   993
        fun mk_thm i =
berghofe@18016
   994
          let
berghofe@18016
   995
            val Ts = map (TFree o rpair HOLogic.typeS)
berghofe@18016
   996
              (variantlist (replicate i "'t", used));
berghofe@18016
   997
            val f = Free ("f", Ts ---> U)
berghofe@18016
   998
          in standard (Goal.prove sign [] [] (Logic.mk_implies
berghofe@18016
   999
            (HOLogic.mk_Trueprop (HOLogic.list_all
berghofe@18016
  1000
               (map (pair "x") Ts, HOLogic.mk_mem (app_bnds f i, S))),
berghofe@18016
  1001
             HOLogic.mk_Trueprop (HOLogic.mk_eq (list_abs (map (pair "x") Ts,
berghofe@18016
  1002
               r $ (a $ app_bnds f i)), f))))
berghofe@18016
  1003
            (fn _ => EVERY [REPEAT (rtac ext 1), REPEAT (etac allE 1), rtac thm 1, atac 1]))
berghofe@18016
  1004
          end
berghofe@18016
  1005
      in map (fn r => r RS subst) (thm :: map mk_thm arities) end;
berghofe@18016
  1006
berghofe@18016
  1007
    fun mk_indrule_lemma ((prems, concls), (((i, _), T), U)) =
berghofe@18016
  1008
      let
berghofe@18016
  1009
        val Rep_t = Const (List.nth (rep_names, i), T --> U) $
berghofe@18016
  1010
          mk_Free "x" T i;
berghofe@18016
  1011
berghofe@18016
  1012
        val Abs_t =  Const (List.nth (abs_names, i), U --> T)
berghofe@18016
  1013
berghofe@18016
  1014
      in (prems @ [HOLogic.imp $ HOLogic.mk_mem (Rep_t,
berghofe@18016
  1015
            Const (List.nth (rep_set_names, i), HOLogic.mk_setT U)) $
berghofe@18016
  1016
              (mk_Free "P" (T --> HOLogic.boolT) (i + 1) $ (Abs_t $ Rep_t))],
berghofe@18016
  1017
          concls @ [mk_Free "P" (T --> HOLogic.boolT) (i + 1) $ mk_Free "x" T i])
berghofe@18016
  1018
      end;
berghofe@18016
  1019
berghofe@18016
  1020
    val (indrule_lemma_prems, indrule_lemma_concls) =
berghofe@18107
  1021
      Library.foldl mk_indrule_lemma (([], []), (descr'' ~~ recTs ~~ recTs'));
berghofe@18016
  1022
berghofe@18016
  1023
    val indrule_lemma = standard (Goal.prove thy8 [] []
berghofe@18016
  1024
      (Logic.mk_implies
berghofe@18016
  1025
        (HOLogic.mk_Trueprop (mk_conj indrule_lemma_prems),
berghofe@18016
  1026
         HOLogic.mk_Trueprop (mk_conj indrule_lemma_concls))) (fn _ => EVERY
berghofe@18016
  1027
           [REPEAT (etac conjE 1),
berghofe@18016
  1028
            REPEAT (EVERY
berghofe@18016
  1029
              [TRY (rtac conjI 1), full_simp_tac (HOL_basic_ss addsimps Rep_inverse_thms) 1,
berghofe@18016
  1030
               etac mp 1, resolve_tac Rep_thms 1])]));
berghofe@18016
  1031
berghofe@18016
  1032
    val Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of indrule_lemma)));
berghofe@18016
  1033
    val frees = if length Ps = 1 then [Free ("P", snd (dest_Var (hd Ps)))] else
berghofe@18016
  1034
      map (Free o apfst fst o dest_Var) Ps;
berghofe@18016
  1035
    val indrule_lemma' = cterm_instantiate
berghofe@18016
  1036
      (map (cterm_of thy8) Ps ~~ map (cterm_of thy8) frees) indrule_lemma;
berghofe@18016
  1037
berghofe@18016
  1038
    val Abs_inverse_thms' = List.concat (map mk_funs_inv Abs_inverse_thms);
berghofe@18016
  1039
berghofe@18016
  1040
    val dt_induct_prop = DatatypeProp.make_ind descr' sorts';
berghofe@18016
  1041
    val dt_induct = standard (Goal.prove thy8 []
berghofe@18016
  1042
      (Logic.strip_imp_prems dt_induct_prop) (Logic.strip_imp_concl dt_induct_prop)
berghofe@18016
  1043
      (fn prems => EVERY
berghofe@18016
  1044
        [rtac indrule_lemma' 1,
berghofe@18016
  1045
         (DatatypeAux.indtac rep_induct THEN_ALL_NEW ObjectLogic.atomize_tac) 1,
berghofe@18016
  1046
         EVERY (map (fn (prem, r) => (EVERY
berghofe@18016
  1047
           [REPEAT (eresolve_tac Abs_inverse_thms' 1),
berghofe@18016
  1048
            simp_tac (HOL_basic_ss addsimps [symmetric r]) 1,
berghofe@18016
  1049
            DEPTH_SOLVE_1 (ares_tac [prem] 1 ORELSE etac allE 1)]))
berghofe@18016
  1050
                (prems ~~ constr_defs))]));
berghofe@18016
  1051
berghofe@18107
  1052
    val case_names_induct = mk_case_names_induct descr'';
berghofe@18016
  1053
berghofe@18066
  1054
    (**** prove that new datatypes have finite support ****)
berghofe@18066
  1055
urbanc@18246
  1056
    val _ = warning "proving finite support for the new datatype";
urbanc@18246
  1057
berghofe@18066
  1058
    val indnames = DatatypeProp.make_tnames recTs;
berghofe@18066
  1059
berghofe@18066
  1060
    val abs_supp = PureThy.get_thms thy8 (Name "abs_supp");
urbanc@18067
  1061
    val supp_atm = PureThy.get_thms thy8 (Name "supp_atm");
berghofe@18066
  1062
berghofe@18066
  1063
    val finite_supp_thms = map (fn atom =>
berghofe@18066
  1064
      let val atomT = Type (atom, [])
berghofe@18066
  1065
      in map standard (List.take
berghofe@18066
  1066
        (split_conj_thm (Goal.prove thy8 [] [] (HOLogic.mk_Trueprop
berghofe@18066
  1067
           (foldr1 HOLogic.mk_conj (map (fn (s, T) => HOLogic.mk_mem
berghofe@19494
  1068
             (Const ("Nominal.supp", T --> HOLogic.mk_setT atomT) $ Free (s, T),
berghofe@18066
  1069
              Const ("Finite_Set.Finites", HOLogic.mk_setT (HOLogic.mk_setT atomT))))
berghofe@18066
  1070
               (indnames ~~ recTs))))
berghofe@18066
  1071
           (fn _ => indtac dt_induct indnames 1 THEN
berghofe@18066
  1072
            ALLGOALS (asm_full_simp_tac (simpset_of thy8 addsimps
urbanc@18067
  1073
              (abs_supp @ supp_atm @
berghofe@18066
  1074
               PureThy.get_thms thy8 (Name ("fs_" ^ Sign.base_name atom ^ "1")) @
berghofe@18066
  1075
               List.concat supp_thms))))),
berghofe@18066
  1076
         length new_type_names))
berghofe@18066
  1077
      end) atoms;
berghofe@18066
  1078
krauss@18759
  1079
    val simp_atts = replicate (length new_type_names) [Simplifier.simp_add];
berghofe@18658
  1080
berghofe@18658
  1081
    val (_, thy9) = thy8 |>
berghofe@18658
  1082
      Theory.add_path big_name |>
berghofe@18658
  1083
      PureThy.add_thms [(("induct_weak", dt_induct), [case_names_induct])] ||>>
berghofe@18658
  1084
      PureThy.add_thmss [(("inducts_weak", projections dt_induct), [case_names_induct])] ||>
berghofe@18658
  1085
      Theory.parent_path ||>>
berghofe@18658
  1086
      DatatypeAux.store_thmss_atts "distinct" new_type_names simp_atts distinct_thms ||>>
berghofe@18658
  1087
      DatatypeAux.store_thmss "constr_rep" new_type_names constr_rep_thmss ||>>
berghofe@18658
  1088
      DatatypeAux.store_thmss_atts "perm" new_type_names simp_atts perm_simps' ||>>
berghofe@18658
  1089
      DatatypeAux.store_thmss "inject" new_type_names inject_thms ||>>
berghofe@18658
  1090
      DatatypeAux.store_thmss "supp" new_type_names supp_thms ||>>
berghofe@18658
  1091
      DatatypeAux.store_thmss_atts "fresh" new_type_names simp_atts fresh_thms ||>
berghofe@18658
  1092
      fold (fn (atom, ths) => fn thy =>
berghofe@18658
  1093
        let val class = Sign.intern_class thy ("fs_" ^ Sign.base_name atom)
berghofe@19275
  1094
        in fold (fn T => AxClass.prove_arity
berghofe@18658
  1095
            (fst (dest_Type T),
berghofe@18658
  1096
              replicate (length sorts) [class], [class])
berghofe@19133
  1097
            (ClassPackage.intro_classes_tac [] THEN resolve_tac ths 1)) newTs thy
berghofe@18658
  1098
        end) (atoms ~~ finite_supp_thms);
berghofe@18658
  1099
berghofe@18107
  1100
    (**** strong induction theorem ****)
berghofe@18107
  1101
berghofe@18107
  1102
    val pnames = if length descr'' = 1 then ["P"]
berghofe@18107
  1103
      else map (fn i => "P" ^ string_of_int i) (1 upto length descr'');
berghofe@18245
  1104
    val ind_sort = if null dt_atomTs then HOLogic.typeS
berghofe@18658
  1105
      else norm_sort thy9 (map (fn T => Sign.intern_class thy9 ("fs_" ^
berghofe@18658
  1106
        Sign.base_name (fst (dest_Type T)))) dt_atomTs);
berghofe@18107
  1107
    val fsT = TFree ("'n", ind_sort);
berghofe@18658
  1108
    val fsT' = TFree ("'n", HOLogic.typeS);
berghofe@18107
  1109
berghofe@18658
  1110
    val fresh_fs = map (fn (s, T) => (T, Free (s, fsT' --> HOLogic.mk_setT T)))
berghofe@18658
  1111
      (DatatypeProp.indexify_names (replicate (length dt_atomTs) "f") ~~ dt_atomTs);
berghofe@18658
  1112
berghofe@18658
  1113
    fun make_pred fsT i T =
berghofe@18302
  1114
      Free (List.nth (pnames, i), fsT --> T --> HOLogic.boolT);
berghofe@18107
  1115
berghofe@18658
  1116
    fun make_ind_prem fsT f k T ((cname, cargs), idxs) =
berghofe@18107
  1117
      let
berghofe@18107
  1118
        val recs = List.filter is_rec_type cargs;
berghofe@18107
  1119
        val Ts = map (typ_of_dtyp descr'' sorts') cargs;
berghofe@18107
  1120
        val recTs' = map (typ_of_dtyp descr'' sorts') recs;
berghofe@18107
  1121
        val tnames = variantlist (DatatypeProp.make_tnames Ts, pnames);
berghofe@18107
  1122
        val rec_tnames = map fst (List.filter (is_rec_type o snd) (tnames ~~ cargs));
berghofe@18107
  1123
        val frees = tnames ~~ Ts;
berghofe@18107
  1124
        val z = (variant tnames "z", fsT);
berghofe@18107
  1125
berghofe@18107
  1126
        fun mk_prem ((dt, s), T) =
berghofe@18107
  1127
          let
berghofe@18107
  1128
            val (Us, U) = strip_type T;
berghofe@18107
  1129
            val l = length Us
berghofe@18107
  1130
          in list_all (z :: map (pair "x") Us, HOLogic.mk_Trueprop
berghofe@18658
  1131
            (make_pred fsT (body_index dt) U $ Bound l $ app_bnds (Free (s, T)) l))
berghofe@18107
  1132
          end;
berghofe@18107
  1133
berghofe@18107
  1134
        val prems = map mk_prem (recs ~~ rec_tnames ~~ recTs');
berghofe@18107
  1135
        val prems' = map (fn p as (_, T) => HOLogic.mk_Trueprop
berghofe@18658
  1136
            (f T (Free p) (Free z)))
berghofe@18107
  1137
          (map (curry List.nth frees) (List.concat (map (fn (m, n) =>
berghofe@18107
  1138
             m upto m + n - 1) idxs)))
berghofe@18107
  1139
berghofe@18302
  1140
      in list_all_free (frees @ [z], Logic.list_implies (prems' @ prems,
berghofe@18658
  1141
        HOLogic.mk_Trueprop (make_pred fsT k T $ Free z $
berghofe@18302
  1142
          list_comb (Const (cname, Ts ---> T), map Free frees))))
berghofe@18107
  1143
      end;
berghofe@18107
  1144
berghofe@18107
  1145
    val ind_prems = List.concat (map (fn (((i, (_, _, constrs)), (_, idxss)), T) =>
berghofe@18658
  1146
      map (make_ind_prem fsT (fn T => fn t => fn u =>
berghofe@19494
  1147
        Const ("Nominal.fresh", T --> fsT --> HOLogic.boolT) $ t $ u) i T)
berghofe@18658
  1148
          (constrs ~~ idxss)) (descr'' ~~ ndescr ~~ recTs));
berghofe@18107
  1149
    val tnames = DatatypeProp.make_tnames recTs;
berghofe@18658
  1150
    val zs = variantlist (replicate (length descr'') "z", tnames);
berghofe@18107
  1151
    val ind_concl = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop "op &")
berghofe@18658
  1152
      (map (fn ((((i, _), T), tname), z) =>
berghofe@18658
  1153
        make_pred fsT i T $ Free (z, fsT) $ Free (tname, T))
berghofe@18658
  1154
        (descr'' ~~ recTs ~~ tnames ~~ zs)));
berghofe@18107
  1155
    val induct = Logic.list_implies (ind_prems, ind_concl);
berghofe@18107
  1156
berghofe@18658
  1157
    val ind_prems' =
berghofe@18658
  1158
      map (fn (_, f as Free (_, T)) => list_all_free ([("x", fsT')],
berghofe@18658
  1159
        HOLogic.mk_Trueprop (HOLogic.mk_mem (f $ Free ("x", fsT'),
berghofe@18658
  1160
          Const ("Finite_Set.Finites", HOLogic.mk_setT (body_type T)))))) fresh_fs @
berghofe@18658
  1161
      List.concat (map (fn (((i, (_, _, constrs)), (_, idxss)), T) =>
berghofe@18658
  1162
        map (make_ind_prem fsT' (fn T => fn t => fn u => HOLogic.Not $
berghofe@18658
  1163
          HOLogic.mk_mem (t, the (AList.lookup op = fresh_fs T) $ u)) i T)
berghofe@18658
  1164
            (constrs ~~ idxss)) (descr'' ~~ ndescr ~~ recTs));
berghofe@18658
  1165
    val ind_concl' = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop "op &")
berghofe@18658
  1166
      (map (fn ((((i, _), T), tname), z) =>
berghofe@18658
  1167
        make_pred fsT' i T $ Free (z, fsT') $ Free (tname, T))
berghofe@18658
  1168
        (descr'' ~~ recTs ~~ tnames ~~ zs)));
berghofe@18658
  1169
    val induct' = Logic.list_implies (ind_prems', ind_concl');
berghofe@18658
  1170
berghofe@18658
  1171
    fun mk_perm Ts (t, u) =
berghofe@18658
  1172
      let
berghofe@18658
  1173
        val T = fastype_of1 (Ts, t);
berghofe@18658
  1174
        val U = fastype_of1 (Ts, u)
berghofe@19494
  1175
      in Const ("Nominal.perm", T --> U --> U) $ t $ u end;
berghofe@18658
  1176
berghofe@18658
  1177
    val aux_ind_vars =
berghofe@18658
  1178
      (DatatypeProp.indexify_names (replicate (length dt_atomTs) "pi") ~~
berghofe@18658
  1179
       map mk_permT dt_atomTs) @ [("z", fsT')];
berghofe@18658
  1180
    val aux_ind_Ts = rev (map snd aux_ind_vars);
berghofe@18658
  1181
    val aux_ind_concl = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop "op &")
berghofe@18658
  1182
      (map (fn (((i, _), T), tname) =>
berghofe@18658
  1183
        HOLogic.list_all (aux_ind_vars, make_pred fsT' i T $ Bound 0 $
berghofe@18658
  1184
          foldr (mk_perm aux_ind_Ts) (Free (tname, T))
berghofe@18658
  1185
            (map Bound (length dt_atomTs downto 1))))
berghofe@18658
  1186
        (descr'' ~~ recTs ~~ tnames)));
berghofe@18658
  1187
berghofe@18658
  1188
    fun mk_ind_perm i k p l vs j =
berghofe@18658
  1189
      let
berghofe@18658
  1190
        val n = length vs;
berghofe@18658
  1191
        val Ts = map snd vs;
berghofe@18658
  1192
        val T = List.nth (Ts, i - j);
berghofe@18658
  1193
        val pT = NominalAtoms.mk_permT T
berghofe@18658
  1194
      in
berghofe@18658
  1195
        Const ("List.list.Cons", HOLogic.mk_prodT (T, T) --> pT --> pT) $
berghofe@18658
  1196
          (HOLogic.pair_const T T $ Bound (l - j) $ foldr (mk_perm Ts)
berghofe@18658
  1197
            (Bound (i - j))
berghofe@18658
  1198
            (map (mk_ind_perm i k p l vs) (j - 1 downto 0) @
berghofe@18658
  1199
             map Bound (n - k - 1 downto n - k - p))) $
berghofe@18658
  1200
          Const ("List.list.Nil", pT)
berghofe@18658
  1201
      end;
berghofe@18658
  1202
berghofe@18658
  1203
    fun mk_fresh i i' j k p l vs _ _ =
berghofe@18658
  1204
      let
berghofe@18658
  1205
        val n = length vs;
berghofe@18658
  1206
        val Ts = map snd vs;
berghofe@18658
  1207
        val T = List.nth (Ts, n - i - 1 - j);
berghofe@18658
  1208
        val f = the (AList.lookup op = fresh_fs T);
berghofe@18658
  1209
        val U = List.nth (Ts, n - i' - 1);
berghofe@18658
  1210
        val S = HOLogic.mk_setT T;
berghofe@18658
  1211
        val prms = map (mk_ind_perm (n - i) k p (n - l) (("a", T) :: vs))
berghofe@18658
  1212
            (j - 1 downto 0) @
berghofe@18658
  1213
          map Bound (n - k downto n - k - p + 1)
berghofe@18658
  1214
      in
berghofe@18658
  1215
        HOLogic.mk_Trueprop (Const ("Ex", (T --> HOLogic.boolT) --> HOLogic.boolT) $
berghofe@18658
  1216
          Abs ("a", T, HOLogic.Not $
berghofe@18658
  1217
            (Const ("op :", T --> S --> HOLogic.boolT) $ Bound 0 $
berghofe@18658
  1218
              (Const ("insert", T --> S --> S) $
berghofe@18658
  1219
                (foldr (mk_perm (T :: Ts)) (Bound (n - i - j)) prms) $
berghofe@18658
  1220
                (Const ("op Un", S --> S --> S) $ (f $ Bound (n - k - p)) $
berghofe@19494
  1221
                   (Const ("Nominal.supp", U --> S) $
berghofe@18658
  1222
                     foldr (mk_perm (T :: Ts)) (Bound (n - i')) prms))))))
berghofe@18658
  1223
      end;
urbanc@18104
  1224
berghofe@18658
  1225
    fun mk_fresh_constr is p vs _ concl =
berghofe@18658
  1226
      let
berghofe@18658
  1227
        val n = length vs;
berghofe@18658
  1228
        val Ts = map snd vs;
berghofe@18658
  1229
        val _ $ (_ $ _ $ t) = concl;
berghofe@18658
  1230
        val c = head_of t;
berghofe@18658
  1231
        val T = body_type (fastype_of c);
berghofe@18658
  1232
        val k = foldr op + 0 (map (fn (_, i) => i + 1) is);
berghofe@18658
  1233
        val ps = map Bound (n - k - 1 downto n - k - p);
berghofe@18658
  1234
        val (_, _, ts, us) = foldl (fn ((_, i), (m, n, ts, us)) =>
berghofe@18658
  1235
          (m - i - 1, n - i,
berghofe@18658
  1236
           ts @ map Bound (n downto n - i + 1) @
berghofe@18658
  1237
             [foldr (mk_perm Ts) (Bound (m - i))
berghofe@18658
  1238
                (map (mk_ind_perm m k p n vs) (i - 1 downto 0) @ ps)],
berghofe@18658
  1239
           us @ map (fn j => foldr (mk_perm Ts) (Bound j) ps) (m downto m - i)))
berghofe@18658
  1240
          (n - 1, n - k - p - 2, [], []) is
berghofe@18658
  1241
      in
berghofe@18658
  1242
        HOLogic.mk_Trueprop (HOLogic.eq_const T $ list_comb (c, ts) $ list_comb (c, us))
berghofe@18658
  1243
      end;
berghofe@18658
  1244
berghofe@18658
  1245
    val abs_fun_finite_supp = PureThy.get_thm thy9 (Name "abs_fun_finite_supp");
berghofe@18658
  1246
berghofe@18658
  1247
    val at_finite_select = PureThy.get_thm thy9 (Name "at_finite_select");
berghofe@18658
  1248
berghofe@18658
  1249
    val induct_aux_lemmas = List.concat (map (fn Type (s, _) =>
berghofe@18658
  1250
      [PureThy.get_thm thy9 (Name ("pt_" ^ Sign.base_name s ^ "_inst")),
berghofe@18658
  1251
       PureThy.get_thm thy9 (Name ("fs_" ^ Sign.base_name s ^ "1")),
berghofe@18658
  1252
       PureThy.get_thm thy9 (Name ("at_" ^ Sign.base_name s ^ "_inst"))]) dt_atomTs);
berghofe@18658
  1253
berghofe@18658
  1254
    val induct_aux_lemmas' = map (fn Type (s, _) =>
berghofe@18658
  1255
      PureThy.get_thm thy9 (Name ("pt_" ^ Sign.base_name s ^ "2")) RS sym) dt_atomTs;
berghofe@18658
  1256
berghofe@18658
  1257
    val induct_aux = standard (Goal.prove thy9 [] ind_prems' ind_concl'
berghofe@18658
  1258
      (fn prems => EVERY
berghofe@18658
  1259
        ([mk_subgoal 1 (K (K (K aux_ind_concl))),
berghofe@18658
  1260
          indtac dt_induct tnames 1] @
berghofe@18658
  1261
         List.concat (map (fn ((_, (_, _, constrs)), (_, constrs')) =>
berghofe@18658
  1262
           List.concat (map (fn ((cname, cargs), is) =>
berghofe@18658
  1263
             [simp_tac (HOL_basic_ss addsimps List.concat perm_simps') 1,
berghofe@18658
  1264
              REPEAT (rtac allI 1)] @
berghofe@18658
  1265
             List.concat (map
berghofe@18658
  1266
               (fn ((_, 0), _) => []
berghofe@18658
  1267
                 | ((i, j), k) => List.concat (map (fn j' =>
berghofe@18658
  1268
                     let
berghofe@18658
  1269
                       val DtType (tname, _) = List.nth (cargs, i + j');
berghofe@18658
  1270
                       val atom = Sign.base_name tname
berghofe@18658
  1271
                     in
berghofe@18658
  1272
                       [mk_subgoal 1 (mk_fresh i (i + j) j'
berghofe@18658
  1273
                          (length cargs) (length dt_atomTs)
berghofe@18658
  1274
                          (length cargs + length dt_atomTs + 1 + i - k)),
berghofe@18658
  1275
                        rtac at_finite_select 1,
berghofe@18658
  1276
                        rtac (PureThy.get_thm thy9 (Name ("at_" ^ atom ^ "_inst"))) 1,
berghofe@18658
  1277
                        asm_full_simp_tac (simpset_of thy9 addsimps
berghofe@18658
  1278
                          [PureThy.get_thm thy9 (Name ("fs_" ^ atom ^ "1"))]) 1,
berghofe@18658
  1279
                        resolve_tac prems 1,
berghofe@18658
  1280
                        etac exE 1,
berghofe@18658
  1281
                        asm_full_simp_tac (simpset_of thy9 addsimps
berghofe@18658
  1282
                          [symmetric fresh_def]) 1]
berghofe@18658
  1283
                     end) (0 upto j - 1))) (is ~~ (0 upto length is - 1))) @
berghofe@18658
  1284
             (if exists (not o equal 0 o snd) is then
berghofe@18658
  1285
                [mk_subgoal 1 (mk_fresh_constr is (length dt_atomTs)),
berghofe@18658
  1286
                 asm_full_simp_tac (simpset_of thy9 addsimps
berghofe@18658
  1287
                   (List.concat inject_thms @
berghofe@18658
  1288
                    alpha @ abs_perm @ abs_fresh @ [abs_fun_finite_supp] @
berghofe@18658
  1289
                    induct_aux_lemmas)) 1,
berghofe@18658
  1290
                 dtac sym 1,
berghofe@18658
  1291
                 asm_full_simp_tac (simpset_of thy9
berghofe@18658
  1292
                   addsimps induct_aux_lemmas'
berghofe@18658
  1293
                   addsimprocs [perm_simproc]) 1,
berghofe@18658
  1294
                 REPEAT (etac conjE 1)]
berghofe@18658
  1295
              else
berghofe@18658
  1296
                []) @
berghofe@18658
  1297
             [(resolve_tac prems THEN_ALL_NEW
berghofe@18658
  1298
                (atac ORELSE' ((REPEAT o etac allE) THEN' atac))) 1])
berghofe@18658
  1299
               (constrs ~~ constrs'))) (descr'' ~~ ndescr)) @
berghofe@18658
  1300
         [REPEAT (eresolve_tac [conjE, allE_Nil] 1),
berghofe@18658
  1301
          REPEAT (etac allE 1),
berghofe@18658
  1302
          REPEAT (TRY (rtac conjI 1) THEN asm_full_simp_tac (simpset_of thy9) 1)])));
berghofe@18658
  1303
berghofe@18658
  1304
    val induct_aux' = Thm.instantiate ([],
berghofe@18658
  1305
      map (fn (s, T) =>
berghofe@18658
  1306
        let val pT = TVar (("'n", 0), HOLogic.typeS) --> T --> HOLogic.boolT
berghofe@18658
  1307
        in (cterm_of thy9 (Var ((s, 0), pT)), cterm_of thy9 (Free (s, pT))) end)
berghofe@18658
  1308
          (pnames ~~ recTs) @
berghofe@18658
  1309
      map (fn (_, f) =>
berghofe@18658
  1310
        let val f' = Logic.varify f
berghofe@18658
  1311
        in (cterm_of thy9 f',
berghofe@19494
  1312
          cterm_of thy9 (Const ("Nominal.supp", fastype_of f')))
berghofe@18658
  1313
        end) fresh_fs) induct_aux;
berghofe@18658
  1314
berghofe@18658
  1315
    val induct = standard (Goal.prove thy9 [] ind_prems ind_concl
berghofe@18658
  1316
      (fn prems => EVERY
berghofe@18658
  1317
         [rtac induct_aux' 1,
berghofe@18658
  1318
          REPEAT (resolve_tac induct_aux_lemmas 1),
berghofe@18658
  1319
          REPEAT ((resolve_tac prems THEN_ALL_NEW
berghofe@18658
  1320
            (etac meta_spec ORELSE' full_simp_tac (HOL_basic_ss addsimps [fresh_def]))) 1)]))
berghofe@18658
  1321
berghofe@18658
  1322
    val (_, thy10) = thy9 |>
berghofe@18016
  1323
      Theory.add_path big_name |>
berghofe@18658
  1324
      PureThy.add_thms [(("induct'", induct_aux), [])] ||>>
berghofe@18658
  1325
      PureThy.add_thms [(("induct", induct), [case_names_induct])] ||>>
berghofe@18658
  1326
      PureThy.add_thmss [(("inducts", projections induct), [case_names_induct])] ||>
berghofe@18658
  1327
      Theory.parent_path;
berghofe@18658
  1328
berghofe@19322
  1329
    (**** recursion combinator ****)
berghofe@19251
  1330
berghofe@19322
  1331
    val _ = warning "defining recursion combinator ...";
berghofe@19251
  1332
berghofe@19251
  1333
    val used = foldr add_typ_tfree_names [] recTs;
berghofe@19251
  1334
berghofe@19322
  1335
    val (rec_result_Ts, rec_fn_Ts) = DatatypeProp.make_primrec_Ts descr' sorts' used;
berghofe@19251
  1336
berghofe@19251
  1337
    val permTs = map mk_permT dt_atomTs;
berghofe@19251
  1338
    val perms = map Free
berghofe@19251
  1339
      (DatatypeProp.indexify_names (replicate (length permTs) "pi") ~~ permTs);
berghofe@19251
  1340
berghofe@19322
  1341
    val rec_set_Ts = map (fn (T1, T2) => rec_fn_Ts ---> HOLogic.mk_setT
berghofe@19251
  1342
      (HOLogic.mk_prodT (T1, permTs ---> T2))) (recTs ~~ rec_result_Ts);
berghofe@19251
  1343
berghofe@19322
  1344
    val big_rec_name = big_name ^ "_rec_set";
berghofe@19322
  1345
    val rec_set_names = map (Sign.full_name (Theory.sign_of thy10))
berghofe@19322
  1346
      (if length descr'' = 1 then [big_rec_name] else
berghofe@19322
  1347
        (map ((curry (op ^) (big_rec_name ^ "_")) o string_of_int)
berghofe@19251
  1348
          (1 upto (length descr''))));
berghofe@19251
  1349
berghofe@19322
  1350
    val rec_fns = map (uncurry (mk_Free "f"))
berghofe@19322
  1351
      (rec_fn_Ts ~~ (1 upto (length rec_fn_Ts)));
berghofe@19322
  1352
    val rec_sets = map (fn c => list_comb (Const c, rec_fns))
berghofe@19322
  1353
      (rec_set_names ~~ rec_set_Ts);
berghofe@19251
  1354
berghofe@19322
  1355
    (* introduction rules for graph of recursion function *)
berghofe@19251
  1356
berghofe@19251
  1357
    fun partition_cargs idxs xs = map (fn (i, j) =>
berghofe@19251
  1358
      (List.take (List.drop (xs, i), j), List.nth (xs, i + j))) idxs;
berghofe@19251
  1359
berghofe@19494
  1360
    fun mk_fresh_fun (a, t) = Const ("Nominal.fresh_fun",
berghofe@19251
  1361
      (fastype_of a --> fastype_of t) --> fastype_of t) $ lambda a t;
berghofe@19251
  1362
berghofe@19322
  1363
    fun make_rec_intr T rec_set ((rec_intr_ts, l), ((cname, cargs), idxs)) =
berghofe@19251
  1364
      let
berghofe@19322
  1365
        fun mk_prem ((dts, (dt, U)), (j, k, prems, t1s, t2s, t3s, atoms)) =
berghofe@19251
  1366
          let
berghofe@19251
  1367
            val free1 = mk_Free "x" U (j + length dts);
berghofe@19251
  1368
            val Us = map snd dts;
berghofe@19251
  1369
            val xs = Us ~~ (j upto j + length dts - 1);
berghofe@19251
  1370
            val frees = map (uncurry (mk_Free "x")) xs;
berghofe@19251
  1371
            val frees' = map (uncurry (mk_Free "x'")) xs;
berghofe@19251
  1372
            val frees'' = Us ~~ (frees ~~ frees');
berghofe@19251
  1373
            val pis = map (fn (T, p) =>
berghofe@19251
  1374
              case filter (equal T o fst) frees'' of
berghofe@19251
  1375
                [] => p
berghofe@19251
  1376
              | xs => HOLogic.mk_binop "List.op @" (p,
berghofe@19251
  1377
                HOLogic.mk_list (HOLogic.mk_prod o snd)
berghofe@19251
  1378
                  (HOLogic.mk_prodT (T, T)) xs))
berghofe@19251
  1379
                  (dt_atomTs ~~ perms)
berghofe@19251
  1380
          in (case dt of
berghofe@19251
  1381
             DtRec m =>
berghofe@19251
  1382
               let val free2 = mk_Free "y"
berghofe@19251
  1383
                 (permTs ---> List.nth (rec_result_Ts, m)) k
berghofe@19251
  1384
               in (j + length dts + 1, k + 1,
berghofe@19251
  1385
                   HOLogic.mk_Trueprop
berghofe@19251
  1386
                     (HOLogic.mk_mem (HOLogic.mk_prod
berghofe@19251
  1387
                       (free1, free2),
berghofe@19322
  1388
                         List.nth (rec_sets, m))) :: prems,
berghofe@19251
  1389
                   frees @ free1 :: t1s,
berghofe@19322
  1390
                   frees' @ foldr (mk_perm []) free1 pis :: t2s,
berghofe@19322
  1391
                   list_comb (free2, pis) :: t3s,
berghofe@19251
  1392
                   frees' @ atoms)
berghofe@19251
  1393
               end
berghofe@19251
  1394
           | _ => (j + length dts + 1, k, prems,
berghofe@19251
  1395
               frees @ free1 :: t1s,
berghofe@19251
  1396
               frees' @ foldr (mk_perm []) free1 pis :: t2s,
berghofe@19322
  1397
               t3s,
berghofe@19251
  1398
               frees' @ atoms))
berghofe@19251
  1399
          end;
berghofe@19251
  1400
berghofe@19251
  1401
        val Ts = map (typ_of_dtyp descr'' sorts') cargs;
berghofe@19322
  1402
        val (_, _, prems, t1s, t2s, t3s, atoms) = foldr mk_prem (1, 1, [], [], [], [], [])
berghofe@19251
  1403
          (partition_cargs idxs (cargs ~~ Ts))
berghofe@19251
  1404
berghofe@19322
  1405
      in (rec_intr_ts @ [Logic.list_implies (prems, HOLogic.mk_Trueprop (HOLogic.mk_mem
berghofe@19251
  1406
        (HOLogic.mk_prod (list_comb (Const (cname, Ts ---> T), t1s),
berghofe@19251
  1407
          foldr (uncurry lambda)
berghofe@19251
  1408
            (foldr mk_fresh_fun
berghofe@19322
  1409
              (list_comb (List.nth (rec_fns, l), t2s @ t3s)) atoms)
berghofe@19322
  1410
            perms), rec_set)))], l + 1)
berghofe@19251
  1411
      end;
berghofe@19251
  1412
berghofe@19322
  1413
    val (rec_intr_ts, _) = Library.foldl (fn (x, (((d, d'), T), rec_set)) =>
berghofe@19322
  1414
      Library.foldl (make_rec_intr T rec_set) (x, #3 (snd d) ~~ snd d'))
berghofe@19322
  1415
        (([], 0), descr'' ~~ ndescr ~~ recTs ~~ rec_sets);
berghofe@19251
  1416
berghofe@19322
  1417
    val (thy11, {intrs = rec_intrs, elims = rec_elims, ...}) =
berghofe@19251
  1418
      setmp InductivePackage.quiet_mode (!quiet_mode)
berghofe@19322
  1419
        (InductivePackage.add_inductive_i false true big_rec_name false false false
berghofe@19322
  1420
           rec_sets (map (fn x => (("", x), [])) rec_intr_ts) []) thy10;
berghofe@19251
  1421
berghofe@17870
  1422
  in
berghofe@19251
  1423
    thy11
berghofe@17870
  1424
  end;
berghofe@17870
  1425
berghofe@17870
  1426
val add_nominal_datatype = gen_add_nominal_datatype read_typ true;
berghofe@17870
  1427
berghofe@17870
  1428
berghofe@17870
  1429
(* FIXME: The following stuff should be exported by DatatypePackage *)
berghofe@17870
  1430
berghofe@17870
  1431
local structure P = OuterParse and K = OuterKeyword in
berghofe@17870
  1432
berghofe@17870
  1433
val datatype_decl =
berghofe@17870
  1434
  Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") -- P.type_args -- P.name -- P.opt_infix --
berghofe@17870
  1435
    (P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix));
berghofe@17870
  1436
berghofe@17870
  1437
fun mk_datatype args =
berghofe@17870
  1438
  let
berghofe@17870
  1439
    val names = map (fn ((((NONE, _), t), _), _) => t | ((((SOME t, _), _), _), _) => t) args;
berghofe@17870
  1440
    val specs = map (fn ((((_, vs), t), mx), cons) =>
berghofe@17870
  1441
      (vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args;
berghofe@18068
  1442
  in add_nominal_datatype false names specs end;
berghofe@17870
  1443
berghofe@17870
  1444
val nominal_datatypeP =
berghofe@17870
  1445
  OuterSyntax.command "nominal_datatype" "define inductive datatypes" K.thy_decl
berghofe@17870
  1446
    (P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype));
berghofe@17870
  1447
berghofe@17870
  1448
val _ = OuterSyntax.add_parsers [nominal_datatypeP];
berghofe@17870
  1449
berghofe@17870
  1450
end;
berghofe@17870
  1451
berghofe@18261
  1452
end
berghofe@18261
  1453