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