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