src/Pure/axclass.ML
author haftmann
Fri Dec 29 20:35:02 2006 +0100 (2006-12-29)
changeset 21953 ab834c5c3858
parent 21931 314f9e2a442c
child 22385 cc2be3315e72
permissions -rw-r--r--
cleanup
wenzelm@404
     1
(*  Title:      Pure/axclass.ML
wenzelm@404
     2
    ID:         $Id$
wenzelm@404
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@404
     4
wenzelm@19511
     5
Type classes as parameter records and predicates, with explicit
wenzelm@19511
     6
definitions and proofs.
wenzelm@404
     7
*)
wenzelm@404
     8
wenzelm@404
     9
signature AX_CLASS =
wenzelm@3938
    10
sig
haftmann@21463
    11
  val get_definition: theory -> class -> {def: thm, intro: thm, axioms: thm list,
haftmann@21925
    12
    params: (string * typ) list}
wenzelm@19243
    13
  val class_intros: theory -> thm list
haftmann@20107
    14
  val class_of_param: theory -> string -> class option
haftmann@21463
    15
  val params_of_class: theory -> class -> string * (string * typ) list
haftmann@21953
    16
  val param_tyvarname: string
wenzelm@19511
    17
  val print_axclasses: theory -> unit
wenzelm@19405
    18
  val cert_classrel: theory -> class * class -> class * class
wenzelm@19405
    19
  val read_classrel: theory -> xstring * xstring -> class * class
wenzelm@19405
    20
  val add_classrel: thm -> theory -> theory
wenzelm@19405
    21
  val add_arity: thm -> theory -> theory
wenzelm@19405
    22
  val prove_classrel: class * class -> tactic -> theory -> theory
wenzelm@19243
    23
  val prove_arity: string * sort list * sort -> tactic -> theory -> theory
wenzelm@19511
    24
  val define_class: bstring * xstring list -> string list ->
wenzelm@19418
    25
    ((bstring * Attrib.src list) * string list) list -> theory -> class * theory
wenzelm@19511
    26
  val define_class_i: bstring * class list -> string list ->
wenzelm@19418
    27
    ((bstring * attribute list) * term list) list -> theory -> class * theory
wenzelm@19511
    28
  val axiomatize_class: bstring * xstring list -> theory -> theory
wenzelm@19511
    29
  val axiomatize_class_i: bstring * class list -> theory -> theory
wenzelm@19511
    30
  val axiomatize_classrel: (xstring * xstring) list -> theory -> theory
wenzelm@19511
    31
  val axiomatize_classrel_i: (class * class) list -> theory -> theory
wenzelm@19511
    32
  val axiomatize_arity: xstring * string list * string -> theory -> theory
wenzelm@19511
    33
  val axiomatize_arity_i: arity -> theory -> theory
wenzelm@19574
    34
  type cache
wenzelm@19574
    35
  val cache: cache
wenzelm@19574
    36
  val of_sort: theory -> typ * sort -> cache -> thm list * cache  (*exception Sorts.CLASS_ERROR*)
wenzelm@3938
    37
end;
wenzelm@404
    38
wenzelm@15801
    39
structure AxClass: AX_CLASS =
wenzelm@404
    40
struct
wenzelm@404
    41
wenzelm@19405
    42
(** theory data **)
wenzelm@423
    43
wenzelm@19405
    44
(* class parameters (canonical order) *)
wenzelm@423
    45
wenzelm@19405
    46
type param = string * class;
wenzelm@423
    47
wenzelm@19405
    48
fun add_param pp ((x, c): param) params =
wenzelm@19405
    49
  (case AList.lookup (op =) params x of
wenzelm@19405
    50
    NONE => (x, c) :: params
wenzelm@19405
    51
  | SOME c' => error ("Duplicate class parameter " ^ quote x ^
wenzelm@19405
    52
      " for " ^ Pretty.string_of_sort pp [c] ^
wenzelm@19405
    53
      (if c = c' then "" else " and " ^ Pretty.string_of_sort pp [c'])));
wenzelm@423
    54
wenzelm@19405
    55
fun merge_params _ ([], qs) = qs
wenzelm@19405
    56
  | merge_params pp (ps, qs) =
wenzelm@19405
    57
      fold_rev (fn q => if member (op =) ps q then I else add_param pp q) qs ps;
wenzelm@423
    58
wenzelm@423
    59
wenzelm@19511
    60
(* axclasses *)
wenzelm@6379
    61
wenzelm@19243
    62
val introN = "intro";
wenzelm@19511
    63
val superN = "super";
wenzelm@19243
    64
val axiomsN = "axioms";
wenzelm@19243
    65
haftmann@21463
    66
val param_tyvarname = "'a";
haftmann@21463
    67
wenzelm@19392
    68
datatype axclass = AxClass of
wenzelm@19460
    69
 {def: thm,
wenzelm@19392
    70
  intro: thm,
haftmann@21463
    71
  axioms: thm list,
haftmann@21925
    72
  params: (string * typ) list};
wenzelm@19392
    73
wenzelm@19460
    74
type axclasses = axclass Symtab.table * param list;
wenzelm@19392
    75
haftmann@21925
    76
fun make_axclass ((def, intro, axioms), params) =
haftmann@21925
    77
  AxClass {def = def, intro = intro, axioms = axioms, params = params};
wenzelm@19405
    78
wenzelm@19405
    79
fun merge_axclasses pp ((tab1, params1), (tab2, params2)) : axclasses =
wenzelm@19405
    80
  (Symtab.merge (K true) (tab1, tab2), merge_params pp (params1, params2));
wenzelm@19405
    81
wenzelm@19392
    82
wenzelm@19392
    83
(* instances *)
wenzelm@19392
    84
wenzelm@20628
    85
val classrel_prefix = "classrel_";
wenzelm@20628
    86
val arity_prefix = "arity_";
wenzelm@19511
    87
wenzelm@19574
    88
type instances =
wenzelm@19574
    89
  ((class * class) * thm) list *
wenzelm@19574
    90
  ((class * sort list) * thm) list Symtab.table;
wenzelm@6379
    91
wenzelm@19574
    92
fun merge_instances ((classrel1, arities1): instances, (classrel2, arities2)) =
wenzelm@19574
    93
 (merge (eq_fst op =) (classrel1, classrel2),
wenzelm@19574
    94
  Symtab.join (K (merge (eq_fst op =))) (arities1, arities2));
wenzelm@19392
    95
wenzelm@19392
    96
wenzelm@19511
    97
(* setup data *)
wenzelm@19392
    98
wenzelm@19392
    99
structure AxClassData = TheoryDataFun
wenzelm@16458
   100
(struct
wenzelm@19392
   101
  val name = "Pure/axclass";
wenzelm@19574
   102
  type T = axclasses * instances;
wenzelm@19574
   103
  val empty : T = ((Symtab.empty, []), ([], Symtab.empty));
wenzelm@19574
   104
  val copy = I;
wenzelm@19574
   105
  val extend = I;
wenzelm@19574
   106
  fun merge pp ((axclasses1, instances1), (axclasses2, instances2)) =
wenzelm@19574
   107
    (merge_axclasses pp (axclasses1, axclasses2), (merge_instances (instances1, instances2)));
wenzelm@19460
   108
  fun print _ _ = ();
wenzelm@16458
   109
end);
wenzelm@6379
   110
wenzelm@19392
   111
val _ = Context.add_setup AxClassData.init;
wenzelm@6379
   112
wenzelm@6379
   113
wenzelm@19574
   114
(* maintain axclasses *)
wenzelm@19392
   115
wenzelm@19574
   116
val get_axclasses = #1 o AxClassData.get;
wenzelm@19574
   117
fun map_axclasses f = AxClassData.map (apfst f);
wenzelm@19574
   118
wenzelm@19574
   119
val lookup_def = Symtab.lookup o #1 o get_axclasses;
wenzelm@6379
   120
wenzelm@19511
   121
fun get_definition thy c =
wenzelm@19511
   122
  (case lookup_def thy c of
wenzelm@19392
   123
    SOME (AxClass info) => info
wenzelm@21919
   124
  | NONE => error ("No such axclass: " ^ quote c));
wenzelm@6379
   125
wenzelm@19123
   126
fun class_intros thy =
wenzelm@19392
   127
  let
wenzelm@19392
   128
    fun add_intro c =
wenzelm@19511
   129
      (case lookup_def thy c of SOME (AxClass {intro, ...}) => cons intro | _ => I);
wenzelm@21931
   130
    val classes = Sign.all_classes thy;
wenzelm@19392
   131
  in map (Thm.class_triv thy) classes @ fold add_intro classes [] end;
wenzelm@15876
   132
wenzelm@15876
   133
wenzelm@19460
   134
fun get_params thy pred =
wenzelm@19574
   135
  let val params = #2 (get_axclasses thy);
wenzelm@19460
   136
  in fold (fn (x, c) => if pred c then cons x else I) params [] end;
wenzelm@19460
   137
wenzelm@19460
   138
fun params_of thy c = get_params thy (fn c' => c' = c);
wenzelm@19460
   139
fun all_params_of thy S = get_params thy (fn c => Sign.subsort thy (S, [c]));
wenzelm@19460
   140
haftmann@20107
   141
fun class_of_param thy =
haftmann@19955
   142
  AList.lookup (op =) (#2 (get_axclasses thy));
haftmann@19955
   143
haftmann@21463
   144
fun params_of_class thy class =
haftmann@21463
   145
  (param_tyvarname, (#params o get_definition thy) class);
wenzelm@19460
   146
wenzelm@21919
   147
wenzelm@19511
   148
(* maintain instances *)
wenzelm@19503
   149
wenzelm@19574
   150
val get_instances = #2 o AxClassData.get;
wenzelm@19574
   151
fun map_instances f = AxClassData.map (apsnd f);
wenzelm@19528
   152
wenzelm@19528
   153
wenzelm@19574
   154
fun the_classrel thy (c1, c2) =
wenzelm@19574
   155
  (case AList.lookup (op =) (#1 (get_instances thy)) (c1, c2) of
wenzelm@19574
   156
    SOME th => Thm.transfer thy th
wenzelm@19574
   157
  | NONE => error ("Unproven class relation " ^ Sign.string_of_classrel thy [c1, c2]));
wenzelm@19574
   158
wenzelm@19574
   159
fun put_classrel arg = map_instances (fn (classrel, arities) =>
wenzelm@19574
   160
  (insert (eq_fst op =) arg classrel, arities));
wenzelm@19503
   161
wenzelm@19503
   162
wenzelm@19574
   163
fun the_arity thy a (c, Ss) =
wenzelm@19574
   164
  (case AList.lookup (op =) (Symtab.lookup_list (#2 (get_instances thy)) a) (c, Ss)  of
wenzelm@19574
   165
    SOME th => Thm.transfer thy th
wenzelm@19574
   166
  | NONE => error ("Unproven type arity " ^ Sign.string_of_arity thy (a, Ss, [c])));
wenzelm@19503
   167
wenzelm@19574
   168
fun put_arity ((t, Ss, c), th) = map_instances (fn (classrel, arities) =>
wenzelm@19574
   169
  (classrel, arities |> Symtab.insert_list (eq_fst op =) (t, ((c, Ss), th))));
wenzelm@19503
   170
wenzelm@19503
   171
wenzelm@19511
   172
(* print data *)
wenzelm@19460
   173
wenzelm@19460
   174
fun print_axclasses thy =
wenzelm@19460
   175
  let
wenzelm@19574
   176
    val axclasses = #1 (get_axclasses thy);
wenzelm@19460
   177
    val ctxt = ProofContext.init thy;
wenzelm@19460
   178
haftmann@21925
   179
    fun pretty_axclass (class, AxClass {def, intro, axioms, params}) =
wenzelm@19460
   180
      Pretty.block (Pretty.fbreaks
wenzelm@19460
   181
       [Pretty.block
wenzelm@19511
   182
          [Pretty.str "class ", ProofContext.pretty_sort ctxt [class], Pretty.str ":"],
wenzelm@19460
   183
        Pretty.strs ("parameters:" :: params_of thy class),
wenzelm@19460
   184
        ProofContext.pretty_fact ctxt ("def", [def]),
wenzelm@19460
   185
        ProofContext.pretty_fact ctxt (introN, [intro]),
wenzelm@19460
   186
        ProofContext.pretty_fact ctxt (axiomsN, axioms)]);
wenzelm@19460
   187
  in Pretty.writeln (Pretty.chunks (map pretty_axclass (Symtab.dest axclasses))) end;
wenzelm@19460
   188
wenzelm@19460
   189
wenzelm@404
   190
wenzelm@19511
   191
(** instances **)
wenzelm@19418
   192
wenzelm@19418
   193
(* class relations *)
wenzelm@19418
   194
wenzelm@19405
   195
fun cert_classrel thy raw_rel =
wenzelm@15876
   196
  let
wenzelm@19405
   197
    val (c1, c2) = pairself (Sign.certify_class thy) raw_rel;
wenzelm@19511
   198
    val _ = Type.add_classrel (Sign.pp thy) (c1, c2) (Sign.tsig_of thy);
wenzelm@19405
   199
    val _ =
wenzelm@19460
   200
      (case subtract (op =) (all_params_of thy [c1]) (all_params_of thy [c2]) of
wenzelm@19405
   201
        [] => ()
wenzelm@19405
   202
      | xs => raise TYPE ("Class " ^ Sign.string_of_sort thy [c1] ^ " lacks parameter(s) " ^
wenzelm@19405
   203
          commas_quote xs ^ " of " ^ Sign.string_of_sort thy [c2], [], []));
wenzelm@19405
   204
  in (c1, c2) end;
wenzelm@19405
   205
wenzelm@19405
   206
fun read_classrel thy raw_rel =
wenzelm@19405
   207
  cert_classrel thy (pairself (Sign.read_class thy) raw_rel)
wenzelm@19405
   208
    handle TYPE (msg, _, _) => error msg;
wenzelm@19405
   209
wenzelm@19405
   210
wenzelm@19405
   211
(* primitive rules *)
wenzelm@19405
   212
wenzelm@19405
   213
fun add_classrel th thy =
wenzelm@19405
   214
  let
wenzelm@19405
   215
    fun err () = raise THM ("add_classrel: malformed class relation", 0, [th]);
wenzelm@19405
   216
    val prop = Drule.plain_prop_of (Thm.transfer thy th);
wenzelm@19405
   217
    val rel = Logic.dest_classrel prop handle TERM _ => err ();
wenzelm@19405
   218
    val (c1, c2) = cert_classrel thy rel handle TYPE _ => err ();
wenzelm@19574
   219
  in
wenzelm@19574
   220
    thy
wenzelm@19574
   221
    |> Sign.primitive_classrel (c1, c2)
wenzelm@19574
   222
    |> put_classrel ((c1, c2), Drule.unconstrainTs th)
wenzelm@19574
   223
  end;
wenzelm@15876
   224
wenzelm@19405
   225
fun add_arity th thy =
wenzelm@15876
   226
  let
wenzelm@19528
   227
    fun err () = raise THM ("add_arity: malformed type arity", 0, [th]);
wenzelm@19405
   228
    val prop = Drule.plain_prop_of (Thm.transfer thy th);
wenzelm@19528
   229
    val (t, Ss, c) = Logic.dest_arity prop handle TERM _ => err ();
wenzelm@19528
   230
    val _ = if map (Sign.certify_sort thy) Ss = Ss then () else err ();
wenzelm@19574
   231
  in
wenzelm@19574
   232
    thy
wenzelm@19574
   233
    |> Sign.primitive_arity (t, Ss, [c])
wenzelm@19574
   234
    |> put_arity ((t, Ss, c), Drule.unconstrainTs th)
wenzelm@19574
   235
  end;
wenzelm@404
   236
wenzelm@404
   237
wenzelm@19243
   238
(* tactical proofs *)
wenzelm@15876
   239
wenzelm@19405
   240
fun prove_classrel raw_rel tac thy =
wenzelm@15876
   241
  let
wenzelm@19405
   242
    val (c1, c2) = cert_classrel thy raw_rel;
wenzelm@20049
   243
    val th = Goal.prove (ProofContext.init thy) [] []
wenzelm@20049
   244
        (Logic.mk_classrel (c1, c2)) (fn _ => tac) handle ERROR msg =>
wenzelm@19243
   245
      cat_error msg ("The error(s) above occurred while trying to prove class relation " ^
wenzelm@19243
   246
        quote (Sign.string_of_classrel thy [c1, c2]));
wenzelm@19511
   247
  in
wenzelm@19511
   248
    thy
wenzelm@20628
   249
    |> PureThy.add_thms [((prefix classrel_prefix (Logic.name_classrel (c1, c2)), th), [])]
wenzelm@19511
   250
    |-> (fn [th'] => add_classrel th')
wenzelm@19511
   251
  end;
wenzelm@404
   252
wenzelm@19243
   253
fun prove_arity raw_arity tac thy =
wenzelm@15876
   254
  let
wenzelm@19243
   255
    val arity = Sign.cert_arity thy raw_arity;
wenzelm@20628
   256
    val names = map (prefix arity_prefix) (Logic.name_arities arity);
wenzelm@19405
   257
    val props = Logic.mk_arities arity;
wenzelm@20049
   258
    val ths = Goal.prove_multi (ProofContext.init thy) [] [] props
wenzelm@21687
   259
      (fn _ => Goal.precise_conjunction_tac (length props) 1 THEN tac) handle ERROR msg =>
wenzelm@19243
   260
        cat_error msg ("The error(s) above occurred while trying to prove type arity " ^
wenzelm@19243
   261
          quote (Sign.string_of_arity thy arity));
wenzelm@19511
   262
  in
wenzelm@19511
   263
    thy
wenzelm@20628
   264
    |> PureThy.add_thms (map (rpair []) (names ~~ ths))
wenzelm@19511
   265
    |-> fold add_arity
wenzelm@19511
   266
  end;
wenzelm@19511
   267
wenzelm@19511
   268
wenzelm@19511
   269
wenzelm@19511
   270
(** class definitions **)
wenzelm@19511
   271
wenzelm@19511
   272
local
wenzelm@19511
   273
haftmann@21463
   274
fun read_param thy raw_t =
haftmann@21463
   275
  let
haftmann@21463
   276
    val t = Sign.read_term thy raw_t
haftmann@21463
   277
  in case try dest_Const t
haftmann@21463
   278
   of SOME (c, _) => c
haftmann@21463
   279
    | NONE => error ("Not a constant: " ^ Sign.string_of_term thy t)
haftmann@21463
   280
  end;
haftmann@21463
   281
haftmann@21463
   282
fun def_class prep_class prep_att prep_param prep_propp
haftmann@21463
   283
    (bclass, raw_super) raw_params raw_specs thy =
wenzelm@19511
   284
  let
wenzelm@19511
   285
    val ctxt = ProofContext.init thy;
wenzelm@19511
   286
    val pp = ProofContext.pp ctxt;
wenzelm@19511
   287
wenzelm@19511
   288
wenzelm@19511
   289
    (* prepare specification *)
wenzelm@19511
   290
wenzelm@19511
   291
    val bconst = Logic.const_of_class bclass;
wenzelm@19511
   292
    val class = Sign.full_name thy bclass;
wenzelm@19511
   293
    val super = map (prep_class thy) raw_super |> Sign.certify_sort thy;
wenzelm@19511
   294
wenzelm@19511
   295
    fun prep_axiom t =
wenzelm@19511
   296
      (case Term.add_tfrees t [] of
wenzelm@19511
   297
        [(a, S)] =>
wenzelm@19511
   298
          if Sign.subsort thy (super, S) then t
wenzelm@19511
   299
          else error ("Sort constraint of type variable " ^
wenzelm@19511
   300
            setmp show_sorts true (Pretty.string_of_typ pp) (TFree (a, S)) ^
wenzelm@19511
   301
            " needs to be weaker than " ^ Pretty.string_of_sort pp super)
wenzelm@19511
   302
      | [] => t
wenzelm@19511
   303
      | _ => error ("Multiple type variables in class axiom:\n" ^ Pretty.string_of_term pp t))
wenzelm@20548
   304
      |> map_types (Term.map_atyps (fn TFree _ => Term.aT [] | U => U))
wenzelm@19511
   305
      |> Logic.close_form;
wenzelm@19511
   306
wenzelm@19585
   307
    val axiomss = prep_propp (ctxt, map (map (rpair []) o snd) raw_specs)
wenzelm@19511
   308
      |> snd |> map (map (prep_axiom o fst));
wenzelm@19511
   309
    val name_atts = Attrib.map_specs (prep_att thy) raw_specs |> map fst;
wenzelm@19511
   310
wenzelm@19511
   311
wenzelm@19511
   312
    (* definition *)
wenzelm@19511
   313
wenzelm@19511
   314
    val conjs = map (curry Logic.mk_inclass (Term.aT [])) super @ flat axiomss;
wenzelm@19511
   315
    val class_eq =
wenzelm@19511
   316
      Logic.mk_equals (Logic.mk_inclass (Term.aT [], class), Logic.mk_conjunction_list conjs);
wenzelm@19511
   317
wenzelm@19511
   318
    val ([def], def_thy) =
wenzelm@19511
   319
      thy
wenzelm@19511
   320
      |> Sign.primitive_class (bclass, super)
wenzelm@19511
   321
      |> PureThy.add_defs_i false [((Thm.def_name bconst, class_eq), [])];
wenzelm@19511
   322
    val (raw_intro, (raw_classrel, raw_axioms)) =
wenzelm@19511
   323
      (Conjunction.split_defined (length conjs) def) ||> chop (length super);
wenzelm@19392
   324
wenzelm@19418
   325
wenzelm@19511
   326
    (* facts *)
wenzelm@19511
   327
wenzelm@19511
   328
    val class_triv = Thm.class_triv def_thy class;
wenzelm@19511
   329
    val ([(_, [intro]), (_, classrel), (_, axioms)], facts_thy) =
wenzelm@19511
   330
      def_thy
wenzelm@19511
   331
      |> PureThy.note_thmss_qualified "" bconst
wenzelm@19511
   332
        [((introN, []), [([Drule.standard raw_intro], [])]),
wenzelm@19511
   333
         ((superN, []), [(map Drule.standard raw_classrel, [])]),
wenzelm@19511
   334
         ((axiomsN, []), [(map (fn th => Drule.standard (class_triv RS th)) raw_axioms, [])])];
wenzelm@19511
   335
haftmann@21463
   336
    (* params *)
haftmann@21463
   337
haftmann@21463
   338
    val params = map (prep_param thy) raw_params;
haftmann@21463
   339
    val params_typs = map (fn param =>
haftmann@21463
   340
      let
haftmann@21463
   341
        val ty = Sign.the_const_type thy param;
haftmann@21893
   342
        val _ = case Term.typ_tvars ty
haftmann@21893
   343
         of [_] => ()
haftmann@21953
   344
          | _ => error ("Exactly one type variable required in parameter " ^ quote param);
haftmann@21893
   345
        val ty' = Term.map_type_tvar (fn _ => TFree (param_tyvarname, [class])) ty;
haftmann@21463
   346
      in (param, ty') end) params;
wenzelm@19511
   347
wenzelm@19511
   348
    (* result *)
wenzelm@19511
   349
haftmann@21925
   350
    val axclass = make_axclass ((def, intro, axioms), params_typs);
wenzelm@19511
   351
    val result_thy =
wenzelm@19511
   352
      facts_thy
wenzelm@19574
   353
      |> fold put_classrel (map (pair class) super ~~ classrel)
wenzelm@19511
   354
      |> Sign.add_path bconst
wenzelm@19511
   355
      |> PureThy.note_thmss_i "" (name_atts ~~ map Thm.simple_fact (unflat axiomss axioms)) |> snd
wenzelm@19511
   356
      |> Sign.restore_naming facts_thy
wenzelm@19574
   357
      |> map_axclasses (fn (axclasses, parameters) =>
wenzelm@21919
   358
        (Symtab.update (class, axclass) axclasses,
wenzelm@19574
   359
          fold (fn x => add_param pp (x, class)) params parameters));
wenzelm@19511
   360
wenzelm@19511
   361
  in (class, result_thy) end;
wenzelm@19511
   362
wenzelm@19511
   363
in
wenzelm@19511
   364
haftmann@21463
   365
val define_class = def_class Sign.read_class Attrib.attribute read_param ProofContext.read_propp;
haftmann@21463
   366
val define_class_i = def_class Sign.certify_class (K I) (K I) ProofContext.cert_propp;
wenzelm@19511
   367
wenzelm@19511
   368
end;
wenzelm@19511
   369
wenzelm@19511
   370
wenzelm@19531
   371
wenzelm@19511
   372
(** axiomatizations **)
wenzelm@19511
   373
wenzelm@19511
   374
local
wenzelm@19511
   375
wenzelm@20628
   376
fun axiomatize prep mk name add raw_args thy =
wenzelm@20628
   377
  let
wenzelm@20628
   378
    val args = prep thy raw_args;
wenzelm@20628
   379
    val specs = mk args;
wenzelm@20628
   380
    val names = name args;
wenzelm@20628
   381
  in thy |> PureThy.add_axioms_i (map (rpair []) (names ~~ specs)) |-> fold add end;
wenzelm@19511
   382
wenzelm@19511
   383
fun ax_classrel prep =
wenzelm@20628
   384
  axiomatize (map o prep) (map Logic.mk_classrel)
wenzelm@20628
   385
    (map (prefix classrel_prefix o Logic.name_classrel)) add_classrel;
wenzelm@19511
   386
wenzelm@19511
   387
fun ax_arity prep =
wenzelm@20628
   388
  axiomatize prep Logic.mk_arities
wenzelm@20628
   389
    (map (prefix arity_prefix) o Logic.name_arities) add_arity;
wenzelm@19511
   390
wenzelm@19706
   391
fun class_const c =
wenzelm@19706
   392
  (Logic.const_of_class c, Term.itselfT (Term.aT []) --> propT);
wenzelm@19706
   393
wenzelm@19511
   394
fun ax_class prep_class prep_classrel (bclass, raw_super) thy =
wenzelm@19511
   395
  let
wenzelm@19511
   396
    val class = Sign.full_name thy bclass;
wenzelm@19511
   397
    val super = map (prep_class thy) raw_super |> Sign.certify_sort thy;
wenzelm@19511
   398
  in
wenzelm@19511
   399
    thy
wenzelm@19511
   400
    |> Sign.primitive_class (bclass, super)
wenzelm@19511
   401
    |> ax_classrel prep_classrel (map (fn c => (class, c)) super)
wenzelm@19706
   402
    |> Theory.add_deps "" (class_const class) (map class_const super)
wenzelm@19511
   403
  end;
wenzelm@19511
   404
wenzelm@19511
   405
in
wenzelm@19511
   406
wenzelm@19511
   407
val axiomatize_class = ax_class Sign.read_class read_classrel;
wenzelm@19511
   408
val axiomatize_class_i = ax_class Sign.certify_class cert_classrel;
wenzelm@19511
   409
val axiomatize_classrel = ax_classrel read_classrel;
wenzelm@19511
   410
val axiomatize_classrel_i = ax_classrel cert_classrel;
wenzelm@19511
   411
val axiomatize_arity = ax_arity Sign.read_arity;
wenzelm@19511
   412
val axiomatize_arity_i = ax_arity Sign.cert_arity;
wenzelm@19511
   413
wenzelm@19511
   414
end;
wenzelm@19511
   415
wenzelm@19511
   416
wenzelm@19511
   417
wenzelm@19511
   418
(** explicit derivations -- cached **)
wenzelm@19511
   419
wenzelm@19574
   420
datatype cache = Types of (class * thm) list Typtab.table;
wenzelm@19574
   421
val cache = Types Typtab.empty;
wenzelm@19574
   422
wenzelm@19511
   423
local
wenzelm@19503
   424
wenzelm@19574
   425
fun lookup_type (Types cache) = AList.lookup (op =) o Typtab.lookup_list cache;
wenzelm@19574
   426
fun insert_type T der (Types cache) = Types (Typtab.insert_list (eq_fst op =) (T, der) cache);
wenzelm@19503
   427
wenzelm@19522
   428
fun derive_type _ (_, []) = []
wenzelm@19522
   429
  | derive_type thy (typ, sort) =
wenzelm@19522
   430
      let
wenzelm@19528
   431
        val vars = Term.fold_atyps
wenzelm@19522
   432
            (fn T as TFree (_, S) => insert (eq_fst op =) (T, S)
wenzelm@19522
   433
              | T as TVar (_, S) => insert (eq_fst op =) (T, S)
wenzelm@19528
   434
              | _ => I) typ [];
wenzelm@19574
   435
        val hyps = vars
wenzelm@19574
   436
          |> map (fn (T, S) => (T, Drule.sort_triv thy (T, S) ~~ S));
wenzelm@19642
   437
        val ths = (typ, sort) |> Sorts.of_sort_derivation (Sign.pp thy) (Sign.classes_of thy)
wenzelm@19574
   438
           {classrel =
wenzelm@19574
   439
              fn (th, c1) => fn c2 => th RS the_classrel thy (c1, c2),
wenzelm@19574
   440
            constructor =
wenzelm@19574
   441
              fn a => fn dom => fn c =>
wenzelm@19574
   442
                let val Ss = map (map snd) dom and ths = maps (map fst) dom
wenzelm@19574
   443
                in ths MRS the_arity thy a (c, Ss) end,
wenzelm@19574
   444
            variable =
wenzelm@19574
   445
              the_default [] o AList.lookup (op =) hyps};
wenzelm@19574
   446
      in ths end;
wenzelm@19503
   447
wenzelm@19511
   448
in
wenzelm@19511
   449
wenzelm@19574
   450
fun of_sort thy (typ, sort) cache =
wenzelm@19574
   451
  let
wenzelm@19574
   452
    val sort' = filter (is_none o lookup_type cache typ) sort;
wenzelm@19574
   453
    val ths' = derive_type thy (typ, sort')
wenzelm@19574
   454
      handle ERROR msg => cat_error msg ("The error(s) above occurred for sort derivation: " ^
wenzelm@19574
   455
        Sign.string_of_typ thy typ ^ " :: " ^ Sign.string_of_sort thy sort');
wenzelm@19574
   456
    val cache' = cache |> fold (insert_type typ) (sort' ~~ ths');
wenzelm@19574
   457
    val ths =
wenzelm@19574
   458
      sort |> map (fn c =>
wenzelm@19574
   459
        Goal.finish (the (lookup_type cache' typ c) RS
wenzelm@19574
   460
          Goal.init (Thm.cterm_of thy (Logic.mk_inclass (typ, c))))
wenzelm@20260
   461
        |> Thm.adjust_maxidx_thm ~1);
wenzelm@19574
   462
  in (ths, cache') end;
wenzelm@19503
   463
wenzelm@19511
   464
end;
wenzelm@19418
   465
wenzelm@15876
   466
end;