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