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