src/HOL/Nominal/nominal_package.ML
author urbanc
Fri Nov 25 14:51:39 2005 +0100 (2005-11-25)
changeset 18246 676d2e625d98
parent 18245 65e60434b3c2
child 18261 1318955d57ac
permissions -rw-r--r--
added fsub.thy (poplmark challenge) to the examples
directory.
berghofe@17870
     1
(* $Id$ *)
berghofe@17870
     2
berghofe@17870
     3
signature NOMINAL_PACKAGE =
berghofe@17870
     4
sig
berghofe@17870
     5
  val add_nominal_datatype : bool -> string list -> (string list * bstring * mixfix *
berghofe@18068
     6
    (bstring * string list * mixfix) list) list -> theory -> theory
berghofe@17870
     7
end
berghofe@17870
     8
berghofe@18068
     9
structure NominalPackage : NOMINAL_PACKAGE =
berghofe@17870
    10
struct
berghofe@17870
    11
berghofe@17870
    12
open DatatypeAux;
berghofe@18068
    13
open NominalAtoms;
berghofe@17870
    14
berghofe@18016
    15
(** FIXME: DatatypePackage should export this function **)
berghofe@18016
    16
berghofe@18016
    17
local
berghofe@18016
    18
berghofe@18016
    19
fun dt_recs (DtTFree _) = []
berghofe@18016
    20
  | dt_recs (DtType (_, dts)) = List.concat (map dt_recs dts)
berghofe@18016
    21
  | dt_recs (DtRec i) = [i];
berghofe@18016
    22
berghofe@18016
    23
fun dt_cases (descr: descr) (_, args, constrs) =
berghofe@18016
    24
  let
berghofe@18016
    25
    fun the_bname i = Sign.base_name (#1 (valOf (AList.lookup (op =) descr i)));
berghofe@18016
    26
    val bnames = map the_bname (distinct (List.concat (map dt_recs args)));
berghofe@18016
    27
  in map (fn (c, _) => space_implode "_" (Sign.base_name c :: bnames)) constrs end;
berghofe@18016
    28
berghofe@18016
    29
berghofe@18016
    30
fun induct_cases descr =
berghofe@18016
    31
  DatatypeProp.indexify_names (List.concat (map (dt_cases descr) (map #2 descr)));
berghofe@18016
    32
berghofe@18016
    33
fun exhaust_cases descr i = dt_cases descr (valOf (AList.lookup (op =) descr i));
berghofe@18016
    34
berghofe@18016
    35
in
berghofe@18016
    36
berghofe@18016
    37
fun mk_case_names_induct descr = RuleCases.case_names (induct_cases descr);
berghofe@18016
    38
berghofe@18016
    39
fun mk_case_names_exhausts descr new =
berghofe@18016
    40
  map (RuleCases.case_names o exhaust_cases descr o #1)
berghofe@18016
    41
    (List.filter (fn ((_, (name, _, _))) => name mem_string new) descr);
berghofe@18016
    42
berghofe@18016
    43
end;
berghofe@18016
    44
berghofe@18016
    45
(*******************************)
berghofe@18016
    46
berghofe@17870
    47
val (_ $ (_ $ (_ $ (distinct_f $ _) $ _))) = hd (prems_of distinct_lemma);
berghofe@17870
    48
berghofe@17870
    49
fun read_typ sign ((Ts, sorts), str) =
berghofe@17870
    50
  let
berghofe@17870
    51
    val T = Type.no_tvars (Sign.read_typ (sign, (AList.lookup op =)
berghofe@17870
    52
      (map (apfst (rpair ~1)) sorts)) str) handle TYPE (msg, _, _) => error msg
berghofe@17870
    53
  in (Ts @ [T], add_typ_tfrees (T, sorts)) end;
berghofe@17870
    54
berghofe@17870
    55
(** taken from HOL/Tools/datatype_aux.ML **)
berghofe@17870
    56
berghofe@17870
    57
fun indtac indrule indnames i st =
berghofe@17870
    58
  let
berghofe@17870
    59
    val ts = HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of indrule));
berghofe@17870
    60
    val ts' = HOLogic.dest_conj (HOLogic.dest_Trueprop
berghofe@17870
    61
      (Logic.strip_imp_concl (List.nth (prems_of st, i - 1))));
berghofe@17870
    62
    val getP = if can HOLogic.dest_imp (hd ts) then
berghofe@17870
    63
      (apfst SOME) o HOLogic.dest_imp else pair NONE;
berghofe@17870
    64
    fun abstr (t1, t2) = (case t1 of
berghofe@17870
    65
        NONE => (case filter (fn Free (s, _) => s mem indnames | _ => false)
berghofe@17870
    66
              (term_frees t2) of
berghofe@17870
    67
            [Free (s, T)] => absfree (s, T, t2)
berghofe@17870
    68
          | _ => sys_error "indtac")
berghofe@17870
    69
      | SOME (_ $ t' $ _) => Abs ("x", fastype_of t', abstract_over (t', t2)))
berghofe@17870
    70
    val cert = cterm_of (Thm.sign_of_thm st);
berghofe@17870
    71
    val Ps = map (cert o head_of o snd o getP) ts;
berghofe@17870
    72
    val indrule' = cterm_instantiate (Ps ~~
berghofe@17870
    73
      (map (cert o abstr o getP) ts')) indrule
berghofe@17870
    74
  in
berghofe@17870
    75
    rtac indrule' i st
berghofe@17870
    76
  end;
berghofe@17870
    77
berghofe@17870
    78
fun gen_add_nominal_datatype prep_typ err flat_names new_type_names dts thy =
berghofe@17870
    79
  let
berghofe@17870
    80
    (* this theory is used just for parsing *)
berghofe@17870
    81
  
berghofe@17870
    82
    val tmp_thy = thy |>
berghofe@17870
    83
      Theory.copy |>
berghofe@17870
    84
      Theory.add_types (map (fn (tvs, tname, mx, _) =>
berghofe@17870
    85
        (tname, length tvs, mx)) dts);
berghofe@17870
    86
berghofe@17870
    87
    val sign = Theory.sign_of tmp_thy;
berghofe@17870
    88
berghofe@17870
    89
    val atoms = atoms_of thy;
berghofe@17870
    90
    val classes = map (NameSpace.map_base (fn s => "pt_" ^ s)) atoms;
berghofe@17870
    91
    val cp_classes = List.concat (map (fn atom1 => map (fn atom2 =>
berghofe@17870
    92
      Sign.intern_class thy ("cp_" ^ Sign.base_name atom1 ^ "_" ^
berghofe@17870
    93
        Sign.base_name atom2)) atoms) atoms);
berghofe@17870
    94
    fun augment_sort S = S union classes;
berghofe@17870
    95
    val augment_sort_typ = map_type_tfree (fn (s, S) => TFree (s, augment_sort S));
berghofe@17870
    96
berghofe@17870
    97
    fun prep_constr ((constrs, sorts), (cname, cargs, mx)) =
berghofe@17870
    98
      let val (cargs', sorts') = Library.foldl (prep_typ sign) (([], sorts), cargs)
berghofe@17870
    99
      in (constrs @ [(cname, cargs', mx)], sorts') end
berghofe@17870
   100
berghofe@17870
   101
    fun prep_dt_spec ((dts, sorts), (tvs, tname, mx, constrs)) =
berghofe@17870
   102
      let val (constrs', sorts') = Library.foldl prep_constr (([], sorts), constrs)
berghofe@17870
   103
      in (dts @ [(tvs, tname, mx, constrs')], sorts') end
berghofe@17870
   104
berghofe@17870
   105
    val (dts', sorts) = Library.foldl prep_dt_spec (([], []), dts);
berghofe@17870
   106
    val sorts' = map (apsnd augment_sort) sorts;
berghofe@17870
   107
    val tyvars = map #1 dts';
berghofe@17870
   108
berghofe@17870
   109
    val types_syntax = map (fn (tvs, tname, mx, constrs) => (tname, mx)) dts';
berghofe@17870
   110
    val constr_syntax = map (fn (tvs, tname, mx, constrs) =>
berghofe@17870
   111
      map (fn (cname, cargs, mx) => (cname, mx)) constrs) dts';
berghofe@17870
   112
berghofe@17870
   113
    val ps = map (fn (_, n, _, _) =>
berghofe@17870
   114
      (Sign.full_name sign n, Sign.full_name sign (n ^ "_Rep"))) dts;
berghofe@17870
   115
    val rps = map Library.swap ps;
berghofe@17870
   116
berghofe@17870
   117
    fun replace_types (Type ("nominal.ABS", [T, U])) = 
berghofe@17870
   118
          Type ("fun", [T, Type ("nominal.nOption", [replace_types U])])
berghofe@17870
   119
      | replace_types (Type (s, Ts)) =
berghofe@17870
   120
          Type (getOpt (AList.lookup op = ps s, s), map replace_types Ts)
berghofe@17870
   121
      | replace_types T = T;
berghofe@17870
   122
berghofe@17870
   123
    fun replace_types' (Type (s, Ts)) =
berghofe@17870
   124
          Type (getOpt (AList.lookup op = rps s, s), map replace_types' Ts)
berghofe@17870
   125
      | replace_types' T = T;
berghofe@17870
   126
berghofe@17870
   127
    val dts'' = map (fn (tvs, tname, mx, constrs) => (tvs, tname ^ "_Rep", NoSyn,
berghofe@17870
   128
      map (fn (cname, cargs, mx) => (cname,
berghofe@17870
   129
        map (augment_sort_typ o replace_types) cargs, NoSyn)) constrs)) dts';
berghofe@17870
   130
berghofe@17870
   131
    val new_type_names' = map (fn n => n ^ "_Rep") new_type_names;
berghofe@17870
   132
    val full_new_type_names' = map (Sign.full_name (sign_of thy)) new_type_names';
berghofe@17870
   133
urbanc@18045
   134
    val ({induction, ...},thy1) =
berghofe@17870
   135
      DatatypePackage.add_datatype_i err flat_names new_type_names' dts'' thy;
berghofe@17870
   136
berghofe@17870
   137
    val SOME {descr, ...} = Symtab.lookup
berghofe@17870
   138
      (DatatypePackage.get_datatypes thy1) (hd full_new_type_names');
berghofe@18107
   139
    fun nth_dtyp i = typ_of_dtyp descr sorts' (DtRec i);
berghofe@18107
   140
berghofe@18107
   141
    val dt_atomTs = filter (fn Type (s, []) => s mem atoms | _ => false)
berghofe@18107
   142
      (get_nonrec_types descr sorts);
berghofe@17870
   143
berghofe@17870
   144
    (**** define permutation functions ****)
berghofe@17870
   145
berghofe@17870
   146
    val permT = mk_permT (TFree ("'x", HOLogic.typeS));
berghofe@17870
   147
    val pi = Free ("pi", permT);
berghofe@17870
   148
    val perm_types = map (fn (i, _) =>
berghofe@17870
   149
      let val T = nth_dtyp i
berghofe@17870
   150
      in permT --> T --> T end) descr;
berghofe@17870
   151
    val perm_names = replicate (length new_type_names) "nominal.perm" @
berghofe@17870
   152
      DatatypeProp.indexify_names (map (fn i => Sign.full_name (sign_of thy1)
berghofe@17870
   153
        ("perm_" ^ name_of_typ (nth_dtyp i)))
berghofe@17870
   154
          (length new_type_names upto length descr - 1));
berghofe@17870
   155
    val perm_names_types = perm_names ~~ perm_types;
berghofe@17870
   156
berghofe@17870
   157
    val perm_eqs = List.concat (map (fn (i, (_, _, constrs)) =>
berghofe@17870
   158
      let val T = nth_dtyp i
berghofe@17870
   159
      in map (fn (cname, dts) => 
berghofe@17870
   160
        let
berghofe@18107
   161
          val Ts = map (typ_of_dtyp descr sorts') dts;
berghofe@17870
   162
          val names = DatatypeProp.make_tnames Ts;
berghofe@17870
   163
          val args = map Free (names ~~ Ts);
berghofe@17870
   164
          val c = Const (cname, Ts ---> T);
berghofe@17870
   165
          fun perm_arg (dt, x) =
berghofe@17870
   166
            let val T = type_of x
berghofe@17870
   167
            in if is_rec_type dt then
berghofe@17870
   168
                let val (Us, _) = strip_type T
berghofe@17870
   169
                in list_abs (map (pair "x") Us,
berghofe@17870
   170
                  Const (List.nth (perm_names_types, body_index dt)) $ pi $
berghofe@17870
   171
                    list_comb (x, map (fn (i, U) =>
berghofe@17870
   172
                      Const ("nominal.perm", permT --> U --> U) $
berghofe@17870
   173
                        (Const ("List.rev", permT --> permT) $ pi) $
berghofe@17870
   174
                        Bound i) ((length Us - 1 downto 0) ~~ Us)))
berghofe@17870
   175
                end
berghofe@17870
   176
              else Const ("nominal.perm", permT --> T --> T) $ pi $ x
berghofe@17870
   177
            end;  
berghofe@17870
   178
        in
berghofe@17870
   179
          (("", HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17870
   180
            (Const (List.nth (perm_names_types, i)) $
berghofe@17870
   181
               Free ("pi", mk_permT (TFree ("'x", HOLogic.typeS))) $
berghofe@17870
   182
               list_comb (c, args),
berghofe@17870
   183
             list_comb (c, map perm_arg (dts ~~ args))))), [])
berghofe@17870
   184
        end) constrs
berghofe@17870
   185
      end) descr);
berghofe@17870
   186
berghofe@17870
   187
    val (thy2, perm_simps) = thy1 |>
berghofe@17870
   188
      Theory.add_consts_i (map (fn (s, T) => (Sign.base_name s, T, NoSyn))
berghofe@17870
   189
        (List.drop (perm_names_types, length new_type_names))) |>
berghofe@17870
   190
      PrimrecPackage.add_primrec_i "" perm_eqs;
berghofe@17870
   191
berghofe@17870
   192
    (**** prove that permutation functions introduced by unfolding are ****)
berghofe@17870
   193
    (**** equivalent to already existing permutation functions         ****)
berghofe@17870
   194
berghofe@17870
   195
    val _ = warning ("length descr: " ^ string_of_int (length descr));
berghofe@17870
   196
    val _ = warning ("length new_type_names: " ^ string_of_int (length new_type_names));
berghofe@17870
   197
berghofe@17870
   198
    val perm_indnames = DatatypeProp.make_tnames (map body_type perm_types);
berghofe@17870
   199
    val perm_fun_def = PureThy.get_thm thy2 (Name "perm_fun_def");
berghofe@17870
   200
berghofe@17870
   201
    val unfolded_perm_eq_thms =
berghofe@17870
   202
      if length descr = length new_type_names then []
berghofe@17870
   203
      else map standard (List.drop (split_conj_thm
berghofe@18010
   204
        (Goal.prove thy2 [] []
berghofe@17870
   205
          (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   206
            (map (fn (c as (s, T), x) =>
berghofe@17870
   207
               let val [T1, T2] = binder_types T
berghofe@17870
   208
               in HOLogic.mk_eq (Const c $ pi $ Free (x, T2),
berghofe@17870
   209
                 Const ("nominal.perm", T) $ pi $ Free (x, T2))
berghofe@17870
   210
               end)
berghofe@18010
   211
             (perm_names_types ~~ perm_indnames))))
berghofe@18010
   212
          (fn _ => EVERY [indtac induction perm_indnames 1,
berghofe@17870
   213
            ALLGOALS (asm_full_simp_tac
berghofe@17870
   214
              (simpset_of thy2 addsimps [perm_fun_def]))])),
berghofe@17870
   215
        length new_type_names));
berghofe@17870
   216
berghofe@17870
   217
    (**** prove [] \<bullet> t = t ****)
berghofe@17870
   218
berghofe@17870
   219
    val _ = warning "perm_empty_thms";
berghofe@17870
   220
berghofe@17870
   221
    val perm_empty_thms = List.concat (map (fn a =>
berghofe@17870
   222
      let val permT = mk_permT (Type (a, []))
berghofe@17870
   223
      in map standard (List.take (split_conj_thm
berghofe@18010
   224
        (Goal.prove thy2 [] []
berghofe@17870
   225
          (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   226
            (map (fn ((s, T), x) => HOLogic.mk_eq
berghofe@17870
   227
                (Const (s, permT --> T --> T) $
berghofe@17870
   228
                   Const ("List.list.Nil", permT) $ Free (x, T),
berghofe@17870
   229
                 Free (x, T)))
berghofe@17870
   230
             (perm_names ~~
berghofe@18010
   231
              map body_type perm_types ~~ perm_indnames))))
berghofe@18010
   232
          (fn _ => EVERY [indtac induction perm_indnames 1,
berghofe@17870
   233
            ALLGOALS (asm_full_simp_tac (simpset_of thy2))])),
berghofe@17870
   234
        length new_type_names))
berghofe@17870
   235
      end)
berghofe@17870
   236
      atoms);
berghofe@17870
   237
berghofe@17870
   238
    (**** prove (pi1 @ pi2) \<bullet> t = pi1 \<bullet> (pi2 \<bullet> t) ****)
berghofe@17870
   239
berghofe@17870
   240
    val _ = warning "perm_append_thms";
berghofe@17870
   241
berghofe@17870
   242
    (*FIXME: these should be looked up statically*)
berghofe@17870
   243
    val at_pt_inst = PureThy.get_thm thy2 (Name "at_pt_inst");
berghofe@17870
   244
    val pt2 = PureThy.get_thm thy2 (Name "pt2");
berghofe@17870
   245
berghofe@17870
   246
    val perm_append_thms = List.concat (map (fn a =>
berghofe@17870
   247
      let
berghofe@17870
   248
        val permT = mk_permT (Type (a, []));
berghofe@17870
   249
        val pi1 = Free ("pi1", permT);
berghofe@17870
   250
        val pi2 = Free ("pi2", permT);
berghofe@17870
   251
        val pt_inst = PureThy.get_thm thy2 (Name ("pt_" ^ Sign.base_name a ^ "_inst"));
berghofe@17870
   252
        val pt2' = pt_inst RS pt2;
berghofe@17870
   253
        val pt2_ax = PureThy.get_thm thy2
berghofe@17870
   254
          (Name (NameSpace.map_base (fn s => "pt_" ^ s ^ "2") a));
berghofe@17870
   255
      in List.take (map standard (split_conj_thm
berghofe@18010
   256
        (Goal.prove thy2 [] []
berghofe@17870
   257
             (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   258
                (map (fn ((s, T), x) =>
berghofe@17870
   259
                    let val perm = Const (s, permT --> T --> T)
berghofe@17870
   260
                    in HOLogic.mk_eq
berghofe@17870
   261
                      (perm $ (Const ("List.op @", permT --> permT --> permT) $
berghofe@17870
   262
                         pi1 $ pi2) $ Free (x, T),
berghofe@17870
   263
                       perm $ pi1 $ (perm $ pi2 $ Free (x, T)))
berghofe@17870
   264
                    end)
berghofe@17870
   265
                  (perm_names ~~
berghofe@18010
   266
                   map body_type perm_types ~~ perm_indnames))))
berghofe@18010
   267
           (fn _ => EVERY [indtac induction perm_indnames 1,
berghofe@17870
   268
              ALLGOALS (asm_full_simp_tac (simpset_of thy2 addsimps [pt2', pt2_ax]))]))),
berghofe@17870
   269
         length new_type_names)
berghofe@17870
   270
      end) atoms);
berghofe@17870
   271
berghofe@17870
   272
    (**** prove pi1 ~ pi2 ==> pi1 \<bullet> t = pi2 \<bullet> t ****)
berghofe@17870
   273
berghofe@17870
   274
    val _ = warning "perm_eq_thms";
berghofe@17870
   275
berghofe@17870
   276
    val pt3 = PureThy.get_thm thy2 (Name "pt3");
berghofe@17870
   277
    val pt3_rev = PureThy.get_thm thy2 (Name "pt3_rev");
berghofe@17870
   278
berghofe@17870
   279
    val perm_eq_thms = List.concat (map (fn a =>
berghofe@17870
   280
      let
berghofe@17870
   281
        val permT = mk_permT (Type (a, []));
berghofe@17870
   282
        val pi1 = Free ("pi1", permT);
berghofe@17870
   283
        val pi2 = Free ("pi2", permT);
berghofe@17870
   284
        (*FIXME: not robust - better access these theorems using NominalData?*)
berghofe@17870
   285
        val at_inst = PureThy.get_thm thy2 (Name ("at_" ^ Sign.base_name a ^ "_inst"));
berghofe@17870
   286
        val pt_inst = PureThy.get_thm thy2 (Name ("pt_" ^ Sign.base_name a ^ "_inst"));
berghofe@17870
   287
        val pt3' = pt_inst RS pt3;
berghofe@17870
   288
        val pt3_rev' = at_inst RS (pt_inst RS pt3_rev);
berghofe@17870
   289
        val pt3_ax = PureThy.get_thm thy2
berghofe@17870
   290
          (Name (NameSpace.map_base (fn s => "pt_" ^ s ^ "3") a));
berghofe@17870
   291
      in List.take (map standard (split_conj_thm
berghofe@18010
   292
        (Goal.prove thy2 [] [] (Logic.mk_implies
berghofe@17870
   293
             (HOLogic.mk_Trueprop (Const ("nominal.prm_eq",
berghofe@17870
   294
                permT --> permT --> HOLogic.boolT) $ pi1 $ pi2),
berghofe@17870
   295
              HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   296
                (map (fn ((s, T), x) =>
berghofe@17870
   297
                    let val perm = Const (s, permT --> T --> T)
berghofe@17870
   298
                    in HOLogic.mk_eq
berghofe@17870
   299
                      (perm $ pi1 $ Free (x, T),
berghofe@17870
   300
                       perm $ pi2 $ Free (x, T))
berghofe@17870
   301
                    end)
berghofe@17870
   302
                  (perm_names ~~
berghofe@18010
   303
                   map body_type perm_types ~~ perm_indnames)))))
berghofe@18010
   304
           (fn _ => EVERY [indtac induction perm_indnames 1,
berghofe@17870
   305
              ALLGOALS (asm_full_simp_tac (simpset_of thy2 addsimps [pt3', pt3_rev', pt3_ax]))]))),
berghofe@17870
   306
         length new_type_names)
berghofe@17870
   307
      end) atoms);
berghofe@17870
   308
berghofe@17870
   309
    (**** prove pi1 \<bullet> (pi2 \<bullet> t) = (pi1 \<bullet> pi2) \<bullet> (pi1 \<bullet> t) ****)
berghofe@17870
   310
berghofe@17870
   311
    val cp1 = PureThy.get_thm thy2 (Name "cp1");
berghofe@17870
   312
    val dj_cp = PureThy.get_thm thy2 (Name "dj_cp");
berghofe@17870
   313
    val pt_perm_compose = PureThy.get_thm thy2 (Name "pt_perm_compose");
berghofe@17870
   314
    val pt_perm_compose_rev = PureThy.get_thm thy2 (Name "pt_perm_compose_rev");
berghofe@17870
   315
    val dj_perm_perm_forget = PureThy.get_thm thy2 (Name "dj_perm_perm_forget");
berghofe@17870
   316
berghofe@17870
   317
    fun composition_instance name1 name2 thy =
berghofe@17870
   318
      let
berghofe@17870
   319
        val name1' = Sign.base_name name1;
berghofe@17870
   320
        val name2' = Sign.base_name name2;
berghofe@17870
   321
        val cp_class = Sign.intern_class thy ("cp_" ^ name1' ^ "_" ^ name2');
berghofe@17870
   322
        val permT1 = mk_permT (Type (name1, []));
berghofe@17870
   323
        val permT2 = mk_permT (Type (name2, []));
berghofe@17870
   324
        val augment = map_type_tfree
berghofe@17870
   325
          (fn (x, S) => TFree (x, cp_class :: S));
berghofe@17870
   326
        val Ts = map (augment o body_type) perm_types;
berghofe@17870
   327
        val cp_inst = PureThy.get_thm thy
berghofe@17870
   328
          (Name ("cp_" ^ name1' ^ "_" ^ name2' ^ "_inst"));
berghofe@17870
   329
        val simps = simpset_of thy addsimps (perm_fun_def ::
berghofe@17870
   330
          (if name1 <> name2 then
berghofe@17870
   331
             let val dj = PureThy.get_thm thy (Name ("dj_" ^ name2' ^ "_" ^ name1'))
berghofe@17870
   332
             in [dj RS (cp_inst RS dj_cp), dj RS dj_perm_perm_forget] end
berghofe@17870
   333
           else
berghofe@17870
   334
             let
berghofe@17870
   335
               val at_inst = PureThy.get_thm thy (Name ("at_" ^ name1' ^ "_inst"));
berghofe@17870
   336
               val pt_inst = PureThy.get_thm thy (Name ("pt_" ^ name1' ^ "_inst"))
berghofe@17870
   337
             in
berghofe@17870
   338
               [cp_inst RS cp1 RS sym,
berghofe@17870
   339
                at_inst RS (pt_inst RS pt_perm_compose) RS sym,
berghofe@17870
   340
                at_inst RS (pt_inst RS pt_perm_compose_rev) RS sym]
berghofe@17870
   341
            end))
berghofe@18010
   342
        val thms = split_conj_thm (standard (Goal.prove thy [] []
berghofe@17870
   343
            (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj
berghofe@17870
   344
              (map (fn ((s, T), x) =>
berghofe@17870
   345
                  let
berghofe@17870
   346
                    val pi1 = Free ("pi1", permT1);
berghofe@17870
   347
                    val pi2 = Free ("pi2", permT2);
berghofe@17870
   348
                    val perm1 = Const (s, permT1 --> T --> T);
berghofe@17870
   349
                    val perm2 = Const (s, permT2 --> T --> T);
berghofe@17870
   350
                    val perm3 = Const ("nominal.perm", permT1 --> permT2 --> permT2)
berghofe@17870
   351
                  in HOLogic.mk_eq
berghofe@17870
   352
                    (perm1 $ pi1 $ (perm2 $ pi2 $ Free (x, T)),
berghofe@17870
   353
                     perm2 $ (perm3 $ pi1 $ pi2) $ (perm1 $ pi1 $ Free (x, T)))
berghofe@17870
   354
                  end)
berghofe@18010
   355
                (perm_names ~~ Ts ~~ perm_indnames))))
berghofe@18010
   356
          (fn _ => EVERY [indtac induction perm_indnames 1,
berghofe@18010
   357
             ALLGOALS (asm_full_simp_tac simps)])))
berghofe@17870
   358
      in
berghofe@17870
   359
        foldl (fn ((s, tvs), thy) => AxClass.add_inst_arity_i
berghofe@17870
   360
            (s, replicate (length tvs) (cp_class :: classes), [cp_class])
berghofe@17870
   361
            (AxClass.intro_classes_tac [] THEN ALLGOALS (resolve_tac thms)) thy)
berghofe@17870
   362
          thy (full_new_type_names' ~~ tyvars)
berghofe@17870
   363
      end;
berghofe@17870
   364
berghofe@17870
   365
    val (thy3, perm_thmss) = thy2 |>
berghofe@17870
   366
      fold (fn name1 => fold (composition_instance name1) atoms) atoms |>
berghofe@17870
   367
      curry (Library.foldr (fn ((i, (tyname, args, _)), thy) =>
berghofe@17870
   368
        AxClass.add_inst_arity_i (tyname, replicate (length args) classes, classes)
berghofe@17870
   369
        (AxClass.intro_classes_tac [] THEN REPEAT (EVERY
berghofe@17870
   370
           [resolve_tac perm_empty_thms 1,
berghofe@17870
   371
            resolve_tac perm_append_thms 1,
berghofe@17870
   372
            resolve_tac perm_eq_thms 1, assume_tac 1])) thy))
berghofe@17870
   373
        (List.take (descr, length new_type_names)) |>
berghofe@17870
   374
      PureThy.add_thmss
berghofe@17870
   375
        [((space_implode "_" new_type_names ^ "_unfolded_perm_eq",
berghofe@17870
   376
          unfolded_perm_eq_thms), [Simplifier.simp_add_global]),
berghofe@17870
   377
         ((space_implode "_" new_type_names ^ "_perm_empty",
berghofe@17870
   378
          perm_empty_thms), [Simplifier.simp_add_global]),
berghofe@17870
   379
         ((space_implode "_" new_type_names ^ "_perm_append",
berghofe@17870
   380
          perm_append_thms), [Simplifier.simp_add_global]),
berghofe@17870
   381
         ((space_implode "_" new_type_names ^ "_perm_eq",
berghofe@17870
   382
          perm_eq_thms), [Simplifier.simp_add_global])];
berghofe@17870
   383
  
berghofe@17870
   384
    (**** Define representing sets ****)
berghofe@17870
   385
berghofe@17870
   386
    val _ = warning "representing sets";
berghofe@17870
   387
berghofe@17870
   388
    val rep_set_names = map (Sign.full_name thy3) (DatatypeProp.indexify_names
berghofe@17870
   389
      (map (fn (i, _) => name_of_typ (nth_dtyp i) ^ "_set") descr));
berghofe@17870
   390
    val big_rep_name =
berghofe@17870
   391
      space_implode "_" (DatatypeProp.indexify_names (List.mapPartial
berghofe@17870
   392
        (fn (i, ("nominal.nOption", _, _)) => NONE
berghofe@17870
   393
          | (i, _) => SOME (name_of_typ (nth_dtyp i))) descr)) ^ "_set";
berghofe@17870
   394
    val _ = warning ("big_rep_name: " ^ big_rep_name);
berghofe@17870
   395
berghofe@17870
   396
    fun strip_option (dtf as DtType ("fun", [dt, DtRec i])) =
berghofe@17870
   397
          (case AList.lookup op = descr i of
berghofe@17870
   398
             SOME ("nominal.nOption", _, [(_, [dt']), _]) =>
berghofe@17870
   399
               apfst (cons dt) (strip_option dt')
berghofe@17870
   400
           | _ => ([], dtf))
berghofe@17870
   401
      | strip_option dt = ([], dt);
berghofe@17870
   402
berghofe@17870
   403
    fun make_intr s T (cname, cargs) =
berghofe@17870
   404
      let
berghofe@17870
   405
        fun mk_prem (dt, (j, j', prems, ts)) = 
berghofe@17870
   406
          let
berghofe@17870
   407
            val (dts, dt') = strip_option dt;
berghofe@17870
   408
            val (dts', dt'') = strip_dtyp dt';
berghofe@18107
   409
            val Ts = map (typ_of_dtyp descr sorts') dts;
berghofe@18107
   410
            val Us = map (typ_of_dtyp descr sorts') dts';
berghofe@18107
   411
            val T = typ_of_dtyp descr sorts' dt'';
berghofe@17870
   412
            val free = mk_Free "x" (Us ---> T) j;
berghofe@17870
   413
            val free' = app_bnds free (length Us);
berghofe@17870
   414
            fun mk_abs_fun (T, (i, t)) =
berghofe@17870
   415
              let val U = fastype_of t
berghofe@17870
   416
              in (i + 1, Const ("nominal.abs_fun", [T, U, T] --->
berghofe@17870
   417
                Type ("nominal.nOption", [U])) $ mk_Free "y" T i $ t)
berghofe@17870
   418
              end
berghofe@17870
   419
          in (j + 1, j' + length Ts,
berghofe@17870
   420
            case dt'' of
berghofe@17870
   421
                DtRec k => list_all (map (pair "x") Us,
berghofe@17870
   422
                  HOLogic.mk_Trueprop (HOLogic.mk_mem (free',
berghofe@17870
   423
                    Const (List.nth (rep_set_names, k),
berghofe@17870
   424
                      HOLogic.mk_setT T)))) :: prems
berghofe@17870
   425
              | _ => prems,
berghofe@17870
   426
            snd (foldr mk_abs_fun (j', free) Ts) :: ts)
berghofe@17870
   427
          end;
berghofe@17870
   428
berghofe@17870
   429
        val (_, _, prems, ts) = foldr mk_prem (1, 1, [], []) cargs;
berghofe@17870
   430
        val concl = HOLogic.mk_Trueprop (HOLogic.mk_mem
berghofe@17870
   431
          (list_comb (Const (cname, map fastype_of ts ---> T), ts),
berghofe@17870
   432
           Const (s, HOLogic.mk_setT T)))
berghofe@17870
   433
      in Logic.list_implies (prems, concl)
berghofe@17870
   434
      end;
berghofe@17870
   435
berghofe@17870
   436
    val (intr_ts, ind_consts) =
berghofe@17870
   437
      apfst List.concat (ListPair.unzip (List.mapPartial
berghofe@17870
   438
        (fn ((_, ("nominal.nOption", _, _)), _) => NONE
berghofe@17870
   439
          | ((i, (_, _, constrs)), rep_set_name) =>
berghofe@17870
   440
              let val T = nth_dtyp i
berghofe@17870
   441
              in SOME (map (make_intr rep_set_name T) constrs,
berghofe@17870
   442
                Const (rep_set_name, HOLogic.mk_setT T))
berghofe@17870
   443
              end)
berghofe@17870
   444
                (descr ~~ rep_set_names)));
berghofe@17870
   445
berghofe@17870
   446
    val (thy4, {raw_induct = rep_induct, intrs = rep_intrs, ...}) =
berghofe@17870
   447
      setmp InductivePackage.quiet_mode false
berghofe@17870
   448
        (InductivePackage.add_inductive_i false true big_rep_name false true false
berghofe@17870
   449
           ind_consts (map (fn x => (("", x), [])) intr_ts) []) thy3;
berghofe@17870
   450
berghofe@17870
   451
    (**** Prove that representing set is closed under permutation ****)
berghofe@17870
   452
berghofe@17870
   453
    val _ = warning "proving closure under permutation...";
berghofe@17870
   454
berghofe@17870
   455
    val perm_indnames' = List.mapPartial
berghofe@17870
   456
      (fn (x, (_, ("nominal.nOption", _, _))) => NONE | (x, _) => SOME x)
berghofe@17870
   457
      (perm_indnames ~~ descr);
berghofe@17870
   458
berghofe@17870
   459
    fun mk_perm_closed name = map (fn th => standard (th RS mp))
berghofe@18010
   460
      (List.take (split_conj_thm (Goal.prove thy4 [] []
berghofe@17870
   461
        (HOLogic.mk_Trueprop (foldr1 HOLogic.mk_conj (map
berghofe@17870
   462
           (fn (S, x) =>
berghofe@17870
   463
              let
berghofe@17870
   464
                val S = map_term_types (map_type_tfree
berghofe@17870
   465
                  (fn (s, cs) => TFree (s, cs union cp_classes))) S;
berghofe@17870
   466
                val T = HOLogic.dest_setT (fastype_of S);
berghofe@17870
   467
                val permT = mk_permT (Type (name, []))
berghofe@17870
   468
              in HOLogic.mk_imp (HOLogic.mk_mem (Free (x, T), S),
berghofe@17870
   469
                HOLogic.mk_mem (Const ("nominal.perm", permT --> T --> T) $
berghofe@17870
   470
                  Free ("pi", permT) $ Free (x, T), S))
berghofe@18010
   471
              end) (ind_consts ~~ perm_indnames'))))
berghofe@18010
   472
        (fn _ => EVERY (* CU: added perm_fun_def in the final tactic in order to deal with funs *)
berghofe@17870
   473
           [indtac rep_induct [] 1,
berghofe@17870
   474
            ALLGOALS (simp_tac (simpset_of thy4 addsimps
berghofe@17870
   475
              (symmetric perm_fun_def :: PureThy.get_thms thy4 (Name ("abs_perm"))))),
berghofe@17870
   476
            ALLGOALS (resolve_tac rep_intrs 
berghofe@17870
   477
               THEN_ALL_NEW (asm_full_simp_tac (simpset_of thy4 addsimps [perm_fun_def])))])),
berghofe@17870
   478
        length new_type_names));
berghofe@17870
   479
berghofe@17870
   480
    (* FIXME: theorems are stored in database for testing only *)
berghofe@17870
   481
    val perm_closed_thmss = map mk_perm_closed atoms;
berghofe@17870
   482
    val (thy5, _) = PureThy.add_thmss [(("perm_closed",
berghofe@17870
   483
      List.concat perm_closed_thmss), [])] thy4;
berghofe@17870
   484
berghofe@17870
   485
    (**** typedef ****)
berghofe@17870
   486
berghofe@17870
   487
    val _ = warning "defining type...";
berghofe@17870
   488
berghofe@17870
   489
    val (thy6, typedefs) =
berghofe@17870
   490
      foldl_map (fn (thy, ((((name, mx), tvs), c), name')) =>
berghofe@17870
   491
        setmp TypedefPackage.quiet_mode true
berghofe@17870
   492
          (TypedefPackage.add_typedef_i false (SOME name') (name, tvs, mx) c NONE
berghofe@17870
   493
            (rtac exI 1 THEN
berghofe@17870
   494
              QUIET_BREADTH_FIRST (has_fewer_prems 1)
berghofe@17870
   495
              (resolve_tac rep_intrs 1))) thy |> (fn (thy, r) =>
berghofe@17870
   496
        let
berghofe@17870
   497
          val permT = mk_permT (TFree (variant tvs "'a", HOLogic.typeS));
berghofe@17870
   498
          val pi = Free ("pi", permT);
berghofe@17870
   499
          val tvs' = map (fn s => TFree (s, the (AList.lookup op = sorts' s))) tvs;
berghofe@17870
   500
          val T = Type (Sign.intern_type thy name, tvs');
berghofe@17870
   501
          val Const (_, Type (_, [U])) = c
berghofe@17870
   502
        in apsnd (pair r o hd)
berghofe@17870
   503
          (PureThy.add_defs_i true [(("prm_" ^ name ^ "_def", Logic.mk_equals
berghofe@17870
   504
            (Const ("nominal.perm", permT --> T --> T) $ pi $ Free ("x", T),
berghofe@17870
   505
             Const (Sign.intern_const thy ("Abs_" ^ name), U --> T) $
berghofe@17870
   506
               (Const ("nominal.perm", permT --> U --> U) $ pi $
berghofe@17870
   507
                 (Const (Sign.intern_const thy ("Rep_" ^ name), T --> U) $
berghofe@17870
   508
                   Free ("x", T))))), [])] thy)
berghofe@17870
   509
        end))
berghofe@17870
   510
          (thy5, types_syntax ~~ tyvars ~~
berghofe@17870
   511
            (List.take (ind_consts, length new_type_names)) ~~ new_type_names);
berghofe@17870
   512
berghofe@17870
   513
    val perm_defs = map snd typedefs;
berghofe@17870
   514
    val Abs_inverse_thms = map (#Abs_inverse o fst) typedefs;
berghofe@18016
   515
    val Rep_inverse_thms = map (#Rep_inverse o fst) typedefs;
berghofe@17870
   516
    val Rep_thms = map (#Rep o fst) typedefs;
berghofe@17870
   517
berghofe@18016
   518
    val big_name = space_implode "_" new_type_names;
berghofe@18016
   519
berghofe@18016
   520
berghofe@17870
   521
    (** prove that new types are in class pt_<name> **)
berghofe@17870
   522
berghofe@17870
   523
    val _ = warning "prove that new types are in class pt_<name> ...";
berghofe@17870
   524
berghofe@17870
   525
    fun pt_instance ((class, atom), perm_closed_thms) =
berghofe@17870
   526
      fold (fn (((({Abs_inverse, Rep_inverse, Rep, ...},
berghofe@17870
   527
        perm_def), name), tvs), perm_closed) => fn thy =>
berghofe@17870
   528
          AxClass.add_inst_arity_i
berghofe@17870
   529
            (Sign.intern_type thy name,
berghofe@17870
   530
              replicate (length tvs) (classes @ cp_classes), [class])
berghofe@17870
   531
            (EVERY [AxClass.intro_classes_tac [],
berghofe@17870
   532
              rewrite_goals_tac [perm_def],
berghofe@17870
   533
              asm_full_simp_tac (simpset_of thy addsimps [Rep_inverse]) 1,
berghofe@17870
   534
              asm_full_simp_tac (simpset_of thy addsimps
berghofe@17870
   535
                [Rep RS perm_closed RS Abs_inverse]) 1,
berghofe@17870
   536
              asm_full_simp_tac (HOL_basic_ss addsimps [PureThy.get_thm thy
berghofe@17870
   537
                (Name ("pt_" ^ Sign.base_name atom ^ "3"))]) 1]) thy)
berghofe@17870
   538
        (typedefs ~~ new_type_names ~~ tyvars ~~ perm_closed_thms);
berghofe@17870
   539
berghofe@17870
   540
berghofe@17870
   541
    (** prove that new types are in class cp_<name1>_<name2> **)
berghofe@17870
   542
berghofe@17870
   543
    val _ = warning "prove that new types are in class cp_<name1>_<name2> ...";
berghofe@17870
   544
berghofe@17870
   545
    fun cp_instance (atom1, perm_closed_thms1) (atom2, perm_closed_thms2) thy =
berghofe@17870
   546
      let
berghofe@17870
   547
        val name = "cp_" ^ Sign.base_name atom1 ^ "_" ^ Sign.base_name atom2;
berghofe@17870
   548
        val class = Sign.intern_class thy name;
berghofe@17870
   549
        val cp1' = PureThy.get_thm thy (Name (name ^ "_inst")) RS cp1
berghofe@17870
   550
      in fold (fn ((((({Abs_inverse, Rep_inverse, Rep, ...},
berghofe@17870
   551
        perm_def), name), tvs), perm_closed1), perm_closed2) => fn thy =>
berghofe@17870
   552
          AxClass.add_inst_arity_i
berghofe@17870
   553
            (Sign.intern_type thy name,
berghofe@17870
   554
              replicate (length tvs) (classes @ cp_classes), [class])
berghofe@17870
   555
            (EVERY [AxClass.intro_classes_tac [],
berghofe@17870
   556
              rewrite_goals_tac [perm_def],
berghofe@17870
   557
              asm_full_simp_tac (simpset_of thy addsimps
berghofe@17870
   558
                ((Rep RS perm_closed1 RS Abs_inverse) ::
berghofe@17870
   559
                 (if atom1 = atom2 then []
berghofe@17870
   560
                  else [Rep RS perm_closed2 RS Abs_inverse]))) 1,
berghofe@18016
   561
              cong_tac 1,
berghofe@17870
   562
              rtac refl 1,
berghofe@17870
   563
              rtac cp1' 1]) thy)
berghofe@17870
   564
        (typedefs ~~ new_type_names ~~ tyvars ~~ perm_closed_thms1 ~~
berghofe@17870
   565
          perm_closed_thms2) thy
berghofe@17870
   566
      end;
berghofe@17870
   567
berghofe@17870
   568
    val thy7 = fold (fn x => fn thy => thy |>
berghofe@17870
   569
      pt_instance x |>
berghofe@17870
   570
      fold (cp_instance (apfst snd x)) (atoms ~~ perm_closed_thmss))
berghofe@17870
   571
        (classes ~~ atoms ~~ perm_closed_thmss) thy6;
berghofe@17870
   572
berghofe@17870
   573
    (**** constructors ****)
berghofe@17870
   574
berghofe@17870
   575
    fun mk_abs_fun (x, t) =
berghofe@17870
   576
      let
berghofe@17870
   577
        val T = fastype_of x;
berghofe@17870
   578
        val U = fastype_of t
berghofe@17870
   579
      in
berghofe@17870
   580
        Const ("nominal.abs_fun", T --> U --> T -->
berghofe@17870
   581
          Type ("nominal.nOption", [U])) $ x $ t
berghofe@17870
   582
      end;
berghofe@17870
   583
berghofe@18016
   584
    val (ty_idxs, _) = foldl
berghofe@18016
   585
      (fn ((i, ("nominal.nOption", _, _)), p) => p
berghofe@18016
   586
        | ((i, _), (ty_idxs, j)) => (ty_idxs @ [(i, j)], j + 1)) ([], 0) descr;
berghofe@18016
   587
berghofe@18016
   588
    fun reindex (DtType (s, dts)) = DtType (s, map reindex dts)
berghofe@18016
   589
      | reindex (DtRec i) = DtRec (the (AList.lookup op = ty_idxs i))
berghofe@18016
   590
      | reindex dt = dt;
berghofe@18016
   591
berghofe@18016
   592
    fun strip_suffix i s = implode (List.take (explode s, size s - i));
berghofe@18016
   593
berghofe@18016
   594
    (** strips the "_Rep" in type names *)
urbanc@18045
   595
    fun strip_nth_name i s = 
urbanc@18045
   596
      let val xs = NameSpace.unpack s; 
urbanc@18045
   597
      in NameSpace.pack (Library.nth_map (length xs - i) (strip_suffix 4) xs) end;
berghofe@18016
   598
berghofe@18107
   599
    val (descr'', ndescr) = ListPair.unzip (List.mapPartial
berghofe@18016
   600
      (fn (i, ("nominal.nOption", _, _)) => NONE
berghofe@18107
   601
        | (i, (s, dts, constrs)) =>
berghofe@18107
   602
             let
berghofe@18107
   603
               val SOME index = AList.lookup op = ty_idxs i;
berghofe@18107
   604
               val (constrs1, constrs2) = ListPair.unzip
berghofe@18107
   605
                 (map (fn (cname, cargs) => apfst (pair (strip_nth_name 2 cname))
berghofe@18107
   606
                   (foldl_map (fn (dts, dt) =>
berghofe@18107
   607
                     let val (dts', dt') = strip_option dt
berghofe@18107
   608
                     in (dts @ dts' @ [reindex dt'], (length dts, length dts')) end)
berghofe@18107
   609
                       ([], cargs))) constrs)
berghofe@18107
   610
             in SOME ((index, (strip_nth_name 1 s,  map reindex dts, constrs1)),
berghofe@18107
   611
               (index, constrs2))
berghofe@18107
   612
             end) descr);
urbanc@18045
   613
berghofe@18016
   614
    val (descr1, descr2) = splitAt (length new_type_names, descr'');
berghofe@18016
   615
    val descr' = [descr1, descr2];
berghofe@18016
   616
berghofe@18107
   617
    val typ_of_dtyp' = replace_types' o typ_of_dtyp descr sorts';
berghofe@17870
   618
berghofe@17870
   619
    val rep_names = map (fn s =>
berghofe@17870
   620
      Sign.intern_const thy7 ("Rep_" ^ s)) new_type_names;
berghofe@17870
   621
    val abs_names = map (fn s =>
berghofe@17870
   622
      Sign.intern_const thy7 ("Abs_" ^ s)) new_type_names;
berghofe@17870
   623
berghofe@18016
   624
    val recTs' = List.mapPartial
berghofe@18016
   625
      (fn ((_, ("nominal.nOption", _, _)), T) => NONE
berghofe@18016
   626
        | (_, T) => SOME T) (descr ~~ get_rec_types descr sorts');
berghofe@18107
   627
    val recTs = get_rec_types descr'' sorts';
berghofe@18016
   628
    val newTs' = Library.take (length new_type_names, recTs');
berghofe@18016
   629
    val newTs = Library.take (length new_type_names, recTs);
berghofe@17870
   630
berghofe@17870
   631
    val full_new_type_names = map (Sign.full_name (sign_of thy)) new_type_names;
berghofe@17870
   632
berghofe@17870
   633
    fun make_constr_def tname T T' ((thy, defs, eqns), ((cname, cargs), (cname', mx))) =
berghofe@17870
   634
      let
berghofe@17870
   635
        fun constr_arg (dt, (j, l_args, r_args)) =
berghofe@17870
   636
          let
berghofe@17870
   637
            val x' = mk_Free "x" (typ_of_dtyp' dt) j;
berghofe@17870
   638
            val (dts, dt') = strip_option dt;
berghofe@17870
   639
            val xs = map (fn (dt, i) => mk_Free "x" (typ_of_dtyp' dt) i)
berghofe@17870
   640
              (dts ~~ (j upto j + length dts - 1))
berghofe@17870
   641
            val x = mk_Free "x" (typ_of_dtyp' dt') (j + length dts)
berghofe@17870
   642
            val (dts', dt'') = strip_dtyp dt'
berghofe@17870
   643
          in case dt'' of
berghofe@17870
   644
              DtRec k => if k < length new_type_names then
berghofe@17870
   645
                  (j + length dts + 1,
berghofe@17870
   646
                   xs @ x :: l_args,
berghofe@17870
   647
                   foldr mk_abs_fun
berghofe@17870
   648
                     (list_abs (map (pair "z" o typ_of_dtyp') dts',
berghofe@17870
   649
                       Const (List.nth (rep_names, k), typ_of_dtyp' dt'' -->
berghofe@18107
   650
                         typ_of_dtyp descr sorts' dt'') $ app_bnds x (length dts')))
berghofe@17870
   651
                     xs :: r_args)
berghofe@17870
   652
                else error "nested recursion not (yet) supported"
berghofe@17870
   653
            | _ => (j + 1, x' :: l_args, x' :: r_args)
berghofe@17870
   654
          end
berghofe@17870
   655
berghofe@17870
   656
        val (_, l_args, r_args) = foldr constr_arg (1, [], []) cargs;
berghofe@17870
   657
        val abs_name = Sign.intern_const (Theory.sign_of thy) ("Abs_" ^ tname);
berghofe@17870
   658
        val rep_name = Sign.intern_const (Theory.sign_of thy) ("Rep_" ^ tname);
berghofe@17870
   659
        val constrT = map fastype_of l_args ---> T;
berghofe@17870
   660
        val lhs = list_comb (Const (Sign.full_name thy (Sign.base_name cname),
berghofe@17870
   661
          constrT), l_args);
berghofe@17870
   662
        val rhs = list_comb (Const (cname, map fastype_of r_args ---> T'), r_args);
berghofe@17870
   663
        val def = Logic.mk_equals (lhs, Const (abs_name, T' --> T) $ rhs);
berghofe@17870
   664
        val eqn = HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17870
   665
          (Const (rep_name, T --> T') $ lhs, rhs));
berghofe@17870
   666
        val def_name = (Sign.base_name cname) ^ "_def";
berghofe@17870
   667
        val (thy', [def_thm]) = thy |>
berghofe@17870
   668
          Theory.add_consts_i [(cname', constrT, mx)] |>
berghofe@17870
   669
          (PureThy.add_defs_i false o map Thm.no_attributes) [(def_name, def)]
berghofe@17870
   670
      in (thy', defs @ [def_thm], eqns @ [eqn]) end;
berghofe@17870
   671
berghofe@17870
   672
    fun dt_constr_defs ((thy, defs, eqns, dist_lemmas),
berghofe@17870
   673
        (((((_, (_, _, constrs)), tname), T), T'), constr_syntax)) =
berghofe@17870
   674
      let
berghofe@17870
   675
        val rep_const = cterm_of thy
berghofe@17870
   676
          (Const (Sign.intern_const thy ("Rep_" ^ tname), T --> T'));
berghofe@17870
   677
        val dist = standard (cterm_instantiate [(cterm_of thy distinct_f, rep_const)] distinct_lemma);
berghofe@17870
   678
        val (thy', defs', eqns') = Library.foldl (make_constr_def tname T T')
berghofe@17870
   679
          ((Theory.add_path tname thy, defs, []), constrs ~~ constr_syntax)
berghofe@17870
   680
      in
berghofe@17870
   681
        (parent_path flat_names thy', defs', eqns @ [eqns'], dist_lemmas @ [dist])
berghofe@17870
   682
      end;
berghofe@17870
   683
berghofe@17870
   684
    val (thy8, constr_defs, constr_rep_eqns, dist_lemmas) = Library.foldl dt_constr_defs
berghofe@17870
   685
      ((thy7, [], [], []), List.take (descr, length new_type_names) ~~
berghofe@17870
   686
        new_type_names ~~ newTs ~~ newTs' ~~ constr_syntax);
berghofe@17870
   687
berghofe@17870
   688
    val abs_inject_thms = map (fn tname =>
berghofe@17870
   689
      PureThy.get_thm thy8 (Name ("Abs_" ^ tname ^ "_inject"))) new_type_names;
berghofe@17870
   690
berghofe@17870
   691
    val rep_inject_thms = map (fn tname =>
berghofe@17870
   692
      PureThy.get_thm thy8 (Name ("Rep_" ^ tname ^ "_inject"))) new_type_names;
berghofe@17870
   693
berghofe@17870
   694
    val rep_thms = map (fn tname =>
berghofe@17870
   695
      PureThy.get_thm thy8 (Name ("Rep_" ^ tname))) new_type_names;
berghofe@17870
   696
berghofe@17870
   697
    val rep_inverse_thms = map (fn tname =>
berghofe@17870
   698
      PureThy.get_thm thy8 (Name ("Rep_" ^ tname ^ "_inverse"))) new_type_names;
berghofe@17870
   699
berghofe@17870
   700
    (* prove theorem  Rep_i (Constr_j ...) = Constr'_j ...  *)
berghofe@17870
   701
    
berghofe@17870
   702
    fun prove_constr_rep_thm eqn =
berghofe@17870
   703
      let
berghofe@17870
   704
        val inj_thms = map (fn r => r RS iffD1) abs_inject_thms;
berghofe@17870
   705
        val rewrites = constr_defs @ map mk_meta_eq rep_inverse_thms
berghofe@18010
   706
      in standard (Goal.prove thy8 [] [] eqn (fn _ => EVERY
berghofe@17870
   707
        [resolve_tac inj_thms 1,
berghofe@17870
   708
         rewrite_goals_tac rewrites,
berghofe@17870
   709
         rtac refl 3,
berghofe@17870
   710
         resolve_tac rep_intrs 2,
berghofe@18010
   711
         REPEAT (resolve_tac rep_thms 1)]))
berghofe@17870
   712
      end;
berghofe@17870
   713
berghofe@17870
   714
    val constr_rep_thmss = map (map prove_constr_rep_thm) constr_rep_eqns;
berghofe@17870
   715
berghofe@17870
   716
    (* prove theorem  pi \<bullet> Rep_i x = Rep_i (pi \<bullet> x) *)
berghofe@17870
   717
berghofe@17870
   718
    fun prove_perm_rep_perm (atom, perm_closed_thms) = map (fn th =>
berghofe@17870
   719
      let
berghofe@17870
   720
        val _ $ (_ $ (Rep $ x) $ _) = Logic.unvarify (prop_of th);
berghofe@17870
   721
        val Type ("fun", [T, U]) = fastype_of Rep;
berghofe@17870
   722
        val permT = mk_permT (Type (atom, []));
berghofe@17870
   723
        val pi = Free ("pi", permT);
berghofe@17870
   724
      in
berghofe@18010
   725
        standard (Goal.prove thy8 [] [] (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17870
   726
            (Const ("nominal.perm", permT --> U --> U) $ pi $ (Rep $ x),
berghofe@18010
   727
             Rep $ (Const ("nominal.perm", permT --> T --> T) $ pi $ x))))
berghofe@18010
   728
          (fn _ => simp_tac (HOL_basic_ss addsimps (perm_defs @ Abs_inverse_thms @
berghofe@18010
   729
            perm_closed_thms @ Rep_thms)) 1))
berghofe@17870
   730
      end) Rep_thms;
berghofe@17870
   731
berghofe@17870
   732
    val perm_rep_perm_thms = List.concat (map prove_perm_rep_perm
berghofe@17870
   733
      (atoms ~~ perm_closed_thmss));
berghofe@17870
   734
berghofe@17870
   735
    (* prove distinctness theorems *)
berghofe@17870
   736
berghofe@18016
   737
    val distinct_props = setmp DatatypeProp.dtK 1000
berghofe@18016
   738
      (DatatypeProp.make_distincts new_type_names descr' sorts') thy8;
berghofe@17870
   739
berghofe@17870
   740
    val dist_rewrites = map (fn (rep_thms, dist_lemma) =>
berghofe@17870
   741
      dist_lemma::(rep_thms @ [In0_eq, In1_eq, In0_not_In1, In1_not_In0]))
berghofe@17870
   742
        (constr_rep_thmss ~~ dist_lemmas);
berghofe@17870
   743
berghofe@17870
   744
    fun prove_distinct_thms (_, []) = []
berghofe@17870
   745
      | prove_distinct_thms (p as (rep_thms, dist_lemma), t::ts) =
berghofe@17870
   746
          let
berghofe@18010
   747
            val dist_thm = standard (Goal.prove thy8 [] [] t (fn _ =>
berghofe@18010
   748
              simp_tac (simpset_of thy8 addsimps (dist_lemma :: rep_thms)) 1))
berghofe@17870
   749
          in dist_thm::(standard (dist_thm RS not_sym))::
berghofe@17870
   750
            (prove_distinct_thms (p, ts))
berghofe@17870
   751
          end;
berghofe@17870
   752
berghofe@17870
   753
    val distinct_thms = map prove_distinct_thms
berghofe@17870
   754
      (constr_rep_thmss ~~ dist_lemmas ~~ distinct_props);
berghofe@17870
   755
berghofe@17870
   756
    (** prove equations for permutation functions **)
berghofe@17870
   757
berghofe@17870
   758
    val abs_perm = PureThy.get_thms thy8 (Name "abs_perm"); (* FIXME *)
berghofe@17870
   759
berghofe@17870
   760
    val perm_simps' = map (fn (((i, (_, _, constrs)), tname), constr_rep_thms) =>
berghofe@17870
   761
      let val T = replace_types' (nth_dtyp i)
berghofe@17870
   762
      in List.concat (map (fn (atom, perm_closed_thms) =>
berghofe@17870
   763
          map (fn ((cname, dts), constr_rep_thm) => 
berghofe@17870
   764
        let
berghofe@17870
   765
          val cname = Sign.intern_const thy8
berghofe@17870
   766
            (NameSpace.append tname (Sign.base_name cname));
berghofe@17870
   767
          val permT = mk_permT (Type (atom, []));
berghofe@17870
   768
          val pi = Free ("pi", permT);
berghofe@17870
   769
berghofe@17870
   770
          fun perm t =
berghofe@17870
   771
            let val T = fastype_of t
berghofe@17870
   772
            in Const ("nominal.perm", permT --> T --> T) $ pi $ t end;
berghofe@17870
   773
berghofe@17870
   774
          fun constr_arg (dt, (j, l_args, r_args)) =
berghofe@17870
   775
            let
berghofe@17870
   776
              val x' = mk_Free "x" (typ_of_dtyp' dt) j;
berghofe@17870
   777
              val (dts, dt') = strip_option dt;
berghofe@17870
   778
              val Ts = map typ_of_dtyp' dts;
berghofe@17870
   779
              val xs = map (fn (T, i) => mk_Free "x" T i)
berghofe@17870
   780
                (Ts ~~ (j upto j + length dts - 1))
berghofe@17870
   781
              val x = mk_Free "x" (typ_of_dtyp' dt') (j + length dts);
berghofe@17870
   782
              val (dts', dt'') = strip_dtyp dt';
berghofe@17870
   783
            in case dt'' of
berghofe@17870
   784
                DtRec k => if k < length new_type_names then
berghofe@17870
   785
                    (j + length dts + 1,
berghofe@17870
   786
                     xs @ x :: l_args,
berghofe@17870
   787
                     map perm (xs @ [x]) @ r_args)
berghofe@17870
   788
                  else error "nested recursion not (yet) supported"
berghofe@17870
   789
              | _ => (j + 1, x' :: l_args, perm x' :: r_args)
berghofe@17870
   790
            end
berghofe@17870
   791
berghofe@17870
   792
          val (_, l_args, r_args) = foldr constr_arg (1, [], []) dts;
berghofe@17870
   793
          val c = Const (cname, map fastype_of l_args ---> T)
berghofe@17870
   794
        in
berghofe@18010
   795
          standard (Goal.prove thy8 [] []
berghofe@17870
   796
            (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@18010
   797
              (perm (list_comb (c, l_args)), list_comb (c, r_args))))
berghofe@18010
   798
            (fn _ => EVERY
berghofe@17870
   799
              [simp_tac (simpset_of thy8 addsimps (constr_rep_thm :: perm_defs)) 1,
berghofe@17870
   800
               simp_tac (HOL_basic_ss addsimps (Rep_thms @ Abs_inverse_thms @
berghofe@17870
   801
                 constr_defs @ perm_closed_thms)) 1,
berghofe@17870
   802
               TRY (simp_tac (HOL_basic_ss addsimps
berghofe@17870
   803
                 (symmetric perm_fun_def :: abs_perm)) 1),
berghofe@17870
   804
               TRY (simp_tac (HOL_basic_ss addsimps
berghofe@17870
   805
                 (perm_fun_def :: perm_defs @ Rep_thms @ Abs_inverse_thms @
berghofe@18010
   806
                    perm_closed_thms)) 1)]))
berghofe@17870
   807
        end) (constrs ~~ constr_rep_thms)) (atoms ~~ perm_closed_thmss))
berghofe@17870
   808
      end) (List.take (descr, length new_type_names) ~~ new_type_names ~~ constr_rep_thmss);
berghofe@17870
   809
berghofe@17870
   810
    (** prove injectivity of constructors **)
berghofe@17870
   811
berghofe@17870
   812
    val rep_inject_thms' = map (fn th => th RS sym) rep_inject_thms;
berghofe@17870
   813
    val alpha = PureThy.get_thms thy8 (Name "alpha");
berghofe@17870
   814
    val abs_fresh = PureThy.get_thms thy8 (Name "abs_fresh");
berghofe@17870
   815
    val fresh_def = PureThy.get_thm thy8 (Name "fresh_def");
berghofe@17870
   816
    val supp_def = PureThy.get_thm thy8 (Name "supp_def");
berghofe@17870
   817
berghofe@17870
   818
    val inject_thms = map (fn (((i, (_, _, constrs)), tname), constr_rep_thms) =>
berghofe@17870
   819
      let val T = replace_types' (nth_dtyp i)
berghofe@17870
   820
      in List.mapPartial (fn ((cname, dts), constr_rep_thm) =>
berghofe@17870
   821
        if null dts then NONE else SOME
berghofe@17870
   822
        let
berghofe@17870
   823
          val cname = Sign.intern_const thy8
berghofe@17870
   824
            (NameSpace.append tname (Sign.base_name cname));
berghofe@17870
   825
berghofe@17870
   826
          fun make_inj (dt, (j, args1, args2, eqs)) =
berghofe@17870
   827
            let
berghofe@17870
   828
              val x' = mk_Free "x" (typ_of_dtyp' dt) j;
berghofe@17870
   829
              val y' = mk_Free "y" (typ_of_dtyp' dt) j;
berghofe@17870
   830
              val (dts, dt') = strip_option dt;
berghofe@17870
   831
              val Ts_idx = map typ_of_dtyp' dts ~~ (j upto j + length dts - 1);
berghofe@17870
   832
              val xs = map (fn (T, i) => mk_Free "x" T i) Ts_idx;
berghofe@17870
   833
              val ys = map (fn (T, i) => mk_Free "y" T i) Ts_idx;
berghofe@17870
   834
              val x = mk_Free "x" (typ_of_dtyp' dt') (j + length dts);
berghofe@17870
   835
              val y = mk_Free "y" (typ_of_dtyp' dt') (j + length dts);
berghofe@17870
   836
              val (dts', dt'') = strip_dtyp dt';
berghofe@17870
   837
            in case dt'' of
berghofe@17870
   838
                DtRec k => if k < length new_type_names then
berghofe@17870
   839
                    (j + length dts + 1,
berghofe@17870
   840
                     xs @ (x :: args1), ys @ (y :: args2),
berghofe@17870
   841
                     HOLogic.mk_eq
berghofe@17870
   842
                       (foldr mk_abs_fun x xs, foldr mk_abs_fun y ys) :: eqs)
berghofe@17870
   843
                  else error "nested recursion not (yet) supported"
berghofe@17870
   844
              | _ => (j + 1, x' :: args1, y' :: args2, HOLogic.mk_eq (x', y') :: eqs)
berghofe@17870
   845
            end;
berghofe@17870
   846
berghofe@17870
   847
          val (_, args1, args2, eqs) = foldr make_inj (1, [], [], []) dts;
berghofe@17870
   848
          val Ts = map fastype_of args1;
berghofe@17870
   849
          val c = Const (cname, Ts ---> T)
berghofe@17870
   850
        in
berghofe@18010
   851
          standard (Goal.prove thy8 [] [] (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17870
   852
              (HOLogic.mk_eq (list_comb (c, args1), list_comb (c, args2)),
berghofe@18010
   853
               foldr1 HOLogic.mk_conj eqs)))
berghofe@18010
   854
            (fn _ => EVERY
berghofe@17870
   855
               [asm_full_simp_tac (simpset_of thy8 addsimps (constr_rep_thm ::
berghofe@17870
   856
                  rep_inject_thms')) 1,
berghofe@17870
   857
                TRY (asm_full_simp_tac (HOL_basic_ss addsimps (fresh_def :: supp_def ::
berghofe@17870
   858
                  alpha @ abs_perm @ abs_fresh @ rep_inject_thms @
berghofe@17874
   859
                  perm_rep_perm_thms)) 1),
berghofe@17874
   860
                TRY (asm_full_simp_tac (HOL_basic_ss addsimps (perm_fun_def ::
berghofe@18010
   861
                  expand_fun_eq :: rep_inject_thms @ perm_rep_perm_thms)) 1)]))
berghofe@17870
   862
        end) (constrs ~~ constr_rep_thms)
berghofe@17870
   863
      end) (List.take (descr, length new_type_names) ~~ new_type_names ~~ constr_rep_thmss);
berghofe@17870
   864
berghofe@17872
   865
    (** equations for support and freshness **)
berghofe@17872
   866
berghofe@17872
   867
    val Un_assoc = PureThy.get_thm thy8 (Name "Un_assoc");
berghofe@17872
   868
    val de_Morgan_conj = PureThy.get_thm thy8 (Name "de_Morgan_conj");
berghofe@17872
   869
    val Collect_disj_eq = PureThy.get_thm thy8 (Name "Collect_disj_eq");
berghofe@17872
   870
    val finite_Un = PureThy.get_thm thy8 (Name "finite_Un");
berghofe@17872
   871
berghofe@17872
   872
    val (supp_thms, fresh_thms) = ListPair.unzip (map ListPair.unzip
berghofe@17872
   873
      (map (fn ((((i, (_, _, constrs)), tname), inject_thms'), perm_thms') =>
berghofe@17872
   874
      let val T = replace_types' (nth_dtyp i)
berghofe@17872
   875
      in List.concat (map (fn (cname, dts) => map (fn atom =>
berghofe@17872
   876
        let
berghofe@17872
   877
          val cname = Sign.intern_const thy8
berghofe@17872
   878
            (NameSpace.append tname (Sign.base_name cname));
berghofe@17872
   879
          val atomT = Type (atom, []);
berghofe@17872
   880
berghofe@17872
   881
          fun process_constr (dt, (j, args1, args2)) =
berghofe@17872
   882
            let
berghofe@17872
   883
              val x' = mk_Free "x" (typ_of_dtyp' dt) j;
berghofe@17872
   884
              val (dts, dt') = strip_option dt;
berghofe@17872
   885
              val Ts_idx = map typ_of_dtyp' dts ~~ (j upto j + length dts - 1);
berghofe@17872
   886
              val xs = map (fn (T, i) => mk_Free "x" T i) Ts_idx;
berghofe@17872
   887
              val x = mk_Free "x" (typ_of_dtyp' dt') (j + length dts);
berghofe@17872
   888
              val (dts', dt'') = strip_dtyp dt';
berghofe@17872
   889
            in case dt'' of
berghofe@17872
   890
                DtRec k => if k < length new_type_names then
berghofe@17872
   891
                    (j + length dts + 1,
berghofe@17872
   892
                     xs @ (x :: args1), foldr mk_abs_fun x xs :: args2)
berghofe@17872
   893
                  else error "nested recursion not (yet) supported"
berghofe@17872
   894
              | _ => (j + 1, x' :: args1, x' :: args2)
berghofe@17872
   895
            end;
berghofe@17872
   896
berghofe@17872
   897
          val (_, args1, args2) = foldr process_constr (1, [], []) dts;
berghofe@17872
   898
          val Ts = map fastype_of args1;
berghofe@17872
   899
          val c = list_comb (Const (cname, Ts ---> T), args1);
berghofe@17872
   900
          fun supp t =
berghofe@17872
   901
            Const ("nominal.supp", fastype_of t --> HOLogic.mk_setT atomT) $ t;
berghofe@17872
   902
          fun fresh t =
berghofe@17872
   903
            Const ("nominal.fresh", atomT --> fastype_of t --> HOLogic.boolT) $
berghofe@17872
   904
              Free ("a", atomT) $ t;
berghofe@18010
   905
          val supp_thm = standard (Goal.prove thy8 [] []
berghofe@17872
   906
              (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17872
   907
                (supp c,
berghofe@17872
   908
                 if null dts then Const ("{}", HOLogic.mk_setT atomT)
berghofe@18010
   909
                 else foldr1 (HOLogic.mk_binop "op Un") (map supp args2))))
berghofe@17872
   910
            (fn _ =>
berghofe@18010
   911
              simp_tac (HOL_basic_ss addsimps (supp_def ::
berghofe@17872
   912
                 Un_assoc :: de_Morgan_conj :: Collect_disj_eq :: finite_Un ::
berghofe@17874
   913
                 symmetric empty_def :: Finites.emptyI :: simp_thms @
berghofe@18010
   914
                 abs_perm @ abs_fresh @ inject_thms' @ perm_thms')) 1))
berghofe@17872
   915
        in
berghofe@17872
   916
          (supp_thm,
berghofe@18010
   917
           standard (Goal.prove thy8 [] [] (HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@17872
   918
              (fresh c,
berghofe@17872
   919
               if null dts then HOLogic.true_const
berghofe@18010
   920
               else foldr1 HOLogic.mk_conj (map fresh args2))))
berghofe@17872
   921
             (fn _ =>
berghofe@18010
   922
               simp_tac (simpset_of thy8 addsimps [fresh_def, supp_thm]) 1)))
berghofe@17872
   923
        end) atoms) constrs)
berghofe@17872
   924
      end) (List.take (descr, length new_type_names) ~~ new_type_names ~~ inject_thms ~~ perm_simps')));
berghofe@17872
   925
berghofe@18107
   926
    (**** weak induction theorem ****)
berghofe@18016
   927
berghofe@18107
   928
    val arities = get_arities descr'';
berghofe@18016
   929
berghofe@18016
   930
    fun mk_funs_inv thm =
berghofe@18016
   931
      let
berghofe@18016
   932
        val {sign, prop, ...} = rep_thm thm;
berghofe@18016
   933
        val _ $ (_ $ (Const (_, Type (_, [U, _])) $ _ $ S)) $
berghofe@18016
   934
          (_ $ (_ $ (r $ (a $ _)) $ _)) = Type.freeze prop;
berghofe@18016
   935
        val used = add_term_tfree_names (a, []);
berghofe@18016
   936
berghofe@18016
   937
        fun mk_thm i =
berghofe@18016
   938
          let
berghofe@18016
   939
            val Ts = map (TFree o rpair HOLogic.typeS)
berghofe@18016
   940
              (variantlist (replicate i "'t", used));
berghofe@18016
   941
            val f = Free ("f", Ts ---> U)
berghofe@18016
   942
          in standard (Goal.prove sign [] [] (Logic.mk_implies
berghofe@18016
   943
            (HOLogic.mk_Trueprop (HOLogic.list_all
berghofe@18016
   944
               (map (pair "x") Ts, HOLogic.mk_mem (app_bnds f i, S))),
berghofe@18016
   945
             HOLogic.mk_Trueprop (HOLogic.mk_eq (list_abs (map (pair "x") Ts,
berghofe@18016
   946
               r $ (a $ app_bnds f i)), f))))
berghofe@18016
   947
            (fn _ => EVERY [REPEAT (rtac ext 1), REPEAT (etac allE 1), rtac thm 1, atac 1]))
berghofe@18016
   948
          end
berghofe@18016
   949
      in map (fn r => r RS subst) (thm :: map mk_thm arities) end;
berghofe@18016
   950
berghofe@18016
   951
    fun mk_indrule_lemma ((prems, concls), (((i, _), T), U)) =
berghofe@18016
   952
      let
berghofe@18016
   953
        val Rep_t = Const (List.nth (rep_names, i), T --> U) $
berghofe@18016
   954
          mk_Free "x" T i;
berghofe@18016
   955
berghofe@18016
   956
        val Abs_t =  Const (List.nth (abs_names, i), U --> T)
berghofe@18016
   957
berghofe@18016
   958
      in (prems @ [HOLogic.imp $ HOLogic.mk_mem (Rep_t,
berghofe@18016
   959
            Const (List.nth (rep_set_names, i), HOLogic.mk_setT U)) $
berghofe@18016
   960
              (mk_Free "P" (T --> HOLogic.boolT) (i + 1) $ (Abs_t $ Rep_t))],
berghofe@18016
   961
          concls @ [mk_Free "P" (T --> HOLogic.boolT) (i + 1) $ mk_Free "x" T i])
berghofe@18016
   962
      end;
berghofe@18016
   963
berghofe@18016
   964
    val (indrule_lemma_prems, indrule_lemma_concls) =
berghofe@18107
   965
      Library.foldl mk_indrule_lemma (([], []), (descr'' ~~ recTs ~~ recTs'));
berghofe@18016
   966
berghofe@18016
   967
    val indrule_lemma = standard (Goal.prove thy8 [] []
berghofe@18016
   968
      (Logic.mk_implies
berghofe@18016
   969
        (HOLogic.mk_Trueprop (mk_conj indrule_lemma_prems),
berghofe@18016
   970
         HOLogic.mk_Trueprop (mk_conj indrule_lemma_concls))) (fn _ => EVERY
berghofe@18016
   971
           [REPEAT (etac conjE 1),
berghofe@18016
   972
            REPEAT (EVERY
berghofe@18016
   973
              [TRY (rtac conjI 1), full_simp_tac (HOL_basic_ss addsimps Rep_inverse_thms) 1,
berghofe@18016
   974
               etac mp 1, resolve_tac Rep_thms 1])]));
berghofe@18016
   975
berghofe@18016
   976
    val Ps = map head_of (HOLogic.dest_conj (HOLogic.dest_Trueprop (concl_of indrule_lemma)));
berghofe@18016
   977
    val frees = if length Ps = 1 then [Free ("P", snd (dest_Var (hd Ps)))] else
berghofe@18016
   978
      map (Free o apfst fst o dest_Var) Ps;
berghofe@18016
   979
    val indrule_lemma' = cterm_instantiate
berghofe@18016
   980
      (map (cterm_of thy8) Ps ~~ map (cterm_of thy8) frees) indrule_lemma;
berghofe@18016
   981
berghofe@18016
   982
    val Abs_inverse_thms' = List.concat (map mk_funs_inv Abs_inverse_thms);
berghofe@18016
   983
berghofe@18016
   984
    val dt_induct_prop = DatatypeProp.make_ind descr' sorts';
berghofe@18016
   985
    val dt_induct = standard (Goal.prove thy8 []
berghofe@18016
   986
      (Logic.strip_imp_prems dt_induct_prop) (Logic.strip_imp_concl dt_induct_prop)
berghofe@18016
   987
      (fn prems => EVERY
berghofe@18016
   988
        [rtac indrule_lemma' 1,
berghofe@18016
   989
         (DatatypeAux.indtac rep_induct THEN_ALL_NEW ObjectLogic.atomize_tac) 1,
berghofe@18016
   990
         EVERY (map (fn (prem, r) => (EVERY
berghofe@18016
   991
           [REPEAT (eresolve_tac Abs_inverse_thms' 1),
berghofe@18016
   992
            simp_tac (HOL_basic_ss addsimps [symmetric r]) 1,
berghofe@18016
   993
            DEPTH_SOLVE_1 (ares_tac [prem] 1 ORELSE etac allE 1)]))
berghofe@18016
   994
                (prems ~~ constr_defs))]));
berghofe@18016
   995
berghofe@18107
   996
    val case_names_induct = mk_case_names_induct descr'';
berghofe@18016
   997
berghofe@18066
   998
    (**** prove that new datatypes have finite support ****)
berghofe@18066
   999
urbanc@18246
  1000
    val _ = warning "proving finite support for the new datatype";
urbanc@18246
  1001
berghofe@18066
  1002
    val indnames = DatatypeProp.make_tnames recTs;
berghofe@18066
  1003
berghofe@18066
  1004
    val abs_supp = PureThy.get_thms thy8 (Name "abs_supp");
urbanc@18067
  1005
    val supp_atm = PureThy.get_thms thy8 (Name "supp_atm");
berghofe@18066
  1006
urbanc@18246
  1007
urbanc@18246
  1008
(*
berghofe@18066
  1009
    val finite_supp_thms = map (fn atom =>
berghofe@18066
  1010
      let val atomT = Type (atom, [])
berghofe@18066
  1011
      in map standard (List.take
berghofe@18066
  1012
        (split_conj_thm (Goal.prove thy8 [] [] (HOLogic.mk_Trueprop
berghofe@18066
  1013
           (foldr1 HOLogic.mk_conj (map (fn (s, T) => HOLogic.mk_mem
berghofe@18066
  1014
             (Const ("nominal.supp", T --> HOLogic.mk_setT atomT) $ Free (s, T),
berghofe@18066
  1015
              Const ("Finite_Set.Finites", HOLogic.mk_setT (HOLogic.mk_setT atomT))))
berghofe@18066
  1016
               (indnames ~~ recTs))))
berghofe@18066
  1017
           (fn _ => indtac dt_induct indnames 1 THEN
berghofe@18066
  1018
            ALLGOALS (asm_full_simp_tac (simpset_of thy8 addsimps
urbanc@18067
  1019
              (abs_supp @ supp_atm @
berghofe@18066
  1020
               PureThy.get_thms thy8 (Name ("fs_" ^ Sign.base_name atom ^ "1")) @
berghofe@18066
  1021
               List.concat supp_thms))))),
berghofe@18066
  1022
         length new_type_names))
berghofe@18066
  1023
      end) atoms;
urbanc@18246
  1024
*)
berghofe@18066
  1025
berghofe@18107
  1026
    (**** strong induction theorem ****)
berghofe@18107
  1027
berghofe@18107
  1028
    val pnames = if length descr'' = 1 then ["P"]
berghofe@18107
  1029
      else map (fn i => "P" ^ string_of_int i) (1 upto length descr'');
berghofe@18245
  1030
    val ind_sort = if null dt_atomTs then HOLogic.typeS
berghofe@18245
  1031
      else map (fn T => Sign.intern_class thy8 ("fs_" ^
berghofe@18245
  1032
        Sign.base_name (fst (dest_Type T)))) dt_atomTs;
berghofe@18107
  1033
    val fsT = TFree ("'n", ind_sort);
berghofe@18107
  1034
berghofe@18107
  1035
    fun make_pred i T =
berghofe@18107
  1036
      Free (List.nth (pnames, i), T --> fsT --> HOLogic.boolT);
berghofe@18107
  1037
berghofe@18107
  1038
    fun make_ind_prem k T ((cname, cargs), idxs) =
berghofe@18107
  1039
      let
berghofe@18107
  1040
        val recs = List.filter is_rec_type cargs;
berghofe@18107
  1041
        val Ts = map (typ_of_dtyp descr'' sorts') cargs;
berghofe@18107
  1042
        val recTs' = map (typ_of_dtyp descr'' sorts') recs;
berghofe@18107
  1043
        val tnames = variantlist (DatatypeProp.make_tnames Ts, pnames);
berghofe@18107
  1044
        val rec_tnames = map fst (List.filter (is_rec_type o snd) (tnames ~~ cargs));
berghofe@18107
  1045
        val frees = tnames ~~ Ts;
berghofe@18107
  1046
        val z = (variant tnames "z", fsT);
berghofe@18107
  1047
berghofe@18107
  1048
        fun mk_prem ((dt, s), T) =
berghofe@18107
  1049
          let
berghofe@18107
  1050
            val (Us, U) = strip_type T;
berghofe@18107
  1051
            val l = length Us
berghofe@18107
  1052
          in list_all (z :: map (pair "x") Us, HOLogic.mk_Trueprop
berghofe@18107
  1053
            (make_pred (body_index dt) U $ app_bnds (Free (s, T)) l $ Bound l))
berghofe@18107
  1054
          end;
berghofe@18107
  1055
berghofe@18107
  1056
        val prems = map mk_prem (recs ~~ rec_tnames ~~ recTs');
berghofe@18107
  1057
        val prems' = map (fn p as (_, T) => HOLogic.mk_Trueprop
berghofe@18107
  1058
            (Const ("nominal.fresh", T --> fsT --> HOLogic.boolT) $
berghofe@18107
  1059
              Free p $ Free z))
berghofe@18107
  1060
          (map (curry List.nth frees) (List.concat (map (fn (m, n) =>
berghofe@18107
  1061
             m upto m + n - 1) idxs)))
berghofe@18107
  1062
berghofe@18107
  1063
      in list_all_free (z :: frees, Logic.list_implies (prems' @ prems,
berghofe@18107
  1064
        HOLogic.mk_Trueprop (make_pred k T $ 
berghofe@18107
  1065
          list_comb (Const (cname, Ts ---> T), map Free frees) $ Free z)))
berghofe@18107
  1066
      end;
berghofe@18107
  1067
berghofe@18107
  1068
    val ind_prems = List.concat (map (fn (((i, (_, _, constrs)), (_, idxss)), T) =>
berghofe@18107
  1069
      map (make_ind_prem i T) (constrs ~~ idxss)) (descr'' ~~ ndescr ~~ recTs));
berghofe@18107
  1070
    val tnames = DatatypeProp.make_tnames recTs;
berghofe@18107
  1071
    val z = (variant tnames "z", fsT);
berghofe@18107
  1072
    val ind_concl = HOLogic.mk_Trueprop (foldr1 (HOLogic.mk_binop "op &")
berghofe@18107
  1073
      (map (fn (((i, _), T), tname) => make_pred i T $ Free (tname, T) $ Free z)
berghofe@18107
  1074
        (descr'' ~~ recTs ~~ tnames)));
berghofe@18107
  1075
    val induct = Logic.list_implies (ind_prems, ind_concl);
berghofe@18107
  1076
urbanc@18104
  1077
    val simp_atts = replicate (length new_type_names) [Simplifier.simp_add_global];
urbanc@18104
  1078
berghofe@17870
  1079
    val (thy9, _) = thy8 |>
berghofe@18016
  1080
      Theory.add_path big_name |>
urbanc@18017
  1081
      PureThy.add_thms [(("induct_weak", dt_induct), [case_names_induct])] |>>
berghofe@18016
  1082
      Theory.parent_path |>>>
urbanc@18104
  1083
      DatatypeAux.store_thmss_atts "distinct" new_type_names simp_atts distinct_thms |>>>
berghofe@17870
  1084
      DatatypeAux.store_thmss "constr_rep" new_type_names constr_rep_thmss |>>>
urbanc@18104
  1085
      DatatypeAux.store_thmss_atts "perm" new_type_names simp_atts perm_simps' |>>>
berghofe@17872
  1086
      DatatypeAux.store_thmss "inject" new_type_names inject_thms |>>>
berghofe@17872
  1087
      DatatypeAux.store_thmss "supp" new_type_names supp_thms |>>>
urbanc@18104
  1088
      DatatypeAux.store_thmss_atts "fresh" new_type_names simp_atts fresh_thms |>>
urbanc@18246
  1089
  (*    fold (fn (atom, ths) => fn thy =>
berghofe@18066
  1090
        let val class = Sign.intern_class thy ("fs_" ^ Sign.base_name atom)
berghofe@18066
  1091
        in fold (fn T => AxClass.add_inst_arity_i
berghofe@18066
  1092
            (fst (dest_Type T),
berghofe@18066
  1093
              replicate (length sorts) [class], [class])
berghofe@18066
  1094
            (AxClass.intro_classes_tac [] THEN resolve_tac ths 1)) newTs thy
urbanc@18246
  1095
        end) (atoms ~~ finite_supp_thms) |>> *)
berghofe@18107
  1096
      Theory.add_path big_name |>>>
urbanc@18142
  1097
      PureThy.add_axioms_i [(("induct_unsafe", induct), [case_names_induct])] |>>
berghofe@18107
  1098
      Theory.parent_path;
berghofe@17870
  1099
berghofe@17870
  1100
  in
berghofe@18068
  1101
    thy9
berghofe@17870
  1102
  end;
berghofe@17870
  1103
berghofe@17870
  1104
val add_nominal_datatype = gen_add_nominal_datatype read_typ true;
berghofe@17870
  1105
berghofe@17870
  1106
berghofe@17870
  1107
(* FIXME: The following stuff should be exported by DatatypePackage *)
berghofe@17870
  1108
berghofe@17870
  1109
local structure P = OuterParse and K = OuterKeyword in
berghofe@17870
  1110
berghofe@17870
  1111
val datatype_decl =
berghofe@17870
  1112
  Scan.option (P.$$$ "(" |-- P.name --| P.$$$ ")") -- P.type_args -- P.name -- P.opt_infix --
berghofe@17870
  1113
    (P.$$$ "=" |-- P.enum1 "|" (P.name -- Scan.repeat P.typ -- P.opt_mixfix));
berghofe@17870
  1114
berghofe@17870
  1115
fun mk_datatype args =
berghofe@17870
  1116
  let
berghofe@17870
  1117
    val names = map (fn ((((NONE, _), t), _), _) => t | ((((SOME t, _), _), _), _) => t) args;
berghofe@17870
  1118
    val specs = map (fn ((((_, vs), t), mx), cons) =>
berghofe@17870
  1119
      (vs, t, mx, map (fn ((x, y), z) => (x, y, z)) cons)) args;
berghofe@18068
  1120
  in add_nominal_datatype false names specs end;
berghofe@17870
  1121
berghofe@17870
  1122
val nominal_datatypeP =
berghofe@17870
  1123
  OuterSyntax.command "nominal_datatype" "define inductive datatypes" K.thy_decl
berghofe@17870
  1124
    (P.and_list1 datatype_decl >> (Toplevel.theory o mk_datatype));
berghofe@17870
  1125
berghofe@17870
  1126
val _ = OuterSyntax.add_parsers [nominal_datatypeP];
berghofe@17870
  1127
berghofe@17870
  1128
end;
berghofe@17870
  1129
berghofe@17870
  1130
end