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