src/Pure/axclass.ML
author wenzelm
Wed Apr 13 18:45:25 2005 +0200 (2005-04-13 ago)
changeset 15705 b5edb9dcec9a
parent 15703 727ef1b8b3ee
child 15801 d2f5ca3c048d
permissions -rw-r--r--
*** MESSAGE REFERS TO PREVIOUS VERSION ***
Attrib.src;
wenzelm@404
     1
(*  Title:      Pure/axclass.ML
wenzelm@404
     2
    ID:         $Id$
wenzelm@404
     3
    Author:     Markus Wenzel, TU Muenchen
wenzelm@404
     4
wenzelm@6379
     5
Axiomatic type class package.
wenzelm@404
     6
*)
wenzelm@404
     7
wenzelm@404
     8
signature AX_CLASS =
wenzelm@3938
     9
sig
wenzelm@5685
    10
  val quiet_mode: bool ref
wenzelm@6379
    11
  val print_axclasses: theory -> unit
paulson@1498
    12
  val add_classrel_thms: thm list -> theory -> theory
paulson@1498
    13
  val add_arity_thms: thm list -> theory -> theory
wenzelm@15703
    14
  val add_axclass: bclass * xclass list -> ((bstring * string) * Attrib.src list) list
wenzelm@6379
    15
    -> theory -> theory * {intro: thm, axioms: thm list}
wenzelm@6379
    16
  val add_axclass_i: bclass * class list -> ((bstring * term) * theory attribute list) list
wenzelm@6379
    17
    -> theory -> theory * {intro: thm, axioms: thm list}
wenzelm@11828
    18
  val add_inst_subclass_x: xclass * xclass -> string list -> thm list
wenzelm@3788
    19
    -> tactic option -> theory -> theory
wenzelm@11828
    20
  val add_inst_subclass: xclass * xclass -> tactic -> theory -> theory
wenzelm@11828
    21
  val add_inst_subclass_i: class * class -> tactic -> theory -> theory
wenzelm@11828
    22
  val add_inst_arity_x: xstring * string list * string -> string list
wenzelm@3938
    23
    -> thm list -> tactic option -> theory -> theory
wenzelm@11828
    24
  val add_inst_arity: xstring * string list * string -> tactic -> theory -> theory
wenzelm@11828
    25
  val add_inst_arity_i: string * sort list * sort -> tactic -> theory -> theory
wenzelm@14605
    26
  val default_intro_classes_tac: thm list -> tactic
wenzelm@6379
    27
  val axclass_tac: thm list -> tactic
wenzelm@12876
    28
  val instance_subclass_proof: xclass * xclass -> bool -> theory -> ProofHistory.T
wenzelm@12876
    29
  val instance_subclass_proof_i: class * class -> bool -> theory -> ProofHistory.T
wenzelm@14605
    30
  val instance_arity_proof: xstring * string list * string -> bool -> theory -> ProofHistory.T
wenzelm@14605
    31
  val instance_arity_proof_i: string * sort list * sort -> bool -> theory -> ProofHistory.T
wenzelm@6379
    32
  val setup: (theory -> theory) list
wenzelm@3938
    33
end;
wenzelm@404
    34
paulson@1498
    35
structure AxClass : AX_CLASS =
wenzelm@404
    36
struct
wenzelm@404
    37
wenzelm@4015
    38
wenzelm@404
    39
(** utilities **)
wenzelm@404
    40
wenzelm@5685
    41
(* messages *)
wenzelm@5685
    42
wenzelm@5685
    43
val quiet_mode = ref false;
wenzelm@5685
    44
fun message s = if ! quiet_mode then () else writeln s;
wenzelm@5685
    45
wenzelm@5685
    46
wenzelm@404
    47
(* type vars *)
wenzelm@404
    48
wenzelm@404
    49
fun map_typ_frees f (Type (t, tys)) = Type (t, map (map_typ_frees f) tys)
wenzelm@404
    50
  | map_typ_frees f (TFree a) = f a
wenzelm@404
    51
  | map_typ_frees _ a = a;
wenzelm@404
    52
wenzelm@404
    53
val map_term_tfrees = map_term_types o map_typ_frees;
wenzelm@404
    54
wenzelm@404
    55
fun aT S = TFree ("'a", S);
wenzelm@404
    56
wenzelm@3395
    57
fun dest_varT (TFree (x, S)) = ((x, ~1), S)
wenzelm@3395
    58
  | dest_varT (TVar xi_S) = xi_S
wenzelm@3788
    59
  | dest_varT T = raise TYPE ("dest_varT", [T], []);
wenzelm@3395
    60
wenzelm@404
    61
wenzelm@886
    62
(* get axioms and theorems *)
wenzelm@404
    63
paulson@1498
    64
val is_def = Logic.is_equals o #prop o rep_thm;
wenzelm@886
    65
wenzelm@4934
    66
fun witnesses thy names thms =
skalberg@15570
    67
  PureThy.get_thmss thy (map (rpair NONE) names) @ thms @ List.filter is_def (map snd (axioms_of thy));
wenzelm@886
    68
wenzelm@404
    69
wenzelm@404
    70
wenzelm@560
    71
(** abstract syntax operations **)
wenzelm@423
    72
wenzelm@6379
    73
(* names *)
wenzelm@6379
    74
wenzelm@6379
    75
fun intro_name c = c ^ "I";
wenzelm@6379
    76
val introN = "intro";
wenzelm@6379
    77
val axiomsN = "axioms";
wenzelm@6379
    78
wenzelm@6379
    79
wenzelm@423
    80
(* subclass relations as terms *)
wenzelm@423
    81
paulson@1498
    82
fun mk_classrel (c1, c2) = Logic.mk_inclass (aT [c1], c2);
wenzelm@423
    83
wenzelm@423
    84
fun dest_classrel tm =
wenzelm@423
    85
  let
wenzelm@3788
    86
    fun err () = raise TERM ("dest_classrel", [tm]);
wenzelm@423
    87
wenzelm@3395
    88
    val (ty, c2) = Logic.dest_inclass tm handle TERM _ => err ();
wenzelm@3395
    89
    val c1 = (case dest_varT ty of (_, [c]) => c | _ => err ())
wenzelm@3395
    90
      handle TYPE _ => err ();
wenzelm@6379
    91
  in (c1, c2) end;
wenzelm@423
    92
wenzelm@423
    93
wenzelm@423
    94
(* arities as terms *)
wenzelm@423
    95
wenzelm@14605
    96
fun mk_arity (t, Ss, c) =
wenzelm@423
    97
  let
wenzelm@14695
    98
    val tfrees = ListPair.map TFree (Term.invent_names [] "'a" (length Ss), Ss);
wenzelm@6379
    99
  in Logic.mk_inclass (Type (t, tfrees), c) end;
wenzelm@423
   100
wenzelm@14605
   101
fun mk_arities (t, Ss, S) = map (fn c => mk_arity (t, Ss, c)) S;
wenzelm@14605
   102
wenzelm@423
   103
fun dest_arity tm =
wenzelm@423
   104
  let
wenzelm@3788
   105
    fun err () = raise TERM ("dest_arity", [tm]);
wenzelm@423
   106
wenzelm@3395
   107
    val (ty, c) = Logic.dest_inclass tm handle TERM _ => err ();
wenzelm@3395
   108
    val (t, tvars) =
wenzelm@423
   109
      (case ty of
wenzelm@3395
   110
        Type (t, tys) => (t, map dest_varT tys handle TYPE _ => err ())
wenzelm@423
   111
      | _ => err ());
wenzelm@423
   112
    val ss =
wenzelm@3395
   113
      if null (gen_duplicates eq_fst tvars)
wenzelm@3395
   114
      then map snd tvars else err ();
wenzelm@6379
   115
  in (t, ss, c) end;
wenzelm@423
   116
wenzelm@423
   117
wenzelm@423
   118
wenzelm@560
   119
(** add theorems as axioms **)
wenzelm@423
   120
wenzelm@423
   121
fun prep_thm_axm thy thm =
wenzelm@423
   122
  let
wenzelm@423
   123
    fun err msg = raise THM ("prep_thm_axm: " ^ msg, 0, [thm]);
wenzelm@423
   124
wenzelm@1237
   125
    val {sign, hyps, prop, ...} = rep_thm thm;
wenzelm@423
   126
  in
wenzelm@6390
   127
    if not (Sign.subsig (sign, Theory.sign_of thy)) then
wenzelm@423
   128
      err "theorem not of same theory"
wenzelm@1237
   129
    else if not (null (extra_shyps thm)) orelse not (null hyps) then
wenzelm@423
   130
      err "theorem may not contain hypotheses"
wenzelm@423
   131
    else prop
wenzelm@423
   132
  end;
wenzelm@423
   133
wenzelm@423
   134
(*theorems expressing class relations*)
wenzelm@423
   135
fun add_classrel_thms thms thy =
wenzelm@423
   136
  let
wenzelm@423
   137
    fun prep_thm thm =
wenzelm@423
   138
      let
wenzelm@423
   139
        val prop = prep_thm_axm thy thm;
wenzelm@423
   140
        val (c1, c2) = dest_classrel prop handle TERM _ =>
wenzelm@423
   141
          raise THM ("add_classrel_thms: theorem is not a class relation", 0, [thm]);
wenzelm@423
   142
      in (c1, c2) end;
wenzelm@8897
   143
  in Theory.add_classrel_i (map prep_thm thms) thy end;
wenzelm@423
   144
wenzelm@423
   145
(*theorems expressing arities*)
wenzelm@423
   146
fun add_arity_thms thms thy =
wenzelm@423
   147
  let
wenzelm@423
   148
    fun prep_thm thm =
wenzelm@423
   149
      let
wenzelm@423
   150
        val prop = prep_thm_axm thy thm;
wenzelm@423
   151
        val (t, ss, c) = dest_arity prop handle TERM _ =>
wenzelm@423
   152
          raise THM ("add_arity_thms: theorem is not an arity", 0, [thm]);
wenzelm@423
   153
      in (t, ss, [c]) end;
wenzelm@8897
   154
  in Theory.add_arities_i (map prep_thm thms) thy end;
wenzelm@6379
   155
wenzelm@6379
   156
wenzelm@6379
   157
wenzelm@6379
   158
(** axclass info **)
wenzelm@6379
   159
wenzelm@6379
   160
(* data kind 'Pure/axclasses' *)
wenzelm@6379
   161
wenzelm@6379
   162
type axclass_info =
wenzelm@6379
   163
  {super_classes: class list,
wenzelm@6379
   164
    intro: thm,
wenzelm@6379
   165
    axioms: thm list};
wenzelm@6379
   166
wenzelm@6379
   167
structure AxclassesArgs =
wenzelm@6379
   168
struct
wenzelm@6379
   169
  val name = "Pure/axclasses";
wenzelm@6379
   170
  type T = axclass_info Symtab.table;
wenzelm@6379
   171
wenzelm@6379
   172
  val empty = Symtab.empty;
wenzelm@6546
   173
  val copy = I;
wenzelm@6379
   174
  val prep_ext = I;
wenzelm@6379
   175
  fun merge (tab1, tab2) = Symtab.merge (K true) (tab1, tab2);
wenzelm@6379
   176
wenzelm@6379
   177
  fun print sg tab =
wenzelm@6379
   178
    let
wenzelm@6379
   179
      val ext_class = Sign.cond_extern sg Sign.classK;
wenzelm@6379
   180
      val ext_thm = PureThy.cond_extern_thm_sg sg;
wenzelm@6379
   181
wenzelm@6379
   182
      fun pretty_class c cs = Pretty.block
wenzelm@6379
   183
        (Pretty.str (ext_class c) :: Pretty.str " <" :: Pretty.brk 1 ::
wenzelm@6379
   184
          Pretty.breaks (map (Pretty.str o ext_class) cs));
wenzelm@6379
   185
wenzelm@10008
   186
      fun pretty_thms name thms = Pretty.big_list (name ^ ":")
wenzelm@10008
   187
        (map (Display.pretty_thm_sg sg) thms);
wenzelm@6379
   188
wenzelm@6379
   189
      fun pretty_axclass (name, {super_classes, intro, axioms}) = Pretty.block (Pretty.fbreaks
wenzelm@6379
   190
        [pretty_class name super_classes, pretty_thms introN [intro], pretty_thms axiomsN axioms]);
wenzelm@8720
   191
    in Pretty.writeln (Pretty.chunks (map pretty_axclass (Symtab.dest tab))) end;
wenzelm@6379
   192
end;
wenzelm@6379
   193
wenzelm@6379
   194
structure AxclassesData = TheoryDataFun(AxclassesArgs);
wenzelm@6379
   195
val print_axclasses = AxclassesData.print;
wenzelm@6379
   196
wenzelm@6379
   197
wenzelm@6379
   198
(* get and put data *)
wenzelm@6379
   199
wenzelm@6379
   200
fun lookup_axclass_info_sg sg c = Symtab.lookup (AxclassesData.get_sg sg, c);
wenzelm@6379
   201
wenzelm@6379
   202
fun get_axclass_info thy c =
wenzelm@6379
   203
  (case lookup_axclass_info_sg (Theory.sign_of thy) c of
skalberg@15531
   204
    NONE => error ("Unknown axclass " ^ quote c)
skalberg@15531
   205
  | SOME info => info);
wenzelm@6379
   206
wenzelm@6379
   207
fun put_axclass_info c info thy =
wenzelm@6379
   208
  thy |> AxclassesData.put (Symtab.update ((c, info), AxclassesData.get thy));
wenzelm@423
   209
wenzelm@423
   210
wenzelm@423
   211
wenzelm@423
   212
(** add axiomatic type classes **)
wenzelm@404
   213
wenzelm@404
   214
(* errors *)
wenzelm@404
   215
wenzelm@404
   216
fun err_bad_axsort ax c =
wenzelm@404
   217
  error ("Sort constraint in axiom " ^ quote ax ^ " not supersort of " ^ quote c);
wenzelm@404
   218
wenzelm@404
   219
fun err_bad_tfrees ax =
wenzelm@404
   220
  error ("More than one type variable in axiom " ^ quote ax);
wenzelm@404
   221
wenzelm@404
   222
wenzelm@404
   223
(* ext_axclass *)
wenzelm@404
   224
wenzelm@6379
   225
fun ext_axclass prep_class prep_axm prep_att (bclass, raw_super_classes) raw_axioms_atts thy =
wenzelm@404
   226
  let
wenzelm@6379
   227
    val sign = Theory.sign_of thy;
wenzelm@3938
   228
wenzelm@6379
   229
    val class = Sign.full_name sign bclass;
wenzelm@6379
   230
    val super_classes = map (prep_class sign) raw_super_classes;
wenzelm@6379
   231
    val axms = map (prep_axm sign o fst) raw_axioms_atts;
wenzelm@6379
   232
    val atts = map (map (prep_att thy) o snd) raw_axioms_atts;
wenzelm@404
   233
wenzelm@6379
   234
    (*declare class*)
wenzelm@6379
   235
    val class_thy =
wenzelm@6379
   236
      thy |> Theory.add_classes_i [(bclass, super_classes)];
wenzelm@6379
   237
    val class_sign = Theory.sign_of class_thy;
wenzelm@404
   238
wenzelm@6379
   239
    (*prepare abstract axioms*)
wenzelm@404
   240
    fun abs_axm ax =
wenzelm@404
   241
      if null (term_tfrees ax) then
wenzelm@14854
   242
        Logic.mk_implies (Logic.mk_inclass (aT [], class), ax)
wenzelm@3788
   243
      else map_term_tfrees (K (aT [class])) ax;
wenzelm@6379
   244
    val abs_axms = map (abs_axm o #2) axms;
wenzelm@404
   245
wenzelm@404
   246
    fun axm_sort (name, ax) =
wenzelm@404
   247
      (case term_tfrees ax of
wenzelm@404
   248
        [] => []
wenzelm@6379
   249
      | [(_, S)] => if Sign.subsort class_sign ([class], S) then S else err_bad_axsort name class
wenzelm@404
   250
      | _ => err_bad_tfrees name);
skalberg@15570
   251
    val axS = Sign.certify_sort class_sign (List.concat (map axm_sort axms));
wenzelm@404
   252
paulson@1498
   253
    val int_axm = Logic.close_form o map_term_tfrees (K (aT axS));
paulson@1498
   254
    fun inclass c = Logic.mk_inclass (aT axS, c);
wenzelm@404
   255
paulson@1498
   256
    val intro_axm = Logic.list_implies
wenzelm@6379
   257
      (map inclass super_classes @ map (int_axm o #2) axms, inclass class);
wenzelm@6379
   258
wenzelm@6379
   259
    (*declare axioms and rule*)
wenzelm@8420
   260
    val (axms_thy, ([intro], [axioms])) =
wenzelm@6379
   261
      class_thy
wenzelm@6379
   262
      |> Theory.add_path bclass
wenzelm@6379
   263
      |> PureThy.add_axioms_i [Thm.no_attributes (introN, intro_axm)]
wenzelm@8420
   264
      |>>> PureThy.add_axiomss_i [Thm.no_attributes (axiomsN, abs_axms)];
wenzelm@6379
   265
    val info = {super_classes = super_classes, intro = intro, axioms = axioms};
wenzelm@6379
   266
wenzelm@6379
   267
    (*store info*)
wenzelm@6379
   268
    val final_thy =
wenzelm@6379
   269
      axms_thy
wenzelm@8420
   270
      |> (#1 o PureThy.add_thms ((map #1 axms ~~ axioms) ~~ atts))
wenzelm@6379
   271
      |> Theory.parent_path
wenzelm@8420
   272
      |> (#1 o PureThy.add_thms [Thm.no_attributes (intro_name bclass, intro)])
wenzelm@6379
   273
      |> put_axclass_info class info;
wenzelm@6379
   274
  in (final_thy, {intro = intro, axioms = axioms}) end;
wenzelm@404
   275
wenzelm@404
   276
wenzelm@404
   277
(* external interfaces *)
wenzelm@404
   278
wenzelm@6390
   279
val add_axclass = ext_axclass Sign.intern_class Theory.read_axm Attrib.global_attribute;
wenzelm@6390
   280
val add_axclass_i = ext_axclass (K I) Theory.cert_axm (K I);
wenzelm@404
   281
wenzelm@404
   282
wenzelm@404
   283
wenzelm@423
   284
(** prove class relations and type arities **)
wenzelm@423
   285
wenzelm@423
   286
(* class_axms *)
wenzelm@404
   287
wenzelm@6379
   288
fun class_axms sign =
wenzelm@6379
   289
  let val classes = Sign.classes sign in
wenzelm@6379
   290
    map (Thm.class_triv sign) classes @
skalberg@15570
   291
    List.mapPartial (Option.map #intro o lookup_axclass_info_sg sign) classes
wenzelm@404
   292
  end;
wenzelm@404
   293
wenzelm@423
   294
wenzelm@7351
   295
(* intro_classes *)
wenzelm@6379
   296
wenzelm@14605
   297
fun intro_classes_tac facts st =
wenzelm@14605
   298
  (ALLGOALS (Method.insert_tac facts THEN'
wenzelm@14605
   299
      REPEAT_ALL_NEW (resolve_tac (class_axms (Thm.sign_of_thm st))))
wenzelm@14605
   300
    THEN Tactic.distinct_subgoals_tac) st;
wenzelm@6379
   301
wenzelm@7351
   302
val intro_classes_method =
wenzelm@14605
   303
  ("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
wenzelm@7351
   304
    "back-chain introduction rules of axiomatic type classes");
wenzelm@6379
   305
wenzelm@6379
   306
wenzelm@10309
   307
(* default method *)
wenzelm@10309
   308
wenzelm@14605
   309
fun default_intro_classes_tac [] = intro_classes_tac []
wenzelm@14605
   310
  | default_intro_classes_tac _ = Tactical.no_tac;    (*no error message!*)
wenzelm@10309
   311
wenzelm@10309
   312
fun default_tac rules ctxt facts =
wenzelm@14605
   313
  HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
wenzelm@14605
   314
    default_intro_classes_tac facts;
wenzelm@10309
   315
wenzelm@10309
   316
val default_method =
wenzelm@12371
   317
  ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac), "apply some intro/elim rule");
wenzelm@10309
   318
wenzelm@10309
   319
wenzelm@14605
   320
(* old-style axclass_tac *)
wenzelm@423
   321
wenzelm@487
   322
(*(1) repeatedly resolve goals of form "OFCLASS(ty, c_class)",
wenzelm@1217
   323
      try class_trivs first, then "cI" axioms
wenzelm@423
   324
  (2) rewrite goals using user supplied definitions
wenzelm@423
   325
  (3) repeatedly resolve goals with user supplied non-definitions*)
wenzelm@423
   326
wenzelm@6379
   327
fun axclass_tac thms =
wenzelm@1217
   328
  let
skalberg@15570
   329
    val defs = List.filter is_def thms;
wenzelm@1217
   330
    val non_defs = filter_out is_def thms;
wenzelm@1217
   331
  in
wenzelm@14605
   332
    intro_classes_tac [] THEN
wenzelm@1217
   333
    TRY (rewrite_goals_tac defs) THEN
wenzelm@1217
   334
    TRY (REPEAT_FIRST (fn i => assume_tac i ORELSE resolve_tac non_defs i))
wenzelm@1217
   335
  end;
wenzelm@404
   336
wenzelm@404
   337
wenzelm@14605
   338
(* old-style provers *)
wenzelm@404
   339
wenzelm@11969
   340
fun prove mk_prop str_of sign prop thms usr_tac =
skalberg@15570
   341
  (Tactic.prove sign [] [] (mk_prop prop) (K (axclass_tac thms THEN (getOpt (usr_tac,all_tac))))
wenzelm@11969
   342
    handle ERROR => error ("The error(s) above occurred while trying to prove " ^
wenzelm@11969
   343
     quote (str_of sign prop))) |> Drule.standard;
wenzelm@404
   344
wenzelm@14824
   345
val prove_subclass = prove mk_classrel (fn sg => fn (c1, c2) =>
wenzelm@14824
   346
  Pretty.string_of_classrel (Sign.pp sg) [c1, c2]);
wenzelm@404
   347
wenzelm@14824
   348
val prove_arity = prove mk_arity (fn sg => fn (t, Ss, c) =>
wenzelm@14824
   349
  Pretty.string_of_arity (Sign.pp sg) (t, Ss, [c]));
wenzelm@404
   350
wenzelm@404
   351
wenzelm@423
   352
wenzelm@449
   353
(** add proved subclass relations and arities **)
wenzelm@404
   354
wenzelm@8897
   355
(* prepare classes and arities *)
wenzelm@8897
   356
wenzelm@8897
   357
fun read_class sg c = Sign.certify_class sg (Sign.intern_class sg c);
wenzelm@8897
   358
wenzelm@14824
   359
fun test_classrel sg cc = (Type.add_classrel (Sign.pp sg) [cc] (Sign.tsig_of sg); cc);
wenzelm@14785
   360
fun cert_classrel sg = test_classrel sg o Library.pairself (Sign.certify_class sg);
wenzelm@14785
   361
fun read_classrel sg = test_classrel sg o Library.pairself (read_class sg);
wenzelm@3949
   362
wenzelm@14824
   363
fun test_arity sg ar = (Type.add_arities (Sign.pp sg) [ar] (Sign.tsig_of sg); ar);
wenzelm@6379
   364
wenzelm@8897
   365
fun prep_arity prep_tycon prep_sort prep_x sg (t, Ss, x) =
wenzelm@14824
   366
  test_arity sg (prep_tycon sg t, map (prep_sort sg) Ss, prep_x sg x);
wenzelm@8897
   367
wenzelm@8897
   368
val read_arity = prep_arity Sign.intern_tycon Sign.read_sort Sign.read_sort;
wenzelm@8897
   369
val cert_arity = prep_arity (K I) Sign.certify_sort Sign.certify_sort;
wenzelm@8897
   370
wenzelm@8897
   371
wenzelm@8897
   372
(* old-style instance declarations *)
wenzelm@6379
   373
wenzelm@6379
   374
fun ext_inst_subclass prep_classrel raw_c1_c2 names thms usr_tac thy =
wenzelm@11969
   375
  let
wenzelm@11969
   376
    val sign = Theory.sign_of thy;
wenzelm@14824
   377
    val (c1, c2) = prep_classrel sign raw_c1_c2;
wenzelm@11969
   378
  in
wenzelm@14824
   379
    message ("Proving class inclusion " ^ quote (Sign.string_of_classrel sign [c1, c2]) ^ " ...");
wenzelm@14824
   380
    thy |> add_classrel_thms [prove_subclass sign (c1, c2) (witnesses thy names thms) usr_tac]
wenzelm@3788
   381
  end;
wenzelm@423
   382
wenzelm@6379
   383
fun ext_inst_arity prep_arity (raw_t, raw_Ss, raw_cs) names thms usr_tac thy =
wenzelm@423
   384
  let
wenzelm@6379
   385
    val sign = Theory.sign_of thy;
wenzelm@6379
   386
    val (t, Ss, cs) = prep_arity sign (raw_t, raw_Ss, raw_cs);
wenzelm@4934
   387
    val wthms = witnesses thy names thms;
wenzelm@423
   388
    fun prove c =
wenzelm@5685
   389
     (message ("Proving type arity " ^
wenzelm@14824
   390
        quote (Sign.string_of_arity sign (t, Ss, [c])) ^ " ...");
wenzelm@11969
   391
        prove_arity sign (t, Ss, c) wthms usr_tac);
wenzelm@6379
   392
  in add_arity_thms (map prove cs) thy end;
wenzelm@6379
   393
skalberg@15531
   394
fun sane_inst_subclass prep sub tac = ext_inst_subclass prep sub [] [] (SOME tac);
skalberg@15531
   395
fun sane_inst_arity prep arity tac = ext_inst_arity prep arity [] [] (SOME tac);
wenzelm@6379
   396
wenzelm@11828
   397
val add_inst_subclass_x = ext_inst_subclass read_classrel;
wenzelm@11828
   398
val add_inst_subclass = sane_inst_subclass read_classrel;
wenzelm@11828
   399
val add_inst_subclass_i = sane_inst_subclass cert_classrel;
wenzelm@11828
   400
val add_inst_arity_x = ext_inst_arity read_arity;
wenzelm@11828
   401
val add_inst_arity = sane_inst_arity read_arity;
wenzelm@11828
   402
val add_inst_arity_i = sane_inst_arity cert_arity;
wenzelm@6379
   403
wenzelm@404
   404
wenzelm@404
   405
wenzelm@6379
   406
(** instance proof interfaces **)
wenzelm@6379
   407
wenzelm@14605
   408
fun inst_proof mk_prop add_thms inst int theory =
wenzelm@14605
   409
  theory
ballarin@15696
   410
  |> IsarThy.multi_theorem_i Drule.internalK I ProofContext.export_standard
wenzelm@14605
   411
    ("", [fn (thy, th) => (add_thms [th] thy, th)]) []
wenzelm@14605
   412
    (map (fn t => (("", []), [(t, ([], []))])) (mk_prop (Theory.sign_of theory) inst)) int;
wenzelm@6379
   413
wenzelm@14605
   414
val instance_subclass_proof =
wenzelm@14605
   415
  inst_proof (single oo (mk_classrel oo read_classrel)) add_classrel_thms;
wenzelm@14605
   416
val instance_subclass_proof_i =
wenzelm@14605
   417
  inst_proof (single oo (mk_classrel oo cert_classrel)) add_classrel_thms;
wenzelm@14605
   418
val instance_arity_proof = inst_proof (mk_arities oo read_arity) add_arity_thms;
wenzelm@14605
   419
val instance_arity_proof_i = inst_proof (mk_arities oo cert_arity) add_arity_thms;
wenzelm@6379
   420
wenzelm@6379
   421
wenzelm@6379
   422
wenzelm@6379
   423
(** package setup **)
wenzelm@6379
   424
wenzelm@6379
   425
(* setup theory *)
wenzelm@3949
   426
wenzelm@6379
   427
val setup =
wenzelm@6379
   428
 [AxclassesData.init,
wenzelm@10309
   429
  Method.add_methods [intro_classes_method, default_method]];
wenzelm@6379
   430
wenzelm@6379
   431
wenzelm@6379
   432
(* outer syntax *)
wenzelm@6379
   433
wenzelm@6719
   434
local structure P = OuterParse and K = OuterSyntax.Keyword in
wenzelm@3949
   435
wenzelm@6379
   436
val axclassP =
wenzelm@6719
   437
  OuterSyntax.command "axclass" "define axiomatic type class" K.thy_decl
wenzelm@12876
   438
    ((P.name -- Scan.optional ((P.$$$ "\\<subseteq>" || P.$$$ "<") |--
wenzelm@12876
   439
        P.!!! (P.list1 P.xname)) []) -- Scan.repeat P.spec_name
wenzelm@6379
   440
      >> (fn (cls, axs) => Toplevel.theory (#1 o add_axclass cls axs)));
wenzelm@6379
   441
wenzelm@6379
   442
val instanceP =
wenzelm@6719
   443
  OuterSyntax.command "instance" "prove type arity or subclass relation" K.thy_goal
wenzelm@12876
   444
    ((P.xname -- ((P.$$$ "\\<subseteq>" || P.$$$ "<") |-- P.xname) >> instance_subclass_proof ||
wenzelm@14605
   445
      (P.xname -- (P.$$$ "::" |-- P.arity) >> P.triple2) >> instance_arity_proof)
wenzelm@6379
   446
      >> (Toplevel.print oo Toplevel.theory_to_proof));
wenzelm@6379
   447
wenzelm@6379
   448
val _ = OuterSyntax.add_parsers [axclassP, instanceP];
wenzelm@6379
   449
wenzelm@6379
   450
end;
wenzelm@3949
   451
wenzelm@404
   452
end;
wenzelm@15705
   453