src/Pure/Isar/class_declaration.ML
author haftmann
Wed Sep 10 14:58:01 2014 +0200 (2014-09-10)
changeset 58293 1d0343818ec0
parent 57182 79d43c510b84
child 58294 7f990b3d5189
permissions -rw-r--r--
tuned
haftmann@38379
     1
(*  Title:      Pure/Isar/class_declaration.ML
haftmann@24218
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@24218
     3
haftmann@38379
     4
Declaring classes and subclass relations.
haftmann@24218
     5
*)
haftmann@24218
     6
haftmann@38379
     7
signature CLASS_DECLARATION =
haftmann@24218
     8
sig
haftmann@57181
     9
  val class: binding -> class list ->
wenzelm@41585
    10
    Element.context_i list -> theory -> string * local_theory
haftmann@57181
    11
  val class_cmd: binding -> xstring list ->
wenzelm@41585
    12
    Element.context list -> theory -> string * local_theory
haftmann@57181
    13
  val prove_subclass: tactic -> class ->
wenzelm@41585
    14
    local_theory -> local_theory
haftmann@57181
    15
  val subclass: class -> local_theory -> Proof.state
haftmann@57181
    16
  val subclass_cmd: xstring -> local_theory -> Proof.state
haftmann@24218
    17
end;
haftmann@24218
    18
haftmann@38379
    19
structure Class_Declaration: CLASS_DECLARATION =
haftmann@24218
    20
struct
haftmann@24218
    21
haftmann@29665
    22
(** class definitions **)
haftmann@24218
    23
haftmann@24218
    24
local
haftmann@24218
    25
haftmann@29665
    26
(* calculating class-related rules including canonical interpretation *)
haftmann@29665
    27
haftmann@29547
    28
fun calculate thy class sups base_sort param_map assm_axiom =
haftmann@29547
    29
  let
wenzelm@42360
    30
    val empty_ctxt = Proof_Context.init_global thy;
haftmann@29547
    31
haftmann@29547
    32
    (* instantiation of canonical interpretation *)
haftmann@29575
    33
    val aT = TFree (Name.aT, base_sort);
haftmann@29627
    34
    val param_map_const = (map o apsnd) Const param_map;
haftmann@29627
    35
    val param_map_inst = (map o apsnd)
haftmann@29627
    36
      (Const o apsnd (map_atyps (K aT))) param_map;
haftmann@29627
    37
    val const_morph = Element.inst_morphism thy
haftmann@29627
    38
      (Symtab.empty, Symtab.make param_map_inst);
haftmann@29797
    39
    val typ_morph = Element.inst_morphism thy
haftmann@29797
    40
      (Symtab.empty |> Symtab.update (Name.aT, TFree (Name.aT, [class])), Symtab.empty);
haftmann@29797
    41
    val (([raw_props], [(_, raw_inst_morph)], export_morph), _) = empty_ctxt
haftmann@29547
    42
      |> Expression.cert_goal_expression ([(class, (("", false),
haftmann@29627
    43
           Expression.Named param_map_const))], []);
wenzelm@45431
    44
    val (props, inst_morph) =
wenzelm@45431
    45
      if null param_map
haftmann@29797
    46
      then (raw_props |> map (Morphism.term typ_morph),
haftmann@29797
    47
        raw_inst_morph $> typ_morph)
haftmann@29797
    48
      else (raw_props, raw_inst_morph); (*FIXME proper handling in
haftmann@29797
    49
        locale.ML / expression.ML would be desirable*)
haftmann@29547
    50
haftmann@29547
    51
    (* witness for canonical interpretation *)
haftmann@52636
    52
    val some_prop = try the_single props;
haftmann@52636
    53
    val some_witn = Option.map (fn prop =>
wenzelm@45431
    54
      let
haftmann@38379
    55
        val sup_axioms = map_filter (fst o Class.rules thy) sups;
wenzelm@45431
    56
        val loc_intro_tac =
wenzelm@45431
    57
          (case Locale.intros_of thy class of
wenzelm@45431
    58
            (_, NONE) => all_tac
wenzelm@52732
    59
          | (_, SOME intro) => ALLGOALS (rtac intro));
haftmann@29547
    60
        val tac = loc_intro_tac
wenzelm@54742
    61
          THEN ALLGOALS (Proof_Context.fact_tac empty_ctxt (sup_axioms @ the_list assm_axiom));
haftmann@52636
    62
      in Element.prove_witness empty_ctxt prop tac end) some_prop;
wenzelm@54883
    63
    val some_axiom = Option.map (Element.conclude_witness empty_ctxt) some_witn;
haftmann@29547
    64
haftmann@29547
    65
    (* canonical interpretation *)
haftmann@29547
    66
    val base_morph = inst_morph
wenzelm@54740
    67
      $> Morphism.binding_morphism "class_binding" (Binding.prefix false (Class.class_prefix class))
haftmann@52636
    68
      $> Element.satisfy_morphism (the_list some_witn);
haftmann@38379
    69
    val eq_morph = Element.eq_morphism thy (Class.these_defs thy sups);
haftmann@29547
    70
haftmann@29547
    71
    (* assm_intro *)
wenzelm@30344
    72
    fun prove_assm_intro thm =
haftmann@29547
    73
      let
wenzelm@31794
    74
        val ((_, [thm']), _) = Variable.import true [thm] empty_ctxt;
wenzelm@45431
    75
        val const_eq_morph =
wenzelm@45431
    76
          (case eq_morph of
wenzelm@46856
    77
            SOME eq_morph => const_morph $> eq_morph
wenzelm@45431
    78
          | NONE => const_morph);
haftmann@36674
    79
        val thm'' = Morphism.thm const_eq_morph thm';
wenzelm@54742
    80
      in
wenzelm@54742
    81
        Goal.prove_sorry_global thy [] [] (Thm.prop_of thm'')
wenzelm@54742
    82
          (fn {context = ctxt, ...} => ALLGOALS (Proof_Context.fact_tac ctxt [thm'']))
wenzelm@54742
    83
      end;
haftmann@52636
    84
    val some_assm_intro = Option.map prove_assm_intro (fst (Locale.intros_of thy class));
haftmann@29547
    85
haftmann@29547
    86
    (* of_class *)
wenzelm@31943
    87
    val of_class_prop_concl = Logic.mk_of_class (aT, class);
wenzelm@45431
    88
    val of_class_prop =
haftmann@52636
    89
      (case some_prop of
wenzelm@45431
    90
        NONE => of_class_prop_concl
haftmann@29627
    91
      | SOME prop => Logic.mk_implies (Morphism.term const_morph
wenzelm@45431
    92
          ((map_types o map_atyps) (K aT) prop), of_class_prop_concl));
haftmann@38379
    93
    val sup_of_classes = map (snd o Class.rules thy) sups;
wenzelm@35021
    94
    val loc_axiom_intros = map Drule.export_without_context_open (Locale.axioms_of thy class);
wenzelm@51685
    95
    val axclass_intro = #intro (Axclass.get_info thy class);
wenzelm@31944
    96
    val base_sort_trivs = Thm.of_sort (Thm.ctyp_of thy aT, base_sort);
wenzelm@45431
    97
    val tac =
wenzelm@45431
    98
      REPEAT (SOMEGOAL
wenzelm@52732
    99
        (match_tac (axclass_intro :: sup_of_classes @ loc_axiom_intros @ base_sort_trivs)
wenzelm@52732
   100
          ORELSE' assume_tac));
wenzelm@51551
   101
    val of_class = Goal.prove_sorry_global thy [] [] of_class_prop (K tac);
haftmann@29547
   102
haftmann@52636
   103
  in (base_morph, eq_morph, export_morph, some_axiom, some_assm_intro, of_class) end;
haftmann@29547
   104
haftmann@29632
   105
haftmann@29665
   106
(* reading and processing class specifications *)
haftmann@29665
   107
haftmann@36460
   108
fun prep_class_elems prep_decl thy sups raw_elems =
haftmann@29632
   109
  let
haftmann@29665
   110
haftmann@29665
   111
    (* user space type system: only permits 'a type variable, improves towards 'a *)
haftmann@36460
   112
    val algebra = Sign.classes_of thy;
haftmann@36460
   113
    val inter_sort = curry (Sorts.inter_sort algebra);
wenzelm@45421
   114
    val proto_base_sort =
wenzelm@45421
   115
      if null sups then Sign.defaultS thy
haftmann@38379
   116
      else fold inter_sort (map (Class.base_sort thy) sups) [];
haftmann@29665
   117
    val base_constraints = (map o apsnd)
haftmann@29665
   118
      (map_type_tfree (K (TVar ((Name.aT, 0), proto_base_sort))) o fst o snd)
haftmann@38379
   119
        (Class.these_operations thy sups);
haftmann@58293
   120
    fun singleton_fixate Ts =
haftmann@29665
   121
      let
haftmann@58293
   122
        val tfrees = fold Term.add_tfreesT Ts [];
wenzelm@45433
   123
        val inferred_sort =
haftmann@58293
   124
          (fold o fold_atyps) (fn TVar (_, S) => inter_sort S | _ => I) Ts [];
wenzelm@45421
   125
        val fixate_sort =
wenzelm@45432
   126
          (case tfrees of
wenzelm@45432
   127
            [] => inferred_sort
wenzelm@45433
   128
          | [(a, S)] =>
wenzelm@45433
   129
              if a <> Name.aT then
wenzelm@45433
   130
                error ("No type variable other than " ^ Name.aT ^ " allowed in class specification")
wenzelm@45433
   131
              else if Sorts.sort_le algebra (S, inferred_sort) then S
wenzelm@45432
   132
              else
wenzelm@45432
   133
                error ("Type inference imposes additional sort constraint " ^
wenzelm@45432
   134
                  Syntax.string_of_sort_global thy inferred_sort ^
wenzelm@45432
   135
                  " of type parameter " ^ Name.aT ^ " of sort " ^
wenzelm@45432
   136
                  Syntax.string_of_sort_global thy S)
wenzelm@45432
   137
          | _ => error "Multiple type variables in class specification");
wenzelm@45432
   138
        val fixateT = TFree (Name.aT, fixate_sort);
wenzelm@45432
   139
      in
haftmann@58293
   140
        (map o map_atyps)
haftmann@58293
   141
          (fn T as TVar (xi, _) => if Type_Infer.is_param xi then fixateT else T | T => T) Ts
wenzelm@45432
   142
      end;
haftmann@58293
   143
    fun after_infer_fixate Ts =
haftmann@40188
   144
      let
wenzelm@45432
   145
        val fixate_sort =
haftmann@58293
   146
          (fold o fold_atyps)
haftmann@58293
   147
            (fn TVar (xi, S) => if Type_Infer.is_param xi then inter_sort S else I | _ => I) Ts [];
haftmann@40188
   148
      in
haftmann@58293
   149
        (map o map_atyps)
wenzelm@45431
   150
          (fn T as TVar (xi, _) =>
wenzelm@45432
   151
              if Type_Infer.is_param xi then Type_Infer.param 0 (Name.aT, fixate_sort) else T
haftmann@58293
   152
            | T => T) Ts
haftmann@40188
   153
      end;
haftmann@58293
   154
    fun lift_check f _ ts = burrow_types f ts;
haftmann@29632
   155
haftmann@35120
   156
    (* preprocessing elements, retrieving base sort from type-checked elements *)
wenzelm@42402
   157
    val raw_supexpr =
wenzelm@42402
   158
      (map (fn sup => (sup, (("", false), Expression.Positional []))) sups, []);
wenzelm@42402
   159
    val init_class_body =
wenzelm@42402
   160
      fold (Proof_Context.add_const_constraint o apsnd SOME) base_constraints
haftmann@38379
   161
      #> Class.redeclare_operations thy sups
haftmann@58293
   162
      #> Context.proof_map (Syntax_Phases.term_check 0 "singleton_fixate" (lift_check singleton_fixate));
wenzelm@47311
   163
    val ((raw_supparams, _, raw_inferred_elems, _), _) =
wenzelm@42402
   164
      Proof_Context.init_global thy
haftmann@58293
   165
      |> Context.proof_map (Syntax_Phases.term_check 0 "after_infer_fixate" (lift_check after_infer_fixate))
haftmann@32206
   166
      |> prep_decl raw_supexpr init_class_body raw_elems;
haftmann@38435
   167
    fun filter_element (Element.Fixes []) = NONE
haftmann@38435
   168
      | filter_element (e as Element.Fixes _) = SOME e
haftmann@38435
   169
      | filter_element (Element.Constrains []) = NONE
haftmann@38435
   170
      | filter_element (e as Element.Constrains _) = SOME e
haftmann@38435
   171
      | filter_element (Element.Assumes []) = NONE
haftmann@38435
   172
      | filter_element (e as Element.Assumes _) = SOME e
wenzelm@45421
   173
      | filter_element (Element.Defines _) =
wenzelm@45421
   174
          error ("\"defines\" element not allowed in class specification.")
wenzelm@45421
   175
      | filter_element (Element.Notes _) =
wenzelm@45421
   176
          error ("\"notes\" element not allowed in class specification.");
haftmann@38435
   177
    val inferred_elems = map_filter filter_element raw_inferred_elems;
haftmann@29665
   178
    fun fold_element_types f (Element.Fixes fxs) = fold (fn (_, SOME T, _) => f T) fxs
haftmann@29665
   179
      | fold_element_types f (Element.Constrains cnstrs) = fold (f o snd) cnstrs
haftmann@29665
   180
      | fold_element_types f (Element.Assumes assms) = fold (fold (fn (t, ts) =>
wenzelm@42402
   181
          fold_types f t #> (fold o fold_types) f ts) o snd) assms;
wenzelm@45421
   182
    val base_sort =
wenzelm@45421
   183
      if null inferred_elems then proto_base_sort
wenzelm@45421
   184
      else
wenzelm@45421
   185
        (case (fold o fold_element_types) Term.add_tfreesT inferred_elems [] of
wenzelm@45421
   186
          [] => error "No type variable in class specification"
haftmann@29665
   187
        | [(_, sort)] => sort
wenzelm@45421
   188
        | _ => error "Multiple type variables in class specification");
haftmann@32206
   189
    val supparams = map (fn ((c, T), _) =>
haftmann@32206
   190
      (c, map_atyps (K (TFree (Name.aT, base_sort))) T)) raw_supparams;
haftmann@32206
   191
    val supparam_names = map fst supparams;
haftmann@32206
   192
    fun mk_param ((c, _), _) = Free (c, (the o AList.lookup (op =) supparams) c);
haftmann@32206
   193
    val supexpr = (map (fn sup => (sup, (("", false),
haftmann@32206
   194
      Expression.Positional (map (SOME o mk_param) (Locale.params_of thy sup))))) sups,
haftmann@32206
   195
        map (fn (c, T) => (Binding.name c, SOME T, NoSyn)) supparams);
haftmann@29575
   196
haftmann@32206
   197
  in (base_sort, supparam_names, supexpr, inferred_elems) end;
haftmann@29575
   198
haftmann@29665
   199
val cert_class_elems = prep_class_elems Expression.cert_declaration;
haftmann@29665
   200
val read_class_elems = prep_class_elems Expression.cert_read_declaration;
haftmann@29575
   201
haftmann@29665
   202
fun prep_class_spec prep_class prep_class_elems thy raw_supclasses raw_elems =
haftmann@29575
   203
  let
wenzelm@46922
   204
    val thy_ctxt = Proof_Context.init_global thy;
haftmann@29665
   205
haftmann@29575
   206
    (* prepare import *)
haftmann@29575
   207
    val inter_sort = curry (Sorts.inter_sort (Sign.classes_of thy));
wenzelm@46922
   208
    val sups = Sign.minimize_sort thy (map (prep_class thy_ctxt) raw_supclasses);
wenzelm@45431
   209
    val _ =
wenzelm@45431
   210
      (case filter_out (Class.is_class thy) sups of
wenzelm@45431
   211
        [] => ()
wenzelm@45431
   212
      | no_classes => error ("No (proper) classes: " ^ commas_quote no_classes));
haftmann@38379
   213
    val raw_supparams = (map o apsnd) (snd o snd) (Class.these_params thy sups);
haftmann@32206
   214
    val raw_supparam_names = map fst raw_supparams;
wenzelm@45431
   215
    val _ =
wenzelm@45431
   216
      if has_duplicates (op =) raw_supparam_names then
wenzelm@45431
   217
        error ("Duplicate parameter(s) in superclasses: " ^
wenzelm@45431
   218
          (commas_quote (duplicates (op =) raw_supparam_names)))
haftmann@29575
   219
      else ();
haftmann@29575
   220
haftmann@29575
   221
    (* infer types and base sort *)
wenzelm@45431
   222
    val (base_sort, supparam_names, supexpr, inferred_elems) = prep_class_elems thy sups raw_elems;
haftmann@32206
   223
    val sup_sort = inter_sort base_sort sups;
haftmann@29575
   224
haftmann@29575
   225
    (* process elements as class specification *)
wenzelm@46922
   226
    val class_ctxt = Class.begin sups base_sort thy_ctxt;
wenzelm@47311
   227
    val ((_, _, syntax_elems, _), _) = class_ctxt
haftmann@29702
   228
      |> Expression.cert_declaration supexpr I inferred_elems;
wenzelm@45431
   229
    fun check_vars e vs =
wenzelm@45431
   230
      if null vs then
wenzelm@45431
   231
        error ("No type variable in part of specification element " ^
wenzelm@45431
   232
          Pretty.string_of (Pretty.chunks (Element.pretty_ctxt class_ctxt e)))
haftmann@29665
   233
      else ();
haftmann@29665
   234
    fun check_element (e as Element.Fixes fxs) =
wenzelm@45431
   235
          List.app (fn (_, SOME T, _) => check_vars e (Term.add_tfreesT T [])) fxs
haftmann@29665
   236
      | check_element (e as Element.Assumes assms) =
wenzelm@45431
   237
          List.app (fn (_, ts_pss) =>
wenzelm@45431
   238
            List.app (fn (t, _) => check_vars e (Term.add_tfrees t [])) ts_pss) assms
wenzelm@45431
   239
      | check_element _ = ();
wenzelm@45431
   240
    val _ = List.app check_element syntax_elems;
haftmann@29665
   241
    fun fork_syn (Element.Fixes xs) =
wenzelm@30344
   242
          fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs
haftmann@29665
   243
          #>> Element.Fixes
haftmann@29665
   244
      | fork_syn x = pair x;
haftmann@29575
   245
    val (elems, global_syntax) = fold_map fork_syn syntax_elems [];
haftmann@29665
   246
haftmann@32713
   247
  in (((sups, supparam_names), (sup_sort, base_sort, supexpr)), (elems, global_syntax)) end;
haftmann@29575
   248
haftmann@29665
   249
val cert_class_spec = prep_class_spec (K I) cert_class_elems;
wenzelm@46922
   250
val read_class_spec = prep_class_spec Proof_Context.read_class read_class_elems;
haftmann@29665
   251
haftmann@29665
   252
haftmann@29665
   253
(* class establishment *)
haftmann@29575
   254
haftmann@32206
   255
fun add_consts class base_sort sups supparam_names global_syntax thy =
wenzelm@24968
   256
  let
haftmann@29816
   257
    (*FIXME simplify*)
haftmann@32206
   258
    val supconsts = supparam_names
haftmann@38379
   259
      |> AList.make (snd o the o AList.lookup (op =) (Class.these_params thy sups))
haftmann@25683
   260
      |> (map o apsnd o apsnd o map_atyps o K o TFree) (Name.aT, [class]);
haftmann@29509
   261
    val all_params = Locale.params_of thy class;
haftmann@32206
   262
    val raw_params = (snd o chop (length supparam_names)) all_params;
wenzelm@30755
   263
    fun add_const ((raw_c, raw_ty), _) thy =
haftmann@25683
   264
      let
wenzelm@30755
   265
        val b = Binding.name raw_c;
wenzelm@30344
   266
        val c = Sign.full_name thy b;
haftmann@25683
   267
        val ty = map_atyps (K (TFree (Name.aT, base_sort))) raw_ty;
haftmann@25683
   268
        val ty0 = Type.strip_sorts ty;
haftmann@25683
   269
        val ty' = map_atyps (K (TFree (Name.aT, [class]))) ty0;
wenzelm@30344
   270
        val syn = (the_default NoSyn o AList.lookup Binding.eq_name global_syntax) b;
haftmann@25683
   271
      in
haftmann@25683
   272
        thy
wenzelm@42375
   273
        |> Sign.declare_const_global ((b, ty0), syn)
haftmann@25683
   274
        |> snd
wenzelm@42494
   275
        |> pair ((Variable.check_name b, ty), (c, ty'))
haftmann@25683
   276
      end;
haftmann@28715
   277
  in
haftmann@28715
   278
    thy
haftmann@38379
   279
    |> Sign.add_path (Class.class_prefix class)
haftmann@28715
   280
    |> fold_map add_const raw_params
haftmann@28715
   281
    ||> Sign.restore_naming thy
haftmann@28715
   282
    |-> (fn params => pair (supconsts @ (map o apfst) fst params, params))
haftmann@28715
   283
  end;
haftmann@28715
   284
haftmann@32206
   285
fun adjungate_axclass bname class base_sort sups supsort supparam_names global_syntax thy =
haftmann@28715
   286
  let
haftmann@29816
   287
    (*FIXME simplify*)
haftmann@25683
   288
    fun globalize param_map = map_aterms
haftmann@25683
   289
      (fn Free (v, ty) => Const ((fst o the o AList.lookup (op =) param_map) v, ty)
haftmann@25683
   290
        | t => t);
haftmann@29509
   291
    val raw_pred = Locale.intros_of thy class
haftmann@25683
   292
      |> fst
wenzelm@35845
   293
      |> Option.map (Logic.unvarify_global o Logic.strip_imp_concl o Thm.prop_of);
wenzelm@45431
   294
    fun get_axiom thy =
wenzelm@51685
   295
      (case #axioms (Axclass.get_info thy class) of
wenzelm@45431
   296
         [] => NONE
wenzelm@45431
   297
      | [thm] => SOME thm);
wenzelm@24968
   298
  in
wenzelm@24968
   299
    thy
haftmann@32206
   300
    |> add_consts class base_sort sups supparam_names global_syntax
wenzelm@51685
   301
    |-> (fn (param_map, params) => Axclass.define_class (bname, supsort)
haftmann@26518
   302
          (map (fst o snd) params)
wenzelm@30211
   303
          [(Thm.empty_binding, Option.map (globalize param_map) raw_pred |> the_list)]
haftmann@25683
   304
    #> snd
haftmann@25683
   305
    #> `get_axiom
haftmann@25683
   306
    #-> (fn assm_axiom => fold (Sign.add_const_constraint o apsnd SOME o snd) params
haftmann@29526
   307
    #> pair (param_map, params, assm_axiom)))
wenzelm@24968
   308
  end;
wenzelm@24968
   309
haftmann@57181
   310
fun gen_class prep_class_spec b raw_supclasses raw_elems thy =
haftmann@24748
   311
  let
haftmann@36635
   312
    val class = Sign.full_name thy b;
haftmann@56921
   313
    val prefix = Binding.qualify true "class";
haftmann@32206
   314
    val (((sups, supparam_names), (supsort, base_sort, supexpr)), (elems, global_syntax)) =
haftmann@32206
   315
      prep_class_spec thy raw_supclasses raw_elems;
haftmann@24218
   316
  in
haftmann@24218
   317
    thy
haftmann@57181
   318
    |> Expression.add_locale b (prefix b) supexpr elems
wenzelm@33671
   319
    |> snd |> Local_Theory.exit_global
haftmann@36635
   320
    |> adjungate_axclass b class base_sort sups supsort supparam_names global_syntax
haftmann@29526
   321
    |-> (fn (param_map, params, assm_axiom) =>
haftmann@29547
   322
       `(fn thy => calculate thy class sups base_sort param_map assm_axiom)
haftmann@52636
   323
    #-> (fn (base_morph, eq_morph, export_morph, some_axiom, some_assm_intro, of_class) =>
ballarin@38107
   324
       Context.theory_map (Locale.add_registration (class, base_morph)
ballarin@38107
   325
         (Option.map (rpair true) eq_morph) export_morph)
haftmann@56921
   326
    #> Class.register class sups params base_sort base_morph export_morph some_axiom some_assm_intro of_class
haftmann@56921
   327
    #> Global_Theory.store_thm (prefix (Binding.qualified_name (class ^ ".of_class.intro")), of_class)))
haftmann@56921
   328
    |> snd
haftmann@57181
   329
    |> Named_Target.init class
haftmann@25038
   330
    |> pair class
haftmann@24218
   331
  end;
haftmann@24218
   332
haftmann@24218
   333
in
haftmann@24218
   334
haftmann@29509
   335
val class = gen_class cert_class_spec;
haftmann@26518
   336
val class_cmd = gen_class read_class_spec;
haftmann@24218
   337
haftmann@24218
   338
end; (*local*)
haftmann@24218
   339
haftmann@24218
   340
wenzelm@45421
   341
haftmann@29358
   342
(** subclass relations **)
haftmann@25462
   343
haftmann@29358
   344
local
haftmann@25462
   345
haftmann@57181
   346
fun gen_subclass prep_class do_proof raw_sup lthy =
haftmann@25462
   347
  let
wenzelm@42360
   348
    val thy = Proof_Context.theory_of lthy;
haftmann@29558
   349
    val proto_sup = prep_class thy raw_sup;
haftmann@57182
   350
    val proto_sub = case Named_Target.class_of lthy of
haftmann@57182
   351
        SOME class => class
haftmann@57182
   352
      | NONE => error "Not in a class target";
wenzelm@51685
   353
    val (sub, sup) = Axclass.cert_classrel thy (proto_sub, proto_sup);
haftmann@29509
   354
haftmann@29509
   355
    val expr = ([(sup, (("", false), Expression.Positional []))], []);
haftmann@29558
   356
    val (([props], deps, export), goal_ctxt) =
haftmann@29509
   357
      Expression.cert_goal_expression expr lthy;
haftmann@29526
   358
    val some_prop = try the_single props;
haftmann@29558
   359
    val some_dep_morph = try the_single (map snd deps);
haftmann@29558
   360
    fun after_qed some_wit =
haftmann@54866
   361
      Class.register_subclass (sub, sup) some_dep_morph some_wit export;
haftmann@29558
   362
  in do_proof after_qed some_prop goal_ctxt end;
haftmann@25485
   363
haftmann@29575
   364
fun user_proof after_qed some_prop =
haftmann@29575
   365
  Element.witness_proof (after_qed o try the_single o the_single)
haftmann@29575
   366
    [the_list some_prop];
haftmann@25485
   367
haftmann@29575
   368
fun tactic_proof tac after_qed some_prop ctxt =
haftmann@29575
   369
  after_qed (Option.map
haftmann@29575
   370
    (fn prop => Element.prove_witness ctxt prop tac) some_prop) ctxt;
haftmann@28666
   371
haftmann@29358
   372
in
haftmann@28666
   373
haftmann@57181
   374
fun prove_subclass tac = gen_subclass (K I) (tactic_proof tac);
wenzelm@54882
   375
wenzelm@54882
   376
fun subclass x = gen_subclass (K I) user_proof x;
wenzelm@54882
   377
fun subclass_cmd x =
wenzelm@54882
   378
  gen_subclass (Proof_Context.read_class o Proof_Context.init_global) user_proof x;
haftmann@25462
   379
haftmann@29358
   380
end; (*local*)
haftmann@29358
   381
haftmann@24218
   382
end;