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