src/Pure/Isar/class.ML
author haftmann
Tue Dec 11 10:23:10 2007 +0100 (2007-12-11 ago)
changeset 25603 4b7a58fc168c
parent 25597 34860182b250
child 25618 01f20279fea1
permissions -rw-r--r--
dropped Class.prep_spec
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@25195
    25
  val prove_subclass: class * class -> thm list -> Proof.context
haftmann@25195
    26
    -> theory -> theory
haftmann@25485
    27
haftmann@25485
    28
  val class_prefix: string -> string
haftmann@25485
    29
  val is_class: theory -> class -> bool
haftmann@25485
    30
  val these_params: theory -> sort -> (string * (string * typ)) list
haftmann@24589
    31
  val print_classes: theory -> unit
haftmann@24423
    32
haftmann@25462
    33
  (*instances*)
haftmann@25536
    34
  val init_instantiation: string list * sort list * sort -> theory -> local_theory
haftmann@25485
    35
  val instantiation_instance: (local_theory -> local_theory) -> local_theory -> Proof.state
haftmann@25485
    36
  val prove_instantiation_instance: (Proof.context -> tactic) -> local_theory -> local_theory
haftmann@25485
    37
  val conclude_instantiation: local_theory -> local_theory
haftmann@25603
    38
  val instantiation_param: local_theory -> string -> string option
haftmann@25485
    39
  val confirm_declaration: string -> local_theory -> local_theory
haftmann@25603
    40
  val pretty_instantiation: local_theory -> Pretty.T
haftmann@25485
    41
haftmann@25462
    42
  (*old axclass layer*)
haftmann@25462
    43
  val axclass_cmd: bstring * xstring list
haftmann@25462
    44
    -> ((bstring * Attrib.src list) * string list) list
haftmann@25462
    45
    -> theory -> class * theory
haftmann@25462
    46
  val classrel_cmd: xstring * xstring -> theory -> Proof.state
haftmann@25462
    47
haftmann@25462
    48
  (*old instance layer*)
haftmann@25536
    49
  val instance_arity: (theory -> theory) -> arity -> theory -> Proof.state
haftmann@25536
    50
  val instance_arity_cmd: bstring * xstring list * xstring -> theory -> Proof.state
haftmann@24218
    51
end;
haftmann@24218
    52
haftmann@24218
    53
structure Class : CLASS =
haftmann@24218
    54
struct
haftmann@24218
    55
haftmann@24218
    56
(** auxiliary **)
haftmann@24218
    57
haftmann@25062
    58
val classN = "class";
haftmann@25062
    59
val introN = "intro";
haftmann@25062
    60
haftmann@25002
    61
fun prove_interpretation tac prfx_atts expr inst =
haftmann@25002
    62
  Locale.interpretation_i I prfx_atts expr inst
haftmann@24589
    63
  #> Proof.global_terminal_proof
haftmann@24589
    64
      (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@24589
    65
  #> ProofContext.theory_of;
haftmann@24589
    66
haftmann@25195
    67
fun prove_interpretation_in tac after_qed (name, expr) =
haftmann@25195
    68
  Locale.interpretation_in_locale
haftmann@25195
    69
      (ProofContext.theory after_qed) (name, expr)
haftmann@25195
    70
  #> Proof.global_terminal_proof
haftmann@25195
    71
      (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@25195
    72
  #> ProofContext.theory_of;
haftmann@25195
    73
wenzelm@25020
    74
fun OF_LAST thm1 thm2 = thm1 RSN (Thm.nprems_of thm2, thm2);
haftmann@24589
    75
haftmann@24589
    76
fun strip_all_ofclass thy sort =
haftmann@24589
    77
  let
wenzelm@24847
    78
    val typ = TVar ((Name.aT, 0), sort);
haftmann@24589
    79
    fun prem_inclass t =
haftmann@24589
    80
      case Logic.strip_imp_prems t
haftmann@24589
    81
       of ofcls :: _ => try Logic.dest_inclass ofcls
haftmann@24589
    82
        | [] => NONE;
haftmann@24589
    83
    fun strip_ofclass class thm =
haftmann@24589
    84
      thm OF (fst o AxClass.of_sort thy (typ, [class])) AxClass.cache;
haftmann@24589
    85
    fun strip thm = case (prem_inclass o Thm.prop_of) thm
haftmann@24589
    86
     of SOME (_, class) => thm |> strip_ofclass class |> strip
haftmann@24589
    87
      | NONE => thm;
haftmann@24589
    88
  in strip end;
haftmann@24589
    89
haftmann@25038
    90
fun get_remove_global_constraint c thy =
haftmann@25038
    91
  let
haftmann@25038
    92
    val ty = Sign.the_const_constraint thy c;
haftmann@25038
    93
  in
haftmann@25038
    94
    thy
haftmann@25038
    95
    |> Sign.add_const_constraint (c, NONE)
haftmann@25038
    96
    |> pair (c, Logic.unvarifyT ty)
haftmann@25038
    97
  end;
haftmann@25038
    98
haftmann@24589
    99
haftmann@25485
   100
(** primitive axclass and instance commands **)
haftmann@24589
   101
haftmann@24218
   102
fun axclass_cmd (class, raw_superclasses) raw_specs thy =
haftmann@24218
   103
  let
haftmann@24218
   104
    val ctxt = ProofContext.init thy;
haftmann@24218
   105
    val superclasses = map (Sign.read_class thy) raw_superclasses;
haftmann@24589
   106
    val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst)
haftmann@24589
   107
      raw_specs;
haftmann@24589
   108
    val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd)
haftmann@24589
   109
          raw_specs)
haftmann@24218
   110
      |> snd
haftmann@24218
   111
      |> (map o map) fst;
haftmann@24589
   112
  in
haftmann@24589
   113
    AxClass.define_class (class, superclasses) []
haftmann@24589
   114
      (name_atts ~~ axiomss) thy
haftmann@24589
   115
  end;
haftmann@24218
   116
haftmann@24218
   117
local
haftmann@24218
   118
haftmann@24218
   119
fun gen_instance mk_prop add_thm after_qed insts thy =
haftmann@24218
   120
  let
haftmann@24218
   121
    fun after_qed' results =
haftmann@24218
   122
      ProofContext.theory ((fold o fold) add_thm results #> after_qed);
haftmann@24218
   123
  in
haftmann@24218
   124
    thy
haftmann@24218
   125
    |> ProofContext.init
haftmann@24589
   126
    |> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])])
haftmann@25536
   127
        o mk_prop thy) insts)
haftmann@24218
   128
  end;
haftmann@24218
   129
haftmann@24218
   130
in
haftmann@24218
   131
haftmann@24589
   132
val instance_arity =
haftmann@24218
   133
  gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity;
haftmann@25502
   134
val instance_arity_cmd =
haftmann@25502
   135
  gen_instance (Logic.mk_arities oo Sign.read_arity) AxClass.add_arity I;
haftmann@24589
   136
val classrel =
haftmann@25536
   137
  gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) AxClass.add_classrel I;
haftmann@24589
   138
val classrel_cmd =
haftmann@25536
   139
  gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) AxClass.add_classrel I;
haftmann@24218
   140
haftmann@24218
   141
end; (*local*)
haftmann@24218
   142
haftmann@24218
   143
haftmann@24589
   144
(** class data **)
haftmann@24218
   145
haftmann@24218
   146
datatype class_data = ClassData of {
haftmann@24218
   147
  consts: (string * string) list
haftmann@24836
   148
    (*locale parameter ~> constant name*),
haftmann@25062
   149
  base_sort: sort,
haftmann@25083
   150
  inst: term option list
haftmann@25083
   151
    (*canonical interpretation*),
haftmann@25062
   152
  morphism: morphism,
haftmann@25062
   153
    (*partial morphism of canonical interpretation*)
haftmann@24657
   154
  intro: thm,
haftmann@24657
   155
  defs: thm list,
haftmann@25368
   156
  operations: (string * (class * (typ * term))) list
haftmann@24657
   157
};
haftmann@24218
   158
haftmann@24657
   159
fun rep_class_data (ClassData d) = d;
haftmann@25062
   160
fun mk_class_data ((consts, base_sort, inst, morphism, intro),
haftmann@25368
   161
    (defs, operations)) =
haftmann@25062
   162
  ClassData { consts = consts, base_sort = base_sort, inst = inst,
haftmann@25062
   163
    morphism = morphism, intro = intro, defs = defs,
haftmann@25368
   164
    operations = operations };
haftmann@25062
   165
fun map_class_data f (ClassData { consts, base_sort, inst, morphism, intro,
haftmann@25368
   166
    defs, operations }) =
haftmann@25062
   167
  mk_class_data (f ((consts, base_sort, inst, morphism, intro),
haftmann@25368
   168
    (defs, operations)));
haftmann@25038
   169
fun merge_class_data _ (ClassData { consts = consts,
haftmann@25062
   170
    base_sort = base_sort, inst = inst, morphism = morphism, intro = intro,
haftmann@25368
   171
    defs = defs1, operations = operations1 },
haftmann@25062
   172
  ClassData { consts = _, base_sort = _, inst = _, morphism = _, intro = _,
haftmann@25368
   173
    defs = defs2, operations = operations2 }) =
haftmann@25062
   174
  mk_class_data ((consts, base_sort, inst, morphism, intro),
haftmann@24914
   175
    (Thm.merge_thms (defs1, defs2),
haftmann@25368
   176
      AList.merge (op =) (K true) (operations1, operations2)));
haftmann@24218
   177
haftmann@24218
   178
structure ClassData = TheoryDataFun
haftmann@24218
   179
(
haftmann@25038
   180
  type T = class_data Graph.T
haftmann@25038
   181
  val empty = Graph.empty;
haftmann@24218
   182
  val copy = I;
haftmann@24218
   183
  val extend = I;
haftmann@25038
   184
  fun merge _ = Graph.join merge_class_data;
haftmann@24218
   185
);
haftmann@24218
   186
haftmann@24218
   187
haftmann@24218
   188
(* queries *)
haftmann@24218
   189
haftmann@25038
   190
val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node o ClassData.get;
haftmann@24218
   191
haftmann@24589
   192
fun the_class_data thy class = case lookup_class_data thy class
wenzelm@25020
   193
 of NONE => error ("Undeclared class " ^ quote class)
haftmann@24589
   194
  | SOME data => data;
haftmann@24218
   195
haftmann@25038
   196
val is_class = is_some oo lookup_class_data;
haftmann@25038
   197
haftmann@25038
   198
val ancestry = Graph.all_succs o ClassData.get;
haftmann@24218
   199
haftmann@25002
   200
fun these_params thy =
haftmann@24218
   201
  let
haftmann@24218
   202
    fun params class =
haftmann@24218
   203
      let
wenzelm@24930
   204
        val const_typs = (#params o AxClass.get_info thy) class;
haftmann@24657
   205
        val const_names = (#consts o the_class_data thy) class;
haftmann@24218
   206
      in
haftmann@24218
   207
        (map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names
haftmann@24218
   208
      end;
haftmann@24218
   209
  in maps params o ancestry thy end;
haftmann@24218
   210
haftmann@24657
   211
fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy;
haftmann@24218
   212
haftmann@25062
   213
fun morphism thy = #morphism o the_class_data thy;
haftmann@25062
   214
haftmann@24218
   215
fun these_intros thy =
haftmann@24657
   216
  Graph.fold (fn (_, (data, _)) => insert Thm.eq_thm ((#intro o rep_class_data) data))
haftmann@25038
   217
    (ClassData.get thy) [];
haftmann@24218
   218
haftmann@24836
   219
fun these_operations thy =
haftmann@24836
   220
  maps (#operations o the_class_data thy) o ancestry thy;
haftmann@24657
   221
haftmann@24218
   222
fun print_classes thy =
haftmann@24218
   223
  let
wenzelm@24920
   224
    val ctxt = ProofContext.init thy;
haftmann@24218
   225
    val algebra = Sign.classes_of thy;
haftmann@24218
   226
    val arities =
haftmann@24218
   227
      Symtab.empty
haftmann@24218
   228
      |> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) =>
haftmann@24218
   229
           Symtab.map_default (class, []) (insert (op =) tyco)) arities)
haftmann@24218
   230
             ((#arities o Sorts.rep_algebra) algebra);
haftmann@24218
   231
    val the_arities = these o Symtab.lookup arities;
haftmann@24218
   232
    fun mk_arity class tyco =
haftmann@24218
   233
      let
haftmann@24218
   234
        val Ss = Sorts.mg_domain algebra tyco [class];
wenzelm@24920
   235
      in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end;
haftmann@24218
   236
    fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: "
wenzelm@24920
   237
      ^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty);
haftmann@24218
   238
    fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [
haftmann@25062
   239
      (SOME o Pretty.str) ("class " ^ Sign.extern_class thy class ^ ":"),
haftmann@24218
   240
      (SOME o Pretty.block) [Pretty.str "supersort: ",
wenzelm@24920
   241
        (Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class],
haftmann@25062
   242
      if is_class thy class then (SOME o Pretty.str)
haftmann@25062
   243
        ("locale: " ^ Locale.extern thy class) else NONE,
haftmann@25062
   244
      ((fn [] => NONE | ps => (SOME o Pretty.block o Pretty.fbreaks)
haftmann@25062
   245
          (Pretty.str "parameters:" :: ps)) o map mk_param
wenzelm@24930
   246
        o these o Option.map #params o try (AxClass.get_info thy)) class,
haftmann@24218
   247
      (SOME o Pretty.block o Pretty.breaks) [
haftmann@24218
   248
        Pretty.str "instances:",
haftmann@24218
   249
        Pretty.list "" "" (map (mk_arity class) (the_arities class))
haftmann@24218
   250
      ]
haftmann@24218
   251
    ]
haftmann@24218
   252
  in
haftmann@24589
   253
    (Pretty.writeln o Pretty.chunks o separate (Pretty.str "")
haftmann@24589
   254
      o map mk_entry o Sorts.all_classes) algebra
haftmann@24218
   255
  end;
haftmann@24218
   256
haftmann@24218
   257
haftmann@24218
   258
(* updaters *)
haftmann@24218
   259
haftmann@25163
   260
fun add_class_data ((class, superclasses), (cs, base_sort, inst, phi, intro)) thy =
haftmann@25002
   261
  let
haftmann@25368
   262
    val operations = map (fn (v_ty as (_, ty), (c, _)) =>
haftmann@25368
   263
      (c, (class, (ty, Free v_ty)))) cs;
haftmann@25002
   264
    val cs = (map o pairself) fst cs;
haftmann@25038
   265
    val add_class = Graph.new_node (class,
haftmann@25368
   266
        mk_class_data ((cs, base_sort, map (SOME o Const) inst, phi, intro), ([], operations)))
haftmann@25002
   267
      #> fold (curry Graph.add_edge class) superclasses;
haftmann@25002
   268
  in
haftmann@25038
   269
    ClassData.map add_class thy
haftmann@25002
   270
  end;
haftmann@24218
   271
haftmann@25368
   272
fun register_operation class (c, (t, some_def)) thy =
haftmann@25062
   273
  let
haftmann@25368
   274
    val base_sort = (#base_sort o the_class_data thy) class;
haftmann@25239
   275
    val prep_typ = map_atyps
haftmann@25368
   276
      (fn TVar (vi as (v, _), sort) => if Name.aT = v
haftmann@25368
   277
        then TFree (v, base_sort) else TVar (vi, sort));
haftmann@25368
   278
    val t' = map_types prep_typ t;
haftmann@25368
   279
    val ty' = Term.fastype_of t';
haftmann@25062
   280
  in
haftmann@25062
   281
    thy
haftmann@25062
   282
    |> (ClassData.map o Graph.map_node class o map_class_data o apsnd)
haftmann@25368
   283
      (fn (defs, operations) =>
haftmann@25096
   284
        (fold cons (the_list some_def) defs,
haftmann@25368
   285
          (c, (class, (ty', t'))) :: operations))
haftmann@25062
   286
  end;
haftmann@24218
   287
haftmann@24589
   288
haftmann@24589
   289
(** rule calculation, tactics and methods **)
haftmann@24589
   290
wenzelm@25024
   291
val class_prefix = Logic.const_of_class o Sign.base_name;
wenzelm@25024
   292
haftmann@25062
   293
fun calculate_morphism class cs =
haftmann@25062
   294
  let
haftmann@25062
   295
    val subst_typ = Term.map_type_tfree (fn var as (v, sort) =>
haftmann@25062
   296
      if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort));
haftmann@25062
   297
    fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) cs v
haftmann@25062
   298
         of SOME (c, _) => Const (c, ty)
haftmann@25062
   299
          | NONE => t)
haftmann@25062
   300
      | subst_aterm t = t;
haftmann@25062
   301
    val subst_term = map_aterms subst_aterm #> map_types subst_typ;
haftmann@25062
   302
  in
haftmann@25209
   303
    Morphism.term_morphism subst_term
haftmann@25062
   304
    $> Morphism.typ_morphism subst_typ
haftmann@25062
   305
  end;
haftmann@25062
   306
haftmann@25038
   307
fun class_intro thy class sups =
haftmann@24589
   308
  let
haftmann@24589
   309
    fun class_elim class =
wenzelm@25020
   310
      case (#axioms o AxClass.get_info thy) class
wenzelm@25020
   311
       of [thm] => SOME (Drule.unconstrainTs thm)
haftmann@24589
   312
        | [] => NONE;
haftmann@25038
   313
    val pred_intro = case Locale.intros thy class
haftmann@24589
   314
     of ([ax_intro], [intro]) => intro |> OF_LAST ax_intro |> SOME
haftmann@24589
   315
      | ([intro], []) => SOME intro
haftmann@24589
   316
      | ([], [intro]) => SOME intro
haftmann@24589
   317
      | _ => NONE;
haftmann@24589
   318
    val pred_intro' = pred_intro
haftmann@24589
   319
      |> Option.map (fn intro => intro OF map_filter class_elim sups);
wenzelm@24930
   320
    val class_intro = (#intro o AxClass.get_info thy) class;
haftmann@24589
   321
    val raw_intro = case pred_intro'
haftmann@24589
   322
     of SOME pred_intro => class_intro |> OF_LAST pred_intro
haftmann@24589
   323
      | NONE => class_intro;
haftmann@24589
   324
    val sort = Sign.super_classes thy class;
wenzelm@24847
   325
    val typ = TVar ((Name.aT, 0), sort);
haftmann@24589
   326
    val defs = these_defs thy sups;
haftmann@24589
   327
  in
haftmann@24589
   328
    raw_intro
haftmann@24589
   329
    |> Drule.instantiate' [SOME (Thm.ctyp_of thy typ)] []
haftmann@24589
   330
    |> strip_all_ofclass thy sort
haftmann@24589
   331
    |> Thm.strip_shyps
haftmann@24589
   332
    |> MetaSimplifier.rewrite_rule defs
haftmann@24589
   333
    |> Drule.unconstrainTs
haftmann@24589
   334
  end;
haftmann@24589
   335
haftmann@24589
   336
fun class_interpretation class facts defs thy =
haftmann@24589
   337
  let
haftmann@25038
   338
    val params = these_params thy [class];
haftmann@25083
   339
    val inst = (#inst o the_class_data thy) class;
wenzelm@25020
   340
    val tac = ALLGOALS (ProofContext.fact_tac facts);
haftmann@25038
   341
    val prfx = class_prefix class;
haftmann@24589
   342
  in
haftmann@25038
   343
    thy
haftmann@25038
   344
    |> fold_map (get_remove_global_constraint o fst o snd) params
ballarin@25094
   345
    ||> prove_interpretation tac ((false, prfx), []) (Locale.Locale class)
ballarin@25094
   346
          (inst, map (fn def => (("", []), def)) defs)
haftmann@25038
   347
    |-> (fn cs => fold (Sign.add_const_constraint o apsnd SOME) cs)
haftmann@24589
   348
  end;
haftmann@24218
   349
haftmann@24218
   350
fun intro_classes_tac facts st =
haftmann@24218
   351
  let
haftmann@24218
   352
    val thy = Thm.theory_of_thm st;
haftmann@24218
   353
    val classes = Sign.all_classes thy;
haftmann@24218
   354
    val class_trivs = map (Thm.class_triv thy) classes;
haftmann@24218
   355
    val class_intros = these_intros thy;
wenzelm@24930
   356
    val axclass_intros = map_filter (try (#intro o AxClass.get_info thy)) classes;
haftmann@24218
   357
  in
haftmann@25268
   358
    Method.intros_tac (class_trivs @ class_intros @ axclass_intros) facts st
haftmann@24218
   359
  end;
haftmann@24218
   360
haftmann@24218
   361
fun default_intro_classes_tac [] = intro_classes_tac []
wenzelm@24930
   362
  | default_intro_classes_tac _ = no_tac;
haftmann@24218
   363
haftmann@24218
   364
fun default_tac rules ctxt facts =
haftmann@24218
   365
  HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
haftmann@24218
   366
    default_intro_classes_tac facts;
haftmann@24218
   367
haftmann@24218
   368
val _ = Context.add_setup (Method.add_methods
haftmann@24218
   369
 [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
haftmann@24218
   370
    "back-chain introduction rules of classes"),
haftmann@24218
   371
  ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
haftmann@24218
   372
    "apply some intro/elim rule")]);
haftmann@24218
   373
haftmann@25195
   374
fun subclass_rule thy (sub, sup) =
haftmann@25195
   375
  let
haftmann@25195
   376
    val ctxt = Locale.init sub thy;
haftmann@25195
   377
    val ctxt_thy = ProofContext.init thy;
haftmann@25195
   378
    val props =
haftmann@25195
   379
      Locale.global_asms_of thy sup
haftmann@25195
   380
      |> maps snd
haftmann@25195
   381
      |> map (ObjectLogic.ensure_propT thy);
haftmann@25195
   382
    fun tac { prems, context } =
haftmann@25195
   383
      Locale.intro_locales_tac true context prems
haftmann@25195
   384
        ORELSE ALLGOALS assume_tac;
haftmann@25195
   385
  in
haftmann@25195
   386
    Goal.prove_multi ctxt [] [] props tac
haftmann@25195
   387
    |> map (Assumption.export false ctxt ctxt_thy)
haftmann@25195
   388
    |> Variable.export ctxt ctxt_thy
haftmann@25195
   389
  end;
haftmann@25195
   390
haftmann@25195
   391
fun prove_single_subclass (sub, sup) thms ctxt thy =
haftmann@25195
   392
  let
haftmann@25195
   393
    val ctxt_thy = ProofContext.init thy;
haftmann@25195
   394
    val subclass_rule = Conjunction.intr_balanced thms
haftmann@25195
   395
      |> Assumption.export false ctxt ctxt_thy
haftmann@25195
   396
      |> singleton (Variable.export ctxt ctxt_thy);
haftmann@25195
   397
    val sub_inst = Thm.ctyp_of thy (TVar ((Name.aT, 0), [sub]));
haftmann@25195
   398
    val sub_ax = #axioms (AxClass.get_info thy sub);
haftmann@25195
   399
    val classrel =
haftmann@25195
   400
      #intro (AxClass.get_info thy sup)
haftmann@25195
   401
      |> Drule.instantiate' [SOME sub_inst] []
haftmann@25195
   402
      |> OF_LAST (subclass_rule OF sub_ax)
haftmann@25195
   403
      |> strip_all_ofclass thy (Sign.super_classes thy sup)
haftmann@25195
   404
      |> Thm.strip_shyps
haftmann@25195
   405
  in
haftmann@25195
   406
    thy
haftmann@25195
   407
    |> AxClass.add_classrel classrel
haftmann@25195
   408
    |> prove_interpretation_in (ALLGOALS (ProofContext.fact_tac thms))
haftmann@25195
   409
         I (sub, Locale.Locale sup)
haftmann@25195
   410
    |> ClassData.map (Graph.add_edge (sub, sup))
haftmann@25195
   411
  end;
haftmann@25195
   412
haftmann@25195
   413
fun prove_subclass (sub, sup) thms ctxt thy =
haftmann@25195
   414
  let
haftmann@25268
   415
    val classes = ClassData.get thy;
haftmann@25268
   416
    val is_sup = not o null o curry (Graph.irreducible_paths classes) sub;
haftmann@25268
   417
    val supclasses = Graph.all_succs classes [sup] |> filter_out is_sup;
haftmann@25195
   418
    fun transform sup' = subclass_rule thy (sup, sup') |> map (fn thm => thm OF thms);
haftmann@25195
   419
  in
haftmann@25195
   420
    thy
haftmann@25195
   421
    |> fold_rev (fn sup' => prove_single_subclass (sub, sup')
haftmann@25195
   422
         (transform sup') ctxt) supclasses
haftmann@25195
   423
 end;
haftmann@25195
   424
haftmann@24218
   425
haftmann@24589
   426
(** classes and class target **)
haftmann@24218
   427
haftmann@25002
   428
(* class context syntax *)
haftmann@24748
   429
haftmann@25083
   430
structure ClassSyntax = ProofDataFun(
haftmann@25083
   431
  type T = {
haftmann@25368
   432
    local_constraints: (string * typ) list,
haftmann@25368
   433
    global_constraints: (string * typ) list,
haftmann@25083
   434
    base_sort: sort,
haftmann@25368
   435
    operations: (string * (typ * term)) list,
haftmann@25195
   436
    unchecks: (term * term) list,
haftmann@25083
   437
    passed: bool
haftmann@25368
   438
  };
haftmann@25368
   439
  fun init _ = {
haftmann@25368
   440
    local_constraints = [],
haftmann@25368
   441
    global_constraints = [],
haftmann@25368
   442
    base_sort = [],
haftmann@25368
   443
    operations = [],
haftmann@25368
   444
    unchecks = [],
haftmann@25368
   445
    passed = true
haftmann@25368
   446
  };;
haftmann@25083
   447
);
haftmann@25083
   448
wenzelm@25344
   449
fun synchronize_syntax sups base_sort ctxt =
haftmann@24914
   450
  let
wenzelm@25344
   451
    val thy = ProofContext.theory_of ctxt;
haftmann@25368
   452
    fun subst_class_typ sort = map_atyps
haftmann@25368
   453
      (fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty');
haftmann@25083
   454
    val operations = these_operations thy sups;
haftmann@25368
   455
    val local_constraints =
haftmann@25368
   456
      (map o apsnd) (subst_class_typ base_sort o fst o snd) operations;
haftmann@25368
   457
    val global_constraints =
haftmann@25368
   458
      (map o apsnd) (fn (class, (ty, _)) => subst_class_typ [class] ty) operations;
wenzelm@25318
   459
    fun declare_const (c, _) =
wenzelm@25318
   460
      let val b = Sign.base_name c
wenzelm@25344
   461
      in Sign.intern_const thy b = c ? Variable.declare_const (b, c) end;
haftmann@25368
   462
    val unchecks = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) operations;
haftmann@25083
   463
  in
haftmann@25083
   464
    ctxt
haftmann@25368
   465
    |> fold declare_const local_constraints
haftmann@25368
   466
    |> fold (ProofContext.add_const_constraint o apsnd SOME) local_constraints
haftmann@25368
   467
    |> ClassSyntax.put {
haftmann@25368
   468
        local_constraints = local_constraints,
haftmann@25368
   469
        global_constraints = global_constraints,
haftmann@25083
   470
        base_sort = base_sort,
haftmann@25368
   471
        operations = (map o apsnd) snd operations,
haftmann@25195
   472
        unchecks = unchecks,
haftmann@25083
   473
        passed = false
haftmann@25368
   474
      }
haftmann@25083
   475
  end;
haftmann@25083
   476
haftmann@25083
   477
fun refresh_syntax class ctxt =
haftmann@25002
   478
  let
haftmann@25002
   479
    val thy = ProofContext.theory_of ctxt;
haftmann@25062
   480
    val base_sort = (#base_sort o the_class_data thy) class;
wenzelm@25344
   481
  in synchronize_syntax [class] base_sort ctxt end;
haftmann@24914
   482
haftmann@25368
   483
val mark_passed = ClassSyntax.map
haftmann@25368
   484
  (fn { local_constraints, global_constraints, base_sort, operations, unchecks, passed } =>
haftmann@25368
   485
    { local_constraints = local_constraints, global_constraints = global_constraints,
haftmann@25368
   486
      base_sort = base_sort, operations = operations, unchecks = unchecks, passed = true });
haftmann@25083
   487
haftmann@25083
   488
fun sort_term_check ts ctxt =
haftmann@24748
   489
  let
haftmann@25368
   490
    val { local_constraints, global_constraints, base_sort, operations, passed, ... } =
haftmann@25368
   491
      ClassSyntax.get ctxt;
haftmann@25368
   492
    fun check_improve (Const (c, ty)) = (case AList.lookup (op =) local_constraints c
haftmann@25368
   493
         of SOME ty0 => (case try (Type.raw_match (ty0, ty)) Vartab.empty
haftmann@25368
   494
             of SOME tyenv => (case Vartab.lookup tyenv (Name.aT, 0)
haftmann@25368
   495
                 of SOME (_, TVar (tvar as (vi, _))) =>
haftmann@25368
   496
                      if TypeInfer.is_param vi then cons tvar else I
haftmann@25368
   497
                  | _ => I)
haftmann@25368
   498
              | NONE => I)
haftmann@25368
   499
          | NONE => I)
haftmann@25368
   500
      | check_improve _ = I;
haftmann@25368
   501
    val improvements = (fold o fold_aterms) check_improve ts [];
haftmann@25368
   502
    val ts' = (map o map_types o map_atyps) (fn ty as TVar tvar =>
haftmann@25368
   503
        if member (op =) improvements tvar
haftmann@25368
   504
          then TFree (Name.aT, base_sort) else ty | ty => ty) ts;
haftmann@25368
   505
    fun check t0 = Envir.expand_term (fn Const (c, ty) => (case AList.lookup (op =) operations c
haftmann@25368
   506
         of SOME (ty0, t) =>
haftmann@25368
   507
              if Type.typ_instance (ProofContext.tsig_of ctxt) (ty, ty0)
haftmann@25368
   508
              then SOME (ty0, check t) else NONE
haftmann@25368
   509
          | NONE => NONE)
haftmann@25368
   510
      | _ => NONE) t0;
haftmann@25368
   511
    val ts'' = map check ts';
haftmann@25368
   512
  in if eq_list (op aconv) (ts, ts'') andalso passed then NONE
haftmann@25083
   513
  else
haftmann@25083
   514
    ctxt
haftmann@25368
   515
    |> fold (ProofContext.add_const_constraint o apsnd SOME) global_constraints
haftmann@25083
   516
    |> mark_passed
haftmann@25368
   517
    |> pair ts''
haftmann@25083
   518
    |> SOME
haftmann@25083
   519
  end;
haftmann@24748
   520
haftmann@25083
   521
fun sort_term_uncheck ts ctxt =
haftmann@25002
   522
  let
haftmann@25002
   523
    val thy = ProofContext.theory_of ctxt;
haftmann@25368
   524
    val unchecks = (#unchecks o ClassSyntax.get) ctxt;
haftmann@25462
   525
    val ts' = map (Pattern.rewrite_term thy unchecks []) ts;
wenzelm@25060
   526
  in if eq_list (op aconv) (ts, ts') then NONE else SOME (ts', ctxt) end;
haftmann@25002
   527
wenzelm@25344
   528
fun init_ctxt sups base_sort ctxt =
haftmann@25083
   529
  ctxt
haftmann@25083
   530
  |> Variable.declare_term
haftmann@25083
   531
      (Logic.mk_type (TFree (Name.aT, base_sort)))
wenzelm@25344
   532
  |> synchronize_syntax sups base_sort
haftmann@25083
   533
  |> Context.proof_map (
haftmann@25083
   534
      Syntax.add_term_check 0 "class" sort_term_check
haftmann@25103
   535
      #> Syntax.add_term_uncheck 0 "class" sort_term_uncheck)
haftmann@24901
   536
haftmann@25311
   537
fun init class thy =
haftmann@25311
   538
  thy
haftmann@25311
   539
  |> Locale.init class
wenzelm@25344
   540
  |> init_ctxt [class] ((#base_sort o the_class_data thy) class);
haftmann@24914
   541
haftmann@24748
   542
haftmann@24589
   543
(* class definition *)
haftmann@24218
   544
haftmann@24218
   545
local
haftmann@24218
   546
haftmann@24748
   547
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems =
haftmann@24218
   548
  let
haftmann@24748
   549
    val supclasses = map (prep_class thy) raw_supclasses;
haftmann@25209
   550
    val sups = filter (is_class thy) supclasses;
haftmann@25209
   551
    fun the_base_sort class = lookup_class_data thy class
haftmann@25209
   552
      |> Option.map #base_sort
haftmann@25209
   553
      |> the_default [class];
haftmann@25209
   554
    val base_sort = Sign.minimize_sort thy (maps the_base_sort supclasses);
haftmann@24748
   555
    val supsort = Sign.minimize_sort thy supclasses;
haftmann@25038
   556
    val suplocales = map Locale.Locale sups;
haftmann@24748
   557
    val (raw_elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e)
haftmann@24748
   558
      | Locale.Expr i => apsnd (cons (prep_expr thy i))) raw_includes_elems ([], []);
haftmann@24748
   559
    val supexpr = Locale.Merge suplocales;
haftmann@24748
   560
    val supparams = (map fst o Locale.parameters_of_expr thy) supexpr;
haftmann@25002
   561
    val supconsts = AList.make (the o AList.lookup (op =) (these_params thy sups))
haftmann@24748
   562
      (map fst supparams);
haftmann@24748
   563
    val mergeexpr = Locale.Merge (suplocales @ includes);
haftmann@24748
   564
    val constrain = Element.Constrains ((map o apsnd o map_atyps)
wenzelm@24847
   565
      (fn TFree (_, sort) => TFree (Name.aT, sort)) supparams);
haftmann@24748
   566
  in
haftmann@24748
   567
    ProofContext.init thy
haftmann@24748
   568
    |> Locale.cert_expr supexpr [constrain]
haftmann@24748
   569
    |> snd
wenzelm@25344
   570
    |> init_ctxt sups base_sort
haftmann@24748
   571
    |> process_expr Locale.empty raw_elems
haftmann@24748
   572
    |> fst
haftmann@25062
   573
    |> (fn elems => ((((sups, supconsts), (supsort, base_sort, mergeexpr)),
haftmann@24748
   574
          (*FIXME*) if null includes then constrain :: elems else elems)))
haftmann@24748
   575
  end;
haftmann@24748
   576
haftmann@24748
   577
val read_class_spec = gen_class_spec Sign.intern_class Locale.intern_expr Locale.read_expr;
haftmann@24748
   578
val check_class_spec = gen_class_spec (K I) (K I) Locale.cert_expr;
haftmann@24748
   579
wenzelm@24968
   580
fun define_class_params (name, raw_superclasses) raw_consts raw_dep_axioms other_consts thy =
wenzelm@24968
   581
  let
wenzelm@24968
   582
    val superclasses = map (Sign.certify_class thy) raw_superclasses;
wenzelm@24968
   583
    val consts = (map o apfst o apsnd) (Sign.certify_typ thy) raw_consts;
haftmann@25083
   584
    fun add_const ((c, ty), syn) =
haftmann@25083
   585
      Sign.declare_const [] (c, Type.strip_sorts ty, syn) #>> Term.dest_Const;
wenzelm@24968
   586
    fun mk_axioms cs thy =
wenzelm@24968
   587
      raw_dep_axioms thy cs
wenzelm@24968
   588
      |> (map o apsnd o map) (Sign.cert_prop thy)
wenzelm@24968
   589
      |> rpair thy;
haftmann@25002
   590
    fun constrain_typs class = (map o apsnd o Term.map_type_tfree)
haftmann@25002
   591
      (fn (v, _) => TFree (v, [class]))
wenzelm@24968
   592
  in
wenzelm@24968
   593
    thy
wenzelm@24968
   594
    |> Sign.add_path (Logic.const_of_class name)
wenzelm@24968
   595
    |> fold_map add_const consts
wenzelm@24968
   596
    ||> Sign.restore_naming thy
wenzelm@24968
   597
    |-> (fn cs => mk_axioms cs
wenzelm@24968
   598
    #-> (fn axioms_prop => AxClass.define_class (name, superclasses)
wenzelm@24968
   599
           (map fst cs @ other_consts) axioms_prop
haftmann@25002
   600
    #-> (fn class => `(fn _ => constrain_typs class cs)
haftmann@25002
   601
    #-> (fn cs' => `(fn thy => AxClass.get_info thy class)
haftmann@25002
   602
    #-> (fn {axioms, ...} => fold (Sign.add_const_constraint o apsnd SOME) cs'
haftmann@25002
   603
    #> pair (class, (cs', axioms)))))))
wenzelm@24968
   604
  end;
wenzelm@24968
   605
haftmann@25002
   606
fun gen_class prep_spec prep_param bname
haftmann@24748
   607
    raw_supclasses raw_includes_elems raw_other_consts thy =
haftmann@24748
   608
  let
haftmann@25038
   609
    val class = Sign.full_name thy bname;
haftmann@25062
   610
    val (((sups, supconsts), (supsort, base_sort, mergeexpr)), elems_syn) =
haftmann@24748
   611
      prep_spec thy raw_supclasses raw_includes_elems;
wenzelm@24968
   612
    val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts;
haftmann@25163
   613
    fun mk_inst class cs =
haftmann@25163
   614
      (map o apsnd o Term.map_type_tfree) (fn (v, _) => TFree (v, [class])) cs;
haftmann@25062
   615
    fun fork_syntax (Element.Fixes xs) =
haftmann@25062
   616
          fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs
haftmann@25062
   617
          #>> Element.Fixes
haftmann@25062
   618
      | fork_syntax x = pair x;
haftmann@25062
   619
    val (elems, global_syn) = fold_map fork_syntax elems_syn [];
wenzelm@25326
   620
    fun globalize (c, ty) =
haftmann@25062
   621
      ((c, Term.map_type_tfree (K (TFree (Name.aT, base_sort))) ty),
haftmann@25062
   622
        (the_default NoSyn o AList.lookup (op =) global_syn) c);
haftmann@25038
   623
    fun extract_params thy =
haftmann@24218
   624
      let
haftmann@25062
   625
        val params = map fst (Locale.parameters_of thy class);
haftmann@24218
   626
      in
haftmann@25062
   627
        (params, (map globalize o snd o chop (length supconsts)) params)
haftmann@24218
   628
      end;
haftmann@25038
   629
    fun extract_assumes params thy cs =
haftmann@24218
   630
      let
haftmann@24218
   631
        val consts = supconsts @ (map (fst o fst) params ~~ cs);
haftmann@24218
   632
        fun subst (Free (c, ty)) =
haftmann@24218
   633
              Const ((fst o the o AList.lookup (op =) consts) c, ty)
haftmann@24218
   634
          | subst t = t;
haftmann@24218
   635
        fun prep_asm ((name, atts), ts) =
wenzelm@25024
   636
          ((Sign.base_name name, map (Attrib.attribute_i thy) atts),
haftmann@24589
   637
            (map o map_aterms) subst ts);
haftmann@24218
   638
      in
haftmann@25038
   639
        Locale.global_asms_of thy class
haftmann@24218
   640
        |> map prep_asm
haftmann@24218
   641
      end;
haftmann@24218
   642
  in
haftmann@24218
   643
    thy
haftmann@24748
   644
    |> Locale.add_locale_i (SOME "") bname mergeexpr elems
haftmann@25038
   645
    |> snd
haftmann@25311
   646
    |> ProofContext.theory_of
haftmann@25311
   647
    |> `extract_params
haftmann@25311
   648
    |-> (fn (all_params, params) =>
wenzelm@24968
   649
        define_class_params (bname, supsort) params
haftmann@25038
   650
          (extract_assumes params) other_consts
haftmann@25038
   651
      #-> (fn (_, (consts, axioms)) =>
haftmann@25038
   652
        `(fn thy => class_intro thy class sups)
haftmann@24218
   653
      #-> (fn class_intro =>
haftmann@25062
   654
        PureThy.note_thmss_qualified "" (NameSpace.append class classN)
haftmann@25062
   655
          [((introN, []), [([class_intro], [])])]
haftmann@25062
   656
      #-> (fn [(_, [class_intro])] =>
haftmann@25038
   657
        add_class_data ((class, sups),
haftmann@25062
   658
          (map fst params ~~ consts, base_sort,
haftmann@25163
   659
            mk_inst class (map snd supconsts @ consts),
haftmann@25062
   660
              calculate_morphism class (supconsts @ (map (fst o fst) params ~~ consts)), class_intro))
haftmann@25038
   661
      #> class_interpretation class axioms []
haftmann@25311
   662
      ))))
haftmann@25268
   663
    |> init class
haftmann@25038
   664
    |> pair class
haftmann@24218
   665
  end;
haftmann@24218
   666
wenzelm@25326
   667
fun read_const thy = #1 o Term.dest_Const o ProofContext.read_const (ProofContext.init thy);
wenzelm@25326
   668
haftmann@24218
   669
in
haftmann@24218
   670
wenzelm@25326
   671
val class_cmd = gen_class read_class_spec read_const;
haftmann@24748
   672
val class = gen_class check_class_spec (K I);
haftmann@24218
   673
haftmann@24218
   674
end; (*local*)
haftmann@24218
   675
haftmann@24218
   676
haftmann@25485
   677
(* class target *)
haftmann@24218
   678
haftmann@25603
   679
fun declare class pos ((c, mx), dict) thy =
haftmann@24218
   680
  let
wenzelm@25024
   681
    val prfx = class_prefix class;
wenzelm@25024
   682
    val thy' = thy |> Sign.add_path prfx;
haftmann@25062
   683
    val phi = morphism thy' class;
wenzelm@25024
   684
haftmann@25062
   685
    val c' = Sign.full_name thy' c;
haftmann@25239
   686
    val dict' = Morphism.term phi dict;
haftmann@25239
   687
    val dict_def = map_types Logic.unvarifyT dict';
haftmann@25239
   688
    val ty' = Term.fastype_of dict_def;
haftmann@25083
   689
    val ty'' = Type.strip_sorts ty';
haftmann@25239
   690
    val def_eq = Logic.mk_equals (Const (c', ty'), dict_def);
haftmann@24218
   691
  in
wenzelm@25024
   692
    thy'
haftmann@25096
   693
    |> Sign.declare_const pos (c, ty'', mx) |> snd
haftmann@25518
   694
    |> Thm.add_def false false (c, def_eq)
haftmann@25062
   695
    |>> Thm.symmetric
haftmann@25083
   696
    |-> (fn def => class_interpretation class [def] [Thm.prop_of def]
haftmann@25368
   697
          #> register_operation class (c', (dict', SOME (Thm.varifyT def))))
haftmann@24218
   698
    |> Sign.restore_naming thy
haftmann@25083
   699
    |> Sign.add_const_constraint (c', SOME ty')
haftmann@24218
   700
  end;
haftmann@24218
   701
haftmann@25603
   702
fun abbrev class prmode pos ((c, mx), rhs) thy =
haftmann@24836
   703
  let
wenzelm@25024
   704
    val prfx = class_prefix class;
haftmann@25096
   705
    val thy' = thy |> Sign.add_path prfx;
haftmann@25062
   706
    val phi = morphism thy class;
haftmann@25062
   707
haftmann@25096
   708
    val c' = Sign.full_name thy' c;
haftmann@25146
   709
    val rews = map (Logic.dest_equals o Thm.prop_of) (these_defs thy' [class])
haftmann@25146
   710
    val rhs' = (Pattern.rewrite_term thy rews [] o Morphism.term phi) rhs;
haftmann@25239
   711
    val ty' = Logic.unvarifyT (Term.fastype_of rhs');
haftmann@24836
   712
  in
haftmann@25096
   713
    thy'
haftmann@25146
   714
    |> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') |> snd
haftmann@25096
   715
    |> Sign.add_const_constraint (c', SOME ty')
wenzelm@25024
   716
    |> Sign.notation true prmode [(Const (c', ty'), mx)]
haftmann@25368
   717
    |> register_operation class (c', (rhs', NONE))
haftmann@25096
   718
    |> Sign.restore_naming thy
haftmann@24836
   719
  end;
haftmann@24836
   720
haftmann@25462
   721
haftmann@25462
   722
(** instantiation target **)
haftmann@25462
   723
haftmann@25462
   724
(* bookkeeping *)
haftmann@25462
   725
haftmann@25462
   726
datatype instantiation = Instantiation of {
haftmann@25536
   727
  arities: string list * sort list * sort,
haftmann@25462
   728
  params: ((string * string) * (string * typ)) list
haftmann@25603
   729
    (*(instantiation parameter, type constructor), (local instantiation parameter, typ)*)
haftmann@25462
   730
}
haftmann@25462
   731
haftmann@25462
   732
structure Instantiation = ProofDataFun
haftmann@25462
   733
(
haftmann@25462
   734
  type T = instantiation
haftmann@25536
   735
  fun init _ = Instantiation { arities = ([], [], []), params = [] };
haftmann@25462
   736
);
haftmann@25462
   737
haftmann@25485
   738
fun mk_instantiation (arities, params) =
haftmann@25485
   739
  Instantiation { arities = arities, params = params };
haftmann@25514
   740
fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy)
haftmann@25485
   741
 of Instantiation data => data;
haftmann@25514
   742
fun map_instantiation f = (LocalTheory.target o Instantiation.map)
haftmann@25514
   743
  (fn Instantiation { arities, params } => mk_instantiation (f (arities, params)));
haftmann@25462
   744
haftmann@25514
   745
fun the_instantiation lthy = case get_instantiation lthy
haftmann@25536
   746
 of { arities = ([], [], []), ... } => error "No instantiation target"
haftmann@25485
   747
  | data => data;
haftmann@25462
   748
haftmann@25485
   749
val instantiation_params = #params o get_instantiation;
haftmann@25462
   750
haftmann@25514
   751
fun instantiation_param lthy v = instantiation_params lthy
haftmann@25462
   752
  |> find_first (fn (_, (v', _)) => v = v')
haftmann@25462
   753
  |> Option.map (fst o fst);
haftmann@25462
   754
haftmann@25514
   755
fun confirm_declaration c = (map_instantiation o apsnd)
haftmann@25485
   756
  (filter_out (fn (_, (c', _)) => c' = c));
haftmann@25485
   757
haftmann@25462
   758
haftmann@25462
   759
(* syntax *)
haftmann@25462
   760
haftmann@25597
   761
fun subst_param thy params = map_aterms (fn t as Const (c, ty) =>
haftmann@25597
   762
    (case AxClass.inst_tyco_of thy (c, ty)
haftmann@25536
   763
     of SOME tyco => (case AList.lookup (op =) params (c, tyco)
haftmann@25536
   764
         of SOME v_ty => Free v_ty
haftmann@25536
   765
          | NONE => t)
haftmann@25536
   766
      | NONE => t)
haftmann@25536
   767
  | t => t);
haftmann@25536
   768
haftmann@25514
   769
fun inst_term_check ts lthy =
haftmann@25462
   770
  let
haftmann@25514
   771
    val params = instantiation_params lthy;
haftmann@25514
   772
    val tsig = ProofContext.tsig_of lthy;
haftmann@25514
   773
    val thy = ProofContext.theory_of lthy;
haftmann@25462
   774
haftmann@25597
   775
    fun check_improve (Const (c, ty)) = (case AxClass.inst_tyco_of thy (c, ty)
haftmann@25462
   776
         of SOME tyco => (case AList.lookup (op =) params (c, tyco)
haftmann@25502
   777
             of SOME (_, ty') => perhaps (try (Type.typ_match tsig (ty, ty')))
haftmann@25462
   778
              | NONE => I)
haftmann@25462
   779
          | NONE => I)
haftmann@25462
   780
      | check_improve _ = I;
haftmann@25462
   781
    val improvement = (fold o fold_aterms) check_improve ts Vartab.empty;
haftmann@25462
   782
    val ts' = (map o map_types) (Envir.typ_subst_TVars improvement) ts;
haftmann@25536
   783
    val ts'' = map (subst_param thy params) ts';
haftmann@25514
   784
  in if eq_list (op aconv) (ts, ts'') then NONE else SOME (ts'', lthy) end;
haftmann@25462
   785
haftmann@25514
   786
fun inst_term_uncheck ts lthy =
haftmann@25462
   787
  let
haftmann@25514
   788
    val params = instantiation_params lthy;
haftmann@25462
   789
    val ts' = (map o map_aterms) (fn t as Free (v, ty) =>
haftmann@25462
   790
       (case get_first (fn ((c, _), (v', _)) => if v = v' then SOME c else NONE) params
haftmann@25462
   791
         of SOME c => Const (c, ty)
haftmann@25462
   792
          | NONE => t)
haftmann@25462
   793
      | t => t) ts;
haftmann@25514
   794
  in if eq_list (op aconv) (ts, ts') then NONE else SOME (ts', lthy) end;
haftmann@25462
   795
haftmann@25462
   796
haftmann@25462
   797
(* target *)
haftmann@25462
   798
haftmann@25485
   799
val sanatize_name = (*FIXME*)
haftmann@25485
   800
  let
haftmann@25574
   801
    fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s
haftmann@25574
   802
      orelse s = "'" orelse s = "_";
haftmann@25485
   803
    val is_junk = not o is_valid andf Symbol.is_regular;
haftmann@25485
   804
    val junk = Scan.many is_junk;
haftmann@25485
   805
    val scan_valids = Symbol.scanner "Malformed input"
haftmann@25485
   806
      ((junk |--
haftmann@25485
   807
        (Scan.optional (Scan.one Symbol.is_ascii_letter) "x" ^^ (Scan.many is_valid >> implode)
haftmann@25485
   808
        --| junk))
haftmann@25485
   809
      -- Scan.repeat ((Scan.many1 is_valid >> implode) --| junk) >> op ::);
haftmann@25485
   810
  in
haftmann@25485
   811
    explode #> scan_valids #> implode
haftmann@25485
   812
  end;
haftmann@25485
   813
haftmann@25536
   814
fun init_instantiation (tycos, sorts, sort) thy =
haftmann@25462
   815
  let
haftmann@25536
   816
    val _ = if null tycos then error "At least one arity must be given" else ();
haftmann@25536
   817
    val _ = map (the_class_data thy) sort;
haftmann@25536
   818
    val vs = map TFree (Name.names Name.context Name.aT sorts);
haftmann@25485
   819
    fun type_name "*" = "prod"
haftmann@25485
   820
      | type_name "+" = "sum"
haftmann@25485
   821
      | type_name s = sanatize_name (NameSpace.base s); (*FIXME*)
haftmann@25597
   822
    fun get_param tyco (param, (c, ty)) = if can (AxClass.param_of_inst thy) (c, tyco)
haftmann@25603
   823
      then NONE else SOME ((c, tyco),
haftmann@25536
   824
        (param ^ "_" ^ type_name tyco, map_atyps (K (Type (tyco, vs))) ty));
haftmann@25536
   825
    val params = map_product get_param tycos (these_params thy sort) |> map_filter I;
haftmann@25485
   826
  in
haftmann@25485
   827
    thy
haftmann@25485
   828
    |> ProofContext.init
haftmann@25536
   829
    |> Instantiation.put (mk_instantiation ((tycos, sorts, sort), params))
haftmann@25536
   830
    |> fold (Variable.declare_term o Logic.mk_type) vs
haftmann@25574
   831
    |> fold (Variable.declare_names o Free o snd) params
haftmann@25536
   832
    |> fold (fn tyco => ProofContext.add_arity (tyco, sorts, sort)) tycos
haftmann@25485
   833
    |> Context.proof_map (
haftmann@25485
   834
        Syntax.add_term_check 0 "instance" inst_term_check
haftmann@25485
   835
        #> Syntax.add_term_uncheck 0 "instance" inst_term_uncheck)
haftmann@25485
   836
  end;
haftmann@25485
   837
haftmann@25485
   838
fun gen_instantiation_instance do_proof after_qed lthy =
haftmann@25485
   839
  let
haftmann@25536
   840
    val (tycos, sorts, sort) = (#arities o the_instantiation) lthy;
haftmann@25536
   841
    val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, sorts, sort)) tycos;
haftmann@25462
   842
    fun after_qed' results =
haftmann@25462
   843
      LocalTheory.theory (fold (AxClass.add_arity o Thm.varifyT) results)
haftmann@25462
   844
      #> after_qed;
haftmann@25462
   845
  in
haftmann@25462
   846
    lthy
haftmann@25462
   847
    |> do_proof after_qed' arities_proof
haftmann@25462
   848
  end;
haftmann@25462
   849
haftmann@25485
   850
val instantiation_instance = gen_instantiation_instance (fn after_qed => fn ts =>
haftmann@25462
   851
  Proof.theorem_i NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts));
haftmann@25462
   852
haftmann@25485
   853
fun prove_instantiation_instance tac = gen_instantiation_instance (fn after_qed =>
haftmann@25502
   854
  fn ts => fn lthy => after_qed (map (fn t => Goal.prove lthy [] [] t
haftmann@25502
   855
    (fn {context, ...} => tac context)) ts) lthy) I;
haftmann@25462
   856
haftmann@25462
   857
fun conclude_instantiation lthy =
haftmann@25462
   858
  let
haftmann@25485
   859
    val { arities, params } = the_instantiation lthy;
haftmann@25536
   860
    val (tycos, sorts, sort) = arities;
haftmann@25462
   861
    val thy = ProofContext.theory_of lthy;
haftmann@25597
   862
    val _ = map (fn tyco => if Sign.of_sort thy
haftmann@25462
   863
        (Type (tyco, map TFree (Name.names Name.context Name.aT sorts)), sort)
haftmann@25462
   864
      then () else error ("Missing instance proof for type " ^ quote (Sign.extern_type thy tyco)))
haftmann@25597
   865
        tycos;
haftmann@25597
   866
  in lthy end;
haftmann@25462
   867
haftmann@25603
   868
fun pretty_instantiation lthy =
haftmann@25603
   869
  let
haftmann@25603
   870
    val { arities, params } = the_instantiation lthy;
haftmann@25603
   871
    val (tycos, sorts, sort) = arities;
haftmann@25603
   872
    val thy = ProofContext.theory_of lthy;
haftmann@25603
   873
    fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, sorts, sort);
haftmann@25603
   874
    fun pr_param ((c, _), (v, ty)) =
haftmann@25603
   875
      (Pretty.block o Pretty.breaks) [(Pretty.str o Sign.extern_const thy) c, Pretty.str "::",
haftmann@25603
   876
        Sign.pretty_typ thy ty, Pretty.str "as", Pretty.str v];
haftmann@25603
   877
  in
haftmann@25603
   878
    (Pretty.block o Pretty.fbreaks)
haftmann@25603
   879
      (Pretty.str "instantiation" :: map pr_arity tycos @ map pr_param params)
haftmann@25603
   880
  end;
haftmann@25603
   881
haftmann@24218
   882
end;