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