src/Pure/Isar/class.ML
author haftmann
Fri Mar 07 13:53:07 2008 +0100 (2008-03-07)
changeset 26238 c30bb8182da2
parent 26167 ccc9007a7164
child 26247 b6608fbeaae1
permissions -rw-r--r--
generic improvable syntax for targets
haftmann@24218
     1
(*  Title:      Pure/Isar/class.ML
haftmann@24218
     2
    ID:         $Id$
haftmann@24218
     3
    Author:     Florian Haftmann, TU Muenchen
haftmann@24218
     4
haftmann@24218
     5
Type classes derived from primitive axclasses and locales.
haftmann@24218
     6
*)
haftmann@24218
     7
haftmann@24218
     8
signature CLASS =
haftmann@24218
     9
sig
haftmann@25462
    10
  (*classes*)
haftmann@25002
    11
  val class: bstring -> class list -> Element.context_i Locale.element list
haftmann@24218
    12
    -> string list -> theory -> string * Proof.context
haftmann@25002
    13
  val class_cmd: bstring -> xstring list -> Element.context Locale.element list
haftmann@24589
    14
    -> xstring list -> theory -> string * Proof.context
haftmann@25485
    15
haftmann@25311
    16
  val init: class -> theory -> Proof.context
haftmann@25603
    17
  val declare: string -> Markup.property list
wenzelm@25104
    18
    -> (string * mixfix) * term -> theory -> theory
haftmann@25603
    19
  val abbrev: string -> Syntax.mode -> Markup.property list
wenzelm@25104
    20
    -> (string * mixfix) * term -> theory -> theory
haftmann@25083
    21
  val refresh_syntax: class -> Proof.context -> Proof.context
haftmann@25485
    22
haftmann@24589
    23
  val intro_classes_tac: thm list -> tactic
haftmann@24589
    24
  val default_intro_classes_tac: thm list -> tactic
haftmann@25618
    25
  val prove_subclass: class * class -> thm -> theory -> theory
haftmann@25485
    26
haftmann@25485
    27
  val class_prefix: string -> string
haftmann@25485
    28
  val is_class: theory -> class -> bool
haftmann@25485
    29
  val these_params: theory -> sort -> (string * (string * typ)) list
haftmann@24589
    30
  val print_classes: theory -> unit
haftmann@24423
    31
haftmann@25462
    32
  (*instances*)
haftmann@25864
    33
  val init_instantiation: string list * (string * sort) list * sort -> theory -> local_theory
haftmann@25485
    34
  val instantiation_instance: (local_theory -> local_theory) -> local_theory -> Proof.state
haftmann@25485
    35
  val prove_instantiation_instance: (Proof.context -> tactic) -> local_theory -> local_theory
haftmann@25485
    36
  val conclude_instantiation: local_theory -> local_theory
haftmann@25603
    37
  val instantiation_param: local_theory -> string -> string option
haftmann@25485
    38
  val confirm_declaration: string -> local_theory -> local_theory
haftmann@25603
    39
  val pretty_instantiation: local_theory -> Pretty.T
haftmann@25485
    40
haftmann@25462
    41
  (*old axclass layer*)
haftmann@25462
    42
  val axclass_cmd: bstring * xstring list
haftmann@25462
    43
    -> ((bstring * Attrib.src list) * string list) list
haftmann@25462
    44
    -> theory -> class * theory
haftmann@25462
    45
  val classrel_cmd: xstring * xstring -> theory -> Proof.state
haftmann@25462
    46
haftmann@25462
    47
  (*old instance layer*)
haftmann@25536
    48
  val instance_arity: (theory -> theory) -> arity -> theory -> Proof.state
haftmann@25536
    49
  val instance_arity_cmd: bstring * xstring list * xstring -> theory -> Proof.state
haftmann@24218
    50
end;
haftmann@24218
    51
haftmann@24218
    52
structure Class : CLASS =
haftmann@24218
    53
struct
haftmann@24218
    54
haftmann@24218
    55
(** auxiliary **)
haftmann@24218
    56
haftmann@25062
    57
val classN = "class";
haftmann@25062
    58
val introN = "intro";
haftmann@25062
    59
haftmann@25002
    60
fun prove_interpretation tac prfx_atts expr inst =
haftmann@25002
    61
  Locale.interpretation_i I prfx_atts expr inst
haftmann@24589
    62
  #> Proof.global_terminal_proof
haftmann@24589
    63
      (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@24589
    64
  #> ProofContext.theory_of;
haftmann@24589
    65
haftmann@25195
    66
fun prove_interpretation_in tac after_qed (name, expr) =
haftmann@25195
    67
  Locale.interpretation_in_locale
haftmann@25195
    68
      (ProofContext.theory after_qed) (name, expr)
haftmann@25195
    69
  #> Proof.global_terminal_proof
haftmann@25195
    70
      (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@25195
    71
  #> ProofContext.theory_of;
haftmann@25195
    72
haftmann@24589
    73
haftmann@25485
    74
(** primitive axclass and instance commands **)
haftmann@24589
    75
haftmann@24218
    76
fun axclass_cmd (class, raw_superclasses) raw_specs thy =
haftmann@24218
    77
  let
haftmann@24218
    78
    val ctxt = ProofContext.init thy;
haftmann@24218
    79
    val superclasses = map (Sign.read_class thy) raw_superclasses;
haftmann@24589
    80
    val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst)
haftmann@24589
    81
      raw_specs;
haftmann@24589
    82
    val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd)
haftmann@24589
    83
          raw_specs)
haftmann@24218
    84
      |> snd
haftmann@24218
    85
      |> (map o map) fst;
haftmann@24589
    86
  in
haftmann@24589
    87
    AxClass.define_class (class, superclasses) []
haftmann@24589
    88
      (name_atts ~~ axiomss) thy
haftmann@24589
    89
  end;
haftmann@24218
    90
haftmann@24218
    91
local
haftmann@24218
    92
haftmann@24218
    93
fun gen_instance mk_prop add_thm after_qed insts thy =
haftmann@24218
    94
  let
haftmann@24218
    95
    fun after_qed' results =
haftmann@24218
    96
      ProofContext.theory ((fold o fold) add_thm results #> after_qed);
haftmann@24218
    97
  in
haftmann@24218
    98
    thy
haftmann@24218
    99
    |> ProofContext.init
haftmann@24589
   100
    |> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])])
haftmann@25536
   101
        o mk_prop thy) insts)
haftmann@24218
   102
  end;
haftmann@24218
   103
haftmann@24218
   104
in
haftmann@24218
   105
haftmann@24589
   106
val instance_arity =
haftmann@24218
   107
  gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity;
haftmann@25502
   108
val instance_arity_cmd =
haftmann@25502
   109
  gen_instance (Logic.mk_arities oo Sign.read_arity) AxClass.add_arity I;
haftmann@24589
   110
val classrel =
haftmann@25536
   111
  gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) AxClass.add_classrel I;
haftmann@24589
   112
val classrel_cmd =
haftmann@25536
   113
  gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) AxClass.add_classrel I;
haftmann@24218
   114
haftmann@24218
   115
end; (*local*)
haftmann@24218
   116
haftmann@24218
   117
haftmann@24589
   118
(** class data **)
haftmann@24218
   119
haftmann@24218
   120
datatype class_data = ClassData of {
haftmann@24218
   121
  consts: (string * string) list
haftmann@24836
   122
    (*locale parameter ~> constant name*),
haftmann@25062
   123
  base_sort: sort,
haftmann@25083
   124
  inst: term option list
haftmann@25083
   125
    (*canonical interpretation*),
haftmann@25711
   126
  morphism: theory -> thm list -> morphism,
haftmann@25062
   127
    (*partial morphism of canonical interpretation*)
haftmann@25618
   128
  assm_intro: thm option,
haftmann@25618
   129
  of_class: thm,
haftmann@25618
   130
  axiom: thm option,
haftmann@24657
   131
  defs: thm list,
haftmann@25368
   132
  operations: (string * (class * (typ * term))) list
haftmann@24657
   133
};
haftmann@24218
   134
haftmann@24657
   135
fun rep_class_data (ClassData d) = d;
haftmann@25618
   136
fun mk_class_data ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom),
haftmann@25368
   137
    (defs, operations)) =
haftmann@25062
   138
  ClassData { consts = consts, base_sort = base_sort, inst = inst,
haftmann@25618
   139
    morphism = morphism, assm_intro = assm_intro, of_class = of_class, axiom = axiom, 
haftmann@25618
   140
    defs = defs, operations = operations };
haftmann@25618
   141
fun map_class_data f (ClassData { consts, base_sort, inst, morphism,
haftmann@25618
   142
    assm_intro, of_class, axiom, defs, operations }) =
haftmann@25618
   143
  mk_class_data (f ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom),
haftmann@25368
   144
    (defs, operations)));
haftmann@25038
   145
fun merge_class_data _ (ClassData { consts = consts,
haftmann@25618
   146
    base_sort = base_sort, inst = inst, morphism = morphism, assm_intro = assm_intro,
haftmann@25618
   147
    of_class = of_class, axiom = axiom, defs = defs1, operations = operations1 },
haftmann@25618
   148
  ClassData { consts = _, base_sort = _, inst = _, morphism = _, assm_intro = _,
haftmann@25618
   149
    of_class = _, axiom = _, defs = defs2, operations = operations2 }) =
haftmann@25618
   150
  mk_class_data ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom),
haftmann@24914
   151
    (Thm.merge_thms (defs1, defs2),
haftmann@25368
   152
      AList.merge (op =) (K true) (operations1, operations2)));
haftmann@24218
   153
haftmann@24218
   154
structure ClassData = TheoryDataFun
haftmann@24218
   155
(
haftmann@25038
   156
  type T = class_data Graph.T
haftmann@25038
   157
  val empty = Graph.empty;
haftmann@24218
   158
  val copy = I;
haftmann@24218
   159
  val extend = I;
haftmann@25038
   160
  fun merge _ = Graph.join merge_class_data;
haftmann@24218
   161
);
haftmann@24218
   162
haftmann@24218
   163
haftmann@24218
   164
(* queries *)
haftmann@24218
   165
haftmann@25038
   166
val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node o ClassData.get;
haftmann@24218
   167
haftmann@24589
   168
fun the_class_data thy class = case lookup_class_data thy class
wenzelm@25020
   169
 of NONE => error ("Undeclared class " ^ quote class)
haftmann@24589
   170
  | SOME data => data;
haftmann@24218
   171
haftmann@25038
   172
val is_class = is_some oo lookup_class_data;
haftmann@25038
   173
haftmann@25038
   174
val ancestry = Graph.all_succs o ClassData.get;
haftmann@24218
   175
haftmann@25002
   176
fun these_params thy =
haftmann@24218
   177
  let
haftmann@24218
   178
    fun params class =
haftmann@24218
   179
      let
wenzelm@24930
   180
        val const_typs = (#params o AxClass.get_info thy) class;
haftmann@24657
   181
        val const_names = (#consts o the_class_data thy) class;
haftmann@24218
   182
      in
haftmann@24218
   183
        (map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names
haftmann@24218
   184
      end;
haftmann@24218
   185
  in maps params o ancestry thy end;
haftmann@24218
   186
haftmann@24657
   187
fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy;
haftmann@24218
   188
haftmann@25711
   189
fun partial_morphism thy class = #morphism (the_class_data thy class) thy [];
haftmann@25711
   190
fun morphism thy class = #morphism (the_class_data thy class) thy (these_defs thy [class]);
haftmann@25062
   191
haftmann@25618
   192
fun these_assm_intros thy =
haftmann@25618
   193
  Graph.fold (fn (_, (data, _)) => fold (insert Thm.eq_thm)
haftmann@25618
   194
    ((the_list o #assm_intro o rep_class_data) data)) (ClassData.get thy) [];
haftmann@24218
   195
haftmann@24836
   196
fun these_operations thy =
haftmann@24836
   197
  maps (#operations o the_class_data thy) o ancestry thy;
haftmann@24657
   198
haftmann@24218
   199
fun print_classes thy =
haftmann@24218
   200
  let
wenzelm@24920
   201
    val ctxt = ProofContext.init thy;
haftmann@24218
   202
    val algebra = Sign.classes_of thy;
haftmann@24218
   203
    val arities =
haftmann@24218
   204
      Symtab.empty
haftmann@24218
   205
      |> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) =>
haftmann@24218
   206
           Symtab.map_default (class, []) (insert (op =) tyco)) arities)
haftmann@24218
   207
             ((#arities o Sorts.rep_algebra) algebra);
haftmann@24218
   208
    val the_arities = these o Symtab.lookup arities;
haftmann@24218
   209
    fun mk_arity class tyco =
haftmann@24218
   210
      let
haftmann@24218
   211
        val Ss = Sorts.mg_domain algebra tyco [class];
wenzelm@24920
   212
      in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end;
haftmann@24218
   213
    fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: "
wenzelm@24920
   214
      ^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty);
haftmann@24218
   215
    fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [
haftmann@25062
   216
      (SOME o Pretty.str) ("class " ^ Sign.extern_class thy class ^ ":"),
haftmann@24218
   217
      (SOME o Pretty.block) [Pretty.str "supersort: ",
wenzelm@24920
   218
        (Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class],
haftmann@25062
   219
      if is_class thy class then (SOME o Pretty.str)
haftmann@25062
   220
        ("locale: " ^ Locale.extern thy class) else NONE,
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@25618
   237
fun add_class_data ((class, superclasses),
haftmann@25711
   238
    (params, base_sort, inst, phi, 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@25618
   244
          map (SOME o Const) inst, phi, assm_intro, of_class, axiom), ([], operations)))
haftmann@25002
   245
      #> fold (curry Graph.add_edge class) superclasses;
haftmann@25618
   246
  in ClassData.map add_class thy end;
haftmann@24218
   247
haftmann@25368
   248
fun register_operation class (c, (t, some_def)) thy =
haftmann@25062
   249
  let
haftmann@25368
   250
    val base_sort = (#base_sort o the_class_data thy) class;
haftmann@25239
   251
    val prep_typ = map_atyps
haftmann@25368
   252
      (fn TVar (vi as (v, _), sort) => if Name.aT = v
haftmann@25368
   253
        then TFree (v, base_sort) else TVar (vi, sort));
haftmann@25368
   254
    val t' = map_types prep_typ t;
haftmann@25368
   255
    val ty' = Term.fastype_of t';
haftmann@25062
   256
  in
haftmann@25062
   257
    thy
haftmann@25062
   258
    |> (ClassData.map o Graph.map_node class o map_class_data o apsnd)
haftmann@25368
   259
      (fn (defs, operations) =>
haftmann@25096
   260
        (fold cons (the_list some_def) defs,
haftmann@25368
   261
          (c, (class, (ty', t'))) :: operations))
haftmann@25062
   262
  end;
haftmann@24218
   263
haftmann@24589
   264
haftmann@24589
   265
(** rule calculation, tactics and methods **)
haftmann@24589
   266
wenzelm@25024
   267
val class_prefix = Logic.const_of_class o Sign.base_name;
wenzelm@25024
   268
haftmann@25683
   269
fun calculate thy sups base_sort assm_axiom param_map class =
haftmann@25062
   270
  let
haftmann@25711
   271
    (*static parts of morphism*)
haftmann@25683
   272
    val subst_typ = map_atyps (fn TFree (v, sort) =>
haftmann@25683
   273
          if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort)
haftmann@25683
   274
      | ty => ty);
haftmann@25683
   275
    fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) param_map v
haftmann@25062
   276
         of SOME (c, _) => Const (c, ty)
haftmann@25062
   277
          | NONE => t)
haftmann@25062
   278
      | subst_aterm t = t;
haftmann@25711
   279
    fun instantiate thy sort = Thm.instantiate ([pairself (Thm.ctyp_of thy o TVar o pair (Name.aT, 0))
haftmann@25711
   280
      (base_sort, sort)], map (fn (v, (c, ty)) => pairself (Thm.cterm_of thy)
haftmann@25711
   281
        (Var ((v, 0), map_atyps (fn _ => TVar ((Name.aT, 0), sort)) ty),
haftmann@25711
   282
          Const (c, map_atyps (fn _ => TVar ((Name.aT, 0), sort)) ty))) param_map);
haftmann@25711
   283
    val instantiate_base_sort = instantiate thy base_sort;
haftmann@25711
   284
    val instantiate_class = instantiate thy [class];
haftmann@25683
   285
    val (proto_assm_intro, locale_intro) = Locale.intros thy class
haftmann@25683
   286
      |> pairself (try the_single);
haftmann@25683
   287
    val axiom_premises = map_filter (#axiom o the_class_data thy) sups
haftmann@25683
   288
      @ the_list assm_axiom;
haftmann@25711
   289
    val axiom = locale_intro
haftmann@25711
   290
      |> Option.map (Drule.standard o (fn thm => thm OF axiom_premises) o instantiate_class)
haftmann@25711
   291
      |> (fn x as SOME _ => x | NONE => assm_axiom);
haftmann@25711
   292
    val lift_axiom = case axiom
haftmann@25711
   293
     of SOME axiom => (fn thm => Thm.implies_elim thm axiom)
haftmann@25683
   294
      | NONE => I;
haftmann@25062
   295
haftmann@25711
   296
    (*dynamic parts of morphism*)
haftmann@25711
   297
    fun rew_term thy defs = Pattern.rewrite_term thy
haftmann@25711
   298
      (map (Logic.dest_equals o Thm.prop_of) defs) [];
haftmann@25711
   299
    fun subst_term thy defs = map_aterms subst_aterm #> rew_term thy defs
haftmann@25711
   300
      #> map_types subst_typ;
haftmann@25711
   301
    fun subst_thm defs = Drule.standard' #> instantiate_class #> lift_axiom
haftmann@25711
   302
      #> MetaSimplifier.rewrite_rule defs;
haftmann@25711
   303
    fun morphism thy defs = 
haftmann@25711
   304
      Morphism.typ_morphism subst_typ
haftmann@25711
   305
      $> Morphism.term_morphism (subst_term thy defs)
haftmann@25711
   306
      $> Morphism.thm_morphism (subst_thm defs);
haftmann@25711
   307
haftmann@25711
   308
    (*class rules*)
haftmann@25711
   309
    val defs = these_defs thy sups;
haftmann@25618
   310
    val assm_intro = proto_assm_intro
haftmann@25711
   311
      |> Option.map instantiate_base_sort
haftmann@25711
   312
      |> Option.map (MetaSimplifier.rewrite_rule defs)
haftmann@25668
   313
      |> Option.map Goal.close_result;
haftmann@25711
   314
    val fixate = Thm.instantiate
haftmann@25711
   315
      (map (pairself (Thm.ctyp_of thy)) [(TVar ((Name.aT, 0), []), TFree (Name.aT, base_sort)),
haftmann@25711
   316
        (TVar ((Name.aT, 0), base_sort), TFree (Name.aT, base_sort))], [])
haftmann@25711
   317
    val class_intro = (fixate o #intro o AxClass.get_info thy) class;
haftmann@25618
   318
    val of_class_sups = if null sups
haftmann@25711
   319
      then map (fixate o Thm.class_triv thy) base_sort
haftmann@25711
   320
      else map (fixate o #of_class o the_class_data thy) sups;
haftmann@25683
   321
    val locale_dests = map Drule.standard' (Locale.dests thy class);
haftmann@25711
   322
    val num_trivs = case length locale_dests
haftmann@25711
   323
     of 0 => if is_none axiom then 0 else 1
haftmann@25711
   324
      | n => n;
haftmann@25711
   325
    val pred_trivs = if num_trivs = 0 then []
haftmann@25711
   326
      else the axiom
haftmann@25711
   327
        |> Thm.prop_of
haftmann@25711
   328
        |> (map_types o map_atyps o K) (TFree (Name.aT, base_sort))
haftmann@25711
   329
        |> (Thm.assume o Thm.cterm_of thy)
haftmann@25711
   330
        |> replicate num_trivs;
haftmann@25668
   331
    val of_class = (class_intro OF of_class_sups OF locale_dests OF pred_trivs)
haftmann@25711
   332
      |> Drule.standard'
haftmann@25668
   333
      |> Goal.close_result;
haftmann@25711
   334
  in (morphism, axiom, assm_intro, of_class) end;
haftmann@24589
   335
haftmann@24589
   336
fun class_interpretation class facts defs thy =
haftmann@24589
   337
  let
haftmann@25038
   338
    val params = these_params thy [class];
haftmann@26238
   339
    val consts = map (fst o snd) params;
haftmann@26238
   340
    val constraints = map (fn c => map_atyps (K (TFree (Name.aT,
haftmann@26238
   341
      [the (AxClass.class_of_param thy c)]))) (Sign.the_const_type thy c)) consts;
haftmann@26238
   342
    val no_constraints = map (map_atyps (K (TFree (Name.aT, [])))) constraints;
haftmann@26238
   343
    fun add_constraint c T = Sign.add_const_constraint (c, SOME T);
haftmann@25083
   344
    val inst = (#inst o the_class_data thy) class;
wenzelm@25020
   345
    val tac = ALLGOALS (ProofContext.fact_tac facts);
haftmann@25038
   346
    val prfx = class_prefix class;
haftmann@24589
   347
  in
haftmann@25038
   348
    thy
haftmann@26238
   349
    |> fold2 add_constraint consts no_constraints
haftmann@26238
   350
    |> prove_interpretation tac ((false, prfx), []) (Locale.Locale class)
ballarin@25094
   351
          (inst, map (fn def => (("", []), def)) defs)
haftmann@26238
   352
    |> fold2 add_constraint consts constraints
haftmann@24589
   353
  end;
haftmann@24218
   354
haftmann@25618
   355
fun prove_subclass (sub, sup) thm thy =
haftmann@25618
   356
  let
haftmann@25711
   357
    val of_class = (#of_class o the_class_data thy) sup;
haftmann@25683
   358
    val intro = Drule.standard' (of_class OF [Drule.standard' thm]);
haftmann@25618
   359
    val classrel = intro OF (the_list o #axiom o the_class_data thy) sub;
haftmann@25618
   360
  in
haftmann@25618
   361
    thy
haftmann@25618
   362
    |> AxClass.add_classrel classrel
haftmann@25618
   363
    |> prove_interpretation_in (ALLGOALS (ProofContext.fact_tac [thm]))
haftmann@25618
   364
         I (sub, Locale.Locale sup)
haftmann@25618
   365
    |> ClassData.map (Graph.add_edge (sub, sup))
haftmann@25618
   366
  end;
haftmann@25618
   367
haftmann@24218
   368
fun intro_classes_tac facts st =
haftmann@24218
   369
  let
haftmann@24218
   370
    val thy = Thm.theory_of_thm st;
haftmann@24218
   371
    val classes = Sign.all_classes thy;
haftmann@24218
   372
    val class_trivs = map (Thm.class_triv thy) classes;
haftmann@25618
   373
    val class_intros = map_filter (try (#intro o AxClass.get_info thy)) classes;
haftmann@25618
   374
    val assm_intros = these_assm_intros thy;
haftmann@24218
   375
  in
haftmann@25618
   376
    Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st
haftmann@24218
   377
  end;
haftmann@24218
   378
haftmann@24218
   379
fun default_intro_classes_tac [] = intro_classes_tac []
wenzelm@24930
   380
  | default_intro_classes_tac _ = no_tac;
haftmann@24218
   381
haftmann@24218
   382
fun default_tac rules ctxt facts =
haftmann@24218
   383
  HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
haftmann@24218
   384
    default_intro_classes_tac facts;
haftmann@24218
   385
haftmann@24218
   386
val _ = Context.add_setup (Method.add_methods
haftmann@24218
   387
 [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
haftmann@24218
   388
    "back-chain introduction rules of classes"),
haftmann@24218
   389
  ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
haftmann@24218
   390
    "apply some intro/elim rule")]);
haftmann@24218
   391
haftmann@24218
   392
haftmann@24589
   393
(** classes and class target **)
haftmann@24218
   394
haftmann@25002
   395
(* class context syntax *)
haftmann@24748
   396
haftmann@26238
   397
fun synchronize_class_syntax sups base_sort ctxt =
haftmann@24914
   398
  let
wenzelm@25344
   399
    val thy = ProofContext.theory_of ctxt;
haftmann@25368
   400
    fun subst_class_typ sort = map_atyps
haftmann@25368
   401
      (fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty');
haftmann@25083
   402
    val operations = these_operations thy sups;
haftmann@25368
   403
    val local_constraints =
haftmann@25368
   404
      (map o apsnd) (subst_class_typ base_sort o fst o snd) operations;
haftmann@25368
   405
    val global_constraints =
haftmann@25368
   406
      (map o apsnd) (fn (class, (ty, _)) => subst_class_typ [class] ty) operations;
wenzelm@25318
   407
    fun declare_const (c, _) =
wenzelm@25318
   408
      let val b = Sign.base_name c
wenzelm@25344
   409
      in Sign.intern_const thy b = c ? Variable.declare_const (b, c) end;
haftmann@26238
   410
    fun improve (c, ty) = (case AList.lookup (op =) local_constraints c
haftmann@26238
   411
     of SOME ty' => (case try (Type.raw_match (ty', ty)) Vartab.empty
haftmann@26238
   412
         of SOME tyenv => (case Vartab.lookup tyenv (Name.aT, 0)
haftmann@26238
   413
             of SOME (_, ty' as TVar (tvar as (vi, _))) =>
haftmann@26238
   414
                  if TypeInfer.is_param vi
haftmann@26238
   415
                    then SOME (ty', TFree (Name.aT, base_sort))
haftmann@26238
   416
                    else NONE
haftmann@26238
   417
              | _ => NONE)
haftmann@26238
   418
          | NONE => NONE)
haftmann@26238
   419
      | NONE => NONE)
haftmann@26238
   420
    fun subst (c, ty) = Option.map snd (AList.lookup (op =) operations c);
haftmann@25368
   421
    val unchecks = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) operations;
haftmann@25083
   422
  in
haftmann@25083
   423
    ctxt
haftmann@25368
   424
    |> fold declare_const local_constraints
haftmann@25368
   425
    |> fold (ProofContext.add_const_constraint o apsnd SOME) local_constraints
haftmann@26238
   426
    |> Overloading.map_improvable_syntax (K {
haftmann@25368
   427
        local_constraints = local_constraints,
haftmann@25368
   428
        global_constraints = global_constraints,
haftmann@26238
   429
        improve = improve,
haftmann@26238
   430
        subst = subst,
haftmann@25195
   431
        unchecks = unchecks,
haftmann@25083
   432
        passed = false
haftmann@26238
   433
      })
haftmann@25083
   434
  end;
haftmann@25083
   435
haftmann@25083
   436
fun refresh_syntax class ctxt =
haftmann@25002
   437
  let
haftmann@25002
   438
    val thy = ProofContext.theory_of ctxt;
haftmann@25062
   439
    val base_sort = (#base_sort o the_class_data thy) class;
haftmann@26238
   440
  in synchronize_class_syntax [class] base_sort ctxt end;
haftmann@25002
   441
wenzelm@25344
   442
fun init_ctxt sups base_sort ctxt =
haftmann@25083
   443
  ctxt
haftmann@25083
   444
  |> Variable.declare_term
haftmann@25083
   445
      (Logic.mk_type (TFree (Name.aT, base_sort)))
haftmann@26238
   446
  |> synchronize_class_syntax sups base_sort
haftmann@26238
   447
  |> Overloading.add_improvable_syntax;
haftmann@24901
   448
haftmann@25311
   449
fun init class thy =
haftmann@25311
   450
  thy
haftmann@25311
   451
  |> Locale.init class
wenzelm@25344
   452
  |> init_ctxt [class] ((#base_sort o the_class_data thy) class);
haftmann@24914
   453
haftmann@24748
   454
haftmann@24589
   455
(* class definition *)
haftmann@24218
   456
haftmann@24218
   457
local
haftmann@24218
   458
haftmann@24748
   459
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems =
haftmann@24218
   460
  let
haftmann@24748
   461
    val supclasses = map (prep_class thy) raw_supclasses;
haftmann@24748
   462
    val supsort = Sign.minimize_sort thy supclasses;
haftmann@25618
   463
    val sups = filter (is_class thy) supsort;
haftmann@25618
   464
    val base_sort = if null sups then supsort else
haftmann@26167
   465
      foldr1 (Sorts.inter_sort (Sign.classes_of thy))
haftmann@26167
   466
        (map (#base_sort o the_class_data thy) sups);
haftmann@25038
   467
    val suplocales = map Locale.Locale sups;
haftmann@24748
   468
    val (raw_elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e)
haftmann@24748
   469
      | Locale.Expr i => apsnd (cons (prep_expr thy i))) raw_includes_elems ([], []);
haftmann@24748
   470
    val supexpr = Locale.Merge suplocales;
haftmann@24748
   471
    val supparams = (map fst o Locale.parameters_of_expr thy) supexpr;
haftmann@24748
   472
    val mergeexpr = Locale.Merge (suplocales @ includes);
haftmann@24748
   473
    val constrain = Element.Constrains ((map o apsnd o map_atyps)
haftmann@26167
   474
      (K (TFree (Name.aT, base_sort))) supparams);
haftmann@25683
   475
    fun fork_syn (Element.Fixes xs) =
haftmann@25683
   476
          fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs
haftmann@25683
   477
          #>> Element.Fixes
haftmann@25683
   478
      | fork_syn x = pair x;
haftmann@25683
   479
    fun fork_syntax elems =
haftmann@25683
   480
      let
haftmann@25683
   481
        val (elems', global_syntax) = fold_map fork_syn elems [];
haftmann@25683
   482
      in (if null includes (*FIXME*) then constrain :: elems' else elems', global_syntax) end;
haftmann@25683
   483
    val (elems, global_syntax) =
haftmann@25683
   484
      ProofContext.init thy
haftmann@25683
   485
      |> Locale.cert_expr supexpr [constrain]
haftmann@25683
   486
      |> snd
haftmann@25683
   487
      |> init_ctxt sups base_sort
haftmann@25683
   488
      |> process_expr Locale.empty raw_elems
haftmann@25683
   489
      |> fst
haftmann@25683
   490
      |> fork_syntax
haftmann@25683
   491
  in (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) end;
haftmann@24748
   492
haftmann@24748
   493
val read_class_spec = gen_class_spec Sign.intern_class Locale.intern_expr Locale.read_expr;
haftmann@24748
   494
val check_class_spec = gen_class_spec (K I) (K I) Locale.cert_expr;
haftmann@24748
   495
haftmann@25683
   496
fun adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts thy =
wenzelm@24968
   497
  let
haftmann@25683
   498
    val supconsts = map fst supparams
haftmann@25683
   499
      |> AList.make (the o AList.lookup (op =) (these_params thy sups))
haftmann@25683
   500
      |> (map o apsnd o apsnd o map_atyps o K o TFree) (Name.aT, [class]);
haftmann@25683
   501
    val all_params = map fst (Locale.parameters_of thy class);
haftmann@25683
   502
    fun add_const (v, raw_ty) thy =
haftmann@25683
   503
      let
haftmann@25683
   504
        val c = Sign.full_name thy v;
haftmann@25683
   505
        val ty = map_atyps (K (TFree (Name.aT, base_sort))) raw_ty;
haftmann@25683
   506
        val ty0 = Type.strip_sorts ty;
haftmann@25683
   507
        val ty' = map_atyps (K (TFree (Name.aT, [class]))) ty0;
haftmann@25683
   508
        val syn = (the_default NoSyn o AList.lookup (op =) global_syntax) v;
haftmann@25683
   509
      in
haftmann@25683
   510
        thy
haftmann@25683
   511
        |> Sign.declare_const [] (v, ty0, syn)
haftmann@25683
   512
        |> snd
haftmann@25683
   513
        |> pair ((v, ty), (c, ty'))
haftmann@25683
   514
      end;
haftmann@25683
   515
    fun add_consts raw_params thy =
haftmann@25683
   516
      thy
haftmann@25683
   517
      |> Sign.add_path (Logic.const_of_class bname)
haftmann@25683
   518
      |> fold_map add_const raw_params
haftmann@25683
   519
      ||> Sign.restore_naming thy
haftmann@25683
   520
      |-> (fn params => pair (supconsts @ (map o apfst) fst params, params));
haftmann@25683
   521
    fun globalize param_map = map_aterms
haftmann@25683
   522
      (fn Free (v, ty) => Const ((fst o the o AList.lookup (op =) param_map) v, ty)
haftmann@25683
   523
        | t => t);
haftmann@25683
   524
    val raw_pred = Locale.intros thy class
haftmann@25683
   525
      |> fst
haftmann@25683
   526
      |> map (Logic.unvarify o Logic.strip_imp_concl o Thm.prop_of);
haftmann@25683
   527
    fun get_axiom thy = case (#axioms o AxClass.get_info thy) class
haftmann@25683
   528
     of [] => NONE
haftmann@25683
   529
      | [thm] => SOME thm;
wenzelm@24968
   530
  in
wenzelm@24968
   531
    thy
haftmann@25683
   532
    |> add_consts ((snd o chop (length supparams)) all_params)
haftmann@25683
   533
    |-> (fn (param_map, params) => AxClass.define_class (bname, supsort)
haftmann@25683
   534
          (map (fst o snd) params @ other_consts)
haftmann@25683
   535
          [((bname ^ "_" ^ AxClass.axiomsN, []), map (globalize param_map) raw_pred)]
haftmann@25683
   536
    #> snd
haftmann@25683
   537
    #> `get_axiom
haftmann@25683
   538
    #-> (fn assm_axiom => fold (Sign.add_const_constraint o apsnd SOME o snd) params
haftmann@25683
   539
    #> pair (param_map, params, assm_axiom)))
wenzelm@24968
   540
  end;
wenzelm@24968
   541
haftmann@25002
   542
fun gen_class prep_spec prep_param bname
haftmann@24748
   543
    raw_supclasses raw_includes_elems raw_other_consts thy =
haftmann@24748
   544
  let
haftmann@25038
   545
    val class = Sign.full_name thy bname;
haftmann@25683
   546
    val (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) =
haftmann@24748
   547
      prep_spec thy raw_supclasses raw_includes_elems;
wenzelm@24968
   548
    val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts;
haftmann@24218
   549
  in
haftmann@24218
   550
    thy
haftmann@24748
   551
    |> Locale.add_locale_i (SOME "") bname mergeexpr elems
haftmann@25038
   552
    |> snd
haftmann@25311
   553
    |> ProofContext.theory_of
haftmann@25683
   554
    |> adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts
haftmann@25683
   555
    |-> (fn (param_map, params, assm_axiom) =>
haftmann@25683
   556
         `(fn thy => calculate thy sups base_sort assm_axiom param_map class)
haftmann@25711
   557
    #-> (fn (morphism, axiom, assm_intro, of_class) =>
haftmann@25683
   558
        add_class_data ((class, sups), (params, base_sort,
haftmann@25711
   559
          map snd param_map, morphism, axiom, assm_intro, of_class))
haftmann@25683
   560
    #> class_interpretation class (the_list axiom) []))
haftmann@25268
   561
    |> init class
haftmann@25038
   562
    |> pair class
haftmann@24218
   563
  end;
haftmann@24218
   564
wenzelm@25326
   565
fun read_const thy = #1 o Term.dest_Const o ProofContext.read_const (ProofContext.init thy);
wenzelm@25326
   566
haftmann@24218
   567
in
haftmann@24218
   568
wenzelm@25326
   569
val class_cmd = gen_class read_class_spec read_const;
haftmann@24748
   570
val class = gen_class check_class_spec (K I);
haftmann@24218
   571
haftmann@24218
   572
end; (*local*)
haftmann@24218
   573
haftmann@24218
   574
haftmann@25485
   575
(* class target *)
haftmann@24218
   576
haftmann@25603
   577
fun declare class pos ((c, mx), dict) thy =
haftmann@24218
   578
  let
wenzelm@25024
   579
    val prfx = class_prefix class;
wenzelm@25024
   580
    val thy' = thy |> Sign.add_path prfx;
haftmann@25711
   581
    val phi = partial_morphism thy' class;
wenzelm@25024
   582
haftmann@25062
   583
    val c' = Sign.full_name thy' c;
haftmann@25239
   584
    val dict' = Morphism.term phi dict;
haftmann@25239
   585
    val dict_def = map_types Logic.unvarifyT dict';
haftmann@25239
   586
    val ty' = Term.fastype_of dict_def;
haftmann@25083
   587
    val ty'' = Type.strip_sorts ty';
haftmann@25239
   588
    val def_eq = Logic.mk_equals (Const (c', ty'), dict_def);
haftmann@25618
   589
    fun get_axiom thy = ((Thm.varifyT o Thm.symmetric o Thm.get_axiom_i thy) c', thy);
haftmann@24218
   590
  in
wenzelm@25024
   591
    thy'
haftmann@25096
   592
    |> Sign.declare_const pos (c, ty'', mx) |> snd
haftmann@25518
   593
    |> Thm.add_def false false (c, def_eq)
haftmann@25062
   594
    |>> Thm.symmetric
haftmann@25618
   595
    ||>> get_axiom
haftmann@25618
   596
    |-> (fn (def, def') => class_interpretation class [def] [Thm.prop_of def]
haftmann@25618
   597
          #> register_operation class (c', (dict', SOME def')))
haftmann@24218
   598
    |> Sign.restore_naming thy
haftmann@25083
   599
    |> Sign.add_const_constraint (c', SOME ty')
haftmann@24218
   600
  end;
haftmann@24218
   601
haftmann@25603
   602
fun abbrev class prmode pos ((c, mx), rhs) thy =
haftmann@24836
   603
  let
wenzelm@25024
   604
    val prfx = class_prefix class;
haftmann@25096
   605
    val thy' = thy |> Sign.add_path prfx;
haftmann@25062
   606
    val phi = morphism thy class;
haftmann@25062
   607
haftmann@25096
   608
    val c' = Sign.full_name thy' c;
haftmann@25711
   609
    val rhs' = Morphism.term phi rhs;
haftmann@25239
   610
    val ty' = Logic.unvarifyT (Term.fastype_of rhs');
haftmann@24836
   611
  in
haftmann@25096
   612
    thy'
haftmann@25146
   613
    |> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') |> snd
haftmann@25096
   614
    |> Sign.add_const_constraint (c', SOME ty')
wenzelm@25024
   615
    |> Sign.notation true prmode [(Const (c', ty'), mx)]
haftmann@25368
   616
    |> register_operation class (c', (rhs', NONE))
haftmann@25096
   617
    |> Sign.restore_naming thy
haftmann@24836
   618
  end;
haftmann@24836
   619
haftmann@25462
   620
haftmann@25462
   621
(** instantiation target **)
haftmann@25462
   622
haftmann@25462
   623
(* bookkeeping *)
haftmann@25462
   624
haftmann@25462
   625
datatype instantiation = Instantiation of {
haftmann@25864
   626
  arities: string list * (string * sort) list * sort,
haftmann@25462
   627
  params: ((string * string) * (string * typ)) list
haftmann@25603
   628
    (*(instantiation parameter, type constructor), (local instantiation parameter, typ)*)
haftmann@25462
   629
}
haftmann@25462
   630
haftmann@25462
   631
structure Instantiation = ProofDataFun
haftmann@25462
   632
(
haftmann@25462
   633
  type T = instantiation
haftmann@25536
   634
  fun init _ = Instantiation { arities = ([], [], []), params = [] };
haftmann@25462
   635
);
haftmann@25462
   636
haftmann@25485
   637
fun mk_instantiation (arities, params) =
haftmann@25485
   638
  Instantiation { arities = arities, params = params };
haftmann@25514
   639
fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy)
haftmann@25485
   640
 of Instantiation data => data;
haftmann@25514
   641
fun map_instantiation f = (LocalTheory.target o Instantiation.map)
haftmann@25514
   642
  (fn Instantiation { arities, params } => mk_instantiation (f (arities, params)));
haftmann@25462
   643
haftmann@25514
   644
fun the_instantiation lthy = case get_instantiation lthy
haftmann@25536
   645
 of { arities = ([], [], []), ... } => error "No instantiation target"
haftmann@25485
   646
  | data => data;
haftmann@25462
   647
haftmann@25485
   648
val instantiation_params = #params o get_instantiation;
haftmann@25462
   649
haftmann@25514
   650
fun instantiation_param lthy v = instantiation_params lthy
haftmann@25462
   651
  |> find_first (fn (_, (v', _)) => v = v')
haftmann@25462
   652
  |> Option.map (fst o fst);
haftmann@25462
   653
haftmann@25462
   654
haftmann@25462
   655
(* syntax *)
haftmann@25462
   656
haftmann@26238
   657
fun synchronize_inst_syntax ctxt =
haftmann@25462
   658
  let
haftmann@26238
   659
    val Instantiation { arities = (_, _, sorts), params = params } = Instantiation.get ctxt;
haftmann@26238
   660
    val thy = ProofContext.theory_of ctxt;
haftmann@26238
   661
    val operations = these_operations thy sorts;
haftmann@26238
   662
    fun subst_class_typ sort = map_atyps
haftmann@26238
   663
      (fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty');
haftmann@26238
   664
    val local_constraints =
haftmann@26238
   665
      (map o apsnd) (subst_class_typ [] o fst o snd) operations;
haftmann@26238
   666
    val global_constraints = map_filter (fn (c, (class, (ty, _))) =>
haftmann@26238
   667
      if exists (fn ((c', _), _) => c = c') params
haftmann@26238
   668
        then SOME (c, subst_class_typ [class] ty)
haftmann@26238
   669
        else NONE) operations;
haftmann@26238
   670
    fun improve (c, ty) = case AxClass.inst_tyco_of thy (c, ty)
haftmann@25711
   671
         of SOME tyco => (case AList.lookup (op =) params (c, tyco)
haftmann@26238
   672
             of SOME (_, ty') => SOME (ty, ty')
haftmann@26238
   673
              | NONE => NONE)
haftmann@26238
   674
          | NONE => NONE;
haftmann@26238
   675
          (*| NONE => (case map_filter
haftmann@26238
   676
               (fn ((c', _), (_, ty')) => if c' = c then SOME ty' else NONE) params
haftmann@26238
   677
             of [ty'] => (case Sign.const_typargs thy (c, ty)
haftmann@26238
   678
                 of [TVar (vi, _)] => if TypeInfer.is_param vi then SOME (ty, ty') else NONE
haftmann@26238
   679
                  | _ => NONE)
haftmann@26238
   680
              | _ => NONE*);
haftmann@26238
   681
    fun subst (c, ty) = case AxClass.inst_tyco_of thy (c, ty)
haftmann@26238
   682
         of SOME tyco => (case AList.lookup (op =) params (c, tyco)
haftmann@26238
   683
             of SOME (v_ty as (_, ty)) => SOME (ty, Free v_ty)
haftmann@26238
   684
              | NONE => NONE)
haftmann@26238
   685
          | NONE => NONE;
haftmann@26238
   686
    val unchecks =
haftmann@26238
   687
      map (fn ((c, _), v_ty as (_, ty)) => (Free v_ty, Const (c, ty))) params;
haftmann@26238
   688
  in
haftmann@26238
   689
    ctxt
haftmann@26238
   690
    |> fold (ProofContext.add_const_constraint o apsnd SOME) local_constraints
haftmann@26238
   691
    |> Overloading.map_improvable_syntax (K {
haftmann@26238
   692
        local_constraints = local_constraints,
haftmann@26238
   693
        global_constraints = global_constraints,
haftmann@26238
   694
        improve = improve,
haftmann@26238
   695
        subst = subst,
haftmann@26238
   696
        unchecks = unchecks,
haftmann@26238
   697
        passed = false
haftmann@26238
   698
      })
haftmann@26238
   699
  end;
haftmann@25462
   700
haftmann@25462
   701
haftmann@25462
   702
(* target *)
haftmann@25462
   703
haftmann@25485
   704
val sanatize_name = (*FIXME*)
haftmann@25485
   705
  let
haftmann@25574
   706
    fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s
haftmann@25574
   707
      orelse s = "'" orelse s = "_";
haftmann@25485
   708
    val is_junk = not o is_valid andf Symbol.is_regular;
haftmann@25485
   709
    val junk = Scan.many is_junk;
haftmann@25485
   710
    val scan_valids = Symbol.scanner "Malformed input"
haftmann@25485
   711
      ((junk |--
haftmann@25485
   712
        (Scan.optional (Scan.one Symbol.is_ascii_letter) "x" ^^ (Scan.many is_valid >> implode)
haftmann@25485
   713
        --| junk))
wenzelm@25999
   714
      ::: Scan.repeat ((Scan.many1 is_valid >> implode) --| junk));
haftmann@25485
   715
  in
haftmann@25485
   716
    explode #> scan_valids #> implode
haftmann@25485
   717
  end;
haftmann@25485
   718
haftmann@25864
   719
fun init_instantiation (tycos, vs, sort) thy =
haftmann@25462
   720
  let
haftmann@25536
   721
    val _ = if null tycos then error "At least one arity must be given" else ();
haftmann@25536
   722
    val _ = map (the_class_data thy) sort;
haftmann@25485
   723
    fun type_name "*" = "prod"
haftmann@25485
   724
      | type_name "+" = "sum"
haftmann@25485
   725
      | type_name s = sanatize_name (NameSpace.base s); (*FIXME*)
haftmann@25597
   726
    fun get_param tyco (param, (c, ty)) = if can (AxClass.param_of_inst thy) (c, tyco)
haftmann@25603
   727
      then NONE else SOME ((c, tyco),
haftmann@25864
   728
        (param ^ "_" ^ type_name tyco, map_atyps (K (Type (tyco, map TFree vs))) ty));
haftmann@25536
   729
    val params = map_product get_param tycos (these_params thy sort) |> map_filter I;
haftmann@25485
   730
  in
haftmann@25485
   731
    thy
haftmann@25485
   732
    |> ProofContext.init
haftmann@25864
   733
    |> Instantiation.put (mk_instantiation ((tycos, vs, sort), params))
haftmann@25864
   734
    |> fold (Variable.declare_term o Logic.mk_type o TFree) vs
haftmann@25574
   735
    |> fold (Variable.declare_names o Free o snd) params
haftmann@26238
   736
    |> synchronize_inst_syntax
haftmann@26238
   737
    |> Overloading.add_improvable_syntax
haftmann@25485
   738
  end;
haftmann@25485
   739
haftmann@26238
   740
fun confirm_declaration c = (map_instantiation o apsnd)
haftmann@26238
   741
  (filter_out (fn (_, (c', _)) => c' = c))
haftmann@26238
   742
  #> LocalTheory.target synchronize_inst_syntax
haftmann@26238
   743
haftmann@25485
   744
fun gen_instantiation_instance do_proof after_qed lthy =
haftmann@25485
   745
  let
haftmann@25864
   746
    val (tycos, vs, sort) = (#arities o the_instantiation) lthy;
haftmann@25864
   747
    val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, map snd vs, sort)) tycos;
haftmann@25462
   748
    fun after_qed' results =
haftmann@25462
   749
      LocalTheory.theory (fold (AxClass.add_arity o Thm.varifyT) results)
haftmann@25462
   750
      #> after_qed;
haftmann@25462
   751
  in
haftmann@25462
   752
    lthy
haftmann@25462
   753
    |> do_proof after_qed' arities_proof
haftmann@25462
   754
  end;
haftmann@25462
   755
haftmann@25485
   756
val instantiation_instance = gen_instantiation_instance (fn after_qed => fn ts =>
haftmann@25462
   757
  Proof.theorem_i NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts));
haftmann@25462
   758
haftmann@25485
   759
fun prove_instantiation_instance tac = gen_instantiation_instance (fn after_qed =>
haftmann@25502
   760
  fn ts => fn lthy => after_qed (map (fn t => Goal.prove lthy [] [] t
haftmann@25502
   761
    (fn {context, ...} => tac context)) ts) lthy) I;
haftmann@25462
   762
haftmann@25462
   763
fun conclude_instantiation lthy =
haftmann@25462
   764
  let
haftmann@25485
   765
    val { arities, params } = the_instantiation lthy;
haftmann@25864
   766
    val (tycos, vs, sort) = arities;
haftmann@25462
   767
    val thy = ProofContext.theory_of lthy;
haftmann@25597
   768
    val _ = map (fn tyco => if Sign.of_sort thy
haftmann@25864
   769
        (Type (tyco, map TFree vs), sort)
haftmann@25462
   770
      then () else error ("Missing instance proof for type " ^ quote (Sign.extern_type thy tyco)))
haftmann@25597
   771
        tycos;
haftmann@25770
   772
    (*this checkpoint should move to AxClass as soon as "attach" has disappeared*)
haftmann@25770
   773
    val _ = case map (fst o snd) params
haftmann@25770
   774
     of [] => ()
haftmann@25770
   775
      | cs => Output.legacy_feature
haftmann@25829
   776
          ("Missing specifications for overloaded parameters " ^ commas_quote cs)
haftmann@25597
   777
  in lthy end;
haftmann@25462
   778
haftmann@25603
   779
fun pretty_instantiation lthy =
haftmann@25603
   780
  let
haftmann@25603
   781
    val { arities, params } = the_instantiation lthy;
haftmann@25864
   782
    val (tycos, vs, sort) = arities;
haftmann@25603
   783
    val thy = ProofContext.theory_of lthy;
haftmann@25864
   784
    fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, map snd vs, sort);
haftmann@25603
   785
    fun pr_param ((c, _), (v, ty)) =
haftmann@25864
   786
      (Pretty.block o Pretty.breaks) [Pretty.str v, Pretty.str "==",
haftmann@25864
   787
        (Pretty.str o Sign.extern_const thy) c, Pretty.str "::", Sign.pretty_typ thy ty];
haftmann@25603
   788
  in
haftmann@25603
   789
    (Pretty.block o Pretty.fbreaks)
haftmann@25603
   790
      (Pretty.str "instantiation" :: map pr_arity tycos @ map pr_param params)
haftmann@25603
   791
  end;
haftmann@25603
   792
haftmann@24218
   793
end;
haftmann@25683
   794