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