src/Pure/Isar/class.ML
author wenzelm
Fri Mar 28 20:02:04 2008 +0100 (2008-03-28)
changeset 26463 9283b4185fdf
parent 26435 bdce320cd426
child 26470 e44d24620515
permissions -rw-r--r--
Context.>> : operate on Context.generic;
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@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@24218
   187
        (map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names
haftmann@24218
   188
      end;
haftmann@24218
   189
  in maps params o ancestry thy end;
haftmann@24218
   190
haftmann@24657
   191
fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy;
haftmann@24218
   192
haftmann@25711
   193
fun partial_morphism thy class = #morphism (the_class_data thy class) thy [];
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@25239
   255
    val prep_typ = map_atyps
haftmann@25368
   256
      (fn TVar (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@25683
   276
    val subst_typ = map_atyps (fn TFree (v, sort) =>
haftmann@25683
   277
          if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort)
haftmann@25683
   278
      | ty => ty);
haftmann@25683
   279
    fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) param_map v
haftmann@25062
   280
         of SOME (c, _) => Const (c, ty)
haftmann@25062
   281
          | NONE => t)
haftmann@25062
   282
      | subst_aterm t = t;
haftmann@25711
   283
    fun instantiate thy sort = Thm.instantiate ([pairself (Thm.ctyp_of thy o TVar o pair (Name.aT, 0))
haftmann@25711
   284
      (base_sort, sort)], map (fn (v, (c, ty)) => pairself (Thm.cterm_of thy)
haftmann@25711
   285
        (Var ((v, 0), map_atyps (fn _ => TVar ((Name.aT, 0), sort)) ty),
haftmann@25711
   286
          Const (c, map_atyps (fn _ => TVar ((Name.aT, 0), sort)) ty))) param_map);
haftmann@25711
   287
    val instantiate_base_sort = instantiate thy base_sort;
haftmann@25711
   288
    val instantiate_class = instantiate thy [class];
haftmann@25683
   289
    val (proto_assm_intro, locale_intro) = Locale.intros thy class
haftmann@25683
   290
      |> pairself (try the_single);
haftmann@25683
   291
    val axiom_premises = map_filter (#axiom o the_class_data thy) sups
haftmann@25683
   292
      @ the_list assm_axiom;
haftmann@25711
   293
    val axiom = locale_intro
haftmann@25711
   294
      |> Option.map (Drule.standard o (fn thm => thm OF axiom_premises) o instantiate_class)
haftmann@25711
   295
      |> (fn x as SOME _ => x | NONE => assm_axiom);
haftmann@25711
   296
    val lift_axiom = case axiom
haftmann@25711
   297
     of SOME axiom => (fn thm => Thm.implies_elim thm axiom)
haftmann@25683
   298
      | NONE => I;
haftmann@25062
   299
haftmann@25711
   300
    (*dynamic parts of morphism*)
haftmann@25711
   301
    fun rew_term thy defs = Pattern.rewrite_term thy
haftmann@25711
   302
      (map (Logic.dest_equals o Thm.prop_of) defs) [];
haftmann@25711
   303
    fun subst_term thy defs = map_aterms subst_aterm #> rew_term thy defs
haftmann@25711
   304
      #> map_types subst_typ;
haftmann@25711
   305
    fun subst_thm defs = Drule.standard' #> instantiate_class #> lift_axiom
haftmann@25711
   306
      #> MetaSimplifier.rewrite_rule defs;
wenzelm@26463
   307
    fun morphism thy defs =
haftmann@25711
   308
      Morphism.typ_morphism subst_typ
haftmann@25711
   309
      $> Morphism.term_morphism (subst_term thy defs)
haftmann@25711
   310
      $> Morphism.thm_morphism (subst_thm defs);
haftmann@25711
   311
haftmann@25711
   312
    (*class rules*)
haftmann@25711
   313
    val defs = these_defs thy sups;
haftmann@25618
   314
    val assm_intro = proto_assm_intro
haftmann@25711
   315
      |> Option.map instantiate_base_sort
haftmann@25711
   316
      |> Option.map (MetaSimplifier.rewrite_rule defs)
haftmann@25668
   317
      |> Option.map Goal.close_result;
haftmann@26247
   318
    val class_intro = (#intro o AxClass.get_info thy) class;
haftmann@25711
   319
    val fixate = Thm.instantiate
haftmann@25711
   320
      (map (pairself (Thm.ctyp_of thy)) [(TVar ((Name.aT, 0), []), TFree (Name.aT, base_sort)),
haftmann@25711
   321
        (TVar ((Name.aT, 0), base_sort), TFree (Name.aT, base_sort))], [])
haftmann@25618
   322
    val of_class_sups = if null sups
haftmann@25711
   323
      then map (fixate o Thm.class_triv thy) base_sort
haftmann@25711
   324
      else map (fixate o #of_class o the_class_data thy) sups;
haftmann@25683
   325
    val locale_dests = map Drule.standard' (Locale.dests thy class);
haftmann@25711
   326
    val num_trivs = case length locale_dests
haftmann@25711
   327
     of 0 => if is_none axiom then 0 else 1
haftmann@25711
   328
      | n => n;
haftmann@25711
   329
    val pred_trivs = if num_trivs = 0 then []
haftmann@25711
   330
      else the axiom
haftmann@25711
   331
        |> Thm.prop_of
haftmann@25711
   332
        |> (map_types o map_atyps o K) (TFree (Name.aT, base_sort))
haftmann@25711
   333
        |> (Thm.assume o Thm.cterm_of thy)
haftmann@25711
   334
        |> replicate num_trivs;
haftmann@26247
   335
    val of_class = (fixate class_intro OF of_class_sups OF locale_dests OF pred_trivs)
haftmann@25711
   336
      |> Drule.standard'
haftmann@25668
   337
      |> Goal.close_result;
haftmann@26247
   338
    val this_intro = assm_intro |> the_default class_intro;
haftmann@26247
   339
  in
haftmann@26247
   340
    thy
haftmann@26247
   341
    |> Sign.sticky_prefix (class_prefix class ^ "_" ^ AxClass.axiomsN)
haftmann@26247
   342
    |> PureThy.note Thm.internalK (AxClass.introN, this_intro)
haftmann@26247
   343
    |> snd
haftmann@26247
   344
    |> Sign.restore_naming thy
haftmann@26247
   345
    |> pair (morphism, axiom, assm_intro, of_class)
haftmann@26247
   346
  end;
haftmann@24589
   347
haftmann@24589
   348
fun class_interpretation class facts defs thy =
haftmann@24589
   349
  let
haftmann@25038
   350
    val params = these_params thy [class];
haftmann@26238
   351
    val consts = map (fst o snd) params;
haftmann@26238
   352
    val constraints = map (fn c => map_atyps (K (TFree (Name.aT,
haftmann@26238
   353
      [the (AxClass.class_of_param thy c)]))) (Sign.the_const_type thy c)) consts;
haftmann@26238
   354
    val no_constraints = map (map_atyps (K (TFree (Name.aT, [])))) constraints;
haftmann@26238
   355
    fun add_constraint c T = Sign.add_const_constraint (c, SOME T);
haftmann@25083
   356
    val inst = (#inst o the_class_data thy) class;
wenzelm@25020
   357
    val tac = ALLGOALS (ProofContext.fact_tac facts);
haftmann@25038
   358
    val prfx = class_prefix class;
haftmann@24589
   359
  in
haftmann@25038
   360
    thy
haftmann@26238
   361
    |> fold2 add_constraint consts no_constraints
haftmann@26238
   362
    |> prove_interpretation tac ((false, prfx), []) (Locale.Locale class)
ballarin@25094
   363
          (inst, map (fn def => (("", []), def)) defs)
haftmann@26238
   364
    |> fold2 add_constraint consts constraints
haftmann@24589
   365
  end;
haftmann@24218
   366
haftmann@25618
   367
fun prove_subclass (sub, sup) thm thy =
haftmann@25618
   368
  let
haftmann@25711
   369
    val of_class = (#of_class o the_class_data thy) sup;
haftmann@25683
   370
    val intro = Drule.standard' (of_class OF [Drule.standard' thm]);
haftmann@25618
   371
    val classrel = intro OF (the_list o #axiom o the_class_data thy) sub;
haftmann@25618
   372
  in
haftmann@25618
   373
    thy
haftmann@25618
   374
    |> AxClass.add_classrel classrel
haftmann@25618
   375
    |> prove_interpretation_in (ALLGOALS (ProofContext.fact_tac [thm]))
haftmann@25618
   376
         I (sub, Locale.Locale sup)
haftmann@25618
   377
    |> ClassData.map (Graph.add_edge (sub, sup))
haftmann@25618
   378
  end;
haftmann@25618
   379
haftmann@24218
   380
fun intro_classes_tac facts st =
haftmann@24218
   381
  let
haftmann@24218
   382
    val thy = Thm.theory_of_thm st;
haftmann@24218
   383
    val classes = Sign.all_classes thy;
haftmann@24218
   384
    val class_trivs = map (Thm.class_triv thy) classes;
haftmann@25618
   385
    val class_intros = map_filter (try (#intro o AxClass.get_info thy)) classes;
haftmann@25618
   386
    val assm_intros = these_assm_intros thy;
haftmann@24218
   387
  in
haftmann@25618
   388
    Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st
haftmann@24218
   389
  end;
haftmann@24218
   390
haftmann@24218
   391
fun default_intro_classes_tac [] = intro_classes_tac []
wenzelm@24930
   392
  | default_intro_classes_tac _ = no_tac;
haftmann@24218
   393
haftmann@24218
   394
fun default_tac rules ctxt facts =
haftmann@24218
   395
  HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
haftmann@24218
   396
    default_intro_classes_tac facts;
haftmann@24218
   397
wenzelm@26463
   398
val _ = Context.>> (Context.map_theory
wenzelm@26463
   399
  (Method.add_methods
wenzelm@26463
   400
   [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
wenzelm@26463
   401
      "back-chain introduction rules of classes"),
wenzelm@26463
   402
    ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
wenzelm@26463
   403
      "apply some intro/elim rule")]));
wenzelm@26463
   404
haftmann@24218
   405
haftmann@24218
   406
haftmann@24589
   407
(** classes and class target **)
haftmann@24218
   408
haftmann@25002
   409
(* class context syntax *)
haftmann@24748
   410
haftmann@26238
   411
fun synchronize_class_syntax sups base_sort ctxt =
haftmann@24914
   412
  let
wenzelm@25344
   413
    val thy = ProofContext.theory_of ctxt;
haftmann@25368
   414
    fun subst_class_typ sort = map_atyps
haftmann@25368
   415
      (fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty');
haftmann@25083
   416
    val operations = these_operations thy sups;
haftmann@25368
   417
    val local_constraints =
haftmann@25368
   418
      (map o apsnd) (subst_class_typ base_sort o fst o snd) operations;
haftmann@25368
   419
    val global_constraints =
haftmann@25368
   420
      (map o apsnd) (fn (class, (ty, _)) => subst_class_typ [class] ty) operations;
wenzelm@25318
   421
    fun declare_const (c, _) =
wenzelm@25318
   422
      let val b = Sign.base_name c
wenzelm@25344
   423
      in Sign.intern_const thy b = c ? Variable.declare_const (b, c) end;
haftmann@26238
   424
    fun improve (c, ty) = (case AList.lookup (op =) local_constraints c
haftmann@26238
   425
     of SOME ty' => (case try (Type.raw_match (ty', ty)) Vartab.empty
haftmann@26238
   426
         of SOME tyenv => (case Vartab.lookup tyenv (Name.aT, 0)
haftmann@26238
   427
             of SOME (_, ty' as TVar (tvar as (vi, _))) =>
haftmann@26238
   428
                  if TypeInfer.is_param vi
haftmann@26238
   429
                    then SOME (ty', TFree (Name.aT, base_sort))
haftmann@26238
   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@25368
   438
    |> fold declare_const local_constraints
haftmann@26247
   439
    |> Overloading.map_improvable_syntax (K (((local_constraints, global_constraints),
haftmann@26247
   440
        ((improve, subst), unchecks)), false))
haftmann@26259
   441
    |> Overloading.set_local_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@25683
   502
fun adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts thy =
wenzelm@24968
   503
  let
haftmann@25683
   504
    val supconsts = map fst supparams
haftmann@25683
   505
      |> AList.make (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@25683
   540
          (map (fst o snd) params @ other_consts)
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@25002
   548
fun gen_class prep_spec prep_param bname
haftmann@26247
   549
    raw_supclasses raw_elems raw_other_consts thy =
haftmann@24748
   550
  let
haftmann@25038
   551
    val class = Sign.full_name thy bname;
haftmann@25683
   552
    val (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) =
haftmann@26247
   553
      prep_spec thy raw_supclasses raw_elems;
wenzelm@24968
   554
    val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts;
haftmann@24218
   555
  in
haftmann@24218
   556
    thy
haftmann@24748
   557
    |> Locale.add_locale_i (SOME "") bname mergeexpr elems
haftmann@25038
   558
    |> snd
haftmann@25311
   559
    |> ProofContext.theory_of
haftmann@25683
   560
    |> adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts
haftmann@25683
   561
    |-> (fn (param_map, params, assm_axiom) =>
haftmann@26247
   562
        calculate sups base_sort assm_axiom param_map class
haftmann@25711
   563
    #-> (fn (morphism, axiom, assm_intro, of_class) =>
haftmann@25683
   564
        add_class_data ((class, sups), (params, base_sort,
haftmann@25711
   565
          map snd param_map, morphism, axiom, assm_intro, of_class))
haftmann@25683
   566
    #> class_interpretation class (the_list axiom) []))
haftmann@25268
   567
    |> init class
haftmann@25038
   568
    |> pair class
haftmann@24218
   569
  end;
haftmann@24218
   570
wenzelm@25326
   571
fun read_const thy = #1 o Term.dest_Const o ProofContext.read_const (ProofContext.init thy);
wenzelm@25326
   572
haftmann@24218
   573
in
haftmann@24218
   574
wenzelm@25326
   575
val class_cmd = gen_class read_class_spec read_const;
haftmann@24748
   576
val class = gen_class check_class_spec (K I);
haftmann@24218
   577
haftmann@24218
   578
end; (*local*)
haftmann@24218
   579
haftmann@24218
   580
haftmann@25485
   581
(* class target *)
haftmann@24218
   582
haftmann@25603
   583
fun declare class pos ((c, mx), dict) thy =
haftmann@24218
   584
  let
wenzelm@25024
   585
    val prfx = class_prefix class;
wenzelm@25024
   586
    val thy' = thy |> Sign.add_path prfx;
haftmann@25711
   587
    val phi = partial_morphism thy' class;
wenzelm@25024
   588
haftmann@25062
   589
    val c' = Sign.full_name thy' c;
haftmann@25239
   590
    val dict' = Morphism.term phi dict;
haftmann@25239
   591
    val dict_def = map_types Logic.unvarifyT dict';
haftmann@25239
   592
    val ty' = Term.fastype_of dict_def;
haftmann@25083
   593
    val ty'' = Type.strip_sorts ty';
haftmann@25239
   594
    val def_eq = Logic.mk_equals (Const (c', ty'), dict_def);
haftmann@26247
   595
    fun get_axiom thy = ((Thm.varifyT o Thm.get_axiom_i thy) c', thy);
haftmann@24218
   596
  in
wenzelm@25024
   597
    thy'
haftmann@25096
   598
    |> Sign.declare_const pos (c, ty'', mx) |> snd
haftmann@25518
   599
    |> Thm.add_def false false (c, def_eq)
haftmann@25062
   600
    |>> Thm.symmetric
haftmann@25618
   601
    ||>> get_axiom
haftmann@25618
   602
    |-> (fn (def, def') => class_interpretation class [def] [Thm.prop_of def]
haftmann@26247
   603
      #> register_operation class (c', (dict', SOME (Thm.symmetric def')))
haftmann@26353
   604
      #> PureThy.note Thm.internalK (c ^ "_raw", def')
haftmann@26247
   605
      #> snd)
haftmann@24218
   606
    |> Sign.restore_naming thy
haftmann@25083
   607
    |> Sign.add_const_constraint (c', SOME ty')
haftmann@24218
   608
  end;
haftmann@24218
   609
haftmann@25603
   610
fun abbrev class prmode pos ((c, mx), rhs) thy =
haftmann@24836
   611
  let
wenzelm@25024
   612
    val prfx = class_prefix class;
haftmann@25096
   613
    val thy' = thy |> Sign.add_path prfx;
haftmann@25062
   614
    val phi = morphism thy class;
haftmann@25062
   615
haftmann@25096
   616
    val c' = Sign.full_name thy' c;
haftmann@25711
   617
    val rhs' = Morphism.term phi rhs;
haftmann@25239
   618
    val ty' = Logic.unvarifyT (Term.fastype_of rhs');
haftmann@24836
   619
  in
haftmann@25096
   620
    thy'
haftmann@25146
   621
    |> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') |> snd
haftmann@25096
   622
    |> Sign.add_const_constraint (c', SOME ty')
wenzelm@25024
   623
    |> Sign.notation true prmode [(Const (c', ty'), mx)]
haftmann@25368
   624
    |> register_operation class (c', (rhs', NONE))
haftmann@25096
   625
    |> Sign.restore_naming thy
haftmann@24836
   626
  end;
haftmann@24836
   627
haftmann@25462
   628
haftmann@25462
   629
(** instantiation target **)
haftmann@25462
   630
haftmann@25462
   631
(* bookkeeping *)
haftmann@25462
   632
haftmann@25462
   633
datatype instantiation = Instantiation of {
haftmann@25864
   634
  arities: string list * (string * sort) list * sort,
haftmann@25462
   635
  params: ((string * string) * (string * typ)) list
haftmann@25603
   636
    (*(instantiation parameter, type constructor), (local instantiation parameter, typ)*)
haftmann@25462
   637
}
haftmann@25462
   638
haftmann@25462
   639
structure Instantiation = ProofDataFun
haftmann@25462
   640
(
haftmann@25462
   641
  type T = instantiation
haftmann@25536
   642
  fun init _ = Instantiation { arities = ([], [], []), params = [] };
haftmann@25462
   643
);
haftmann@25462
   644
haftmann@25485
   645
fun mk_instantiation (arities, params) =
haftmann@25485
   646
  Instantiation { arities = arities, params = params };
haftmann@25514
   647
fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy)
haftmann@25485
   648
 of Instantiation data => data;
haftmann@25514
   649
fun map_instantiation f = (LocalTheory.target o Instantiation.map)
haftmann@25514
   650
  (fn Instantiation { arities, params } => mk_instantiation (f (arities, params)));
haftmann@25462
   651
haftmann@25514
   652
fun the_instantiation lthy = case get_instantiation lthy
haftmann@25536
   653
 of { arities = ([], [], []), ... } => error "No instantiation target"
haftmann@25485
   654
  | data => data;
haftmann@25462
   655
haftmann@25485
   656
val instantiation_params = #params o get_instantiation;
haftmann@25462
   657
haftmann@25514
   658
fun instantiation_param lthy v = instantiation_params lthy
haftmann@25462
   659
  |> find_first (fn (_, (v', _)) => v = v')
haftmann@25462
   660
  |> Option.map (fst o fst);
haftmann@25462
   661
haftmann@25462
   662
haftmann@25462
   663
(* syntax *)
haftmann@25462
   664
haftmann@26238
   665
fun synchronize_inst_syntax ctxt =
haftmann@25462
   666
  let
haftmann@26259
   667
    val Instantiation { arities = (_, _, sort), params = params } = Instantiation.get ctxt;
haftmann@26238
   668
    val thy = ProofContext.theory_of ctxt;
haftmann@26238
   669
    fun subst_class_typ sort = map_atyps
haftmann@26238
   670
      (fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty');
haftmann@26238
   671
    fun subst (c, ty) = case AxClass.inst_tyco_of thy (c, ty)
haftmann@26238
   672
         of SOME tyco => (case AList.lookup (op =) params (c, tyco)
haftmann@26238
   673
             of SOME (v_ty as (_, ty)) => SOME (ty, Free v_ty)
haftmann@26238
   674
              | NONE => NONE)
haftmann@26238
   675
          | NONE => NONE;
haftmann@26238
   676
    val unchecks =
haftmann@26238
   677
      map (fn ((c, _), v_ty as (_, ty)) => (Free v_ty, Const (c, ty))) params;
haftmann@26238
   678
  in
haftmann@26238
   679
    ctxt
haftmann@26259
   680
    |> Overloading.map_improvable_syntax
haftmann@26259
   681
         (fn (((local_constraints, _), ((improve, _), _)), _) =>
haftmann@26329
   682
            (((local_constraints, []), ((improve, subst), unchecks)), false))
haftmann@26238
   683
  end;
haftmann@25462
   684
haftmann@25462
   685
haftmann@25462
   686
(* target *)
haftmann@25462
   687
haftmann@25485
   688
val sanatize_name = (*FIXME*)
haftmann@25485
   689
  let
haftmann@25574
   690
    fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s
haftmann@25574
   691
      orelse s = "'" orelse s = "_";
haftmann@25485
   692
    val is_junk = not o is_valid andf Symbol.is_regular;
haftmann@25485
   693
    val junk = Scan.many is_junk;
haftmann@25485
   694
    val scan_valids = Symbol.scanner "Malformed input"
haftmann@25485
   695
      ((junk |--
haftmann@25485
   696
        (Scan.optional (Scan.one Symbol.is_ascii_letter) "x" ^^ (Scan.many is_valid >> implode)
haftmann@25485
   697
        --| junk))
wenzelm@25999
   698
      ::: Scan.repeat ((Scan.many1 is_valid >> implode) --| junk));
haftmann@25485
   699
  in
haftmann@25485
   700
    explode #> scan_valids #> implode
haftmann@25485
   701
  end;
haftmann@25485
   702
haftmann@26259
   703
fun type_name "*" = "prod"
haftmann@26259
   704
  | type_name "+" = "sum"
haftmann@26259
   705
  | type_name s = sanatize_name (NameSpace.base s); (*FIXME*)
haftmann@26259
   706
haftmann@25864
   707
fun init_instantiation (tycos, vs, sort) thy =
haftmann@25462
   708
  let
haftmann@25536
   709
    val _ = if null tycos then error "At least one arity must be given" else ();
haftmann@26259
   710
    fun subst_class_typ sort = map_atyps
haftmann@26259
   711
      (fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty');
haftmann@25597
   712
    fun get_param tyco (param, (c, ty)) = if can (AxClass.param_of_inst thy) (c, tyco)
haftmann@25603
   713
      then NONE else SOME ((c, tyco),
haftmann@25864
   714
        (param ^ "_" ^ type_name tyco, map_atyps (K (Type (tyco, map TFree vs))) ty));
haftmann@26329
   715
    val class_of = fst o the o AList.lookup (op =) (these_operations thy sort);
haftmann@26329
   716
    val params = these_params thy sort;
haftmann@26329
   717
    val inst_params = map_product get_param tycos (these_params thy sort) |> map_filter I;
haftmann@26329
   718
    val local_constraints = map (apsnd (subst_class_typ []) o snd) params;
haftmann@26329
   719
    val pseudo_constraints = map (fn (_, (c, _)) => (c, class_of c)) params;
haftmann@26329
   720
    val typ_of_sort = Type.typ_of_sort (Sign.classes_of thy);
haftmann@26353
   721
    val typargs = Sign.const_typargs thy;
haftmann@26329
   722
    val pp = Sign.pp thy;
haftmann@26353
   723
    fun constrain_typ tys sorts ty =
haftmann@26329
   724
      let
haftmann@26353
   725
        val tyenv = fold2 typ_of_sort tys sorts Vartab.empty
haftmann@26329
   726
          handle Sorts.CLASS_ERROR e => Sorts.class_error pp e;
haftmann@26329
   727
      in
haftmann@26329
   728
        map_atyps (fn TVar (vi, _) => TVar (vi, the (Vartab.lookup tyenv vi))
haftmann@26329
   729
          | ty => ty) ty
haftmann@26329
   730
      end;
haftmann@26353
   731
    fun constrain_class (c, ty) class =
haftmann@26353
   732
      constrain_typ (typargs (c, ty)) [[class]] ty;
haftmann@26329
   733
    fun improve_param (c, ty) = case AxClass.inst_tyco_of thy (c, ty)
haftmann@26329
   734
     of SOME tyco => (case AList.lookup (op =) inst_params (c, tyco)
haftmann@26259
   735
         of SOME (_, ty') => SOME (ty, ty')
haftmann@26259
   736
          | NONE => NONE)
haftmann@26259
   737
      | NONE => NONE;
haftmann@26329
   738
    fun improve (c, ty) = case improve_param (c, ty)
haftmann@26329
   739
     of SOME ty_ty' => SOME ty_ty'
haftmann@26329
   740
      | NONE => (case AList.lookup (op =) pseudo_constraints c
haftmann@26329
   741
         of SOME class =>
haftmann@26329
   742
              SOME (ty, constrain_class (c, ty) class)
haftmann@26329
   743
          | NONE => NONE);
haftmann@25485
   744
  in
haftmann@25485
   745
    thy
haftmann@25485
   746
    |> ProofContext.init
haftmann@26329
   747
    |> Instantiation.put (mk_instantiation ((tycos, vs, sort), inst_params))
haftmann@25864
   748
    |> fold (Variable.declare_term o Logic.mk_type o TFree) vs
haftmann@26329
   749
    |> fold (Variable.declare_names o Free o snd) inst_params
haftmann@26259
   750
    |> (Overloading.map_improvable_syntax o apfst)
haftmann@26329
   751
         (fn ((_, _), ((_, subst), unchecks)) =>
haftmann@26329
   752
            ((local_constraints, []), ((improve, K NONE), [])))
haftmann@26259
   753
    |> Overloading.add_improvable_syntax
haftmann@26238
   754
    |> synchronize_inst_syntax
haftmann@25485
   755
  end;
haftmann@25485
   756
haftmann@26238
   757
fun confirm_declaration c = (map_instantiation o apsnd)
haftmann@26238
   758
  (filter_out (fn (_, (c', _)) => c' = c))
haftmann@26238
   759
  #> LocalTheory.target synchronize_inst_syntax
haftmann@26238
   760
haftmann@25485
   761
fun gen_instantiation_instance do_proof after_qed lthy =
haftmann@25485
   762
  let
haftmann@25864
   763
    val (tycos, vs, sort) = (#arities o the_instantiation) lthy;
haftmann@25864
   764
    val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, map snd vs, sort)) tycos;
haftmann@25462
   765
    fun after_qed' results =
haftmann@25462
   766
      LocalTheory.theory (fold (AxClass.add_arity o Thm.varifyT) results)
haftmann@25462
   767
      #> after_qed;
haftmann@25462
   768
  in
haftmann@25462
   769
    lthy
haftmann@25462
   770
    |> do_proof after_qed' arities_proof
haftmann@25462
   771
  end;
haftmann@25462
   772
haftmann@25485
   773
val instantiation_instance = gen_instantiation_instance (fn after_qed => fn ts =>
haftmann@25462
   774
  Proof.theorem_i NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts));
haftmann@25462
   775
haftmann@25485
   776
fun prove_instantiation_instance tac = gen_instantiation_instance (fn after_qed =>
haftmann@25502
   777
  fn ts => fn lthy => after_qed (map (fn t => Goal.prove lthy [] [] t
haftmann@25502
   778
    (fn {context, ...} => tac context)) ts) lthy) I;
haftmann@25462
   779
haftmann@25462
   780
fun conclude_instantiation lthy =
haftmann@25462
   781
  let
haftmann@25485
   782
    val { arities, params } = the_instantiation lthy;
haftmann@25864
   783
    val (tycos, vs, sort) = arities;
haftmann@25462
   784
    val thy = ProofContext.theory_of lthy;
haftmann@25597
   785
    val _ = map (fn tyco => if Sign.of_sort thy
haftmann@25864
   786
        (Type (tyco, map TFree vs), sort)
haftmann@25462
   787
      then () else error ("Missing instance proof for type " ^ quote (Sign.extern_type thy tyco)))
haftmann@25597
   788
        tycos;
haftmann@25770
   789
    (*this checkpoint should move to AxClass as soon as "attach" has disappeared*)
haftmann@25770
   790
    val _ = case map (fst o snd) params
haftmann@25770
   791
     of [] => ()
haftmann@25770
   792
      | cs => Output.legacy_feature
haftmann@25829
   793
          ("Missing specifications for overloaded parameters " ^ commas_quote cs)
haftmann@25597
   794
  in lthy end;
haftmann@25462
   795
haftmann@25603
   796
fun pretty_instantiation lthy =
haftmann@25603
   797
  let
haftmann@25603
   798
    val { arities, params } = the_instantiation lthy;
haftmann@25864
   799
    val (tycos, vs, sort) = arities;
haftmann@25603
   800
    val thy = ProofContext.theory_of lthy;
haftmann@25864
   801
    fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, map snd vs, sort);
haftmann@25603
   802
    fun pr_param ((c, _), (v, ty)) =
haftmann@25864
   803
      (Pretty.block o Pretty.breaks) [Pretty.str v, Pretty.str "==",
haftmann@25864
   804
        (Pretty.str o Sign.extern_const thy) c, Pretty.str "::", Sign.pretty_typ thy ty];
haftmann@25603
   805
  in
haftmann@25603
   806
    (Pretty.block o Pretty.fbreaks)
haftmann@25603
   807
      (Pretty.str "instantiation" :: map pr_arity tycos @ map pr_param params)
haftmann@25603
   808
  end;
haftmann@25603
   809
haftmann@24218
   810
end;
haftmann@25683
   811