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