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