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