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