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