src/Pure/Isar/class.ML
author haftmann
Thu Dec 13 07:09:06 2007 +0100 (2007-12-13)
changeset 25618 01f20279fea1
parent 25603 4b7a58fc168c
child 25668 a9ebfc170fbc
permissions -rw-r--r--
improved rule calculation
haftmann@24218
     1
(*  Title:      Pure/Isar/class.ML
haftmann@24218
     2
    ID:         $Id$
haftmann@24218
     3
    Author:     Florian Haftmann, TU Muenchen
haftmann@24218
     4
haftmann@24218
     5
Type classes derived from primitive axclasses and locales.
haftmann@24218
     6
*)
haftmann@24218
     7
haftmann@24218
     8
signature CLASS =
haftmann@24218
     9
sig
haftmann@25462
    10
  (*classes*)
haftmann@25002
    11
  val class: bstring -> class list -> Element.context_i Locale.element list
haftmann@24218
    12
    -> string list -> theory -> string * Proof.context
haftmann@25002
    13
  val class_cmd: bstring -> xstring list -> Element.context Locale.element list
haftmann@24589
    14
    -> xstring list -> theory -> string * Proof.context
haftmann@25485
    15
haftmann@25311
    16
  val init: class -> theory -> Proof.context
haftmann@25603
    17
  val declare: string -> Markup.property list
wenzelm@25104
    18
    -> (string * mixfix) * term -> theory -> theory
haftmann@25603
    19
  val abbrev: string -> Syntax.mode -> Markup.property list
wenzelm@25104
    20
    -> (string * mixfix) * term -> theory -> theory
haftmann@25083
    21
  val refresh_syntax: class -> Proof.context -> Proof.context
haftmann@25485
    22
haftmann@24589
    23
  val intro_classes_tac: thm list -> tactic
haftmann@24589
    24
  val default_intro_classes_tac: thm list -> tactic
haftmann@25618
    25
  val prove_subclass: class * class -> thm -> theory -> theory
haftmann@25485
    26
haftmann@25485
    27
  val class_prefix: string -> string
haftmann@25485
    28
  val is_class: theory -> class -> bool
haftmann@25485
    29
  val these_params: theory -> sort -> (string * (string * typ)) list
haftmann@24589
    30
  val print_classes: theory -> unit
haftmann@24423
    31
haftmann@25462
    32
  (*instances*)
haftmann@25536
    33
  val init_instantiation: string list * sort list * sort -> theory -> local_theory
haftmann@25485
    34
  val instantiation_instance: (local_theory -> local_theory) -> local_theory -> Proof.state
haftmann@25485
    35
  val prove_instantiation_instance: (Proof.context -> tactic) -> local_theory -> local_theory
haftmann@25485
    36
  val conclude_instantiation: local_theory -> local_theory
haftmann@25603
    37
  val instantiation_param: local_theory -> string -> string option
haftmann@25485
    38
  val confirm_declaration: string -> local_theory -> local_theory
haftmann@25603
    39
  val pretty_instantiation: local_theory -> Pretty.T
haftmann@25485
    40
haftmann@25462
    41
  (*old axclass layer*)
haftmann@25462
    42
  val axclass_cmd: bstring * xstring list
haftmann@25462
    43
    -> ((bstring * Attrib.src list) * string list) list
haftmann@25462
    44
    -> theory -> class * theory
haftmann@25462
    45
  val classrel_cmd: xstring * xstring -> theory -> Proof.state
haftmann@25462
    46
haftmann@25462
    47
  (*old instance layer*)
haftmann@25536
    48
  val instance_arity: (theory -> theory) -> arity -> theory -> Proof.state
haftmann@25536
    49
  val instance_arity_cmd: bstring * xstring list * xstring -> theory -> Proof.state
haftmann@24218
    50
end;
haftmann@24218
    51
haftmann@24218
    52
structure Class : CLASS =
haftmann@24218
    53
struct
haftmann@24218
    54
haftmann@24218
    55
(** auxiliary **)
haftmann@24218
    56
haftmann@25062
    57
val classN = "class";
haftmann@25062
    58
val introN = "intro";
haftmann@25062
    59
haftmann@25002
    60
fun prove_interpretation tac prfx_atts expr inst =
haftmann@25002
    61
  Locale.interpretation_i I prfx_atts expr inst
haftmann@24589
    62
  #> Proof.global_terminal_proof
haftmann@24589
    63
      (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@24589
    64
  #> ProofContext.theory_of;
haftmann@24589
    65
haftmann@25195
    66
fun prove_interpretation_in tac after_qed (name, expr) =
haftmann@25195
    67
  Locale.interpretation_in_locale
haftmann@25195
    68
      (ProofContext.theory after_qed) (name, expr)
haftmann@25195
    69
  #> Proof.global_terminal_proof
haftmann@25195
    70
      (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@25195
    71
  #> ProofContext.theory_of;
haftmann@25195
    72
haftmann@25038
    73
fun get_remove_global_constraint c thy =
haftmann@25038
    74
  let
haftmann@25038
    75
    val ty = Sign.the_const_constraint thy c;
haftmann@25038
    76
  in
haftmann@25038
    77
    thy
haftmann@25038
    78
    |> Sign.add_const_constraint (c, NONE)
haftmann@25038
    79
    |> pair (c, Logic.unvarifyT ty)
haftmann@25038
    80
  end;
haftmann@25038
    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@25062
   135
  morphism: 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,
haftmann@25618
   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@24218
   192
        (map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names
haftmann@24218
   193
      end;
haftmann@24218
   194
  in maps params o ancestry thy end;
haftmann@24218
   195
haftmann@24657
   196
fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy;
haftmann@24218
   197
haftmann@25062
   198
fun morphism thy = #morphism o the_class_data thy;
haftmann@25062
   199
haftmann@25618
   200
fun these_assm_intros thy =
haftmann@25618
   201
  Graph.fold (fn (_, (data, _)) => fold (insert Thm.eq_thm)
haftmann@25618
   202
    ((the_list o #assm_intro o rep_class_data) data)) (ClassData.get thy) [];
haftmann@24218
   203
haftmann@24836
   204
fun these_operations thy =
haftmann@24836
   205
  maps (#operations o the_class_data thy) o ancestry thy;
haftmann@24657
   206
haftmann@24218
   207
fun print_classes thy =
haftmann@24218
   208
  let
wenzelm@24920
   209
    val ctxt = ProofContext.init thy;
haftmann@24218
   210
    val algebra = Sign.classes_of thy;
haftmann@24218
   211
    val arities =
haftmann@24218
   212
      Symtab.empty
haftmann@24218
   213
      |> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) =>
haftmann@24218
   214
           Symtab.map_default (class, []) (insert (op =) tyco)) arities)
haftmann@24218
   215
             ((#arities o Sorts.rep_algebra) algebra);
haftmann@24218
   216
    val the_arities = these o Symtab.lookup arities;
haftmann@24218
   217
    fun mk_arity class tyco =
haftmann@24218
   218
      let
haftmann@24218
   219
        val Ss = Sorts.mg_domain algebra tyco [class];
wenzelm@24920
   220
      in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end;
haftmann@24218
   221
    fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: "
wenzelm@24920
   222
      ^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty);
haftmann@24218
   223
    fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [
haftmann@25062
   224
      (SOME o Pretty.str) ("class " ^ Sign.extern_class thy class ^ ":"),
haftmann@24218
   225
      (SOME o Pretty.block) [Pretty.str "supersort: ",
wenzelm@24920
   226
        (Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class],
haftmann@25062
   227
      if is_class thy class then (SOME o Pretty.str)
haftmann@25062
   228
        ("locale: " ^ Locale.extern thy class) else NONE,
haftmann@25062
   229
      ((fn [] => NONE | ps => (SOME o Pretty.block o Pretty.fbreaks)
haftmann@25062
   230
          (Pretty.str "parameters:" :: ps)) o map mk_param
wenzelm@24930
   231
        o these o Option.map #params o try (AxClass.get_info thy)) class,
haftmann@24218
   232
      (SOME o Pretty.block o Pretty.breaks) [
haftmann@24218
   233
        Pretty.str "instances:",
haftmann@24218
   234
        Pretty.list "" "" (map (mk_arity class) (the_arities class))
haftmann@24218
   235
      ]
haftmann@24218
   236
    ]
haftmann@24218
   237
  in
haftmann@24589
   238
    (Pretty.writeln o Pretty.chunks o separate (Pretty.str "")
haftmann@24589
   239
      o map mk_entry o Sorts.all_classes) algebra
haftmann@24218
   240
  end;
haftmann@24218
   241
haftmann@24218
   242
haftmann@24218
   243
(* updaters *)
haftmann@24218
   244
haftmann@25618
   245
fun add_class_data ((class, superclasses),
haftmann@25618
   246
    (cs, base_sort, inst, phi, assm_intro, of_class, axiom)) thy =
haftmann@25002
   247
  let
haftmann@25368
   248
    val operations = map (fn (v_ty as (_, ty), (c, _)) =>
haftmann@25368
   249
      (c, (class, (ty, Free v_ty)))) cs;
haftmann@25002
   250
    val cs = (map o pairself) fst cs;
haftmann@25038
   251
    val add_class = Graph.new_node (class,
haftmann@25618
   252
        mk_class_data ((cs, 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@25239
   260
    val prep_typ = map_atyps
haftmann@25368
   261
      (fn TVar (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@25062
   278
fun calculate_morphism class cs =
haftmann@25062
   279
  let
haftmann@25062
   280
    val subst_typ = Term.map_type_tfree (fn var as (v, sort) =>
haftmann@25062
   281
      if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort));
haftmann@25062
   282
    fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) cs v
haftmann@25062
   283
         of SOME (c, _) => Const (c, ty)
haftmann@25062
   284
          | NONE => t)
haftmann@25062
   285
      | subst_aterm t = t;
haftmann@25062
   286
    val subst_term = map_aterms subst_aterm #> map_types subst_typ;
haftmann@25062
   287
  in
haftmann@25209
   288
    Morphism.term_morphism subst_term
haftmann@25062
   289
    $> Morphism.typ_morphism subst_typ
haftmann@25062
   290
  end;
haftmann@25062
   291
haftmann@25618
   292
fun calculate_rules thy sups base_sort assm_axiom param_map class =
haftmann@24589
   293
  let
haftmann@25618
   294
    (*FIXME use more primitves here rather than OF, simplifify code*)
haftmann@25618
   295
    fun the_option [x] = SOME x
haftmann@25618
   296
      | the_option [] = NONE;
haftmann@25618
   297
    fun VarA sort = TVar ((Name.aT, 0), sort);
haftmann@25618
   298
    fun FreeA sort = TFree (Name.aT, sort);
haftmann@25618
   299
    fun instantiate sort1 sort2 =
haftmann@25618
   300
      Thm.instantiate ([pairself (Thm.ctyp_of thy) (VarA sort1, FreeA sort2)], [])
haftmann@25618
   301
    val (proto_assm_intro, locale_intro) = pairself the_option (Locale.intros thy class);
haftmann@25618
   302
    val inst_ty = (map_atyps o K o VarA) base_sort;
haftmann@25618
   303
    val assm_intro = proto_assm_intro
haftmann@25618
   304
      |> Option.map (Thm.instantiate ([],
haftmann@25618
   305
           map (fn ((v, _), (c, ty)) => pairself (Thm.cterm_of thy)
haftmann@25618
   306
             (Var ((v, 0), inst_ty ty), Const (c, inst_ty ty))) param_map))
haftmann@25618
   307
      |> Option.map (MetaSimplifier.rewrite_rule (these_defs thy sups));
haftmann@25618
   308
    val axiom_premises = map_filter (#axiom o the_class_data thy) sups
haftmann@25618
   309
      @ the_list assm_axiom;
haftmann@25618
   310
    val axiom = case locale_intro
haftmann@25618
   311
     of SOME proto_axiom => SOME
haftmann@25618
   312
          ((instantiate base_sort [class] proto_axiom OF axiom_premises) |> Drule.standard)
haftmann@25618
   313
      | NONE => assm_axiom;
haftmann@25618
   314
    val class_intro = (instantiate [] base_sort o #intro o AxClass.get_info thy) class;
haftmann@25618
   315
    val of_class_sups = if null sups
haftmann@25618
   316
      then Drule.sort_triv thy (FreeA base_sort, base_sort)
haftmann@25618
   317
      else map (Drule.implies_intr_hyps o #of_class o the_class_data thy) sups;
haftmann@25618
   318
    val locale_dests = map Drule.standard (Locale.dests thy class);
haftmann@25618
   319
    fun mk_pred_triv () = (Thm.assume o Thm.cterm_of thy
haftmann@25618
   320
      o (map_types o map_atyps o K o FreeA) base_sort o Thm.prop_of o the) axiom;
haftmann@25618
   321
    val pred_trivs = case length locale_dests
haftmann@25618
   322
     of 0 => if is_none locale_intro then [] else [mk_pred_triv ()]
haftmann@25618
   323
      | n => replicate n (mk_pred_triv ());
haftmann@25618
   324
    val of_class = class_intro OF of_class_sups OF locale_dests OF pred_trivs;
haftmann@25618
   325
  in (assm_intro, of_class, axiom) end;
haftmann@24589
   326
haftmann@24589
   327
fun class_interpretation class facts defs thy =
haftmann@24589
   328
  let
haftmann@25038
   329
    val params = these_params thy [class];
haftmann@25083
   330
    val inst = (#inst o the_class_data thy) class;
wenzelm@25020
   331
    val tac = ALLGOALS (ProofContext.fact_tac facts);
haftmann@25038
   332
    val prfx = class_prefix class;
haftmann@24589
   333
  in
haftmann@25038
   334
    thy
haftmann@25038
   335
    |> fold_map (get_remove_global_constraint o fst o snd) params
ballarin@25094
   336
    ||> prove_interpretation tac ((false, prfx), []) (Locale.Locale class)
ballarin@25094
   337
          (inst, map (fn def => (("", []), def)) defs)
haftmann@25038
   338
    |-> (fn cs => fold (Sign.add_const_constraint o apsnd SOME) cs)
haftmann@24589
   339
  end;
haftmann@24218
   340
haftmann@25618
   341
fun prove_subclass (sub, sup) thm thy =
haftmann@25618
   342
  let
haftmann@25618
   343
    val of_class = (Drule.standard o #of_class o the_class_data thy) sup;
haftmann@25618
   344
    val intro = Drule.standard (of_class OF [Drule.standard thm]);
haftmann@25618
   345
    val classrel = intro OF (the_list o #axiom o the_class_data thy) sub;
haftmann@25618
   346
  in
haftmann@25618
   347
    thy
haftmann@25618
   348
    |> AxClass.add_classrel classrel
haftmann@25618
   349
    |> prove_interpretation_in (ALLGOALS (ProofContext.fact_tac [thm]))
haftmann@25618
   350
         I (sub, Locale.Locale sup)
haftmann@25618
   351
    |> ClassData.map (Graph.add_edge (sub, sup))
haftmann@25618
   352
  end;
haftmann@25618
   353
haftmann@24218
   354
fun intro_classes_tac facts st =
haftmann@24218
   355
  let
haftmann@24218
   356
    val thy = Thm.theory_of_thm st;
haftmann@24218
   357
    val classes = Sign.all_classes thy;
haftmann@24218
   358
    val class_trivs = map (Thm.class_triv thy) classes;
haftmann@25618
   359
    val class_intros = map_filter (try (#intro o AxClass.get_info thy)) classes;
haftmann@25618
   360
    val assm_intros = these_assm_intros thy;
haftmann@24218
   361
  in
haftmann@25618
   362
    Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st
haftmann@24218
   363
  end;
haftmann@24218
   364
haftmann@24218
   365
fun default_intro_classes_tac [] = intro_classes_tac []
wenzelm@24930
   366
  | default_intro_classes_tac _ = no_tac;
haftmann@24218
   367
haftmann@24218
   368
fun default_tac rules ctxt facts =
haftmann@24218
   369
  HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
haftmann@24218
   370
    default_intro_classes_tac facts;
haftmann@24218
   371
haftmann@24218
   372
val _ = Context.add_setup (Method.add_methods
haftmann@24218
   373
 [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
haftmann@24218
   374
    "back-chain introduction rules of classes"),
haftmann@24218
   375
  ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
haftmann@24218
   376
    "apply some intro/elim rule")]);
haftmann@24218
   377
haftmann@24218
   378
haftmann@24589
   379
(** classes and class target **)
haftmann@24218
   380
haftmann@25002
   381
(* class context syntax *)
haftmann@24748
   382
haftmann@25083
   383
structure ClassSyntax = ProofDataFun(
haftmann@25083
   384
  type T = {
haftmann@25368
   385
    local_constraints: (string * typ) list,
haftmann@25368
   386
    global_constraints: (string * typ) list,
haftmann@25083
   387
    base_sort: sort,
haftmann@25368
   388
    operations: (string * (typ * term)) list,
haftmann@25195
   389
    unchecks: (term * term) list,
haftmann@25083
   390
    passed: bool
haftmann@25368
   391
  };
haftmann@25368
   392
  fun init _ = {
haftmann@25368
   393
    local_constraints = [],
haftmann@25368
   394
    global_constraints = [],
haftmann@25368
   395
    base_sort = [],
haftmann@25368
   396
    operations = [],
haftmann@25368
   397
    unchecks = [],
haftmann@25368
   398
    passed = true
haftmann@25368
   399
  };;
haftmann@25083
   400
);
haftmann@25083
   401
wenzelm@25344
   402
fun synchronize_syntax sups base_sort ctxt =
haftmann@24914
   403
  let
wenzelm@25344
   404
    val thy = ProofContext.theory_of ctxt;
haftmann@25368
   405
    fun subst_class_typ sort = map_atyps
haftmann@25368
   406
      (fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty');
haftmann@25083
   407
    val operations = these_operations thy sups;
haftmann@25368
   408
    val local_constraints =
haftmann@25368
   409
      (map o apsnd) (subst_class_typ base_sort o fst o snd) operations;
haftmann@25368
   410
    val global_constraints =
haftmann@25368
   411
      (map o apsnd) (fn (class, (ty, _)) => subst_class_typ [class] ty) operations;
wenzelm@25318
   412
    fun declare_const (c, _) =
wenzelm@25318
   413
      let val b = Sign.base_name c
wenzelm@25344
   414
      in Sign.intern_const thy b = c ? Variable.declare_const (b, c) end;
haftmann@25368
   415
    val unchecks = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) operations;
haftmann@25083
   416
  in
haftmann@25083
   417
    ctxt
haftmann@25368
   418
    |> fold declare_const local_constraints
haftmann@25368
   419
    |> fold (ProofContext.add_const_constraint o apsnd SOME) local_constraints
haftmann@25368
   420
    |> ClassSyntax.put {
haftmann@25368
   421
        local_constraints = local_constraints,
haftmann@25368
   422
        global_constraints = global_constraints,
haftmann@25083
   423
        base_sort = base_sort,
haftmann@25368
   424
        operations = (map o apsnd) snd operations,
haftmann@25195
   425
        unchecks = unchecks,
haftmann@25083
   426
        passed = false
haftmann@25368
   427
      }
haftmann@25083
   428
  end;
haftmann@25083
   429
haftmann@25083
   430
fun refresh_syntax class ctxt =
haftmann@25002
   431
  let
haftmann@25002
   432
    val thy = ProofContext.theory_of ctxt;
haftmann@25062
   433
    val base_sort = (#base_sort o the_class_data thy) class;
wenzelm@25344
   434
  in synchronize_syntax [class] base_sort ctxt end;
haftmann@24914
   435
haftmann@25368
   436
val mark_passed = ClassSyntax.map
haftmann@25368
   437
  (fn { local_constraints, global_constraints, base_sort, operations, unchecks, passed } =>
haftmann@25368
   438
    { local_constraints = local_constraints, global_constraints = global_constraints,
haftmann@25368
   439
      base_sort = base_sort, operations = operations, unchecks = unchecks, passed = true });
haftmann@25083
   440
haftmann@25083
   441
fun sort_term_check ts ctxt =
haftmann@24748
   442
  let
haftmann@25368
   443
    val { local_constraints, global_constraints, base_sort, operations, passed, ... } =
haftmann@25368
   444
      ClassSyntax.get ctxt;
haftmann@25368
   445
    fun check_improve (Const (c, ty)) = (case AList.lookup (op =) local_constraints c
haftmann@25368
   446
         of SOME ty0 => (case try (Type.raw_match (ty0, ty)) Vartab.empty
haftmann@25368
   447
             of SOME tyenv => (case Vartab.lookup tyenv (Name.aT, 0)
haftmann@25368
   448
                 of SOME (_, TVar (tvar as (vi, _))) =>
haftmann@25368
   449
                      if TypeInfer.is_param vi then cons tvar else I
haftmann@25368
   450
                  | _ => I)
haftmann@25368
   451
              | NONE => I)
haftmann@25368
   452
          | NONE => I)
haftmann@25368
   453
      | check_improve _ = I;
haftmann@25368
   454
    val improvements = (fold o fold_aterms) check_improve ts [];
haftmann@25368
   455
    val ts' = (map o map_types o map_atyps) (fn ty as TVar tvar =>
haftmann@25368
   456
        if member (op =) improvements tvar
haftmann@25368
   457
          then TFree (Name.aT, base_sort) else ty | ty => ty) ts;
haftmann@25368
   458
    fun check t0 = Envir.expand_term (fn Const (c, ty) => (case AList.lookup (op =) operations c
haftmann@25368
   459
         of SOME (ty0, t) =>
haftmann@25368
   460
              if Type.typ_instance (ProofContext.tsig_of ctxt) (ty, ty0)
haftmann@25368
   461
              then SOME (ty0, check t) else NONE
haftmann@25368
   462
          | NONE => NONE)
haftmann@25368
   463
      | _ => NONE) t0;
haftmann@25368
   464
    val ts'' = map check ts';
haftmann@25368
   465
  in if eq_list (op aconv) (ts, ts'') andalso passed then NONE
haftmann@25083
   466
  else
haftmann@25083
   467
    ctxt
haftmann@25368
   468
    |> fold (ProofContext.add_const_constraint o apsnd SOME) global_constraints
haftmann@25083
   469
    |> mark_passed
haftmann@25368
   470
    |> pair ts''
haftmann@25083
   471
    |> SOME
haftmann@25083
   472
  end;
haftmann@24748
   473
haftmann@25083
   474
fun sort_term_uncheck ts ctxt =
haftmann@25002
   475
  let
haftmann@25002
   476
    val thy = ProofContext.theory_of ctxt;
haftmann@25368
   477
    val unchecks = (#unchecks o ClassSyntax.get) ctxt;
haftmann@25462
   478
    val ts' = map (Pattern.rewrite_term thy unchecks []) ts;
wenzelm@25060
   479
  in if eq_list (op aconv) (ts, ts') then NONE else SOME (ts', ctxt) end;
haftmann@25002
   480
wenzelm@25344
   481
fun init_ctxt sups base_sort ctxt =
haftmann@25083
   482
  ctxt
haftmann@25083
   483
  |> Variable.declare_term
haftmann@25083
   484
      (Logic.mk_type (TFree (Name.aT, base_sort)))
wenzelm@25344
   485
  |> synchronize_syntax sups base_sort
haftmann@25083
   486
  |> Context.proof_map (
haftmann@25083
   487
      Syntax.add_term_check 0 "class" sort_term_check
haftmann@25103
   488
      #> Syntax.add_term_uncheck 0 "class" sort_term_uncheck)
haftmann@24901
   489
haftmann@25311
   490
fun init class thy =
haftmann@25311
   491
  thy
haftmann@25311
   492
  |> Locale.init class
wenzelm@25344
   493
  |> init_ctxt [class] ((#base_sort o the_class_data thy) class);
haftmann@24914
   494
haftmann@24748
   495
haftmann@24589
   496
(* class definition *)
haftmann@24218
   497
haftmann@24218
   498
local
haftmann@24218
   499
haftmann@24748
   500
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems =
haftmann@24218
   501
  let
haftmann@24748
   502
    val supclasses = map (prep_class thy) raw_supclasses;
haftmann@24748
   503
    val supsort = Sign.minimize_sort thy supclasses;
haftmann@25618
   504
    val sups = filter (is_class thy) supsort;
haftmann@25618
   505
    val base_sort = if null sups then supsort else
haftmann@25618
   506
      (#base_sort o the_class_data thy o hd) sups;
haftmann@25038
   507
    val suplocales = map Locale.Locale sups;
haftmann@24748
   508
    val (raw_elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e)
haftmann@24748
   509
      | Locale.Expr i => apsnd (cons (prep_expr thy i))) raw_includes_elems ([], []);
haftmann@24748
   510
    val supexpr = Locale.Merge suplocales;
haftmann@24748
   511
    val supparams = (map fst o Locale.parameters_of_expr thy) supexpr;
haftmann@25002
   512
    val supconsts = AList.make (the o AList.lookup (op =) (these_params thy sups))
haftmann@24748
   513
      (map fst supparams);
haftmann@24748
   514
    val mergeexpr = Locale.Merge (suplocales @ includes);
haftmann@24748
   515
    val constrain = Element.Constrains ((map o apsnd o map_atyps)
wenzelm@24847
   516
      (fn TFree (_, sort) => TFree (Name.aT, sort)) supparams);
haftmann@24748
   517
  in
haftmann@24748
   518
    ProofContext.init thy
haftmann@24748
   519
    |> Locale.cert_expr supexpr [constrain]
haftmann@24748
   520
    |> snd
wenzelm@25344
   521
    |> init_ctxt sups base_sort
haftmann@24748
   522
    |> process_expr Locale.empty raw_elems
haftmann@24748
   523
    |> fst
haftmann@25062
   524
    |> (fn elems => ((((sups, supconsts), (supsort, base_sort, mergeexpr)),
haftmann@24748
   525
          (*FIXME*) if null includes then constrain :: elems else elems)))
haftmann@24748
   526
  end;
haftmann@24748
   527
haftmann@24748
   528
val read_class_spec = gen_class_spec Sign.intern_class Locale.intern_expr Locale.read_expr;
haftmann@24748
   529
val check_class_spec = gen_class_spec (K I) (K I) Locale.cert_expr;
haftmann@24748
   530
haftmann@25618
   531
fun define_class_params name class superclasses consts dep_axiom other_consts thy =
wenzelm@24968
   532
  let
haftmann@25083
   533
    fun add_const ((c, ty), syn) =
haftmann@25083
   534
      Sign.declare_const [] (c, Type.strip_sorts ty, syn) #>> Term.dest_Const;
haftmann@25618
   535
    val constrain_typs = (map o apsnd o Term.map_type_tfree)
haftmann@25002
   536
      (fn (v, _) => TFree (v, [class]))
haftmann@25618
   537
    fun the_option [x] = SOME x
haftmann@25618
   538
      | the_option [] = NONE;
wenzelm@24968
   539
  in
wenzelm@24968
   540
    thy
wenzelm@24968
   541
    |> Sign.add_path (Logic.const_of_class name)
wenzelm@24968
   542
    |> fold_map add_const consts
wenzelm@24968
   543
    ||> Sign.restore_naming thy
haftmann@25618
   544
    |-> (fn cs => `(fn thy => dep_axiom thy cs)
haftmann@25618
   545
    #-> (fn axiom => AxClass.define_class (name, superclasses)
haftmann@25618
   546
           (map fst cs @ other_consts) [axiom]
haftmann@25618
   547
    #-> (fn _ => `(fn _ => constrain_typs cs)
haftmann@25618
   548
    #-> (fn cs' => `(fn thy => (the_option o #axioms o AxClass.get_info thy) class)
haftmann@25618
   549
    #-> (fn axiom => fold (Sign.add_const_constraint o apsnd SOME) cs'
haftmann@25618
   550
    #> pair (cs', axiom))))))
wenzelm@24968
   551
  end;
wenzelm@24968
   552
haftmann@25002
   553
fun gen_class prep_spec prep_param bname
haftmann@24748
   554
    raw_supclasses raw_includes_elems raw_other_consts thy =
haftmann@24748
   555
  let
haftmann@25038
   556
    val class = Sign.full_name thy bname;
haftmann@25062
   557
    val (((sups, supconsts), (supsort, base_sort, mergeexpr)), elems_syn) =
haftmann@24748
   558
      prep_spec thy raw_supclasses raw_includes_elems;
wenzelm@24968
   559
    val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts;
haftmann@25163
   560
    fun mk_inst class cs =
haftmann@25163
   561
      (map o apsnd o Term.map_type_tfree) (fn (v, _) => TFree (v, [class])) cs;
haftmann@25062
   562
    fun fork_syntax (Element.Fixes xs) =
haftmann@25062
   563
          fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs
haftmann@25062
   564
          #>> Element.Fixes
haftmann@25062
   565
      | fork_syntax x = pair x;
haftmann@25062
   566
    val (elems, global_syn) = fold_map fork_syntax elems_syn [];
wenzelm@25326
   567
    fun globalize (c, ty) =
haftmann@25618
   568
      ((c, map_atyps (K (TFree (Name.aT, base_sort))) ty),
haftmann@25062
   569
        (the_default NoSyn o AList.lookup (op =) global_syn) c);
haftmann@25038
   570
    fun extract_params thy =
haftmann@24218
   571
      let
haftmann@25062
   572
        val params = map fst (Locale.parameters_of thy class);
haftmann@24218
   573
      in
haftmann@25062
   574
        (params, (map globalize o snd o chop (length supconsts)) params)
haftmann@24218
   575
      end;
haftmann@25038
   576
    fun extract_assumes params thy cs =
haftmann@24218
   577
      let
haftmann@24218
   578
        val consts = supconsts @ (map (fst o fst) params ~~ cs);
haftmann@24218
   579
        fun subst (Free (c, ty)) =
haftmann@24218
   580
              Const ((fst o the o AList.lookup (op =) consts) c, ty)
haftmann@24218
   581
          | subst t = t;
haftmann@24218
   582
        fun prep_asm ((name, atts), ts) =
wenzelm@25024
   583
          ((Sign.base_name name, map (Attrib.attribute_i thy) atts),
haftmann@24589
   584
            (map o map_aterms) subst ts);
haftmann@24218
   585
      in
haftmann@25618
   586
        Locale.intros thy class
haftmann@25618
   587
        |> fst
haftmann@25618
   588
        |> map (map_aterms subst o Logic.unvarify o Logic.strip_imp_concl o Thm.prop_of)
haftmann@25618
   589
        |> pair (bname ^ "_" ^ AxClass.axiomsN, [])
haftmann@24218
   590
      end;
haftmann@24218
   591
  in
haftmann@24218
   592
    thy
haftmann@24748
   593
    |> Locale.add_locale_i (SOME "") bname mergeexpr elems
haftmann@25038
   594
    |> snd
haftmann@25311
   595
    |> ProofContext.theory_of
haftmann@25311
   596
    |> `extract_params
haftmann@25311
   597
    |-> (fn (all_params, params) =>
haftmann@25618
   598
        define_class_params bname class supsort params
haftmann@25038
   599
          (extract_assumes params) other_consts
haftmann@25618
   600
      #-> (fn (consts, assm_axiom) =>
haftmann@25618
   601
        `(fn thy => calculate_rules thy sups base_sort assm_axiom
haftmann@25618
   602
          (all_params ~~ map snd supconsts @ consts) class)
haftmann@25618
   603
      #-> (fn (assm_intro, assm_proj, axiom) =>
haftmann@25038
   604
        add_class_data ((class, sups),
haftmann@25062
   605
          (map fst params ~~ consts, base_sort,
haftmann@25163
   606
            mk_inst class (map snd supconsts @ consts),
haftmann@25618
   607
              calculate_morphism class (supconsts @ (map (fst o fst) params ~~ consts)),
haftmann@25618
   608
          assm_intro, assm_proj, axiom))
haftmann@25618
   609
      #> class_interpretation class (the_list axiom) []
haftmann@25618
   610
      )))
haftmann@25268
   611
    |> init class
haftmann@25038
   612
    |> pair class
haftmann@24218
   613
  end;
haftmann@24218
   614
wenzelm@25326
   615
fun read_const thy = #1 o Term.dest_Const o ProofContext.read_const (ProofContext.init thy);
wenzelm@25326
   616
haftmann@24218
   617
in
haftmann@24218
   618
wenzelm@25326
   619
val class_cmd = gen_class read_class_spec read_const;
haftmann@24748
   620
val class = gen_class check_class_spec (K I);
haftmann@24218
   621
haftmann@24218
   622
end; (*local*)
haftmann@24218
   623
haftmann@24218
   624
haftmann@25485
   625
(* class target *)
haftmann@24218
   626
haftmann@25603
   627
fun declare class pos ((c, mx), dict) thy =
haftmann@24218
   628
  let
wenzelm@25024
   629
    val prfx = class_prefix class;
wenzelm@25024
   630
    val thy' = thy |> Sign.add_path prfx;
haftmann@25062
   631
    val phi = morphism thy' class;
wenzelm@25024
   632
haftmann@25062
   633
    val c' = Sign.full_name thy' c;
haftmann@25239
   634
    val dict' = Morphism.term phi dict;
haftmann@25239
   635
    val dict_def = map_types Logic.unvarifyT dict';
haftmann@25239
   636
    val ty' = Term.fastype_of dict_def;
haftmann@25083
   637
    val ty'' = Type.strip_sorts ty';
haftmann@25239
   638
    val def_eq = Logic.mk_equals (Const (c', ty'), dict_def);
haftmann@25618
   639
    fun get_axiom thy = ((Thm.varifyT o Thm.symmetric o Thm.get_axiom_i thy) c', thy);
haftmann@24218
   640
  in
wenzelm@25024
   641
    thy'
haftmann@25096
   642
    |> Sign.declare_const pos (c, ty'', mx) |> snd
haftmann@25518
   643
    |> Thm.add_def false false (c, def_eq)
haftmann@25062
   644
    |>> Thm.symmetric
haftmann@25618
   645
    ||>> get_axiom
haftmann@25618
   646
    |-> (fn (def, def') => class_interpretation class [def] [Thm.prop_of def]
haftmann@25618
   647
          #> register_operation class (c', (dict', SOME def')))
haftmann@24218
   648
    |> Sign.restore_naming thy
haftmann@25083
   649
    |> Sign.add_const_constraint (c', SOME ty')
haftmann@24218
   650
  end;
haftmann@24218
   651
haftmann@25603
   652
fun abbrev class prmode pos ((c, mx), rhs) thy =
haftmann@24836
   653
  let
wenzelm@25024
   654
    val prfx = class_prefix class;
haftmann@25096
   655
    val thy' = thy |> Sign.add_path prfx;
haftmann@25062
   656
    val phi = morphism thy class;
haftmann@25062
   657
haftmann@25096
   658
    val c' = Sign.full_name thy' c;
haftmann@25146
   659
    val rews = map (Logic.dest_equals o Thm.prop_of) (these_defs thy' [class])
haftmann@25146
   660
    val rhs' = (Pattern.rewrite_term thy rews [] o Morphism.term phi) rhs;
haftmann@25239
   661
    val ty' = Logic.unvarifyT (Term.fastype_of rhs');
haftmann@24836
   662
  in
haftmann@25096
   663
    thy'
haftmann@25146
   664
    |> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') |> snd
haftmann@25096
   665
    |> Sign.add_const_constraint (c', SOME ty')
wenzelm@25024
   666
    |> Sign.notation true prmode [(Const (c', ty'), mx)]
haftmann@25368
   667
    |> register_operation class (c', (rhs', NONE))
haftmann@25096
   668
    |> Sign.restore_naming thy
haftmann@24836
   669
  end;
haftmann@24836
   670
haftmann@25462
   671
haftmann@25462
   672
(** instantiation target **)
haftmann@25462
   673
haftmann@25462
   674
(* bookkeeping *)
haftmann@25462
   675
haftmann@25462
   676
datatype instantiation = Instantiation of {
haftmann@25536
   677
  arities: string list * sort list * sort,
haftmann@25462
   678
  params: ((string * string) * (string * typ)) list
haftmann@25603
   679
    (*(instantiation parameter, type constructor), (local instantiation parameter, typ)*)
haftmann@25462
   680
}
haftmann@25462
   681
haftmann@25462
   682
structure Instantiation = ProofDataFun
haftmann@25462
   683
(
haftmann@25462
   684
  type T = instantiation
haftmann@25536
   685
  fun init _ = Instantiation { arities = ([], [], []), params = [] };
haftmann@25462
   686
);
haftmann@25462
   687
haftmann@25485
   688
fun mk_instantiation (arities, params) =
haftmann@25485
   689
  Instantiation { arities = arities, params = params };
haftmann@25514
   690
fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy)
haftmann@25485
   691
 of Instantiation data => data;
haftmann@25514
   692
fun map_instantiation f = (LocalTheory.target o Instantiation.map)
haftmann@25514
   693
  (fn Instantiation { arities, params } => mk_instantiation (f (arities, params)));
haftmann@25462
   694
haftmann@25514
   695
fun the_instantiation lthy = case get_instantiation lthy
haftmann@25536
   696
 of { arities = ([], [], []), ... } => error "No instantiation target"
haftmann@25485
   697
  | data => data;
haftmann@25462
   698
haftmann@25485
   699
val instantiation_params = #params o get_instantiation;
haftmann@25462
   700
haftmann@25514
   701
fun instantiation_param lthy v = instantiation_params lthy
haftmann@25462
   702
  |> find_first (fn (_, (v', _)) => v = v')
haftmann@25462
   703
  |> Option.map (fst o fst);
haftmann@25462
   704
haftmann@25514
   705
fun confirm_declaration c = (map_instantiation o apsnd)
haftmann@25485
   706
  (filter_out (fn (_, (c', _)) => c' = c));
haftmann@25485
   707
haftmann@25462
   708
haftmann@25462
   709
(* syntax *)
haftmann@25462
   710
haftmann@25597
   711
fun subst_param thy params = map_aterms (fn t as Const (c, ty) =>
haftmann@25597
   712
    (case AxClass.inst_tyco_of thy (c, ty)
haftmann@25536
   713
     of SOME tyco => (case AList.lookup (op =) params (c, tyco)
haftmann@25536
   714
         of SOME v_ty => Free v_ty
haftmann@25536
   715
          | NONE => t)
haftmann@25536
   716
      | NONE => t)
haftmann@25536
   717
  | t => t);
haftmann@25536
   718
haftmann@25514
   719
fun inst_term_check ts lthy =
haftmann@25462
   720
  let
haftmann@25514
   721
    val params = instantiation_params lthy;
haftmann@25514
   722
    val tsig = ProofContext.tsig_of lthy;
haftmann@25514
   723
    val thy = ProofContext.theory_of lthy;
haftmann@25462
   724
haftmann@25597
   725
    fun check_improve (Const (c, ty)) = (case AxClass.inst_tyco_of thy (c, ty)
haftmann@25462
   726
         of SOME tyco => (case AList.lookup (op =) params (c, tyco)
haftmann@25502
   727
             of SOME (_, ty') => perhaps (try (Type.typ_match tsig (ty, ty')))
haftmann@25462
   728
              | NONE => I)
haftmann@25462
   729
          | NONE => I)
haftmann@25462
   730
      | check_improve _ = I;
haftmann@25462
   731
    val improvement = (fold o fold_aterms) check_improve ts Vartab.empty;
haftmann@25462
   732
    val ts' = (map o map_types) (Envir.typ_subst_TVars improvement) ts;
haftmann@25536
   733
    val ts'' = map (subst_param thy params) ts';
haftmann@25514
   734
  in if eq_list (op aconv) (ts, ts'') then NONE else SOME (ts'', lthy) end;
haftmann@25462
   735
haftmann@25514
   736
fun inst_term_uncheck ts lthy =
haftmann@25462
   737
  let
haftmann@25514
   738
    val params = instantiation_params lthy;
haftmann@25462
   739
    val ts' = (map o map_aterms) (fn t as Free (v, ty) =>
haftmann@25462
   740
       (case get_first (fn ((c, _), (v', _)) => if v = v' then SOME c else NONE) params
haftmann@25462
   741
         of SOME c => Const (c, ty)
haftmann@25462
   742
          | NONE => t)
haftmann@25462
   743
      | t => t) ts;
haftmann@25514
   744
  in if eq_list (op aconv) (ts, ts') then NONE else SOME (ts', lthy) end;
haftmann@25462
   745
haftmann@25462
   746
haftmann@25462
   747
(* target *)
haftmann@25462
   748
haftmann@25485
   749
val sanatize_name = (*FIXME*)
haftmann@25485
   750
  let
haftmann@25574
   751
    fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s
haftmann@25574
   752
      orelse s = "'" orelse s = "_";
haftmann@25485
   753
    val is_junk = not o is_valid andf Symbol.is_regular;
haftmann@25485
   754
    val junk = Scan.many is_junk;
haftmann@25485
   755
    val scan_valids = Symbol.scanner "Malformed input"
haftmann@25485
   756
      ((junk |--
haftmann@25485
   757
        (Scan.optional (Scan.one Symbol.is_ascii_letter) "x" ^^ (Scan.many is_valid >> implode)
haftmann@25485
   758
        --| junk))
haftmann@25485
   759
      -- Scan.repeat ((Scan.many1 is_valid >> implode) --| junk) >> op ::);
haftmann@25485
   760
  in
haftmann@25485
   761
    explode #> scan_valids #> implode
haftmann@25485
   762
  end;
haftmann@25485
   763
haftmann@25536
   764
fun init_instantiation (tycos, sorts, sort) thy =
haftmann@25462
   765
  let
haftmann@25536
   766
    val _ = if null tycos then error "At least one arity must be given" else ();
haftmann@25536
   767
    val _ = map (the_class_data thy) sort;
haftmann@25536
   768
    val vs = map TFree (Name.names Name.context Name.aT sorts);
haftmann@25485
   769
    fun type_name "*" = "prod"
haftmann@25485
   770
      | type_name "+" = "sum"
haftmann@25485
   771
      | type_name s = sanatize_name (NameSpace.base s); (*FIXME*)
haftmann@25597
   772
    fun get_param tyco (param, (c, ty)) = if can (AxClass.param_of_inst thy) (c, tyco)
haftmann@25603
   773
      then NONE else SOME ((c, tyco),
haftmann@25536
   774
        (param ^ "_" ^ type_name tyco, map_atyps (K (Type (tyco, vs))) ty));
haftmann@25536
   775
    val params = map_product get_param tycos (these_params thy sort) |> map_filter I;
haftmann@25485
   776
  in
haftmann@25485
   777
    thy
haftmann@25485
   778
    |> ProofContext.init
haftmann@25536
   779
    |> Instantiation.put (mk_instantiation ((tycos, sorts, sort), params))
haftmann@25536
   780
    |> fold (Variable.declare_term o Logic.mk_type) vs
haftmann@25574
   781
    |> fold (Variable.declare_names o Free o snd) params
haftmann@25536
   782
    |> fold (fn tyco => ProofContext.add_arity (tyco, sorts, sort)) tycos
haftmann@25485
   783
    |> Context.proof_map (
haftmann@25485
   784
        Syntax.add_term_check 0 "instance" inst_term_check
haftmann@25485
   785
        #> Syntax.add_term_uncheck 0 "instance" inst_term_uncheck)
haftmann@25485
   786
  end;
haftmann@25485
   787
haftmann@25485
   788
fun gen_instantiation_instance do_proof after_qed lthy =
haftmann@25485
   789
  let
haftmann@25536
   790
    val (tycos, sorts, sort) = (#arities o the_instantiation) lthy;
haftmann@25536
   791
    val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, sorts, sort)) tycos;
haftmann@25462
   792
    fun after_qed' results =
haftmann@25462
   793
      LocalTheory.theory (fold (AxClass.add_arity o Thm.varifyT) results)
haftmann@25462
   794
      #> after_qed;
haftmann@25462
   795
  in
haftmann@25462
   796
    lthy
haftmann@25462
   797
    |> do_proof after_qed' arities_proof
haftmann@25462
   798
  end;
haftmann@25462
   799
haftmann@25485
   800
val instantiation_instance = gen_instantiation_instance (fn after_qed => fn ts =>
haftmann@25462
   801
  Proof.theorem_i NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts));
haftmann@25462
   802
haftmann@25485
   803
fun prove_instantiation_instance tac = gen_instantiation_instance (fn after_qed =>
haftmann@25502
   804
  fn ts => fn lthy => after_qed (map (fn t => Goal.prove lthy [] [] t
haftmann@25502
   805
    (fn {context, ...} => tac context)) ts) lthy) I;
haftmann@25462
   806
haftmann@25462
   807
fun conclude_instantiation lthy =
haftmann@25462
   808
  let
haftmann@25485
   809
    val { arities, params } = the_instantiation lthy;
haftmann@25536
   810
    val (tycos, sorts, sort) = arities;
haftmann@25462
   811
    val thy = ProofContext.theory_of lthy;
haftmann@25597
   812
    val _ = map (fn tyco => if Sign.of_sort thy
haftmann@25462
   813
        (Type (tyco, map TFree (Name.names Name.context Name.aT sorts)), sort)
haftmann@25462
   814
      then () else error ("Missing instance proof for type " ^ quote (Sign.extern_type thy tyco)))
haftmann@25597
   815
        tycos;
haftmann@25597
   816
  in lthy end;
haftmann@25462
   817
haftmann@25603
   818
fun pretty_instantiation lthy =
haftmann@25603
   819
  let
haftmann@25603
   820
    val { arities, params } = the_instantiation lthy;
haftmann@25603
   821
    val (tycos, sorts, sort) = arities;
haftmann@25603
   822
    val thy = ProofContext.theory_of lthy;
haftmann@25603
   823
    fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, sorts, sort);
haftmann@25603
   824
    fun pr_param ((c, _), (v, ty)) =
haftmann@25603
   825
      (Pretty.block o Pretty.breaks) [(Pretty.str o Sign.extern_const thy) c, Pretty.str "::",
haftmann@25603
   826
        Sign.pretty_typ thy ty, Pretty.str "as", Pretty.str v];
haftmann@25603
   827
  in
haftmann@25603
   828
    (Pretty.block o Pretty.fbreaks)
haftmann@25603
   829
      (Pretty.str "instantiation" :: map pr_arity tycos @ map pr_param params)
haftmann@25603
   830
  end;
haftmann@25603
   831
haftmann@24218
   832
end;