src/Pure/Isar/class_target.ML
author haftmann
Wed Jan 21 23:40:23 2009 +0100 (2009-01-21 ago)
changeset 29610 83d282f12352
parent 29577 08f783c5fcf0
child 29632 c3d576157244
permissions -rw-r--r--
allow empty class specs
haftmann@29358
     1
(*  Title:      Pure/Isar/class_target.ML
haftmann@24218
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@24218
     3
haftmann@29358
     4
Type classes derived from primitive axclasses and locales - mechanisms.
haftmann@24218
     5
*)
haftmann@24218
     6
haftmann@29358
     7
signature CLASS_TARGET =
haftmann@24218
     8
sig
haftmann@25462
     9
  (*classes*)
haftmann@29358
    10
  val register: class -> class list -> ((string * typ) * (string * typ)) list
haftmann@29526
    11
    -> sort -> morphism -> thm option -> thm option -> thm
haftmann@29526
    12
    -> theory -> theory
haftmann@29558
    13
  val register_subclass: class * class -> morphism option -> Element.witness option
haftmann@29558
    14
    -> morphism -> theory -> theory
haftmann@25485
    15
haftmann@29526
    16
  val is_class: theory -> class -> bool
haftmann@29526
    17
  val base_sort: theory -> class -> sort
haftmann@29526
    18
  val rules: theory -> class -> thm option * thm
haftmann@29526
    19
  val these_params: theory -> sort -> (string * (class * (string * typ))) list
haftmann@29526
    20
  val these_defs: theory -> sort -> thm list
haftmann@29577
    21
  val these_operations: theory -> sort -> (string * (class * (typ * term))) list
haftmann@29526
    22
  val print_classes: theory -> unit
haftmann@29526
    23
haftmann@29358
    24
  val begin: class list -> sort -> Proof.context -> Proof.context
haftmann@25311
    25
  val init: class -> theory -> Proof.context
wenzelm@28017
    26
  val declare: class -> Properties.T
haftmann@27690
    27
    -> (string * mixfix) * term -> theory -> theory
wenzelm@28017
    28
  val abbrev: class -> Syntax.mode -> Properties.T
wenzelm@25104
    29
    -> (string * mixfix) * term -> theory -> theory
haftmann@29526
    30
  val class_prefix: string -> string
haftmann@25083
    31
  val refresh_syntax: class -> Proof.context -> Proof.context
haftmann@25485
    32
haftmann@25462
    33
  (*instances*)
haftmann@26247
    34
  val init_instantiation: string list * (string * sort) list * sort
haftmann@26247
    35
    -> theory -> local_theory
haftmann@26247
    36
  val instantiation_instance: (local_theory -> local_theory)
haftmann@26247
    37
    -> local_theory -> Proof.state
haftmann@26247
    38
  val prove_instantiation_instance: (Proof.context -> tactic)
haftmann@26247
    39
    -> local_theory -> local_theory
haftmann@28666
    40
  val prove_instantiation_exit: (Proof.context -> tactic)
haftmann@28666
    41
    -> local_theory -> theory
haftmann@28666
    42
  val prove_instantiation_exit_result: (morphism -> 'a -> 'b)
haftmann@28666
    43
    -> (Proof.context -> 'b -> tactic) -> 'a -> local_theory -> 'b * theory
haftmann@25485
    44
  val conclude_instantiation: local_theory -> local_theory
haftmann@25603
    45
  val instantiation_param: local_theory -> string -> string option
haftmann@25485
    46
  val confirm_declaration: string -> local_theory -> local_theory
haftmann@25603
    47
  val pretty_instantiation: local_theory -> Pretty.T
haftmann@26259
    48
  val type_name: string -> string
haftmann@25485
    49
haftmann@29526
    50
  val intro_classes_tac: thm list -> tactic
haftmann@29526
    51
  val default_intro_tac: Proof.context -> thm list -> tactic
haftmann@29526
    52
haftmann@25462
    53
  (*old axclass layer*)
haftmann@25462
    54
  val axclass_cmd: bstring * xstring list
wenzelm@28084
    55
    -> (Attrib.binding * string list) list
haftmann@25462
    56
    -> theory -> class * theory
haftmann@25462
    57
  val classrel_cmd: xstring * xstring -> theory -> Proof.state
haftmann@25536
    58
  val instance_arity: (theory -> theory) -> arity -> theory -> Proof.state
haftmann@25536
    59
  val instance_arity_cmd: bstring * xstring list * xstring -> theory -> Proof.state
haftmann@24218
    60
end;
haftmann@24218
    61
haftmann@29358
    62
structure Class_Target : CLASS_TARGET =
haftmann@24218
    63
struct
haftmann@24218
    64
haftmann@25485
    65
(** primitive axclass and instance commands **)
haftmann@24589
    66
haftmann@24218
    67
fun axclass_cmd (class, raw_superclasses) raw_specs thy =
haftmann@24218
    68
  let
haftmann@24218
    69
    val ctxt = ProofContext.init thy;
haftmann@24218
    70
    val superclasses = map (Sign.read_class thy) raw_superclasses;
haftmann@24589
    71
    val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst)
haftmann@24589
    72
      raw_specs;
haftmann@24589
    73
    val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd)
haftmann@24589
    74
          raw_specs)
haftmann@24218
    75
      |> snd
haftmann@24218
    76
      |> (map o map) fst;
haftmann@24589
    77
  in
haftmann@24589
    78
    AxClass.define_class (class, superclasses) []
haftmann@24589
    79
      (name_atts ~~ axiomss) thy
haftmann@24589
    80
  end;
haftmann@24218
    81
haftmann@24218
    82
local
haftmann@24218
    83
haftmann@24218
    84
fun gen_instance mk_prop add_thm after_qed insts thy =
haftmann@24218
    85
  let
haftmann@24218
    86
    fun after_qed' results =
haftmann@24218
    87
      ProofContext.theory ((fold o fold) add_thm results #> after_qed);
haftmann@24218
    88
  in
haftmann@24218
    89
    thy
haftmann@24218
    90
    |> ProofContext.init
haftmann@24589
    91
    |> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])])
haftmann@25536
    92
        o mk_prop thy) insts)
haftmann@24218
    93
  end;
haftmann@24218
    94
haftmann@24218
    95
in
haftmann@24218
    96
haftmann@24589
    97
val instance_arity =
haftmann@24218
    98
  gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity;
haftmann@25502
    99
val instance_arity_cmd =
haftmann@25502
   100
  gen_instance (Logic.mk_arities oo Sign.read_arity) AxClass.add_arity I;
haftmann@24589
   101
val classrel =
haftmann@25536
   102
  gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) AxClass.add_classrel I;
haftmann@24589
   103
val classrel_cmd =
haftmann@25536
   104
  gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) AxClass.add_classrel I;
haftmann@24218
   105
haftmann@24218
   106
end; (*local*)
haftmann@24218
   107
haftmann@24218
   108
haftmann@24589
   109
(** class data **)
haftmann@24218
   110
haftmann@24218
   111
datatype class_data = ClassData of {
haftmann@28715
   112
haftmann@28715
   113
  (* static part *)
haftmann@24218
   114
  consts: (string * string) list
haftmann@24836
   115
    (*locale parameter ~> constant name*),
haftmann@25062
   116
  base_sort: sort,
haftmann@29545
   117
  base_morph: morphism
haftmann@29439
   118
    (*static part of canonical morphism*),
haftmann@25618
   119
  assm_intro: thm option,
haftmann@25618
   120
  of_class: thm,
haftmann@25618
   121
  axiom: thm option,
haftmann@28715
   122
  
haftmann@28715
   123
  (* dynamic part *)
haftmann@24657
   124
  defs: thm list,
haftmann@25368
   125
  operations: (string * (class * (typ * term))) list
haftmann@28715
   126
haftmann@24657
   127
};
haftmann@24218
   128
haftmann@29526
   129
fun rep_class_data (ClassData data) = data;
haftmann@29526
   130
fun mk_class_data ((consts, base_sort, base_morph, assm_intro, of_class, axiom),
haftmann@25368
   131
    (defs, operations)) =
haftmann@29526
   132
  ClassData { consts = consts, base_sort = base_sort,
haftmann@29439
   133
    base_morph = base_morph, assm_intro = assm_intro, of_class = of_class, axiom = axiom,
haftmann@25618
   134
    defs = defs, operations = operations };
haftmann@29526
   135
fun map_class_data f (ClassData { consts, base_sort, base_morph, assm_intro,
haftmann@28715
   136
    of_class, axiom, defs, operations }) =
haftmann@29526
   137
  mk_class_data (f ((consts, base_sort, base_morph, assm_intro, of_class, axiom),
haftmann@25368
   138
    (defs, operations)));
haftmann@25038
   139
fun merge_class_data _ (ClassData { consts = consts,
haftmann@29526
   140
    base_sort = base_sort, base_morph = base_morph, assm_intro = assm_intro,
haftmann@25618
   141
    of_class = of_class, axiom = axiom, defs = defs1, operations = operations1 },
haftmann@29526
   142
  ClassData { consts = _, base_sort = _, base_morph = _, assm_intro = _,
haftmann@25618
   143
    of_class = _, axiom = _, defs = defs2, operations = operations2 }) =
haftmann@29526
   144
  mk_class_data ((consts, base_sort, base_morph, assm_intro, of_class, axiom),
haftmann@24914
   145
    (Thm.merge_thms (defs1, defs2),
haftmann@25368
   146
      AList.merge (op =) (K true) (operations1, operations2)));
haftmann@24218
   147
haftmann@24218
   148
structure ClassData = TheoryDataFun
haftmann@24218
   149
(
haftmann@25038
   150
  type T = class_data Graph.T
haftmann@25038
   151
  val empty = Graph.empty;
haftmann@24218
   152
  val copy = I;
haftmann@24218
   153
  val extend = I;
haftmann@25038
   154
  fun merge _ = Graph.join merge_class_data;
haftmann@24218
   155
);
haftmann@24218
   156
haftmann@24218
   157
haftmann@24218
   158
(* queries *)
haftmann@24218
   159
haftmann@25038
   160
val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node o ClassData.get;
haftmann@24218
   161
haftmann@24589
   162
fun the_class_data thy class = case lookup_class_data thy class
wenzelm@25020
   163
 of NONE => error ("Undeclared class " ^ quote class)
haftmann@24589
   164
  | SOME data => data;
haftmann@24218
   165
haftmann@25038
   166
val is_class = is_some oo lookup_class_data;
haftmann@25038
   167
haftmann@25038
   168
val ancestry = Graph.all_succs o ClassData.get;
haftmann@29509
   169
val heritage = Graph.all_preds o ClassData.get;
haftmann@29509
   170
haftmann@25002
   171
fun these_params thy =
haftmann@24218
   172
  let
haftmann@24218
   173
    fun params class =
haftmann@24218
   174
      let
wenzelm@24930
   175
        val const_typs = (#params o AxClass.get_info thy) class;
haftmann@24657
   176
        val const_names = (#consts o the_class_data thy) class;
haftmann@24218
   177
      in
haftmann@26518
   178
        (map o apsnd)
haftmann@26518
   179
          (fn c => (class, (c, (the o AList.lookup (op =) const_typs) c))) const_names
haftmann@24218
   180
      end;
haftmann@24218
   181
  in maps params o ancestry thy end;
haftmann@24218
   182
haftmann@29526
   183
val base_sort = #base_sort oo the_class_data;
haftmann@29526
   184
haftmann@29526
   185
fun rules thy class =
haftmann@29526
   186
  let val { axiom, of_class, ... } = the_class_data thy class
haftmann@29526
   187
  in (axiom, of_class) end;
haftmann@29526
   188
haftmann@29526
   189
fun all_assm_intros thy =
haftmann@25618
   190
  Graph.fold (fn (_, (data, _)) => fold (insert Thm.eq_thm)
haftmann@25618
   191
    ((the_list o #assm_intro o rep_class_data) data)) (ClassData.get thy) [];
haftmann@24218
   192
haftmann@29526
   193
fun these_defs thy = maps (#defs o the_class_data thy) o ancestry thy;
haftmann@29526
   194
fun these_operations thy = maps (#operations o the_class_data thy) o ancestry thy;
haftmann@29358
   195
haftmann@29526
   196
val base_morphism = #base_morph oo the_class_data;
haftmann@29526
   197
fun morphism thy class = base_morphism thy class
haftmann@29526
   198
  $> Element.eq_morphism thy (these_defs thy [class]);
haftmann@28715
   199
haftmann@24218
   200
fun print_classes thy =
haftmann@24218
   201
  let
wenzelm@24920
   202
    val ctxt = ProofContext.init thy;
haftmann@24218
   203
    val algebra = Sign.classes_of thy;
haftmann@24218
   204
    val arities =
haftmann@24218
   205
      Symtab.empty
haftmann@24218
   206
      |> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) =>
haftmann@24218
   207
           Symtab.map_default (class, []) (insert (op =) tyco)) arities)
haftmann@24218
   208
             ((#arities o Sorts.rep_algebra) algebra);
haftmann@24218
   209
    val the_arities = these o Symtab.lookup arities;
haftmann@24218
   210
    fun mk_arity class tyco =
haftmann@24218
   211
      let
haftmann@24218
   212
        val Ss = Sorts.mg_domain algebra tyco [class];
wenzelm@24920
   213
      in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end;
haftmann@24218
   214
    fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: "
wenzelm@24920
   215
      ^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty);
haftmann@24218
   216
    fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [
haftmann@25062
   217
      (SOME o Pretty.str) ("class " ^ Sign.extern_class thy class ^ ":"),
haftmann@24218
   218
      (SOME o Pretty.block) [Pretty.str "supersort: ",
wenzelm@24920
   219
        (Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class],
haftmann@25062
   220
      ((fn [] => NONE | ps => (SOME o Pretty.block o Pretty.fbreaks)
haftmann@25062
   221
          (Pretty.str "parameters:" :: ps)) o map mk_param
wenzelm@24930
   222
        o these o Option.map #params o try (AxClass.get_info thy)) class,
haftmann@24218
   223
      (SOME o Pretty.block o Pretty.breaks) [
haftmann@24218
   224
        Pretty.str "instances:",
haftmann@24218
   225
        Pretty.list "" "" (map (mk_arity class) (the_arities class))
haftmann@24218
   226
      ]
haftmann@24218
   227
    ]
haftmann@24218
   228
  in
haftmann@24589
   229
    (Pretty.writeln o Pretty.chunks o separate (Pretty.str "")
haftmann@24589
   230
      o map mk_entry o Sorts.all_classes) algebra
haftmann@24218
   231
  end;
haftmann@24218
   232
haftmann@24218
   233
haftmann@24218
   234
(* updaters *)
haftmann@24218
   235
haftmann@29526
   236
fun register class sups params base_sort morph
haftmann@29358
   237
    axiom assm_intro of_class thy =
haftmann@25002
   238
  let
haftmann@25368
   239
    val operations = map (fn (v_ty as (_, ty), (c, _)) =>
haftmann@25683
   240
      (c, (class, (ty, Free v_ty)))) params;
haftmann@25038
   241
    val add_class = Graph.new_node (class,
haftmann@25683
   242
        mk_class_data (((map o pairself) fst params, base_sort,
haftmann@29526
   243
          morph, assm_intro, of_class, axiom), ([], operations)))
haftmann@29526
   244
      #> fold (curry Graph.add_edge class) sups;
haftmann@25618
   245
  in ClassData.map add_class thy end;
haftmann@24218
   246
haftmann@29526
   247
fun activate_defs class thms thy =
haftmann@29526
   248
  let
haftmann@29526
   249
    val eq_morph = Element.eq_morphism thy thms;
haftmann@29526
   250
    fun amend cls thy = Locale.amend_registration eq_morph
haftmann@29526
   251
      (cls, morphism thy cls) thy;
haftmann@29526
   252
  in fold amend (heritage thy [class]) thy end;
haftmann@29526
   253
haftmann@25368
   254
fun register_operation class (c, (t, some_def)) thy =
haftmann@25062
   255
  let
haftmann@29358
   256
    val base_sort = base_sort thy class;
haftmann@29439
   257
    val prep_typ = map_type_tfree
haftmann@29439
   258
      (fn (v, sort) => if Name.aT = v
haftmann@29439
   259
        then TFree (v, base_sort) else TVar ((v, 0), sort));
haftmann@25368
   260
    val t' = map_types prep_typ t;
haftmann@25368
   261
    val ty' = Term.fastype_of t';
haftmann@25062
   262
  in
haftmann@25062
   263
    thy
haftmann@25062
   264
    |> (ClassData.map o Graph.map_node class o map_class_data o apsnd)
haftmann@25368
   265
      (fn (defs, operations) =>
haftmann@25096
   266
        (fold cons (the_list some_def) defs,
haftmann@25368
   267
          (c, (class, (ty', t'))) :: operations))
haftmann@29526
   268
    |> is_some some_def ? activate_defs class (the_list some_def)
haftmann@25062
   269
  end;
haftmann@24218
   270
haftmann@29558
   271
fun register_subclass (sub, sup) some_dep_morph some_wit export thy =
haftmann@25618
   272
  let
haftmann@29558
   273
    val intros = (snd o rules thy) sup :: map_filter I
haftmann@29558
   274
      [Option.map (Drule.standard' o Element.conclude_witness) some_wit,
haftmann@29558
   275
        (fst o rules thy) sub];
haftmann@29610
   276
    val tac = EVERY (map (TRYALL o Tactic.rtac) intros);
haftmann@29558
   277
    val classrel = Goal.prove_global thy [] [] (Logic.mk_classrel (sub, sup))
haftmann@29558
   278
      (K tac);
haftmann@29509
   279
    val diff_sort = Sign.complete_sort thy [sup]
haftmann@29509
   280
      |> subtract (op =) (Sign.complete_sort thy [sub]);
haftmann@25618
   281
  in
haftmann@25618
   282
    thy
haftmann@25618
   283
    |> AxClass.add_classrel classrel
haftmann@25618
   284
    |> ClassData.map (Graph.add_edge (sub, sup))
haftmann@29526
   285
    |> activate_defs sub (these_defs thy diff_sort)
haftmann@29610
   286
    |> fold (fn dep_morph => Locale.add_dependency sub (sup,
haftmann@29610
   287
        dep_morph $> Element.satisfy_morphism (the_list some_wit) $> export))
haftmann@29610
   288
          (the_list some_dep_morph)
haftmann@29558
   289
    |> (fn thy => fold_rev Locale.activate_global_facts
haftmann@29558
   290
      (Locale.get_registrations thy) thy)
haftmann@24218
   291
  end;
haftmann@24218
   292
haftmann@24218
   293
haftmann@24589
   294
(** classes and class target **)
haftmann@24218
   295
haftmann@25002
   296
(* class context syntax *)
haftmann@24748
   297
haftmann@29577
   298
fun these_unchecks thy =
haftmann@29577
   299
  map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) o these_operations thy;
haftmann@29577
   300
haftmann@29577
   301
fun synchronize_class_syntax sort base_sort ctxt =
haftmann@24914
   302
  let
wenzelm@25344
   303
    val thy = ProofContext.theory_of ctxt;
haftmann@26596
   304
    val algebra = Sign.classes_of thy;
haftmann@29577
   305
    val operations = these_operations thy sort;
haftmann@26518
   306
    fun subst_class_typ sort = map_type_tfree (K (TVar ((Name.aT, 0), sort)));
haftmann@26518
   307
    val primary_constraints =
haftmann@25368
   308
      (map o apsnd) (subst_class_typ base_sort o fst o snd) operations;
haftmann@26518
   309
    val secondary_constraints =
haftmann@25368
   310
      (map o apsnd) (fn (class, (ty, _)) => subst_class_typ [class] ty) operations;
wenzelm@25318
   311
    fun declare_const (c, _) =
wenzelm@25318
   312
      let val b = Sign.base_name c
wenzelm@25344
   313
      in Sign.intern_const thy b = c ? Variable.declare_const (b, c) end;
haftmann@26518
   314
    fun improve (c, ty) = (case AList.lookup (op =) primary_constraints c
haftmann@26238
   315
     of SOME ty' => (case try (Type.raw_match (ty', ty)) Vartab.empty
haftmann@26238
   316
         of SOME tyenv => (case Vartab.lookup tyenv (Name.aT, 0)
haftmann@26596
   317
             of SOME (_, ty' as TVar (tvar as (vi, sort))) =>
haftmann@26238
   318
                  if TypeInfer.is_param vi
haftmann@26596
   319
                    andalso Sorts.sort_le algebra (base_sort, sort)
haftmann@26596
   320
                      then SOME (ty', TFree (Name.aT, base_sort))
haftmann@26596
   321
                      else NONE
haftmann@26238
   322
              | _ => NONE)
haftmann@26238
   323
          | NONE => NONE)
haftmann@26238
   324
      | NONE => NONE)
haftmann@26238
   325
    fun subst (c, ty) = Option.map snd (AList.lookup (op =) operations c);
haftmann@29577
   326
    val unchecks = these_unchecks thy sort;
haftmann@25083
   327
  in
haftmann@25083
   328
    ctxt
haftmann@26518
   329
    |> fold declare_const primary_constraints
haftmann@26518
   330
    |> Overloading.map_improvable_syntax (K (((primary_constraints, secondary_constraints),
haftmann@26730
   331
        (((improve, subst), true), unchecks)), false))
haftmann@26518
   332
    |> Overloading.set_primary_constraints
haftmann@25083
   333
  end;
haftmann@25083
   334
haftmann@25083
   335
fun refresh_syntax class ctxt =
haftmann@25002
   336
  let
haftmann@25002
   337
    val thy = ProofContext.theory_of ctxt;
haftmann@29358
   338
    val base_sort = base_sort thy class;
haftmann@26238
   339
  in synchronize_class_syntax [class] base_sort ctxt end;
haftmann@25002
   340
haftmann@29577
   341
fun begin sort base_sort ctxt =
haftmann@25083
   342
  ctxt
haftmann@25083
   343
  |> Variable.declare_term
haftmann@25083
   344
      (Logic.mk_type (TFree (Name.aT, base_sort)))
haftmann@29577
   345
  |> synchronize_class_syntax sort base_sort
haftmann@26238
   346
  |> Overloading.add_improvable_syntax;
haftmann@24901
   347
haftmann@25311
   348
fun init class thy =
haftmann@25311
   349
  thy
haftmann@29509
   350
  |> Locale.init class
haftmann@29358
   351
  |> begin [class] (base_sort thy class);
haftmann@24914
   352
haftmann@24748
   353
haftmann@27690
   354
(* class target *)
haftmann@27690
   355
haftmann@29526
   356
val class_prefix = Logic.const_of_class o Sign.base_name;
haftmann@29526
   357
haftmann@27690
   358
fun declare class pos ((c, mx), dict) thy =
haftmann@27690
   359
  let
haftmann@29577
   360
    val morph = morphism thy class;
haftmann@29577
   361
    val b = Morphism.binding morph (Binding.name c);
haftmann@29577
   362
    val b_def = Morphism.binding morph (Binding.name (c ^ "_dict"));
haftmann@29577
   363
    val c' = Sign.full_name thy b;
haftmann@29439
   364
    val dict' = Morphism.term morph dict;
haftmann@29439
   365
    val ty' = Term.fastype_of dict';
haftmann@29577
   366
    val def_eq = Logic.mk_equals (Const (c', ty'), dict')
haftmann@29577
   367
      |> map_types Type.strip_sorts;
haftmann@27690
   368
  in
haftmann@29577
   369
    thy
haftmann@29577
   370
    |> Sign.declare_const pos ((b, Type.strip_sorts ty'), mx)
haftmann@29577
   371
    |> snd
haftmann@29577
   372
    |> Thm.add_def false false (b_def, def_eq)
haftmann@29577
   373
    |>> Thm.varifyT
haftmann@29577
   374
    |-> (fn def_thm => PureThy.store_thm (b_def, def_thm)
haftmann@29577
   375
      #> snd
haftmann@29577
   376
      #> register_operation class (c', (dict', SOME (Thm.symmetric def_thm))))
haftmann@27690
   377
    |> Sign.add_const_constraint (c', SOME ty')
haftmann@27690
   378
  end;
haftmann@27690
   379
haftmann@27690
   380
fun abbrev class prmode pos ((c, mx), rhs) thy =
haftmann@27690
   381
  let
haftmann@29577
   382
    val morph = morphism thy class;
haftmann@29577
   383
    val unchecks = these_unchecks thy [class];
haftmann@29577
   384
    val b = Morphism.binding morph (Binding.name c);
haftmann@29577
   385
    val c' = Sign.full_name thy b;
haftmann@27690
   386
    val rhs' = Pattern.rewrite_term thy unchecks [] rhs;
haftmann@27690
   387
    val ty' = Term.fastype_of rhs';
haftmann@29577
   388
    val rhs'' = map_types ((*Type.strip_sorts o *)Logic.varifyT) rhs';
haftmann@27690
   389
  in
haftmann@29577
   390
    thy
haftmann@29577
   391
    |> Sign.add_abbrev (#1 prmode) pos (b, rhs'')
haftmann@29577
   392
    |> snd
haftmann@27690
   393
    |> Sign.add_const_constraint (c', SOME ty')
haftmann@27690
   394
    |> Sign.notation true prmode [(Const (c', ty'), mx)]
haftmann@27690
   395
    |> not (#1 prmode = PrintMode.input) ? register_operation class (c', (rhs', NONE))
haftmann@27690
   396
  end;
haftmann@27690
   397
haftmann@27690
   398
haftmann@25462
   399
(** instantiation target **)
haftmann@25462
   400
haftmann@25462
   401
(* bookkeeping *)
haftmann@25462
   402
haftmann@25462
   403
datatype instantiation = Instantiation of {
haftmann@25864
   404
  arities: string list * (string * sort) list * sort,
haftmann@25462
   405
  params: ((string * string) * (string * typ)) list
haftmann@25603
   406
    (*(instantiation parameter, type constructor), (local instantiation parameter, typ)*)
haftmann@25462
   407
}
haftmann@25462
   408
haftmann@25462
   409
structure Instantiation = ProofDataFun
haftmann@25462
   410
(
haftmann@25462
   411
  type T = instantiation
haftmann@25536
   412
  fun init _ = Instantiation { arities = ([], [], []), params = [] };
haftmann@25462
   413
);
haftmann@25462
   414
haftmann@25485
   415
fun mk_instantiation (arities, params) =
haftmann@25485
   416
  Instantiation { arities = arities, params = params };
haftmann@25514
   417
fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy)
haftmann@25485
   418
 of Instantiation data => data;
haftmann@25514
   419
fun map_instantiation f = (LocalTheory.target o Instantiation.map)
haftmann@25514
   420
  (fn Instantiation { arities, params } => mk_instantiation (f (arities, params)));
haftmann@25462
   421
haftmann@25514
   422
fun the_instantiation lthy = case get_instantiation lthy
haftmann@25536
   423
 of { arities = ([], [], []), ... } => error "No instantiation target"
haftmann@25485
   424
  | data => data;
haftmann@25462
   425
haftmann@25485
   426
val instantiation_params = #params o get_instantiation;
haftmann@25462
   427
haftmann@25514
   428
fun instantiation_param lthy v = instantiation_params lthy
haftmann@25462
   429
  |> find_first (fn (_, (v', _)) => v = v')
haftmann@25462
   430
  |> Option.map (fst o fst);
haftmann@25462
   431
haftmann@25462
   432
haftmann@25462
   433
(* syntax *)
haftmann@25462
   434
haftmann@26238
   435
fun synchronize_inst_syntax ctxt =
haftmann@25462
   436
  let
haftmann@26259
   437
    val Instantiation { arities = (_, _, sort), params = params } = Instantiation.get ctxt;
haftmann@26238
   438
    val thy = ProofContext.theory_of ctxt;
haftmann@26238
   439
    fun subst (c, ty) = case AxClass.inst_tyco_of thy (c, ty)
haftmann@26238
   440
         of SOME tyco => (case AList.lookup (op =) params (c, tyco)
haftmann@26238
   441
             of SOME (v_ty as (_, ty)) => SOME (ty, Free v_ty)
haftmann@26238
   442
              | NONE => NONE)
haftmann@26238
   443
          | NONE => NONE;
haftmann@26238
   444
    val unchecks =
haftmann@26238
   445
      map (fn ((c, _), v_ty as (_, ty)) => (Free v_ty, Const (c, ty))) params;
haftmann@26238
   446
  in
haftmann@26238
   447
    ctxt
haftmann@26259
   448
    |> Overloading.map_improvable_syntax
haftmann@26730
   449
         (fn (((primary_constraints, _), (((improve, _), _), _)), _) =>
haftmann@26730
   450
            (((primary_constraints, []), (((improve, subst), false), unchecks)), false))
haftmann@26238
   451
  end;
haftmann@25462
   452
haftmann@25462
   453
haftmann@25462
   454
(* target *)
haftmann@25462
   455
haftmann@25485
   456
val sanatize_name = (*FIXME*)
haftmann@25485
   457
  let
haftmann@25574
   458
    fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s
haftmann@25574
   459
      orelse s = "'" orelse s = "_";
haftmann@25485
   460
    val is_junk = not o is_valid andf Symbol.is_regular;
haftmann@25485
   461
    val junk = Scan.many is_junk;
haftmann@25485
   462
    val scan_valids = Symbol.scanner "Malformed input"
haftmann@25485
   463
      ((junk |--
haftmann@25485
   464
        (Scan.optional (Scan.one Symbol.is_ascii_letter) "x" ^^ (Scan.many is_valid >> implode)
haftmann@25485
   465
        --| junk))
wenzelm@25999
   466
      ::: Scan.repeat ((Scan.many1 is_valid >> implode) --| junk));
haftmann@25485
   467
  in
haftmann@25485
   468
    explode #> scan_valids #> implode
haftmann@25485
   469
  end;
haftmann@25485
   470
haftmann@26259
   471
fun type_name "*" = "prod"
haftmann@26259
   472
  | type_name "+" = "sum"
haftmann@29526
   473
  | type_name s = sanatize_name (NameSpace.base s);
haftmann@26259
   474
haftmann@26518
   475
fun resort_terms pp algebra consts constraints ts =
haftmann@26518
   476
  let
haftmann@26518
   477
    fun matchings (Const (c_ty as (c, _))) = (case constraints c
haftmann@26518
   478
         of NONE => I
haftmann@26518
   479
          | SOME sorts => fold2 (curry (Sorts.meet_sort algebra))
haftmann@26518
   480
              (Consts.typargs consts c_ty) sorts)
haftmann@26518
   481
      | matchings _ = I
haftmann@26518
   482
    val tvartab = (fold o fold_aterms) matchings ts Vartab.empty
wenzelm@26642
   483
      handle Sorts.CLASS_ERROR e => error (Sorts.class_error pp e);
haftmann@27089
   484
    val inst = map_type_tvar
haftmann@27089
   485
      (fn (vi, sort) => TVar (vi, the_default sort (Vartab.lookup tvartab vi)));
haftmann@26518
   486
  in if Vartab.is_empty tvartab then NONE else SOME ((map o map_types) inst ts) end;
haftmann@26518
   487
haftmann@25864
   488
fun init_instantiation (tycos, vs, sort) thy =
haftmann@25462
   489
  let
haftmann@25536
   490
    val _ = if null tycos then error "At least one arity must be given" else ();
haftmann@26518
   491
    val params = these_params thy sort;
haftmann@26518
   492
    fun get_param tyco (param, (_, (c, ty))) = if can (AxClass.param_of_inst thy) (c, tyco)
haftmann@25603
   493
      then NONE else SOME ((c, tyco),
haftmann@25864
   494
        (param ^ "_" ^ type_name tyco, map_atyps (K (Type (tyco, map TFree vs))) ty));
haftmann@26518
   495
    val inst_params = map_product get_param tycos params |> map_filter I;
haftmann@26518
   496
    val primary_constraints = map (apsnd
haftmann@26518
   497
      (map_atyps (K (TVar ((Name.aT, 0), [])))) o snd o snd) params;
wenzelm@26939
   498
    val pp = Syntax.pp_global thy;
haftmann@26518
   499
    val algebra = Sign.classes_of thy
haftmann@26518
   500
      |> fold (fn tyco => Sorts.add_arities pp
haftmann@26518
   501
            (tyco, map (fn class => (class, map snd vs)) sort)) tycos;
haftmann@26518
   502
    val consts = Sign.consts_of thy;
haftmann@26518
   503
    val improve_constraints = AList.lookup (op =)
haftmann@26518
   504
      (map (fn (_, (class, (c, _))) => (c, [[class]])) params);
haftmann@26518
   505
    fun resort_check ts ctxt = case resort_terms pp algebra consts improve_constraints ts
haftmann@26518
   506
     of NONE => NONE
haftmann@26518
   507
      | SOME ts' => SOME (ts', ctxt);
haftmann@26518
   508
    fun improve (c, ty) = case AxClass.inst_tyco_of thy (c, ty)
haftmann@26329
   509
     of SOME tyco => (case AList.lookup (op =) inst_params (c, tyco)
haftmann@26518
   510
         of SOME (_, ty') => if Type.raw_instance (ty', ty) then SOME (ty, ty') else NONE
haftmann@26259
   511
          | NONE => NONE)
haftmann@26259
   512
      | NONE => NONE;
haftmann@25485
   513
  in
haftmann@25485
   514
    thy
haftmann@25485
   515
    |> ProofContext.init
haftmann@26329
   516
    |> Instantiation.put (mk_instantiation ((tycos, vs, sort), inst_params))
wenzelm@27281
   517
    |> fold (Variable.declare_typ o TFree) vs
haftmann@26329
   518
    |> fold (Variable.declare_names o Free o snd) inst_params
haftmann@26259
   519
    |> (Overloading.map_improvable_syntax o apfst)
haftmann@26329
   520
         (fn ((_, _), ((_, subst), unchecks)) =>
haftmann@26730
   521
            ((primary_constraints, []), (((improve, K NONE), false), [])))
haftmann@26259
   522
    |> Overloading.add_improvable_syntax
haftmann@26518
   523
    |> Context.proof_map (Syntax.add_term_check 0 "resorting" resort_check)
haftmann@26238
   524
    |> synchronize_inst_syntax
haftmann@25485
   525
  end;
haftmann@25485
   526
haftmann@26238
   527
fun confirm_declaration c = (map_instantiation o apsnd)
haftmann@26238
   528
  (filter_out (fn (_, (c', _)) => c' = c))
haftmann@26238
   529
  #> LocalTheory.target synchronize_inst_syntax
haftmann@26238
   530
haftmann@25485
   531
fun gen_instantiation_instance do_proof after_qed lthy =
haftmann@25485
   532
  let
haftmann@25864
   533
    val (tycos, vs, sort) = (#arities o the_instantiation) lthy;
haftmann@25864
   534
    val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, map snd vs, sort)) tycos;
haftmann@25462
   535
    fun after_qed' results =
haftmann@25462
   536
      LocalTheory.theory (fold (AxClass.add_arity o Thm.varifyT) results)
haftmann@25462
   537
      #> after_qed;
haftmann@25462
   538
  in
haftmann@25462
   539
    lthy
haftmann@25462
   540
    |> do_proof after_qed' arities_proof
haftmann@25462
   541
  end;
haftmann@25462
   542
haftmann@25485
   543
val instantiation_instance = gen_instantiation_instance (fn after_qed => fn ts =>
haftmann@25462
   544
  Proof.theorem_i NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts));
haftmann@25462
   545
haftmann@25485
   546
fun prove_instantiation_instance tac = gen_instantiation_instance (fn after_qed =>
haftmann@25502
   547
  fn ts => fn lthy => after_qed (map (fn t => Goal.prove lthy [] [] t
haftmann@25502
   548
    (fn {context, ...} => tac context)) ts) lthy) I;
haftmann@25462
   549
haftmann@28666
   550
fun prove_instantiation_exit tac = prove_instantiation_instance tac
haftmann@28666
   551
  #> LocalTheory.exit_global;
haftmann@28666
   552
haftmann@28666
   553
fun prove_instantiation_exit_result f tac x lthy =
haftmann@28666
   554
  let
haftmann@29439
   555
    val morph = ProofContext.export_morphism lthy
haftmann@28666
   556
      (ProofContext.init (ProofContext.theory_of lthy));
haftmann@29439
   557
    val y = f morph x;
haftmann@28666
   558
  in
haftmann@28666
   559
    lthy
haftmann@28666
   560
    |> prove_instantiation_exit (fn ctxt => tac ctxt y)
haftmann@28666
   561
    |> pair y
haftmann@28666
   562
  end;
haftmann@28666
   563
haftmann@25462
   564
fun conclude_instantiation lthy =
haftmann@25462
   565
  let
haftmann@25485
   566
    val { arities, params } = the_instantiation lthy;
haftmann@25864
   567
    val (tycos, vs, sort) = arities;
haftmann@25462
   568
    val thy = ProofContext.theory_of lthy;
haftmann@25597
   569
    val _ = map (fn tyco => if Sign.of_sort thy
haftmann@25864
   570
        (Type (tyco, map TFree vs), sort)
haftmann@25462
   571
      then () else error ("Missing instance proof for type " ^ quote (Sign.extern_type thy tyco)))
haftmann@25597
   572
        tycos;
haftmann@25597
   573
  in lthy end;
haftmann@25462
   574
haftmann@25603
   575
fun pretty_instantiation lthy =
haftmann@25603
   576
  let
haftmann@25603
   577
    val { arities, params } = the_instantiation lthy;
haftmann@25864
   578
    val (tycos, vs, sort) = arities;
haftmann@25603
   579
    val thy = ProofContext.theory_of lthy;
haftmann@25864
   580
    fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, map snd vs, sort);
haftmann@25603
   581
    fun pr_param ((c, _), (v, ty)) =
haftmann@25864
   582
      (Pretty.block o Pretty.breaks) [Pretty.str v, Pretty.str "==",
wenzelm@26939
   583
        (Pretty.str o Sign.extern_const thy) c, Pretty.str "::", Syntax.pretty_typ_global thy ty];
haftmann@25603
   584
  in
haftmann@25603
   585
    (Pretty.block o Pretty.fbreaks)
haftmann@25603
   586
      (Pretty.str "instantiation" :: map pr_arity tycos @ map pr_param params)
haftmann@25603
   587
  end;
haftmann@25603
   588
haftmann@29526
   589
haftmann@29526
   590
(** tactics and methods **)
haftmann@29526
   591
haftmann@29526
   592
fun intro_classes_tac facts st =
haftmann@29526
   593
  let
haftmann@29526
   594
    val thy = Thm.theory_of_thm st;
haftmann@29526
   595
    val classes = Sign.all_classes thy;
haftmann@29526
   596
    val class_trivs = map (Thm.class_triv thy) classes;
haftmann@29526
   597
    val class_intros = map_filter (try (#intro o AxClass.get_info thy)) classes;
haftmann@29526
   598
    val assm_intros = all_assm_intros thy;
haftmann@29526
   599
  in
haftmann@29526
   600
    Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st
haftmann@29526
   601
  end;
haftmann@29526
   602
haftmann@29526
   603
fun default_intro_tac ctxt [] =
haftmann@29577
   604
      intro_classes_tac [] ORELSE Locale.intro_locales_tac true ctxt []
haftmann@29526
   605
  | default_intro_tac _ _ = no_tac;
haftmann@29526
   606
haftmann@29526
   607
fun default_tac rules ctxt facts =
haftmann@29526
   608
  HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
haftmann@29526
   609
    default_intro_tac ctxt facts;
haftmann@29526
   610
haftmann@29526
   611
val _ = Context.>> (Context.map_theory
haftmann@29526
   612
  (Method.add_methods
haftmann@29526
   613
   [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
haftmann@29526
   614
      "back-chain introduction rules of classes"),
haftmann@29526
   615
    ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
haftmann@29526
   616
      "apply some intro/elim rule")]));
haftmann@29526
   617
haftmann@24218
   618
end;
haftmann@25683
   619