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