src/HOL/Nominal/nominal_atoms.ML
author berghofe
Wed Mar 15 17:59:33 2006 +0100 (2006-03-15)
changeset 19275 3d10de7a8ca7
parent 19165 7dc4fc25de8d
child 19477 a95176d0f0dd
permissions -rw-r--r--
add_inst_arity_i renamed to prove_arity.
berghofe@18068
     1
(* $Id$ *)
berghofe@18068
     2
berghofe@18068
     3
signature NOMINAL_ATOMS =
berghofe@18068
     4
sig
berghofe@18068
     5
  val create_nom_typedecls : string list -> theory -> theory
berghofe@18068
     6
  val atoms_of : theory -> string list
berghofe@18068
     7
  val mk_permT : typ -> typ
urbanc@18746
     8
  val setup : theory -> theory
berghofe@18068
     9
end
berghofe@18068
    10
berghofe@18068
    11
structure NominalAtoms : NOMINAL_ATOMS =
berghofe@18068
    12
struct
berghofe@18068
    13
berghofe@18068
    14
(* data kind 'HOL/nominal' *)
berghofe@18068
    15
berghofe@18068
    16
structure NominalArgs =
berghofe@18068
    17
struct
berghofe@18068
    18
  val name = "HOL/nominal";
berghofe@18068
    19
  type T = unit Symtab.table;
berghofe@18068
    20
berghofe@18068
    21
  val empty = Symtab.empty;
berghofe@18068
    22
  val copy = I;
berghofe@18068
    23
  val extend = I;
berghofe@18068
    24
  fun merge _ x = Symtab.merge (K true) x;
berghofe@18068
    25
berghofe@18068
    26
  fun print sg tab = ();
berghofe@18068
    27
end;
berghofe@18068
    28
berghofe@18068
    29
structure NominalData = TheoryDataFun(NominalArgs);
berghofe@18068
    30
berghofe@18068
    31
fun atoms_of thy = map fst (Symtab.dest (NominalData.get thy));
berghofe@18068
    32
berghofe@18068
    33
(* FIXME: add to hologic.ML ? *)
berghofe@18068
    34
fun mk_listT T = Type ("List.list", [T]);
berghofe@18068
    35
fun mk_permT T = mk_listT (HOLogic.mk_prodT (T, T));
berghofe@18068
    36
berghofe@18068
    37
fun mk_Cons x xs =
berghofe@18068
    38
  let val T = fastype_of x
berghofe@18068
    39
  in Const ("List.list.Cons", T --> mk_listT T --> mk_listT T) $ x $ xs end;
berghofe@18068
    40
berghofe@18068
    41
berghofe@18068
    42
(* this function sets up all matters related to atom-  *)
berghofe@18068
    43
(* kinds; the user specifies a list of atom-kind names *)
berghofe@18068
    44
(* atom_decl <ak1> ... <akn>                           *)
berghofe@18068
    45
fun create_nom_typedecls ak_names thy =
berghofe@18068
    46
  let
berghofe@18068
    47
    (* declares a type-decl for every atom-kind: *) 
berghofe@18068
    48
    (* that is typedecl <ak>                     *)
berghofe@18068
    49
    val thy1 = TypedefPackage.add_typedecls (map (fn x => (x,[],NoSyn)) ak_names) thy;
berghofe@18068
    50
    
berghofe@18068
    51
    (* produces a list consisting of pairs:         *)
berghofe@18068
    52
    (*  fst component is the atom-kind name         *)
berghofe@18068
    53
    (*  snd component is its type                   *)
berghofe@18068
    54
    val full_ak_names = map (Sign.intern_type (sign_of thy1)) ak_names;
berghofe@18068
    55
    val ak_names_types = ak_names ~~ map (Type o rpair []) full_ak_names;
berghofe@18068
    56
     
berghofe@18068
    57
    (* adds for every atom-kind an axiom             *)
berghofe@18068
    58
    (* <ak>_infinite: infinite (UNIV::<ak_type> set) *)
urbanc@18381
    59
    val (inf_axs,thy2) = PureThy.add_axioms_i (map (fn (ak_name, T) =>
berghofe@18068
    60
      let 
berghofe@18068
    61
	val name = ak_name ^ "_infinite"
berghofe@18068
    62
        val axiom = HOLogic.mk_Trueprop (HOLogic.mk_not
berghofe@18068
    63
                    (HOLogic.mk_mem (HOLogic.mk_UNIV T,
berghofe@18068
    64
                     Const ("Finite_Set.Finites", HOLogic.mk_setT (HOLogic.mk_setT T)))))
berghofe@18068
    65
      in
berghofe@18068
    66
	((name, axiom), []) 
berghofe@18068
    67
      end) ak_names_types) thy1;
berghofe@18068
    68
    
berghofe@18068
    69
    (* declares a swapping function for every atom-kind, it is         *)
berghofe@18068
    70
    (* const swap_<ak> :: <akT> * <akT> => <akT> => <akT>              *)
berghofe@18068
    71
    (* swap_<ak> (a,b) c = (if a=c then b (else if b=c then a else c)) *)
berghofe@18068
    72
    (* overloades then the general swap-function                       *) 
berghofe@18068
    73
    val (thy3, swap_eqs) = foldl_map (fn (thy, (ak_name, T)) =>
berghofe@18068
    74
      let
berghofe@18068
    75
        val swapT = HOLogic.mk_prodT (T, T) --> T --> T;
berghofe@18068
    76
        val swap_name = Sign.full_name (sign_of thy) ("swap_" ^ ak_name);
berghofe@18068
    77
        val a = Free ("a", T);
berghofe@18068
    78
        val b = Free ("b", T);
berghofe@18068
    79
        val c = Free ("c", T);
berghofe@18068
    80
        val ab = Free ("ab", HOLogic.mk_prodT (T, T))
berghofe@18068
    81
        val cif = Const ("HOL.If", HOLogic.boolT --> T --> T --> T);
berghofe@18068
    82
        val cswap_akname = Const (swap_name, swapT);
berghofe@18068
    83
        val cswap = Const ("nominal.swap", swapT)
berghofe@18068
    84
berghofe@18068
    85
        val name = "swap_"^ak_name^"_def";
berghofe@18068
    86
        val def1 = HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@18068
    87
		   (cswap_akname $ HOLogic.mk_prod (a,b) $ c,
berghofe@18068
    88
                    cif $ HOLogic.mk_eq (a,c) $ b $ (cif $ HOLogic.mk_eq (b,c) $ a $ c)))
berghofe@18068
    89
        val def2 = Logic.mk_equals (cswap $ ab $ c, cswap_akname $ ab $ c)
berghofe@18068
    90
      in
berghofe@18068
    91
        thy |> Theory.add_consts_i [("swap_" ^ ak_name, swapT, NoSyn)] 
berghofe@18366
    92
            |> (#2 o PureThy.add_defs_i true [((name, def2),[])])
berghofe@18068
    93
            |> PrimrecPackage.add_primrec_i "" [(("", def1),[])]            
berghofe@18068
    94
      end) (thy2, ak_names_types);
berghofe@18068
    95
    
berghofe@18068
    96
    (* declares a permutation function for every atom-kind acting  *)
berghofe@18068
    97
    (* on such atoms                                               *)
berghofe@18068
    98
    (* const <ak>_prm_<ak> :: (<akT> * <akT>)list => akT => akT    *)
berghofe@18068
    99
    (* <ak>_prm_<ak> []     a = a                                  *)
berghofe@18068
   100
    (* <ak>_prm_<ak> (x#xs) a = swap_<ak> x (perm xs a)            *)
berghofe@18068
   101
    val (thy4, prm_eqs) = foldl_map (fn (thy, (ak_name, T)) =>
berghofe@18068
   102
      let
berghofe@18068
   103
        val swapT = HOLogic.mk_prodT (T, T) --> T --> T;
berghofe@18068
   104
        val swap_name = Sign.full_name (sign_of thy) ("swap_" ^ ak_name)
berghofe@18068
   105
        val prmT = mk_permT T --> T --> T;
berghofe@18068
   106
        val prm_name = ak_name ^ "_prm_" ^ ak_name;
berghofe@18068
   107
        val qu_prm_name = Sign.full_name (sign_of thy) prm_name;
berghofe@18068
   108
        val x  = Free ("x", HOLogic.mk_prodT (T, T));
berghofe@18068
   109
        val xs = Free ("xs", mk_permT T);
berghofe@18068
   110
        val a  = Free ("a", T) ;
berghofe@18068
   111
berghofe@18068
   112
        val cnil  = Const ("List.list.Nil", mk_permT T);
berghofe@18068
   113
        
berghofe@18068
   114
        val def1 = HOLogic.mk_Trueprop (HOLogic.mk_eq (Const (qu_prm_name, prmT) $ cnil $ a, a));
berghofe@18068
   115
berghofe@18068
   116
        val def2 = HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@18068
   117
                   (Const (qu_prm_name, prmT) $ mk_Cons x xs $ a,
berghofe@18068
   118
                    Const (swap_name, swapT) $ x $ (Const (qu_prm_name, prmT) $ xs $ a)));
berghofe@18068
   119
      in
berghofe@18068
   120
        thy |> Theory.add_consts_i [(prm_name, mk_permT T --> T --> T, NoSyn)] 
berghofe@18068
   121
            |> PrimrecPackage.add_primrec_i "" [(("", def1), []),(("", def2), [])]
berghofe@18068
   122
      end) (thy3, ak_names_types);
berghofe@18068
   123
    
berghofe@18068
   124
    (* defines permutation functions for all combinations of atom-kinds; *)
berghofe@18068
   125
    (* there are a trivial cases and non-trivial cases                   *)
berghofe@18068
   126
    (* non-trivial case:                                                 *)
berghofe@18068
   127
    (* <ak>_prm_<ak>_def:  perm pi a == <ak>_prm_<ak> pi a               *)
berghofe@18068
   128
    (* trivial case with <ak> != <ak'>                                   *)
berghofe@18068
   129
    (* <ak>_prm<ak'>_def[simp]:  perm pi a == a                          *)
berghofe@18068
   130
    (*                                                                   *)
berghofe@18068
   131
    (* the trivial cases are added to the simplifier, while the non-     *)
berghofe@18068
   132
    (* have their own rules proved below                                 *)  
berghofe@18366
   133
    val (perm_defs, thy5) = fold_map (fn (ak_name, T) => fn thy =>
berghofe@18366
   134
      fold_map (fn (ak_name', T') => fn thy' =>
berghofe@18068
   135
        let
berghofe@18068
   136
          val perm_def_name = ak_name ^ "_prm_" ^ ak_name';
berghofe@18068
   137
          val pi = Free ("pi", mk_permT T);
berghofe@18068
   138
          val a  = Free ("a", T');
berghofe@18068
   139
          val cperm = Const ("nominal.perm", mk_permT T --> T' --> T');
berghofe@18068
   140
          val cperm_def = Const (Sign.full_name (sign_of thy') perm_def_name, mk_permT T --> T' --> T');
berghofe@18068
   141
berghofe@18068
   142
          val name = ak_name ^ "_prm_" ^ ak_name' ^ "_def";
berghofe@18068
   143
          val def = Logic.mk_equals
berghofe@18068
   144
                    (cperm $ pi $ a, if ak_name = ak_name' then cperm_def $ pi $ a else a)
berghofe@18068
   145
        in
berghofe@18366
   146
          PureThy.add_defs_i true [((name, def),[])] thy'
berghofe@18366
   147
        end) ak_names_types thy) ak_names_types thy4;
berghofe@18068
   148
    
berghofe@18068
   149
    (* proves that every atom-kind is an instance of at *)
berghofe@18068
   150
    (* lemma at_<ak>_inst:                              *)
berghofe@18068
   151
    (* at TYPE(<ak>)                                    *)
urbanc@18381
   152
    val (prm_cons_thms,thy6) = 
berghofe@18068
   153
      thy5 |> PureThy.add_thms (map (fn (ak_name, T) =>
berghofe@18068
   154
      let
berghofe@18068
   155
        val ak_name_qu = Sign.full_name (sign_of thy5) (ak_name);
berghofe@18068
   156
        val i_type = Type(ak_name_qu,[]);
berghofe@18068
   157
	val cat = Const ("nominal.at",(Term.itselfT i_type)  --> HOLogic.boolT);
berghofe@18068
   158
        val at_type = Logic.mk_type i_type;
berghofe@18068
   159
        val simp_s = HOL_basic_ss addsimps PureThy.get_thmss thy5
berghofe@18068
   160
                                  [Name "at_def",
berghofe@18068
   161
                                   Name (ak_name ^ "_prm_" ^ ak_name ^ "_def"),
berghofe@18068
   162
                                   Name (ak_name ^ "_prm_" ^ ak_name ^ ".simps"),
berghofe@18068
   163
                                   Name ("swap_" ^ ak_name ^ "_def"),
berghofe@18068
   164
                                   Name ("swap_" ^ ak_name ^ ".simps"),
berghofe@18068
   165
                                   Name (ak_name ^ "_infinite")]
berghofe@18068
   166
	    
berghofe@18068
   167
	val name = "at_"^ak_name^ "_inst";
berghofe@18068
   168
        val statement = HOLogic.mk_Trueprop (cat $ at_type);
berghofe@18068
   169
berghofe@18068
   170
        val proof = fn _ => auto_tac (claset(),simp_s);
berghofe@18068
   171
berghofe@18068
   172
      in 
berghofe@18068
   173
        ((name, standard (Goal.prove thy5 [] [] statement proof)), []) 
berghofe@18068
   174
      end) ak_names_types);
berghofe@18068
   175
berghofe@18068
   176
    (* declares a perm-axclass for every atom-kind               *)
berghofe@18068
   177
    (* axclass pt_<ak>                                           *)
berghofe@18068
   178
    (* pt_<ak>1[simp]: perm [] x = x                             *)
berghofe@18068
   179
    (* pt_<ak>2:       perm (pi1@pi2) x = perm pi1 (perm pi2 x)  *)
berghofe@18068
   180
    (* pt_<ak>3:       pi1 ~ pi2 ==> perm pi1 x = perm pi2 x     *)
urbanc@18438
   181
     val (pt_ax_classes,thy7) =  fold_map (fn (ak_name, T) => fn thy =>
berghofe@18068
   182
      let 
berghofe@18068
   183
	  val cl_name = "pt_"^ak_name;
berghofe@18068
   184
          val ty = TFree("'a",["HOL.type"]);
berghofe@18068
   185
          val x   = Free ("x", ty);
berghofe@18068
   186
          val pi1 = Free ("pi1", mk_permT T);
berghofe@18068
   187
          val pi2 = Free ("pi2", mk_permT T);
berghofe@18068
   188
          val cperm = Const ("nominal.perm", mk_permT T --> ty --> ty);
berghofe@18068
   189
          val cnil  = Const ("List.list.Nil", mk_permT T);
berghofe@18068
   190
          val cappend = Const ("List.op @",mk_permT T --> mk_permT T --> mk_permT T);
berghofe@18068
   191
          val cprm_eq = Const ("nominal.prm_eq",mk_permT T --> mk_permT T --> HOLogic.boolT);
berghofe@18068
   192
          (* nil axiom *)
berghofe@18068
   193
          val axiom1 = HOLogic.mk_Trueprop (HOLogic.mk_eq 
berghofe@18068
   194
                       (cperm $ cnil $ x, x));
berghofe@18068
   195
          (* append axiom *)
berghofe@18068
   196
          val axiom2 = HOLogic.mk_Trueprop (HOLogic.mk_eq
berghofe@18068
   197
                       (cperm $ (cappend $ pi1 $ pi2) $ x, cperm $ pi1 $ (cperm $ pi2 $ x)));
berghofe@18068
   198
          (* perm-eq axiom *)
berghofe@18068
   199
          val axiom3 = Logic.mk_implies
berghofe@18068
   200
                       (HOLogic.mk_Trueprop (cprm_eq $ pi1 $ pi2),
berghofe@18068
   201
                        HOLogic.mk_Trueprop (HOLogic.mk_eq (cperm $ pi1 $ x, cperm $ pi2 $ x)));
berghofe@18068
   202
      in
urbanc@18438
   203
          AxClass.add_axclass_i (cl_name, ["HOL.type"])
krauss@18759
   204
                [((cl_name^"1", axiom1),[Simplifier.simp_add]), 
berghofe@18068
   205
                 ((cl_name^"2", axiom2),[]),                           
urbanc@18438
   206
                 ((cl_name^"3", axiom3),[])] thy                          
urbanc@18438
   207
      end) ak_names_types thy6;
berghofe@18068
   208
berghofe@18068
   209
    (* proves that every pt_<ak>-type together with <ak>-type *)
berghofe@18068
   210
    (* instance of pt                                         *)
berghofe@18068
   211
    (* lemma pt_<ak>_inst:                                    *)
berghofe@18068
   212
    (* pt TYPE('x::pt_<ak>) TYPE(<ak>)                        *)
urbanc@18381
   213
    val (prm_inst_thms,thy8) = 
berghofe@18068
   214
      thy7 |> PureThy.add_thms (map (fn (ak_name, T) =>
berghofe@18068
   215
      let
berghofe@18068
   216
        val ak_name_qu = Sign.full_name (sign_of thy7) (ak_name);
berghofe@18068
   217
        val pt_name_qu = Sign.full_name (sign_of thy7) ("pt_"^ak_name);
berghofe@18068
   218
        val i_type1 = TFree("'x",[pt_name_qu]);
berghofe@18068
   219
        val i_type2 = Type(ak_name_qu,[]);
berghofe@18068
   220
	val cpt = Const ("nominal.pt",(Term.itselfT i_type1)-->(Term.itselfT i_type2)-->HOLogic.boolT);
berghofe@18068
   221
        val pt_type = Logic.mk_type i_type1;
berghofe@18068
   222
        val at_type = Logic.mk_type i_type2;
berghofe@18068
   223
        val simp_s = HOL_basic_ss addsimps PureThy.get_thmss thy7
berghofe@18068
   224
                                  [Name "pt_def",
berghofe@18068
   225
                                   Name ("pt_" ^ ak_name ^ "1"),
berghofe@18068
   226
                                   Name ("pt_" ^ ak_name ^ "2"),
berghofe@18068
   227
                                   Name ("pt_" ^ ak_name ^ "3")];
berghofe@18068
   228
berghofe@18068
   229
	val name = "pt_"^ak_name^ "_inst";
berghofe@18068
   230
        val statement = HOLogic.mk_Trueprop (cpt $ pt_type $ at_type);
berghofe@18068
   231
berghofe@18068
   232
        val proof = fn _ => auto_tac (claset(),simp_s);
berghofe@18068
   233
      in 
berghofe@18068
   234
        ((name, standard (Goal.prove thy7 [] [] statement proof)), []) 
berghofe@18068
   235
      end) ak_names_types);
berghofe@18068
   236
berghofe@18068
   237
     (* declares an fs-axclass for every atom-kind       *)
berghofe@18068
   238
     (* axclass fs_<ak>                                  *)
berghofe@18068
   239
     (* fs_<ak>1: finite ((supp x)::<ak> set)            *)
urbanc@18438
   240
     val (fs_ax_classes,thy11) =  fold_map (fn (ak_name, T) => fn thy =>
berghofe@18068
   241
       let 
berghofe@18068
   242
	  val cl_name = "fs_"^ak_name;
berghofe@18068
   243
	  val pt_name = Sign.full_name (sign_of thy) ("pt_"^ak_name);
berghofe@18068
   244
          val ty = TFree("'a",["HOL.type"]);
berghofe@18068
   245
          val x   = Free ("x", ty);
berghofe@18068
   246
          val csupp    = Const ("nominal.supp", ty --> HOLogic.mk_setT T);
berghofe@18068
   247
          val cfinites = Const ("Finite_Set.Finites", HOLogic.mk_setT (HOLogic.mk_setT T))
berghofe@18068
   248
          
berghofe@18068
   249
          val axiom1   = HOLogic.mk_Trueprop (HOLogic.mk_mem (csupp $ x, cfinites));
berghofe@18068
   250
berghofe@18068
   251
       in  
urbanc@18438
   252
        AxClass.add_axclass_i (cl_name, [pt_name]) [((cl_name^"1", axiom1),[])] thy            
urbanc@18438
   253
       end) ak_names_types thy8; 
berghofe@18068
   254
berghofe@18068
   255
     (* proves that every fs_<ak>-type together with <ak>-type   *)
berghofe@18068
   256
     (* instance of fs-type                                      *)
berghofe@18068
   257
     (* lemma abst_<ak>_inst:                                    *)
berghofe@18068
   258
     (* fs TYPE('x::pt_<ak>) TYPE (<ak>)                         *)
urbanc@18381
   259
     val (fs_inst_thms,thy12) = 
berghofe@18068
   260
       thy11 |> PureThy.add_thms (map (fn (ak_name, T) =>
berghofe@18068
   261
       let
berghofe@18068
   262
         val ak_name_qu = Sign.full_name (sign_of thy11) (ak_name);
berghofe@18068
   263
         val fs_name_qu = Sign.full_name (sign_of thy11) ("fs_"^ak_name);
berghofe@18068
   264
         val i_type1 = TFree("'x",[fs_name_qu]);
berghofe@18068
   265
         val i_type2 = Type(ak_name_qu,[]);
berghofe@18068
   266
 	 val cfs = Const ("nominal.fs", 
berghofe@18068
   267
                                 (Term.itselfT i_type1)-->(Term.itselfT i_type2)-->HOLogic.boolT);
berghofe@18068
   268
         val fs_type = Logic.mk_type i_type1;
berghofe@18068
   269
         val at_type = Logic.mk_type i_type2;
berghofe@18068
   270
	 val simp_s = HOL_basic_ss addsimps PureThy.get_thmss thy11
berghofe@18068
   271
                                   [Name "fs_def",
berghofe@18068
   272
                                    Name ("fs_" ^ ak_name ^ "1")];
berghofe@18068
   273
    
berghofe@18068
   274
	 val name = "fs_"^ak_name^ "_inst";
berghofe@18068
   275
         val statement = HOLogic.mk_Trueprop (cfs $ fs_type $ at_type);
berghofe@18068
   276
berghofe@18068
   277
         val proof = fn _ => auto_tac (claset(),simp_s);
berghofe@18068
   278
       in 
berghofe@18068
   279
         ((name, standard (Goal.prove thy11 [] [] statement proof)), []) 
berghofe@18068
   280
       end) ak_names_types);
berghofe@18068
   281
berghofe@18068
   282
       (* declares for every atom-kind combination an axclass            *)
berghofe@18068
   283
       (* cp_<ak1>_<ak2> giving a composition property                   *)
berghofe@18068
   284
       (* cp_<ak1>_<ak2>1: pi1 o pi2 o x = (pi1 o pi2) o (pi1 o x)       *)
urbanc@18438
   285
        val (_,thy12b) = fold_map (fn (ak_name, T) => fn thy =>
urbanc@18438
   286
	 fold_map (fn (ak_name', T') => fn thy' =>
berghofe@18068
   287
	     let
berghofe@18068
   288
	       val cl_name = "cp_"^ak_name^"_"^ak_name';
berghofe@18068
   289
	       val ty = TFree("'a",["HOL.type"]);
berghofe@18068
   290
               val x   = Free ("x", ty);
berghofe@18068
   291
               val pi1 = Free ("pi1", mk_permT T);
berghofe@18068
   292
	       val pi2 = Free ("pi2", mk_permT T');                  
berghofe@18068
   293
	       val cperm1 = Const ("nominal.perm", mk_permT T  --> ty --> ty);
berghofe@18068
   294
               val cperm2 = Const ("nominal.perm", mk_permT T' --> ty --> ty);
berghofe@18068
   295
               val cperm3 = Const ("nominal.perm", mk_permT T  --> mk_permT T' --> mk_permT T');
berghofe@18068
   296
berghofe@18068
   297
               val ax1   = HOLogic.mk_Trueprop 
berghofe@18068
   298
			   (HOLogic.mk_eq (cperm1 $ pi1 $ (cperm2 $ pi2 $ x), 
berghofe@18068
   299
                                           cperm2 $ (cperm3 $ pi1 $ pi2) $ (cperm1 $ pi1 $ x)));
berghofe@18068
   300
	       in  
urbanc@18438
   301
		 AxClass.add_axclass_i (cl_name, ["HOL.type"]) [((cl_name^"1", ax1),[])] thy'  
urbanc@18438
   302
	       end) ak_names_types thy) ak_names_types thy12;
berghofe@18068
   303
berghofe@18068
   304
        (* proves for every <ak>-combination a cp_<ak1>_<ak2>_inst theorem;     *)
berghofe@18068
   305
        (* lemma cp_<ak1>_<ak2>_inst:                                           *)
berghofe@18068
   306
        (* cp TYPE('a::cp_<ak1>_<ak2>) TYPE(<ak1>) TYPE(<ak2>)                  *)
urbanc@18381
   307
        val (cp_thms,thy12c) = fold_map (fn (ak_name, T) => fn thy =>
urbanc@18381
   308
	 fold_map (fn (ak_name', T') => fn thy' =>
berghofe@18068
   309
           let
berghofe@18068
   310
             val ak_name_qu  = Sign.full_name (sign_of thy') (ak_name);
berghofe@18068
   311
	     val ak_name_qu' = Sign.full_name (sign_of thy') (ak_name');
berghofe@18068
   312
             val cp_name_qu  = Sign.full_name (sign_of thy') ("cp_"^ak_name^"_"^ak_name');
berghofe@18068
   313
             val i_type0 = TFree("'a",[cp_name_qu]);
berghofe@18068
   314
             val i_type1 = Type(ak_name_qu,[]);
berghofe@18068
   315
             val i_type2 = Type(ak_name_qu',[]);
berghofe@18068
   316
	     val ccp = Const ("nominal.cp",
berghofe@18068
   317
                             (Term.itselfT i_type0)-->(Term.itselfT i_type1)-->
berghofe@18068
   318
                                                      (Term.itselfT i_type2)-->HOLogic.boolT);
berghofe@18068
   319
             val at_type  = Logic.mk_type i_type1;
berghofe@18068
   320
             val at_type' = Logic.mk_type i_type2;
berghofe@18068
   321
	     val cp_type  = Logic.mk_type i_type0;
berghofe@18068
   322
             val simp_s   = HOL_basic_ss addsimps PureThy.get_thmss thy' [(Name "cp_def")];
berghofe@18068
   323
	     val cp1      = PureThy.get_thm thy' (Name ("cp_"^ak_name^"_"^ak_name'^"1"));
berghofe@18068
   324
berghofe@18068
   325
	     val name = "cp_"^ak_name^ "_"^ak_name'^"_inst";
berghofe@18068
   326
             val statement = HOLogic.mk_Trueprop (ccp $ cp_type $ at_type $ at_type');
berghofe@18068
   327
berghofe@18068
   328
             val proof = fn _ => EVERY [auto_tac (claset(),simp_s), rtac cp1 1];
berghofe@18068
   329
	   in
urbanc@18381
   330
	     PureThy.add_thms [((name, standard (Goal.prove thy' [] [] statement proof)), [])] thy'
berghofe@18068
   331
	   end) 
urbanc@18381
   332
           ak_names_types thy) ak_names_types thy12b;
berghofe@18068
   333
       
berghofe@18068
   334
        (* proves for every non-trivial <ak>-combination a disjointness   *)
berghofe@18068
   335
        (* theorem; i.e. <ak1> != <ak2>                                   *)
berghofe@18068
   336
        (* lemma ds_<ak1>_<ak2>:                                          *)
berghofe@18068
   337
        (* dj TYPE(<ak1>) TYPE(<ak2>)                                     *)
urbanc@18381
   338
        val (dj_thms, thy12d) = fold_map (fn (ak_name,T) => fn thy =>
urbanc@18381
   339
	  fold_map (fn (ak_name',T') => fn thy' =>
berghofe@18068
   340
          (if not (ak_name = ak_name') 
berghofe@18068
   341
           then 
berghofe@18068
   342
	       let
berghofe@18068
   343
		 val ak_name_qu  = Sign.full_name (sign_of thy') (ak_name);
berghofe@18068
   344
	         val ak_name_qu' = Sign.full_name (sign_of thy') (ak_name');
berghofe@18068
   345
                 val i_type1 = Type(ak_name_qu,[]);
berghofe@18068
   346
                 val i_type2 = Type(ak_name_qu',[]);
berghofe@18068
   347
	         val cdj = Const ("nominal.disjoint",
berghofe@18068
   348
                           (Term.itselfT i_type1)-->(Term.itselfT i_type2)-->HOLogic.boolT);
berghofe@18068
   349
                 val at_type  = Logic.mk_type i_type1;
berghofe@18068
   350
                 val at_type' = Logic.mk_type i_type2;
berghofe@18068
   351
                 val simp_s = HOL_basic_ss addsimps PureThy.get_thmss thy' 
berghofe@18068
   352
					   [Name "disjoint_def",
berghofe@18068
   353
                                            Name (ak_name^"_prm_"^ak_name'^"_def"),
berghofe@18068
   354
                                            Name (ak_name'^"_prm_"^ak_name^"_def")];
berghofe@18068
   355
berghofe@18068
   356
	         val name = "dj_"^ak_name^"_"^ak_name';
berghofe@18068
   357
                 val statement = HOLogic.mk_Trueprop (cdj $ at_type $ at_type');
berghofe@18068
   358
berghofe@18068
   359
                 val proof = fn _ => auto_tac (claset(),simp_s);
berghofe@18068
   360
	       in
urbanc@18381
   361
		PureThy.add_thms [((name, standard (Goal.prove thy' [] [] statement proof)), [])] thy'
berghofe@18068
   362
	       end
berghofe@18068
   363
           else 
urbanc@18381
   364
            ([],thy')))  (* do nothing branch, if ak_name = ak_name' *) 
urbanc@18381
   365
	    ak_names_types thy) ak_names_types thy12c;
berghofe@18068
   366
berghofe@18068
   367
     (*<<<<<<<  pt_<ak> class instances  >>>>>>>*)
berghofe@18068
   368
     (*=========================================*)
urbanc@18279
   369
     (* some abbreviations for theorems *)
urbanc@18279
   370
      val pt1           = thm "pt1";
urbanc@18279
   371
      val pt2           = thm "pt2";
urbanc@18279
   372
      val pt3           = thm "pt3";
urbanc@18279
   373
      val at_pt_inst    = thm "at_pt_inst";
urbanc@18279
   374
      val pt_set_inst   = thm "pt_set_inst"; 
urbanc@18279
   375
      val pt_unit_inst  = thm "pt_unit_inst";
urbanc@18279
   376
      val pt_prod_inst  = thm "pt_prod_inst"; 
urbanc@18600
   377
      val pt_nprod_inst = thm "pt_nprod_inst"; 
urbanc@18279
   378
      val pt_list_inst  = thm "pt_list_inst";   
urbanc@18279
   379
      val pt_optn_inst  = thm "pt_option_inst";   
urbanc@18279
   380
      val pt_noptn_inst = thm "pt_noption_inst";   
urbanc@18279
   381
      val pt_fun_inst   = thm "pt_fun_inst";     
berghofe@18068
   382
urbanc@18435
   383
     (* for all atom-kind combinations <ak>/<ak'> show that        *)
urbanc@18435
   384
     (* every <ak> is an instance of pt_<ak'>; the proof for       *)
urbanc@18435
   385
     (* ak!=ak' is by definition; the case ak=ak' uses at_pt_inst. *)
urbanc@18431
   386
     val thy13 = fold (fn ak_name => fn thy =>
urbanc@18431
   387
	fold (fn ak_name' => fn thy' =>
urbanc@18431
   388
         let
urbanc@18431
   389
           val qu_name =  Sign.full_name (sign_of thy') ak_name';
urbanc@18431
   390
           val cls_name = Sign.full_name (sign_of thy') ("pt_"^ak_name);
urbanc@18431
   391
           val at_inst  = PureThy.get_thm thy' (Name ("at_"^ak_name'^"_inst")); 
urbanc@18431
   392
berghofe@19133
   393
           val proof1 = EVERY [ClassPackage.intro_classes_tac [],
berghofe@18068
   394
                                 rtac ((at_inst RS at_pt_inst) RS pt1) 1,
berghofe@18068
   395
                                 rtac ((at_inst RS at_pt_inst) RS pt2) 1,
berghofe@18068
   396
                                 rtac ((at_inst RS at_pt_inst) RS pt3) 1,
berghofe@18068
   397
                                 atac 1];
urbanc@18431
   398
           val simp_s = HOL_basic_ss addsimps 
urbanc@18431
   399
                        PureThy.get_thmss thy' [Name (ak_name^"_prm_"^ak_name'^"_def")];  
berghofe@19133
   400
           val proof2 = EVERY [ClassPackage.intro_classes_tac [], REPEAT (asm_simp_tac simp_s 1)];
urbanc@18431
   401
urbanc@18431
   402
         in
urbanc@18431
   403
           thy'
berghofe@19275
   404
           |> AxClass.prove_arity (qu_name,[],[cls_name])
urbanc@18431
   405
              (if ak_name = ak_name' then proof1 else proof2)
urbanc@18431
   406
         end) ak_names thy) ak_names thy12c;
berghofe@18068
   407
urbanc@18430
   408
     (* show that                       *)
urbanc@18430
   409
     (*      fun(pt_<ak>,pt_<ak>)       *)
urbanc@18579
   410
     (*      noption(pt_<ak>)           *)
urbanc@18430
   411
     (*      option(pt_<ak>)            *)
urbanc@18430
   412
     (*      list(pt_<ak>)              *)
urbanc@18430
   413
     (*      *(pt_<ak>,pt_<ak>)         *)
urbanc@18600
   414
     (*      nprod(pt_<ak>,pt_<ak>)     *)
urbanc@18430
   415
     (*      unit                       *)
urbanc@18430
   416
     (*      set(pt_<ak>)               *)
urbanc@18430
   417
     (* are instances of pt_<ak>        *)
urbanc@18431
   418
     val thy18 = fold (fn ak_name => fn thy =>
berghofe@18068
   419
       let
urbanc@18430
   420
          val cls_name = Sign.full_name (sign_of thy) ("pt_"^ak_name);
berghofe@18068
   421
          val at_thm   = PureThy.get_thm thy (Name ("at_"^ak_name^"_inst"));
berghofe@18068
   422
          val pt_inst  = PureThy.get_thm thy (Name ("pt_"^ak_name^"_inst"));
urbanc@18430
   423
          
urbanc@18430
   424
          fun pt_proof thm = 
berghofe@19133
   425
	      EVERY [ClassPackage.intro_classes_tac [],
urbanc@18430
   426
                     rtac (thm RS pt1) 1, rtac (thm RS pt2) 1, rtac (thm RS pt3) 1, atac 1];
urbanc@18430
   427
urbanc@18430
   428
          val pt_thm_fun   = at_thm RS (pt_inst RS (pt_inst RS pt_fun_inst));
urbanc@18430
   429
          val pt_thm_noptn = pt_inst RS pt_noptn_inst; 
urbanc@18430
   430
          val pt_thm_optn  = pt_inst RS pt_optn_inst; 
urbanc@18430
   431
          val pt_thm_list  = pt_inst RS pt_list_inst;
urbanc@18430
   432
          val pt_thm_prod  = pt_inst RS (pt_inst RS pt_prod_inst);
urbanc@18600
   433
          val pt_thm_nprod = pt_inst RS (pt_inst RS pt_nprod_inst);
urbanc@18430
   434
          val pt_thm_unit  = pt_unit_inst;
urbanc@18430
   435
          val pt_thm_set   = pt_inst RS pt_set_inst
berghofe@18068
   436
       in 
urbanc@18430
   437
	thy
berghofe@19275
   438
	|> AxClass.prove_arity ("fun",[[cls_name],[cls_name]],[cls_name]) (pt_proof pt_thm_fun)
berghofe@19275
   439
        |> AxClass.prove_arity ("nominal.noption",[[cls_name]],[cls_name]) (pt_proof pt_thm_noptn) 
berghofe@19275
   440
        |> AxClass.prove_arity ("Datatype.option",[[cls_name]],[cls_name]) (pt_proof pt_thm_optn)
berghofe@19275
   441
        |> AxClass.prove_arity ("List.list",[[cls_name]],[cls_name]) (pt_proof pt_thm_list)
berghofe@19275
   442
        |> AxClass.prove_arity ("*",[[cls_name],[cls_name]],[cls_name]) (pt_proof pt_thm_prod)
berghofe@19275
   443
        |> AxClass.prove_arity ("nominal.nprod",[[cls_name],[cls_name]],[cls_name]) 
urbanc@18600
   444
                                    (pt_proof pt_thm_nprod)
berghofe@19275
   445
        |> AxClass.prove_arity ("Product_Type.unit",[],[cls_name]) (pt_proof pt_thm_unit)
berghofe@19275
   446
        |> AxClass.prove_arity ("set",[[cls_name]],[cls_name]) (pt_proof pt_thm_set)
urbanc@18430
   447
     end) ak_names thy13; 
berghofe@18068
   448
berghofe@18068
   449
       (*<<<<<<<  fs_<ak> class instances  >>>>>>>*)
berghofe@18068
   450
       (*=========================================*)
urbanc@18279
   451
       (* abbreviations for some lemmas *)
urbanc@18431
   452
       val fs1            = thm "fs1";
urbanc@18431
   453
       val fs_at_inst     = thm "fs_at_inst";
urbanc@18431
   454
       val fs_unit_inst   = thm "fs_unit_inst";
urbanc@18431
   455
       val fs_prod_inst   = thm "fs_prod_inst";
urbanc@18600
   456
       val fs_nprod_inst  = thm "fs_nprod_inst";
urbanc@18431
   457
       val fs_list_inst   = thm "fs_list_inst";
urbanc@18431
   458
       val fs_option_inst = thm "fs_option_inst";
urbanc@18437
   459
       val dj_supp        = thm "dj_supp"
berghofe@18068
   460
berghofe@18068
   461
       (* shows that <ak> is an instance of fs_<ak>     *)
berghofe@18068
   462
       (* uses the theorem at_<ak>_inst                 *)
urbanc@18431
   463
       val thy20 = fold (fn ak_name => fn thy =>
urbanc@18437
   464
	fold (fn ak_name' => fn thy' => 
urbanc@18437
   465
        let
urbanc@18437
   466
           val qu_name =  Sign.full_name (sign_of thy') ak_name';
urbanc@18437
   467
           val qu_class = Sign.full_name (sign_of thy') ("fs_"^ak_name);
urbanc@18437
   468
           val proof = 
urbanc@18437
   469
	       (if ak_name = ak_name'
urbanc@18437
   470
	        then
urbanc@18437
   471
	          let val at_thm = PureThy.get_thm thy' (Name ("at_"^ak_name^"_inst"));
berghofe@19133
   472
                  in  EVERY [ClassPackage.intro_classes_tac [],
urbanc@18437
   473
                             rtac ((at_thm RS fs_at_inst) RS fs1) 1] end
urbanc@18437
   474
                else
urbanc@18437
   475
		  let val dj_inst = PureThy.get_thm thy' (Name ("dj_"^ak_name'^"_"^ak_name));
urbanc@18437
   476
                      val simp_s = HOL_basic_ss addsimps [dj_inst RS dj_supp, Finites.emptyI]; 
berghofe@19133
   477
                  in EVERY [ClassPackage.intro_classes_tac [], asm_simp_tac simp_s 1] end)      
urbanc@18437
   478
        in 
berghofe@19275
   479
	 AxClass.prove_arity (qu_name,[],[qu_class]) proof thy' 
urbanc@18437
   480
        end) ak_names thy) ak_names thy18;
berghofe@18068
   481
urbanc@18431
   482
       (* shows that                  *)
urbanc@18431
   483
       (*    unit                     *)
urbanc@18431
   484
       (*    *(fs_<ak>,fs_<ak>)       *)
urbanc@18600
   485
       (*    nprod(fs_<ak>,fs_<ak>)   *)
urbanc@18431
   486
       (*    list(fs_<ak>)            *)
urbanc@18431
   487
       (*    option(fs_<ak>)          *) 
urbanc@18431
   488
       (* are instances of fs_<ak>    *)
berghofe@18068
   489
urbanc@18431
   490
       val thy24 = fold (fn ak_name => fn thy => 
urbanc@18431
   491
        let
urbanc@18431
   492
          val cls_name = Sign.full_name (sign_of thy) ("fs_"^ak_name);
berghofe@18068
   493
          val fs_inst  = PureThy.get_thm thy (Name ("fs_"^ak_name^"_inst"));
berghofe@19133
   494
          fun fs_proof thm = EVERY [ClassPackage.intro_classes_tac [], rtac (thm RS fs1) 1];      
berghofe@18068
   495
urbanc@18600
   496
          val fs_thm_unit  = fs_unit_inst;
urbanc@18600
   497
          val fs_thm_prod  = fs_inst RS (fs_inst RS fs_prod_inst);
urbanc@18600
   498
          val fs_thm_nprod = fs_inst RS (fs_inst RS fs_nprod_inst);
urbanc@18600
   499
          val fs_thm_list  = fs_inst RS fs_list_inst;
urbanc@18600
   500
          val fs_thm_optn  = fs_inst RS fs_option_inst;
urbanc@18431
   501
        in 
urbanc@18431
   502
         thy 
berghofe@19275
   503
         |> AxClass.prove_arity ("Product_Type.unit",[],[cls_name]) (fs_proof fs_thm_unit) 
berghofe@19275
   504
         |> AxClass.prove_arity ("*",[[cls_name],[cls_name]],[cls_name]) (fs_proof fs_thm_prod) 
berghofe@19275
   505
         |> AxClass.prove_arity ("nominal.nprod",[[cls_name],[cls_name]],[cls_name]) 
urbanc@18600
   506
                                     (fs_proof fs_thm_nprod) 
berghofe@19275
   507
         |> AxClass.prove_arity ("List.list",[[cls_name]],[cls_name]) (fs_proof fs_thm_list)
berghofe@19275
   508
         |> AxClass.prove_arity ("Datatype.option",[[cls_name]],[cls_name]) (fs_proof fs_thm_optn)
urbanc@18431
   509
        end) ak_names thy20; 
urbanc@18431
   510
berghofe@18068
   511
       (*<<<<<<<  cp_<ak>_<ai> class instances  >>>>>>>*)
berghofe@18068
   512
       (*==============================================*)
urbanc@18279
   513
       (* abbreviations for some lemmas *)
urbanc@18279
   514
       val cp1             = thm "cp1";
urbanc@18279
   515
       val cp_unit_inst    = thm "cp_unit_inst";
urbanc@18279
   516
       val cp_bool_inst    = thm "cp_bool_inst";
urbanc@18279
   517
       val cp_prod_inst    = thm "cp_prod_inst";
urbanc@18279
   518
       val cp_list_inst    = thm "cp_list_inst";
urbanc@18279
   519
       val cp_fun_inst     = thm "cp_fun_inst";
urbanc@18279
   520
       val cp_option_inst  = thm "cp_option_inst";
urbanc@18279
   521
       val cp_noption_inst = thm "cp_noption_inst";
urbanc@18279
   522
       val pt_perm_compose = thm "pt_perm_compose";
urbanc@18279
   523
       val dj_pp_forget    = thm "dj_perm_perm_forget";
berghofe@18068
   524
berghofe@18068
   525
       (* shows that <aj> is an instance of cp_<ak>_<ai>  *)
urbanc@18432
   526
       (* for every  <ak>/<ai>-combination                *)
urbanc@18432
   527
       val thy25 = fold (fn ak_name => fn thy => 
urbanc@18432
   528
	 fold (fn ak_name' => fn thy' => 
urbanc@18432
   529
          fold (fn ak_name'' => fn thy'' => 
berghofe@18068
   530
            let
urbanc@18432
   531
              val name =  Sign.full_name (sign_of thy'') ak_name;
urbanc@18432
   532
              val cls_name = Sign.full_name (sign_of thy'') ("cp_"^ak_name'^"_"^ak_name'');
berghofe@18068
   533
              val proof =
berghofe@18068
   534
                (if (ak_name'=ak_name'') then 
berghofe@18068
   535
		  (let
berghofe@18068
   536
                    val pt_inst  = PureThy.get_thm thy'' (Name ("pt_"^ak_name''^"_inst"));
berghofe@18068
   537
		    val at_inst  = PureThy.get_thm thy'' (Name ("at_"^ak_name''^"_inst"));
berghofe@18068
   538
                  in 
berghofe@19133
   539
		   EVERY [ClassPackage.intro_classes_tac [], 
berghofe@18068
   540
                          rtac (at_inst RS (pt_inst RS pt_perm_compose)) 1]
berghofe@18068
   541
                  end)
berghofe@18068
   542
		else
berghofe@18068
   543
		  (let 
berghofe@18068
   544
                     val dj_inst  = PureThy.get_thm thy'' (Name ("dj_"^ak_name''^"_"^ak_name'));
berghofe@18068
   545
		     val simp_s = HOL_basic_ss addsimps 
berghofe@18068
   546
                                        ((dj_inst RS dj_pp_forget)::
berghofe@18068
   547
                                         (PureThy.get_thmss thy'' 
berghofe@18068
   548
					   [Name (ak_name' ^"_prm_"^ak_name^"_def"),
berghofe@18068
   549
                                            Name (ak_name''^"_prm_"^ak_name^"_def")]));  
berghofe@18068
   550
		  in 
berghofe@19133
   551
                    EVERY [ClassPackage.intro_classes_tac [], simp_tac simp_s 1]
berghofe@18068
   552
                  end))
berghofe@18068
   553
	      in
berghofe@19275
   554
                AxClass.prove_arity (name,[],[cls_name]) proof thy''
urbanc@18432
   555
	      end) ak_names thy') ak_names thy) ak_names thy24;
berghofe@18068
   556
      
urbanc@18432
   557
       (* shows that                                                    *) 
urbanc@18432
   558
       (*      units                                                    *) 
urbanc@18432
   559
       (*      products                                                 *)
urbanc@18432
   560
       (*      lists                                                    *)
urbanc@18432
   561
       (*      functions                                                *)
urbanc@18432
   562
       (*      options                                                  *)
urbanc@18432
   563
       (*      noptions                                                 *)
urbanc@18432
   564
       (* are instances of cp_<ak>_<ai> for every <ak>/<ai>-combination *)
urbanc@18432
   565
       val thy26 = fold (fn ak_name => fn thy =>
urbanc@18432
   566
	fold (fn ak_name' => fn thy' =>
urbanc@18432
   567
        let
urbanc@18432
   568
            val cls_name = Sign.full_name (sign_of thy') ("cp_"^ak_name^"_"^ak_name');
berghofe@18068
   569
            val cp_inst  = PureThy.get_thm thy' (Name ("cp_"^ak_name^"_"^ak_name'^"_inst"));
berghofe@18068
   570
            val pt_inst  = PureThy.get_thm thy' (Name ("pt_"^ak_name^"_inst"));
berghofe@18068
   571
            val at_inst  = PureThy.get_thm thy' (Name ("at_"^ak_name^"_inst"));
urbanc@18432
   572
berghofe@19133
   573
            fun cp_proof thm  = EVERY [ClassPackage.intro_classes_tac [],rtac (thm RS cp1) 1];     
urbanc@18432
   574
	  
urbanc@18432
   575
            val cp_thm_unit = cp_unit_inst;
urbanc@18432
   576
            val cp_thm_prod = cp_inst RS (cp_inst RS cp_prod_inst);
urbanc@18432
   577
            val cp_thm_list = cp_inst RS cp_list_inst;
urbanc@18432
   578
            val cp_thm_fun  = at_inst RS (pt_inst RS (cp_inst RS (cp_inst RS cp_fun_inst)));
urbanc@18432
   579
            val cp_thm_optn = cp_inst RS cp_option_inst;
urbanc@18432
   580
            val cp_thm_noptn = cp_inst RS cp_noption_inst;
urbanc@18432
   581
        in
urbanc@18432
   582
         thy'
berghofe@19275
   583
         |> AxClass.prove_arity ("Product_Type.unit",[],[cls_name]) (cp_proof cp_thm_unit)
berghofe@19275
   584
	 |> AxClass.prove_arity ("*",[[cls_name],[cls_name]],[cls_name]) (cp_proof cp_thm_prod)
berghofe@19275
   585
         |> AxClass.prove_arity ("List.list",[[cls_name]],[cls_name]) (cp_proof cp_thm_list)
berghofe@19275
   586
         |> AxClass.prove_arity ("fun",[[cls_name],[cls_name]],[cls_name]) (cp_proof cp_thm_fun)
berghofe@19275
   587
         |> AxClass.prove_arity ("Datatype.option",[[cls_name]],[cls_name]) (cp_proof cp_thm_optn)
berghofe@19275
   588
         |> AxClass.prove_arity ("nominal.noption",[[cls_name]],[cls_name]) (cp_proof cp_thm_noptn)
urbanc@18432
   589
        end) ak_names thy) ak_names thy25;
urbanc@18432
   590
       
urbanc@18432
   591
     (* show that discrete nominal types are permutation types, finitely     *) 
urbanc@18432
   592
     (* supported and have the commutation property                          *)
urbanc@18432
   593
     (* discrete types have a permutation operation defined as pi o x = x;   *)
urbanc@18432
   594
     (* which renders the proofs to be simple "simp_all"-proofs.             *)            
urbanc@18432
   595
     val thy32 =
urbanc@18432
   596
        let 
urbanc@18432
   597
	  fun discrete_pt_inst discrete_ty defn = 
urbanc@18432
   598
	     fold (fn ak_name => fn thy =>
urbanc@18432
   599
	     let
urbanc@18432
   600
	       val qu_class = Sign.full_name (sign_of thy) ("pt_"^ak_name);
urbanc@18432
   601
	       val simp_s = HOL_basic_ss addsimps [defn];
berghofe@19133
   602
               val proof = EVERY [ClassPackage.intro_classes_tac [], REPEAT (asm_simp_tac simp_s 1)];      
urbanc@18432
   603
             in  
berghofe@19275
   604
	       AxClass.prove_arity (discrete_ty,[],[qu_class]) proof thy
urbanc@18432
   605
             end) ak_names;
berghofe@18068
   606
urbanc@18432
   607
          fun discrete_fs_inst discrete_ty defn = 
urbanc@18432
   608
	     fold (fn ak_name => fn thy =>
urbanc@18432
   609
	     let
urbanc@18432
   610
	       val qu_class = Sign.full_name (sign_of thy) ("fs_"^ak_name);
urbanc@18432
   611
	       val supp_def = thm "nominal.supp_def";
urbanc@18432
   612
               val simp_s = HOL_ss addsimps [supp_def,Collect_const,Finites.emptyI,defn];
berghofe@19133
   613
               val proof = EVERY [ClassPackage.intro_classes_tac [], asm_simp_tac simp_s 1];      
urbanc@18432
   614
             in  
berghofe@19275
   615
	       AxClass.prove_arity (discrete_ty,[],[qu_class]) proof thy
urbanc@18432
   616
             end) ak_names;  
berghofe@18068
   617
urbanc@18432
   618
          fun discrete_cp_inst discrete_ty defn = 
urbanc@18432
   619
	     fold (fn ak_name' => (fold (fn ak_name => fn thy =>
urbanc@18432
   620
	     let
urbanc@18432
   621
	       val qu_class = Sign.full_name (sign_of thy) ("cp_"^ak_name^"_"^ak_name');
urbanc@18432
   622
	       val supp_def = thm "nominal.supp_def";
urbanc@18432
   623
               val simp_s = HOL_ss addsimps [defn];
berghofe@19133
   624
               val proof = EVERY [ClassPackage.intro_classes_tac [], asm_simp_tac simp_s 1];      
urbanc@18432
   625
             in  
berghofe@19275
   626
	       AxClass.prove_arity (discrete_ty,[],[qu_class]) proof thy
urbanc@18432
   627
             end) ak_names)) ak_names;  
urbanc@18432
   628
          
urbanc@18432
   629
        in
urbanc@18432
   630
         thy26
urbanc@18432
   631
         |> discrete_pt_inst "nat"  (thm "perm_nat_def")
urbanc@18432
   632
         |> discrete_fs_inst "nat"  (thm "perm_nat_def") 
urbanc@18432
   633
         |> discrete_cp_inst "nat"  (thm "perm_nat_def") 
urbanc@18432
   634
         |> discrete_pt_inst "bool" (thm "perm_bool")
urbanc@18432
   635
         |> discrete_fs_inst "bool" (thm "perm_bool")
urbanc@18432
   636
         |> discrete_cp_inst "bool" (thm "perm_bool")
urbanc@18432
   637
         |> discrete_pt_inst "IntDef.int" (thm "perm_int_def")
urbanc@18432
   638
         |> discrete_fs_inst "IntDef.int" (thm "perm_int_def") 
urbanc@18432
   639
         |> discrete_cp_inst "IntDef.int" (thm "perm_int_def") 
urbanc@18432
   640
         |> discrete_pt_inst "List.char" (thm "perm_char_def")
urbanc@18432
   641
         |> discrete_fs_inst "List.char" (thm "perm_char_def")
urbanc@18432
   642
         |> discrete_cp_inst "List.char" (thm "perm_char_def")
urbanc@18432
   643
        end;
urbanc@18432
   644
berghofe@18068
   645
urbanc@18262
   646
       (* abbreviations for some lemmas *)
urbanc@18262
   647
       (*===============================*)
urbanc@18279
   648
       val abs_fun_pi        = thm "nominal.abs_fun_pi";
urbanc@18279
   649
       val abs_fun_pi_ineq   = thm "nominal.abs_fun_pi_ineq";
urbanc@18279
   650
       val abs_fun_eq        = thm "nominal.abs_fun_eq";
urbanc@18279
   651
       val dj_perm_forget    = thm "nominal.dj_perm_forget";
urbanc@18279
   652
       val dj_pp_forget      = thm "nominal.dj_perm_perm_forget";
urbanc@18279
   653
       val fresh_iff         = thm "nominal.fresh_abs_fun_iff";
urbanc@18279
   654
       val fresh_iff_ineq    = thm "nominal.fresh_abs_fun_iff_ineq";
urbanc@18279
   655
       val abs_fun_supp      = thm "nominal.abs_fun_supp";
urbanc@18279
   656
       val abs_fun_supp_ineq = thm "nominal.abs_fun_supp_ineq";
urbanc@18279
   657
       val pt_swap_bij       = thm "nominal.pt_swap_bij";
urbanc@18279
   658
       val pt_fresh_fresh    = thm "nominal.pt_fresh_fresh";
urbanc@18279
   659
       val pt_bij            = thm "nominal.pt_bij";
urbanc@18279
   660
       val pt_perm_compose   = thm "nominal.pt_perm_compose";
urbanc@19139
   661
       val pt_perm_compose'  = thm "nominal.pt_perm_compose'";
urbanc@19139
   662
       val perm_app          = thm "nominal.pt_fun_app_eq";
urbanc@18279
   663
       val at_fresh          = thm "nominal.at_fresh";
urbanc@18279
   664
       val at_calc           = thms "nominal.at_calc";
urbanc@18279
   665
       val at_supp           = thm "nominal.at_supp";
urbanc@18279
   666
       val dj_supp           = thm "nominal.dj_supp";
urbanc@18396
   667
       val fresh_left_ineq   = thm "nominal.pt_fresh_left_ineq";
urbanc@18396
   668
       val fresh_left        = thm "nominal.pt_fresh_left";
urbanc@18426
   669
       val fresh_bij_ineq    = thm "nominal.pt_fresh_bij_ineq";
urbanc@18426
   670
       val fresh_bij         = thm "nominal.pt_fresh_bij";
urbanc@19139
   671
       val pt_pi_rev         = thm "nominal.pt_pi_rev";
urbanc@19139
   672
       val pt_rev_pi         = thm "nominal.pt_rev_pi";
urbanc@19165
   673
       val fresh_fun_eqvt    = thm "nominal.fresh_fun_equiv";
berghofe@18068
   674
urbanc@18262
   675
       (* Now we collect and instantiate some lemmas w.r.t. all atom      *)
urbanc@18262
   676
       (* types; this allows for example to use abs_perm (which is a      *)
urbanc@18262
   677
       (* collection of theorems) instead of thm abs_fun_pi with explicit *)
urbanc@18262
   678
       (* instantiations.                                                 *)
urbanc@18381
   679
       val (_,thy33) = 
urbanc@18262
   680
	 let 
urbanc@18651
   681
             
urbanc@18651
   682
urbanc@18279
   683
             (* takes a theorem thm and a list of theorems [t1,..,tn]            *)
urbanc@18279
   684
             (* produces a list of theorems of the form [t1 RS thm,..,tn RS thm] *) 
urbanc@18262
   685
             fun instR thm thms = map (fn ti => ti RS thm) thms;
berghofe@18068
   686
urbanc@18262
   687
             (* takes two theorem lists (hopefully of the same length ;o)                *)
urbanc@18262
   688
             (* produces a list of theorems of the form                                  *)
urbanc@18262
   689
             (* [t1 RS m1,..,tn RS mn] where [t1,..,tn] is thms1 and [m1,..,mn] is thms2 *) 
urbanc@18279
   690
             fun inst_zip thms1 thms2 = map (fn (t1,t2) => t1 RS t2) (thms1 ~~ thms2);
berghofe@18068
   691
urbanc@18262
   692
             (* takes a theorem list of the form [l1,...,ln]              *)
urbanc@18262
   693
             (* and a list of theorem lists of the form                   *)
urbanc@18262
   694
             (* [[h11,...,h1m],....,[hk1,....,hkm]                        *)
urbanc@18262
   695
             (* produces the list of theorem lists                        *)
urbanc@18262
   696
             (* [[l1 RS h11,...,l1 RS h1m],...,[ln RS hk1,...,ln RS hkm]] *)
urbanc@18279
   697
             fun inst_mult thms thmss = map (fn (t,ts) => instR t ts) (thms ~~ thmss);
urbanc@18279
   698
urbanc@18279
   699
             (* FIXME: these lists do not need to be created dynamically again *)
urbanc@18262
   700
berghofe@18068
   701
             (* list of all at_inst-theorems *)
urbanc@18262
   702
             val ats = map (fn ak => PureThy.get_thm thy32 (Name ("at_"^ak^"_inst"))) ak_names
berghofe@18068
   703
             (* list of all pt_inst-theorems *)
urbanc@18262
   704
             val pts = map (fn ak => PureThy.get_thm thy32 (Name ("pt_"^ak^"_inst"))) ak_names
urbanc@18262
   705
             (* list of all cp_inst-theorems as a collection of lists*)
berghofe@18068
   706
             val cps = 
urbanc@18262
   707
		 let fun cps_fun ak1 ak2 = PureThy.get_thm thy32 (Name ("cp_"^ak1^"_"^ak2^"_inst"))
urbanc@18262
   708
		 in map (fn aki => (map (cps_fun aki) ak_names)) ak_names end; 
urbanc@18262
   709
             (* list of all cp_inst-theorems that have different atom types *)
urbanc@18262
   710
             val cps' = 
urbanc@18262
   711
		let fun cps'_fun ak1 ak2 = 
urbanc@18262
   712
		if ak1=ak2 then NONE else SOME(PureThy.get_thm thy32 (Name ("cp_"^ak1^"_"^ak2^"_inst")))
urbanc@18262
   713
		in map (fn aki => (List.mapPartial I (map (cps'_fun aki) ak_names))) ak_names end;
berghofe@18068
   714
             (* list of all dj_inst-theorems *)
berghofe@18068
   715
             val djs = 
berghofe@18068
   716
	       let fun djs_fun (ak1,ak2) = 
urbanc@18262
   717
		     if ak1=ak2 then NONE else SOME(PureThy.get_thm thy32 (Name ("dj_"^ak2^"_"^ak1)))
urbanc@18262
   718
	       in List.mapPartial I (map djs_fun (Library.product ak_names ak_names)) end;
urbanc@18262
   719
             (* list of all fs_inst-theorems *)
urbanc@18262
   720
             val fss = map (fn ak => PureThy.get_thm thy32 (Name ("fs_"^ak^"_inst"))) ak_names
urbanc@18651
   721
              
urbanc@18262
   722
             fun inst_pt thms = Library.flat (map (fn ti => instR ti pts) thms); 
urbanc@18262
   723
             fun inst_at thms = Library.flat (map (fn ti => instR ti ats) thms);               
urbanc@18262
   724
             fun inst_fs thms = Library.flat (map (fn ti => instR ti fss) thms);
urbanc@18436
   725
             fun inst_cp thms cps = Library.flat (inst_mult thms cps); 
urbanc@18262
   726
	     fun inst_pt_at thms = inst_zip ats (inst_pt thms);			
urbanc@18262
   727
             fun inst_dj thms = Library.flat (map (fn ti => instR ti djs) thms);  
urbanc@18436
   728
	     fun inst_pt_pt_at_cp thms = inst_cp (inst_zip ats (inst_zip pts (inst_pt thms))) cps;
urbanc@18262
   729
             fun inst_pt_at_fs thms = inst_zip (inst_fs [fs1]) (inst_zip ats (inst_pt thms));
urbanc@18396
   730
	     fun inst_pt_pt_at_cp thms = 
urbanc@18279
   731
		 let val i_pt_pt_at = inst_zip ats (inst_zip pts (inst_pt thms));
urbanc@18436
   732
                     val i_pt_pt_at_cp = inst_cp i_pt_pt_at cps';
urbanc@18396
   733
		 in i_pt_pt_at_cp end;
urbanc@18396
   734
             fun inst_pt_pt_at_cp_dj thms = inst_zip djs (inst_pt_pt_at_cp thms);
berghofe@18068
   735
           in
urbanc@18262
   736
            thy32 
urbanc@18652
   737
	    |>   PureThy.add_thmss [(("alpha", inst_pt_at [abs_fun_eq]),[])]
urbanc@18381
   738
            ||>> PureThy.add_thmss [(("perm_swap", inst_pt_at [pt_swap_bij]),[])]
urbanc@19139
   739
            ||>> PureThy.add_thmss 
urbanc@19139
   740
	      let val thms1 = inst_pt_at [pt_pi_rev];
urbanc@19139
   741
		  val thms2 = inst_pt_at [pt_rev_pi];
urbanc@19139
   742
              in [(("perm_pi_simp",thms1 @ thms2),[])] end
urbanc@18381
   743
            ||>> PureThy.add_thmss [(("perm_fresh_fresh", inst_pt_at [pt_fresh_fresh]),[])]
urbanc@18381
   744
            ||>> PureThy.add_thmss [(("perm_bij", inst_pt_at [pt_bij]),[])]
urbanc@18436
   745
            ||>> PureThy.add_thmss 
urbanc@18436
   746
	      let val thms1 = inst_pt_at [pt_perm_compose];
urbanc@18436
   747
		  val thms2 = instR cp1 (Library.flat cps');
urbanc@18436
   748
              in [(("perm_compose",thms1 @ thms2),[])] end
urbanc@19139
   749
            ||>> PureThy.add_thmss [(("perm_compose'",inst_pt_at [pt_perm_compose']),[])] 
urbanc@19139
   750
            ||>> PureThy.add_thmss [(("perm_app", inst_pt_at [perm_app]),[])]
urbanc@18381
   751
            ||>> PureThy.add_thmss [(("supp_atm", (inst_at [at_supp]) @ (inst_dj [dj_supp])),[])]
urbanc@18381
   752
            ||>> PureThy.add_thmss [(("fresh_atm", inst_at [at_fresh]),[])]
urbanc@18381
   753
            ||>> PureThy.add_thmss [(("calc_atm", inst_at at_calc),[])]
urbanc@18381
   754
            ||>> PureThy.add_thmss
urbanc@18279
   755
	      let val thms1 = inst_pt_at [abs_fun_pi]
urbanc@18279
   756
		  and thms2 = inst_pt_pt_at_cp [abs_fun_pi_ineq]
urbanc@18279
   757
	      in [(("abs_perm", thms1 @ thms2),[])] end
urbanc@18381
   758
            ||>> PureThy.add_thmss
urbanc@18279
   759
	      let val thms1 = inst_dj [dj_perm_forget]
urbanc@18279
   760
		  and thms2 = inst_dj [dj_pp_forget]
urbanc@18279
   761
              in [(("perm_dj", thms1 @ thms2),[])] end
urbanc@18381
   762
            ||>> PureThy.add_thmss
urbanc@18279
   763
	      let val thms1 = inst_pt_at_fs [fresh_iff]
urbanc@18626
   764
                  and thms2 = inst_pt_at [fresh_iff]
urbanc@18626
   765
		  and thms3 = inst_pt_pt_at_cp_dj [fresh_iff_ineq]
urbanc@18626
   766
	    in [(("abs_fresh", thms1 @ thms2 @ thms3),[])] end
urbanc@18381
   767
	    ||>> PureThy.add_thmss
urbanc@18279
   768
	      let val thms1 = inst_pt_at [abs_fun_supp]
urbanc@18279
   769
		  and thms2 = inst_pt_at_fs [abs_fun_supp]
urbanc@18279
   770
		  and thms3 = inst_pt_pt_at_cp_dj [abs_fun_supp_ineq]
urbanc@18279
   771
	      in [(("abs_supp", thms1 @ thms2 @ thms3),[])] end
urbanc@18396
   772
            ||>> PureThy.add_thmss
urbanc@18396
   773
	      let val thms1 = inst_pt_at [fresh_left]
urbanc@18396
   774
		  and thms2 = inst_pt_pt_at_cp [fresh_left_ineq]
urbanc@18396
   775
	      in [(("fresh_left", thms1 @ thms2),[])] end
urbanc@18426
   776
            ||>> PureThy.add_thmss
urbanc@18426
   777
	      let val thms1 = inst_pt_at [fresh_bij]
urbanc@18426
   778
		  and thms2 = inst_pt_pt_at_cp [fresh_bij_ineq]
urbanc@18426
   779
	      in [(("fresh_eqvt", thms1 @ thms2),[])] end
urbanc@19165
   780
            ||>> PureThy.add_thmss [(("fresh_fun_eqvt",inst_pt_at [fresh_fun_eqvt]),[])]
berghofe@18068
   781
	   end;
berghofe@18068
   782
berghofe@18068
   783
    in NominalData.put (fold Symtab.update (map (rpair ()) full_ak_names)
urbanc@18262
   784
      (NominalData.get thy11)) thy33
berghofe@18068
   785
    end;
berghofe@18068
   786
berghofe@18068
   787
berghofe@18068
   788
(* syntax und parsing *)
berghofe@18068
   789
structure P = OuterParse and K = OuterKeyword;
berghofe@18068
   790
berghofe@18068
   791
val atom_declP =
berghofe@18068
   792
  OuterSyntax.command "atom_decl" "Declare new kinds of atoms" K.thy_decl
berghofe@18068
   793
    (Scan.repeat1 P.name >> (Toplevel.theory o create_nom_typedecls));
berghofe@18068
   794
berghofe@18068
   795
val _ = OuterSyntax.add_parsers [atom_declP];
berghofe@18068
   796
urbanc@18746
   797
val setup = NominalData.init;
berghofe@18068
   798
berghofe@18068
   799
end;