src/Pure/axclass.ML
author wenzelm
Sat Dec 14 17:28:05 2013 +0100 (2013-12-14)
changeset 54742 7a86358a3c0b
parent 53171 a5e54d4d9081
child 54931 88cf06038e37
permissions -rw-r--r--
proper context for basic Simplifier operations: rewrite_rule, rewrite_goals_rule, rewrite_goals_tac etc.;
clarified tool context in some boundary cases;
wenzelm@404
     1
(*  Title:      Pure/axclass.ML
wenzelm@404
     2
    Author:     Markus Wenzel, TU Muenchen
wenzelm@404
     3
wenzelm@24964
     4
Type classes defined as predicates, associated with a record of
wenzelm@36417
     5
parameters.  Proven class relations and type arities.
wenzelm@404
     6
*)
wenzelm@404
     7
wenzelm@51685
     8
signature AXCLASS =
wenzelm@3938
     9
sig
wenzelm@36427
    10
  type info = {def: thm, intro: thm, axioms: thm list, params: (string * typ) list}
wenzelm@36427
    11
  val get_info: theory -> class -> info
wenzelm@36427
    12
  val class_of_param: theory -> string -> class option
wenzelm@36427
    13
  val instance_name: string * class -> string
wenzelm@36427
    14
  val thynames_of_arity: theory -> class * string -> string list
wenzelm@36427
    15
  val param_of_inst: theory -> string * string -> string
wenzelm@36427
    16
  val inst_of_param: theory -> string -> (string * string) option
wenzelm@36427
    17
  val unoverload: theory -> thm -> thm
wenzelm@36427
    18
  val overload: theory -> thm -> thm
wenzelm@36427
    19
  val unoverload_conv: theory -> conv
wenzelm@36427
    20
  val overload_conv: theory -> conv
wenzelm@36427
    21
  val lookup_inst_param: Consts.T -> ((string * string) * 'a) list -> string * typ -> 'a option
wenzelm@36427
    22
  val unoverload_const: theory -> string * typ -> string
wenzelm@36427
    23
  val cert_classrel: theory -> class * class -> class * class
wenzelm@36427
    24
  val read_classrel: theory -> xstring * xstring -> class * class
wenzelm@36427
    25
  val declare_overloaded: string * typ -> theory -> term * theory
wenzelm@36427
    26
  val define_overloaded: binding -> string * term -> theory -> thm * theory
haftmann@37246
    27
  val add_classrel: thm -> theory -> theory
haftmann@37246
    28
  val add_arity: thm -> theory -> theory
wenzelm@51671
    29
  val prove_classrel: class * class -> (Proof.context -> tactic) -> theory -> theory
wenzelm@51671
    30
  val prove_arity: string * sort list * sort -> (Proof.context -> tactic) -> theory -> theory
wenzelm@36427
    31
  val define_class: binding * class list -> string list ->
wenzelm@36427
    32
    (Thm.binding * term list) list -> theory -> class * theory
wenzelm@30344
    33
  val axiomatize_class: binding * class list -> theory -> theory
wenzelm@30344
    34
  val axiomatize_class_cmd: binding * xstring list -> theory -> theory
wenzelm@24929
    35
  val axiomatize_classrel: (class * class) list -> theory -> theory
wenzelm@24929
    36
  val axiomatize_classrel_cmd: (xstring * xstring) list -> theory -> theory
wenzelm@24929
    37
  val axiomatize_arity: arity -> theory -> theory
wenzelm@24929
    38
  val axiomatize_arity_cmd: xstring * string list * string -> theory -> theory
wenzelm@3938
    39
end;
wenzelm@404
    40
wenzelm@51685
    41
structure Axclass: AXCLASS =
wenzelm@404
    42
struct
wenzelm@404
    43
wenzelm@19405
    44
(** theory data **)
wenzelm@423
    45
wenzelm@36329
    46
(* axclass info *)
wenzelm@36329
    47
wenzelm@36329
    48
type info =
wenzelm@36329
    49
 {def: thm,
wenzelm@36329
    50
  intro: thm,
wenzelm@36329
    51
  axioms: thm list,
wenzelm@36329
    52
  params: (string * typ) list};
wenzelm@36329
    53
wenzelm@36329
    54
fun make_axclass (def, intro, axioms, params): info =
wenzelm@36329
    55
  {def = def, intro = intro, axioms = axioms, params = params};
wenzelm@36329
    56
wenzelm@36329
    57
wenzelm@19405
    58
(* class parameters (canonical order) *)
wenzelm@423
    59
wenzelm@19405
    60
type param = string * class;
wenzelm@423
    61
wenzelm@42389
    62
fun add_param ctxt ((x, c): param) params =
wenzelm@19405
    63
  (case AList.lookup (op =) params x of
wenzelm@19405
    64
    NONE => (x, c) :: params
wenzelm@42383
    65
  | SOME c' =>
wenzelm@42389
    66
      error ("Duplicate class parameter " ^ quote x ^ " for " ^ Syntax.string_of_sort ctxt [c] ^
wenzelm@42389
    67
        (if c = c' then "" else " and " ^ Syntax.string_of_sort ctxt [c'])));
wenzelm@423
    68
haftmann@25597
    69
wenzelm@19511
    70
(* setup data *)
wenzelm@19392
    71
wenzelm@36329
    72
datatype data = Data of
wenzelm@36329
    73
 {axclasses: info Symtab.table,
wenzelm@36329
    74
  params: param list,
wenzelm@36418
    75
  proven_classrels: thm Symreltab.table,
wenzelm@36418
    76
  proven_arities: ((class * sort list) * (thm * string)) list Symtab.table,
wenzelm@36329
    77
    (*arity theorems with theory name*)
wenzelm@36329
    78
  inst_params:
wenzelm@36329
    79
    (string * thm) Symtab.table Symtab.table *
wenzelm@36329
    80
      (*constant name ~> type constructor ~> (constant name, equation)*)
wenzelm@50764
    81
    (string * string) Symtab.table (*constant name ~> (constant name, type constructor)*)};
wenzelm@36329
    82
wenzelm@36329
    83
fun make_data
wenzelm@50764
    84
    (axclasses, params, proven_classrels, proven_arities, inst_params) =
wenzelm@36329
    85
  Data {axclasses = axclasses, params = params, proven_classrels = proven_classrels,
wenzelm@50764
    86
    proven_arities = proven_arities, inst_params = inst_params};
wenzelm@36329
    87
wenzelm@36327
    88
structure Data = Theory_Data_PP
wenzelm@22846
    89
(
wenzelm@36329
    90
  type T = data;
wenzelm@36329
    91
  val empty =
wenzelm@50764
    92
    make_data (Symtab.empty, [], Symreltab.empty, Symtab.empty, (Symtab.empty, Symtab.empty));
wenzelm@19574
    93
  val extend = I;
wenzelm@36329
    94
  fun merge pp
wenzelm@36329
    95
      (Data {axclasses = axclasses1, params = params1, proven_classrels = proven_classrels1,
wenzelm@50764
    96
        proven_arities = proven_arities1, inst_params = inst_params1},
wenzelm@36329
    97
       Data {axclasses = axclasses2, params = params2, proven_classrels = proven_classrels2,
wenzelm@50764
    98
        proven_arities = proven_arities2, inst_params = inst_params2}) =
wenzelm@36325
    99
    let
wenzelm@42389
   100
      val ctxt = Syntax.init_pretty pp;
wenzelm@42389
   101
wenzelm@36329
   102
      val axclasses' = Symtab.merge (K true) (axclasses1, axclasses2);
wenzelm@36329
   103
      val params' =
wenzelm@36329
   104
        if null params1 then params2
wenzelm@42389
   105
        else
wenzelm@42389
   106
          fold_rev (fn p => if member (op =) params1 p then I else add_param ctxt p)
wenzelm@42389
   107
            params2 params1;
wenzelm@36329
   108
wenzelm@50760
   109
      (*see Theory.at_begin hook for transitive closure of classrels and arity completion*)
wenzelm@50768
   110
      val proven_classrels' = Symreltab.merge (K true) (proven_classrels1, proven_classrels2);
wenzelm@50768
   111
      val proven_arities' = Symtab.merge_list (eq_fst op =) (proven_arities1, proven_arities2);
wenzelm@36329
   112
wenzelm@36329
   113
      val inst_params' =
wenzelm@36329
   114
        (Symtab.join (K (Symtab.merge (K true))) (#1 inst_params1, #1 inst_params2),
wenzelm@36329
   115
          Symtab.merge (K true) (#2 inst_params1, #2 inst_params2));
wenzelm@36325
   116
    in
wenzelm@50764
   117
      make_data (axclasses', params', proven_classrels', proven_arities', inst_params')
wenzelm@36325
   118
    end;
wenzelm@22846
   119
);
wenzelm@6379
   120
wenzelm@36329
   121
fun map_data f =
wenzelm@50764
   122
  Data.map (fn Data {axclasses, params, proven_classrels, proven_arities, inst_params} =>
wenzelm@50764
   123
    make_data (f (axclasses, params, proven_classrels, proven_arities, inst_params)));
wenzelm@36329
   124
wenzelm@36329
   125
fun map_axclasses f =
wenzelm@50764
   126
  map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params) =>
wenzelm@50764
   127
    (f axclasses, params, proven_classrels, proven_arities, inst_params));
wenzelm@36329
   128
wenzelm@36329
   129
fun map_params f =
wenzelm@50764
   130
  map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params) =>
wenzelm@50764
   131
    (axclasses, f params, proven_classrels, proven_arities, inst_params));
wenzelm@36329
   132
wenzelm@36329
   133
fun map_proven_classrels f =
wenzelm@50764
   134
  map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params) =>
wenzelm@50764
   135
    (axclasses, params, f proven_classrels, proven_arities, inst_params));
wenzelm@36329
   136
wenzelm@36329
   137
fun map_proven_arities f =
wenzelm@50764
   138
  map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params) =>
wenzelm@50764
   139
    (axclasses, params, proven_classrels, f proven_arities, inst_params));
wenzelm@36329
   140
wenzelm@36329
   141
fun map_inst_params f =
wenzelm@50764
   142
  map_data (fn (axclasses, params, proven_classrels, proven_arities, inst_params) =>
wenzelm@50764
   143
    (axclasses, params, proven_classrels, proven_arities, f inst_params));
wenzelm@36329
   144
wenzelm@36329
   145
val rep_data = Data.get #> (fn Data args => args);
wenzelm@36329
   146
wenzelm@36329
   147
val axclasses_of = #axclasses o rep_data;
wenzelm@36329
   148
val params_of = #params o rep_data;
wenzelm@36329
   149
val proven_classrels_of = #proven_classrels o rep_data;
wenzelm@36329
   150
val proven_arities_of = #proven_arities o rep_data;
wenzelm@36329
   151
val inst_params_of = #inst_params o rep_data;
wenzelm@36329
   152
wenzelm@6379
   153
wenzelm@36346
   154
(* axclasses with parameters *)
wenzelm@19392
   155
wenzelm@24929
   156
fun get_info thy c =
wenzelm@36329
   157
  (case Symtab.lookup (axclasses_of thy) c of
wenzelm@36327
   158
    SOME info => info
wenzelm@21919
   159
  | NONE => error ("No such axclass: " ^ quote c));
wenzelm@6379
   160
wenzelm@36327
   161
fun all_params_of thy S =
wenzelm@36329
   162
  let val params = params_of thy;
wenzelm@36327
   163
  in fold (fn (x, c) => if Sign.subsort thy (S, [c]) then cons x else I) params [] end;
wenzelm@19460
   164
wenzelm@36329
   165
fun class_of_param thy = AList.lookup (op =) (params_of thy);
wenzelm@19460
   166
wenzelm@21919
   167
wenzelm@19511
   168
(* maintain instances *)
wenzelm@19503
   169
wenzelm@36329
   170
val classrel_prefix = "classrel_";
wenzelm@36329
   171
val arity_prefix = "arity_";
haftmann@25486
   172
wenzelm@36329
   173
fun instance_name (a, c) = Long_Name.base_name c ^ "_" ^ Long_Name.base_name a;
wenzelm@19528
   174
wenzelm@19528
   175
wenzelm@50764
   176
val update_classrel = map_proven_classrels o Symreltab.update;
wenzelm@36421
   177
wenzelm@50764
   178
val is_classrel = Symreltab.defined o proven_classrels_of;
wenzelm@36421
   179
wenzelm@19574
   180
fun the_classrel thy (c1, c2) =
wenzelm@36329
   181
  (case Symreltab.lookup (proven_classrels_of thy) (c1, c2) of
wenzelm@50764
   182
    SOME thm => Thm.transfer thy thm
wenzelm@24920
   183
  | NONE => error ("Unproven class relation " ^
wenzelm@50764
   184
      Syntax.string_of_classrel (Proof_Context.init_global thy) [c1, c2]));
wenzelm@36325
   185
wenzelm@36325
   186
fun complete_classrels thy =
wenzelm@36325
   187
  let
wenzelm@50764
   188
    fun complete (c, (_, (all_preds, all_succs))) (finished1, thy1) =
wenzelm@50764
   189
      let
wenzelm@50769
   190
        fun compl c1 c2 (finished2, thy2) =
wenzelm@50764
   191
          if is_classrel thy2 (c1, c2) then (finished2, thy2)
wenzelm@50764
   192
          else
wenzelm@50764
   193
            (false,
wenzelm@50764
   194
              thy2
wenzelm@50764
   195
              |> update_classrel ((c1, c2),
wenzelm@50764
   196
                (the_classrel thy2 (c1, c) RS the_classrel thy2 (c, c2))
wenzelm@50764
   197
                |> Drule.instantiate' [SOME (ctyp_of thy2 (TVar ((Name.aT, 0), [])))] []
wenzelm@50764
   198
                |> Thm.close_derivation));
wenzelm@50764
   199
wenzelm@50769
   200
        val proven = is_classrel thy1;
wenzelm@50769
   201
        val preds = Graph.Keys.fold (fn c1 => proven (c1, c) ? cons c1) all_preds [];
wenzelm@50769
   202
        val succs = Graph.Keys.fold (fn c2 => proven (c, c2) ? cons c2) all_succs [];
wenzelm@50769
   203
      in
wenzelm@50769
   204
        fold_product compl preds succs (finished1, thy1)
wenzelm@50769
   205
      end;
wenzelm@36325
   206
  in
wenzelm@50769
   207
    (case Graph.fold complete (Sorts.classes_of (Sign.classes_of thy)) (true, thy) of
wenzelm@50769
   208
      (true, _) => NONE
wenzelm@50769
   209
    | (_, thy') => SOME thy')
wenzelm@36325
   210
  end;
wenzelm@19503
   211
wenzelm@19503
   212
wenzelm@36740
   213
fun the_arity thy (a, Ss, c) =
wenzelm@36329
   214
  (case AList.lookup (op =) (Symtab.lookup_list (proven_arities_of thy) a) (c, Ss) of
wenzelm@50764
   215
    SOME (thm, _) => Thm.transfer thy thm
wenzelm@24920
   216
  | NONE => error ("Unproven type arity " ^
wenzelm@50764
   217
      Syntax.string_of_arity (Proof_Context.init_global thy) (a, Ss, [c])));
wenzelm@19503
   218
wenzelm@33172
   219
fun thynames_of_arity thy (c, a) =
wenzelm@36329
   220
  Symtab.lookup_list (proven_arities_of thy) a
wenzelm@36418
   221
  |> map_filter (fn ((c', _), (_, name)) => if c = c' then SOME name else NONE)
haftmann@27497
   222
  |> rev;
haftmann@27397
   223
wenzelm@36419
   224
fun insert_arity_completions thy t ((c, Ss), ((th, thy_name))) (finished, arities) =
haftmann@27547
   225
  let
haftmann@27547
   226
    val algebra = Sign.classes_of thy;
wenzelm@36417
   227
    val ars = Symtab.lookup_list arities t;
wenzelm@33172
   228
    val super_class_completions =
wenzelm@33172
   229
      Sign.super_classes thy c
wenzelm@36417
   230
      |> filter_out (fn c1 => exists (fn ((c2, Ss2), _) =>
wenzelm@36417
   231
            c1 = c2 andalso Sorts.sorts_le algebra (Ss2, Ss)) ars);
wenzelm@36417
   232
wenzelm@43329
   233
    val names = Name.invent Name.context Name.aT (length Ss);
wenzelm@36417
   234
    val std_vars = map (fn a => SOME (ctyp_of thy (TVar ((a, 0), [])))) names;
wenzelm@36417
   235
wenzelm@36325
   236
    val completions = super_class_completions |> map (fn c1 =>
wenzelm@36325
   237
      let
wenzelm@36419
   238
        val th1 =
wenzelm@50764
   239
          (th RS the_classrel thy (c, c1))
wenzelm@36417
   240
          |> Drule.instantiate' std_vars []
wenzelm@36327
   241
          |> Thm.close_derivation;
wenzelm@36418
   242
      in ((th1, thy_name), c1) end);
wenzelm@36419
   243
wenzelm@36419
   244
    val finished' = finished andalso null completions;
wenzelm@36418
   245
    val arities' = fold (fn (th, c1) => Symtab.cons_list (t, ((c1, Ss), th))) completions arities;
wenzelm@36419
   246
  in (finished', arities') end;
wenzelm@19503
   247
wenzelm@50764
   248
fun put_arity_completion ((t, Ss, c), th) thy =
wenzelm@36419
   249
  let val ar = ((c, Ss), (th, Context.theory_name thy)) in
haftmann@27547
   250
    thy
wenzelm@36329
   251
    |> map_proven_arities
wenzelm@36419
   252
      (Symtab.insert_list (eq_fst op =) (t, ar) #>
wenzelm@36419
   253
       curry (insert_arity_completions thy t ar) true #> #2)
haftmann@27547
   254
  end;
wenzelm@19503
   255
wenzelm@31944
   256
fun complete_arities thy =
haftmann@27547
   257
  let
wenzelm@36329
   258
    val arities = proven_arities_of thy;
wenzelm@36419
   259
    val (finished, arities') =
wenzelm@50769
   260
      Symtab.fold (fn (t, ars) => fold (insert_arity_completions thy t) ars)
wenzelm@50769
   261
        arities (true, arities);
wenzelm@33172
   262
  in
wenzelm@36419
   263
    if finished then NONE
wenzelm@36329
   264
    else SOME (map_proven_arities (K arities') thy)
haftmann@27547
   265
  end;
haftmann@27547
   266
wenzelm@53171
   267
val _ = Theory.setup
wenzelm@53171
   268
  (Theory.at_begin complete_classrels #> Theory.at_begin complete_arities);
haftmann@27397
   269
wenzelm@36740
   270
val _ = Proofterm.install_axclass_proofs
wenzelm@36740
   271
  {classrel_proof = Thm.proof_of oo the_classrel,
wenzelm@36740
   272
   arity_proof = Thm.proof_of oo the_arity};
wenzelm@36418
   273
haftmann@27397
   274
haftmann@25597
   275
(* maintain instance parameters *)
haftmann@25597
   276
haftmann@25597
   277
fun get_inst_param thy (c, tyco) =
wenzelm@36329
   278
  (case Symtab.lookup (the_default Symtab.empty (Symtab.lookup (#1 (inst_params_of thy)) c)) tyco of
wenzelm@36327
   279
    SOME c' => c'
wenzelm@36327
   280
  | NONE => error ("No instance parameter for constant " ^ quote c ^ " on type " ^ quote tyco));
haftmann@25597
   281
wenzelm@36327
   282
fun add_inst_param (c, tyco) inst =
wenzelm@36327
   283
  (map_inst_params o apfst o Symtab.map_default (c, Symtab.empty)) (Symtab.update_new (tyco, inst))
wenzelm@36417
   284
  #> (map_inst_params o apsnd) (Symtab.update_new (#1 inst, (c, tyco)));
haftmann@25597
   285
wenzelm@36329
   286
val inst_of_param = Symtab.lookup o #2 o inst_params_of;
wenzelm@36417
   287
val param_of_inst = #1 oo get_inst_param;
haftmann@25597
   288
wenzelm@36327
   289
fun inst_thms thy =
wenzelm@36329
   290
  Symtab.fold (Symtab.fold (cons o #2 o #2) o #2) (#1 (inst_params_of thy)) [];
haftmann@25597
   291
wenzelm@36417
   292
fun get_inst_tyco consts = try (#1 o dest_Type o the_single o Consts.typargs consts);
haftmann@25597
   293
wenzelm@54742
   294
fun unoverload thy =
wenzelm@54742
   295
  rewrite_rule (Proof_Context.init_global thy) (inst_thms thy);
wenzelm@54742
   296
wenzelm@54742
   297
fun overload thy =
wenzelm@54742
   298
  rewrite_rule (Proof_Context.init_global thy) (map Thm.symmetric (inst_thms thy));
haftmann@25597
   299
wenzelm@54742
   300
fun unoverload_conv thy =
wenzelm@54742
   301
  Raw_Simplifier.rewrite (Proof_Context.init_global thy) true (inst_thms thy);
wenzelm@54742
   302
wenzelm@54742
   303
fun overload_conv thy =
wenzelm@54742
   304
  Raw_Simplifier.rewrite (Proof_Context.init_global thy) true (map Thm.symmetric (inst_thms thy));
haftmann@25597
   305
wenzelm@36327
   306
fun lookup_inst_param consts params (c, T) =
wenzelm@36327
   307
  (case get_inst_tyco consts (c, T) of
wenzelm@36327
   308
    SOME tyco => AList.lookup (op =) params (c, tyco)
wenzelm@36327
   309
  | NONE => NONE);
haftmann@31249
   310
haftmann@25597
   311
fun unoverload_const thy (c_ty as (c, _)) =
wenzelm@36327
   312
  if is_some (class_of_param thy c) then
wenzelm@36327
   313
    (case get_inst_tyco (Sign.consts_of thy) c_ty of
wenzelm@36327
   314
      SOME tyco => try (param_of_inst thy) (c, tyco) |> the_default c
wenzelm@36327
   315
    | NONE => c)
haftmann@33969
   316
  else c;
haftmann@25597
   317
wenzelm@404
   318
wenzelm@36327
   319
wenzelm@19511
   320
(** instances **)
wenzelm@19418
   321
wenzelm@19418
   322
(* class relations *)
wenzelm@19418
   323
wenzelm@19405
   324
fun cert_classrel thy raw_rel =
wenzelm@15876
   325
  let
wenzelm@26939
   326
    val string_of_sort = Syntax.string_of_sort_global thy;
wenzelm@19405
   327
    val (c1, c2) = pairself (Sign.certify_class thy) raw_rel;
wenzelm@52788
   328
    val _ = Sign.primitive_classrel (c1, c2) thy;
wenzelm@19405
   329
    val _ =
wenzelm@19460
   330
      (case subtract (op =) (all_params_of thy [c1]) (all_params_of thy [c2]) of
wenzelm@19405
   331
        [] => ()
wenzelm@26939
   332
      | xs => raise TYPE ("Class " ^ string_of_sort [c1] ^ " lacks parameter(s) " ^
wenzelm@26939
   333
          commas_quote xs ^ " of " ^ string_of_sort [c2], [], []));
wenzelm@19405
   334
  in (c1, c2) end;
wenzelm@19405
   335
wenzelm@19405
   336
fun read_classrel thy raw_rel =
wenzelm@42360
   337
  cert_classrel thy (pairself (Proof_Context.read_class (Proof_Context.init_global thy)) raw_rel)
wenzelm@19405
   338
    handle TYPE (msg, _, _) => error msg;
wenzelm@19405
   339
wenzelm@19405
   340
haftmann@25597
   341
(* declaration and definition of instances of overloaded constants *)
haftmann@25597
   342
wenzelm@35201
   343
fun inst_tyco_of thy (c, T) =
wenzelm@35201
   344
  (case get_inst_tyco (Sign.consts_of thy) (c, T) of
wenzelm@35201
   345
    SOME tyco => tyco
wenzelm@35201
   346
  | NONE => error ("Illegal type for instantiation of class parameter: " ^
wenzelm@35201
   347
      quote (c ^ " :: " ^ Syntax.string_of_typ_global thy T)));
haftmann@31249
   348
haftmann@25597
   349
fun declare_overloaded (c, T) thy =
haftmann@25597
   350
  let
wenzelm@35201
   351
    val class =
wenzelm@35201
   352
      (case class_of_param thy c of
wenzelm@35201
   353
        SOME class => class
wenzelm@35201
   354
      | NONE => error ("Not a class parameter: " ^ quote c));
haftmann@31249
   355
    val tyco = inst_tyco_of thy (c, T);
haftmann@25597
   356
    val name_inst = instance_name (tyco, class) ^ "_inst";
wenzelm@36417
   357
    val c' = instance_name (tyco, c);
haftmann@25597
   358
    val T' = Type.strip_sorts T;
haftmann@25597
   359
  in
haftmann@25597
   360
    thy
wenzelm@35201
   361
    |> Sign.qualified_path true (Binding.name name_inst)
wenzelm@42375
   362
    |> Sign.declare_const_global ((Binding.name c', T'), NoSyn)
wenzelm@30344
   363
    |-> (fn const' as Const (c'', _) =>
wenzelm@42375
   364
      Thm.add_def_global false true
wenzelm@30344
   365
        (Binding.name (Thm.def_name c'), Logic.mk_equals (Const (c, T'), const'))
wenzelm@36106
   366
      #>> apsnd Thm.varifyT_global
wenzelm@36106
   367
      #-> (fn (_, thm) => add_inst_param (c, tyco) (c'', thm)
wenzelm@39557
   368
        #> Global_Theory.add_thm ((Binding.conceal (Binding.name c'), thm), [])
wenzelm@36417
   369
        #> #2
wenzelm@36106
   370
        #> pair (Const (c, T))))
wenzelm@35201
   371
    ||> Sign.restore_naming thy
haftmann@25597
   372
  end;
haftmann@25597
   373
haftmann@30519
   374
fun define_overloaded b (c, t) thy =
haftmann@25597
   375
  let
haftmann@25597
   376
    val T = Term.fastype_of t;
haftmann@31249
   377
    val tyco = inst_tyco_of thy (c, T);
haftmann@25597
   378
    val (c', eq) = get_inst_param thy (c, tyco);
haftmann@25597
   379
    val prop = Logic.mk_equals (Const (c', T), t);
wenzelm@36417
   380
    val b' = Thm.def_binding_optional (Binding.name (instance_name (tyco, c))) b;
haftmann@25597
   381
  in
haftmann@25597
   382
    thy
wenzelm@42375
   383
    |> Thm.add_def_global false false (b', prop)
haftmann@38383
   384
    |>> (fn (_, thm) => Drule.transitive_thm OF [eq, thm])
haftmann@25597
   385
  end;
haftmann@25597
   386
haftmann@25597
   387
haftmann@30951
   388
(* primitive rules *)
haftmann@30951
   389
haftmann@37249
   390
fun add_classrel raw_th thy =
haftmann@30951
   391
  let
wenzelm@31948
   392
    val th = Thm.strip_shyps (Thm.transfer thy raw_th);
wenzelm@31948
   393
    val prop = Thm.plain_prop_of th;
haftmann@30951
   394
    fun err () = raise THM ("add_classrel: malformed class relation", 0, [th]);
haftmann@30951
   395
    val rel = Logic.dest_classrel prop handle TERM _ => err ();
haftmann@30951
   396
    val (c1, c2) = cert_classrel thy rel handle TYPE _ => err ();
wenzelm@50769
   397
    val (th', thy') =
wenzelm@50769
   398
      Global_Theory.store_thm
wenzelm@50769
   399
        (Binding.name (prefix classrel_prefix (Logic.name_classrel (c1, c2))), th) thy;
berghofe@37232
   400
    val th'' = th'
krauss@36934
   401
      |> Thm.unconstrainT
berghofe@37232
   402
      |> Drule.instantiate' [SOME (ctyp_of thy' (TVar ((Name.aT, 0), [])))] [];
haftmann@30951
   403
  in
berghofe@37232
   404
    thy'
haftmann@30951
   405
    |> Sign.primitive_classrel (c1, c2)
wenzelm@50764
   406
    |> map_proven_classrels (Symreltab.update ((c1, c2), th''))
wenzelm@50764
   407
    |> perhaps complete_classrels
haftmann@30951
   408
    |> perhaps complete_arities
haftmann@30951
   409
  end;
haftmann@30951
   410
haftmann@37249
   411
fun add_arity raw_th thy =
haftmann@30951
   412
  let
wenzelm@31948
   413
    val th = Thm.strip_shyps (Thm.transfer thy raw_th);
wenzelm@31948
   414
    val prop = Thm.plain_prop_of th;
haftmann@30951
   415
    fun err () = raise THM ("add_arity: malformed type arity", 0, [th]);
berghofe@37232
   416
    val arity as (t, Ss, c) = Logic.dest_arity prop handle TERM _ => err ();
berghofe@37232
   417
wenzelm@50769
   418
    val (th', thy') =
wenzelm@50769
   419
      Global_Theory.store_thm
wenzelm@50769
   420
        (Binding.name (prefix arity_prefix (Logic.name_arity arity)), th) thy;
wenzelm@36417
   421
wenzelm@43329
   422
    val args = Name.invent_names Name.context Name.aT Ss;
wenzelm@36417
   423
    val T = Type (t, map TFree args);
berghofe@37232
   424
    val std_vars = map (fn (a, S) => SOME (ctyp_of thy' (TVar ((a, 0), [])))) args;
wenzelm@36417
   425
berghofe@37232
   426
    val missing_params = Sign.complete_sort thy' [c]
berghofe@37232
   427
      |> maps (these o Option.map #params o try (get_info thy'))
berghofe@37232
   428
      |> filter_out (fn (const, _) => can (get_inst_param thy') (const, t))
haftmann@30951
   429
      |> (map o apsnd o map_atyps) (K T);
berghofe@37232
   430
    val th'' = th'
krauss@36934
   431
      |> Thm.unconstrainT
krauss@36934
   432
      |> Drule.instantiate' std_vars [];
haftmann@30951
   433
  in
berghofe@37232
   434
    thy'
wenzelm@36417
   435
    |> fold (#2 oo declare_overloaded) missing_params
haftmann@30951
   436
    |> Sign.primitive_arity (t, Ss, [c])
wenzelm@50764
   437
    |> put_arity_completion ((t, Ss, c), th'')
haftmann@30951
   438
  end;
haftmann@30951
   439
haftmann@30951
   440
haftmann@30951
   441
(* tactical proofs *)
haftmann@30951
   442
haftmann@30951
   443
fun prove_classrel raw_rel tac thy =
haftmann@30951
   444
  let
wenzelm@42360
   445
    val ctxt = Proof_Context.init_global thy;
haftmann@30951
   446
    val (c1, c2) = cert_classrel thy raw_rel;
wenzelm@51671
   447
    val th =
wenzelm@51671
   448
      Goal.prove ctxt [] [] (Logic.mk_classrel (c1, c2)) (fn {context, ...} => tac context)
wenzelm@51671
   449
        handle ERROR msg =>
wenzelm@51671
   450
          cat_error msg ("The error(s) above occurred while trying to prove class relation " ^
wenzelm@51671
   451
            quote (Syntax.string_of_classrel ctxt [c1, c2]));
haftmann@30951
   452
  in
haftmann@37249
   453
    thy |> add_classrel th
haftmann@30951
   454
  end;
haftmann@30951
   455
haftmann@30951
   456
fun prove_arity raw_arity tac thy =
haftmann@30951
   457
  let
wenzelm@42360
   458
    val ctxt = Proof_Context.init_global thy;
wenzelm@42360
   459
    val arity = Proof_Context.cert_arity ctxt raw_arity;
haftmann@30951
   460
    val names = map (prefix arity_prefix) (Logic.name_arities arity);
haftmann@30951
   461
    val props = Logic.mk_arities arity;
wenzelm@51671
   462
    val ths =
wenzelm@51671
   463
      Goal.prove_multi ctxt [] [] props
wenzelm@51671
   464
      (fn {context, ...} => Goal.precise_conjunction_tac (length props) 1 THEN tac context)
wenzelm@51671
   465
        handle ERROR msg =>
wenzelm@51671
   466
          cat_error msg ("The error(s) above occurred while trying to prove type arity " ^
wenzelm@51671
   467
            quote (Syntax.string_of_arity ctxt arity));
haftmann@30951
   468
  in
haftmann@37249
   469
    thy |> fold add_arity ths
haftmann@30951
   470
  end;
haftmann@30951
   471
haftmann@30951
   472
wenzelm@19511
   473
wenzelm@19511
   474
(** class definitions **)
wenzelm@19511
   475
wenzelm@23421
   476
fun split_defined n eq =
wenzelm@23421
   477
  let
wenzelm@23421
   478
    val intro =
wenzelm@23421
   479
      (eq RS Drule.equal_elim_rule2)
wenzelm@23421
   480
      |> Conjunction.curry_balanced n
wenzelm@23421
   481
      |> n = 0 ? Thm.eq_assumption 1;
wenzelm@23421
   482
    val dests =
wenzelm@23421
   483
      if n = 0 then []
wenzelm@23421
   484
      else
wenzelm@23421
   485
        (eq RS Drule.equal_elim_rule1)
wenzelm@32765
   486
        |> Balanced_Tree.dest (fn th =>
wenzelm@23421
   487
          (th RS Conjunction.conjunctionD1, th RS Conjunction.conjunctionD2)) n;
wenzelm@23421
   488
  in (intro, dests) end;
wenzelm@23421
   489
wenzelm@24964
   490
fun define_class (bclass, raw_super) raw_params raw_specs thy =
wenzelm@19511
   491
  let
wenzelm@39133
   492
    val ctxt = Syntax.init_pretty_global thy;
wenzelm@19511
   493
wenzelm@19511
   494
wenzelm@24964
   495
    (* class *)
wenzelm@19511
   496
wenzelm@30344
   497
    val bconst = Binding.map_name Logic.const_of_class bclass;
wenzelm@30344
   498
    val class = Sign.full_name thy bclass;
wenzelm@24731
   499
    val super = Sign.minimize_sort thy (Sign.certify_sort thy raw_super);
wenzelm@19511
   500
wenzelm@24964
   501
    fun check_constraint (a, S) =
wenzelm@24964
   502
      if Sign.subsort thy (super, S) then ()
wenzelm@24964
   503
      else error ("Sort constraint of type variable " ^
wenzelm@39134
   504
        Syntax.string_of_typ (Config.put show_sorts true ctxt) (TFree (a, S)) ^
wenzelm@39133
   505
        " needs to be weaker than " ^ Syntax.string_of_sort ctxt super);
wenzelm@24964
   506
wenzelm@24964
   507
wenzelm@24964
   508
    (* params *)
wenzelm@24964
   509
wenzelm@24964
   510
    val params = raw_params |> map (fn p =>
wenzelm@24964
   511
      let
wenzelm@24964
   512
        val T = Sign.the_const_type thy p;
wenzelm@24964
   513
        val _ =
wenzelm@24964
   514
          (case Term.add_tvarsT T [] of
wenzelm@24964
   515
            [((a, _), S)] => check_constraint (a, S)
wenzelm@24964
   516
          | _ => error ("Exactly one type variable expected in class parameter " ^ quote p));
wenzelm@24964
   517
        val T' = Term.map_type_tvar (fn _ => TFree (Name.aT, [class])) T;
wenzelm@24964
   518
      in (p, T') end);
wenzelm@24964
   519
wenzelm@24964
   520
wenzelm@24964
   521
    (* axioms *)
wenzelm@24964
   522
wenzelm@19511
   523
    fun prep_axiom t =
wenzelm@19511
   524
      (case Term.add_tfrees t [] of
wenzelm@24964
   525
        [(a, S)] => check_constraint (a, S)
wenzelm@24964
   526
      | [] => ()
wenzelm@39133
   527
      | _ => error ("Multiple type variables in class axiom:\n" ^ Syntax.string_of_term ctxt t);
wenzelm@24964
   528
      t
wenzelm@24964
   529
      |> Term.map_types (Term.map_atyps (fn TFree _ => Term.aT [] | U => U))
wenzelm@24964
   530
      |> Logic.close_form);
wenzelm@19511
   531
wenzelm@24681
   532
    val axiomss = map (map (prep_axiom o Sign.cert_prop thy) o snd) raw_specs;
haftmann@22745
   533
    val name_atts = map fst raw_specs;
wenzelm@19511
   534
wenzelm@19511
   535
wenzelm@19511
   536
    (* definition *)
wenzelm@19511
   537
wenzelm@35854
   538
    val conjs = Logic.mk_of_sort (Term.aT [], super) @ flat axiomss;
wenzelm@19511
   539
    val class_eq =
wenzelm@31943
   540
      Logic.mk_equals (Logic.mk_of_class (Term.aT [], class), Logic.mk_conjunction_balanced conjs);
wenzelm@19511
   541
wenzelm@19511
   542
    val ([def], def_thy) =
wenzelm@19511
   543
      thy
wenzelm@19511
   544
      |> Sign.primitive_class (bclass, super)
wenzelm@39557
   545
      |> Global_Theory.add_defs false [((Thm.def_binding bconst, class_eq), [])];
wenzelm@19511
   546
    val (raw_intro, (raw_classrel, raw_axioms)) =
wenzelm@23421
   547
      split_defined (length conjs) def ||> chop (length super);
wenzelm@19392
   548
wenzelm@19418
   549
wenzelm@19511
   550
    (* facts *)
wenzelm@19511
   551
wenzelm@19511
   552
    val class_triv = Thm.class_triv def_thy class;
wenzelm@19511
   553
    val ([(_, [intro]), (_, classrel), (_, axioms)], facts_thy) =
wenzelm@19511
   554
      def_thy
wenzelm@35201
   555
      |> Sign.qualified_path true bconst
wenzelm@39557
   556
      |> Global_Theory.note_thmss ""
wenzelm@36326
   557
        [((Binding.name "intro", []), [([Drule.export_without_context raw_intro], [])]),
wenzelm@36326
   558
         ((Binding.name "super", []), [(map Drule.export_without_context raw_classrel, [])]),
wenzelm@36326
   559
         ((Binding.name "axioms", []),
wenzelm@35021
   560
           [(map (fn th => Drule.export_without_context (class_triv RS th)) raw_axioms, [])])]
haftmann@27691
   561
      ||> Sign.restore_naming def_thy;
wenzelm@19511
   562
wenzelm@24847
   563
wenzelm@19511
   564
    (* result *)
wenzelm@19511
   565
wenzelm@36329
   566
    val axclass = make_axclass (def, intro, axioms, params);
wenzelm@19511
   567
    val result_thy =
wenzelm@19511
   568
      facts_thy
wenzelm@50764
   569
      |> map_proven_classrels
wenzelm@50764
   570
          (fold2 (fn c => fn th => Symreltab.update ((class, c), th)) super classrel)
wenzelm@50764
   571
      |> perhaps complete_classrels
wenzelm@35201
   572
      |> Sign.qualified_path false bconst
wenzelm@39557
   573
      |> Global_Theory.note_thmss "" (name_atts ~~ map Thm.simple_fact (unflat axiomss axioms))
wenzelm@39557
   574
      |> #2
wenzelm@19511
   575
      |> Sign.restore_naming facts_thy
wenzelm@36329
   576
      |> map_axclasses (Symtab.update (class, axclass))
wenzelm@42389
   577
      |> map_params (fold (fn (x, _) => add_param ctxt (x, class)) params);
wenzelm@19511
   578
wenzelm@19511
   579
  in (class, result_thy) end;
wenzelm@19511
   580
wenzelm@19511
   581
wenzelm@19531
   582
wenzelm@19511
   583
(** axiomatizations **)
wenzelm@19511
   584
wenzelm@19511
   585
local
wenzelm@19511
   586
wenzelm@36417
   587
(*old-style axioms*)
wenzelm@20628
   588
fun axiomatize prep mk name add raw_args thy =
wenzelm@20628
   589
  let
wenzelm@20628
   590
    val args = prep thy raw_args;
wenzelm@20628
   591
    val specs = mk args;
wenzelm@20628
   592
    val names = name args;
haftmann@29579
   593
  in
haftmann@29579
   594
    thy
wenzelm@42375
   595
    |> fold_map Thm.add_axiom_global (map Binding.name names ~~ specs)
haftmann@37249
   596
    |-> fold (add o Drule.export_without_context o snd)
haftmann@29579
   597
  end;
wenzelm@19511
   598
wenzelm@19511
   599
fun ax_classrel prep =
wenzelm@20628
   600
  axiomatize (map o prep) (map Logic.mk_classrel)
haftmann@37249
   601
    (map (prefix classrel_prefix o Logic.name_classrel)) add_classrel;
wenzelm@19511
   602
wenzelm@19511
   603
fun ax_arity prep =
wenzelm@42360
   604
  axiomatize (prep o Proof_Context.init_global) Logic.mk_arities
haftmann@37249
   605
    (map (prefix arity_prefix) o Logic.name_arities) add_arity;
wenzelm@19511
   606
wenzelm@19706
   607
fun class_const c =
wenzelm@19706
   608
  (Logic.const_of_class c, Term.itselfT (Term.aT []) --> propT);
wenzelm@19706
   609
wenzelm@19511
   610
fun ax_class prep_class prep_classrel (bclass, raw_super) thy =
wenzelm@19511
   611
  let
wenzelm@30344
   612
    val class = Sign.full_name thy bclass;
wenzelm@24731
   613
    val super = map (prep_class thy) raw_super |> Sign.minimize_sort thy;
wenzelm@19511
   614
  in
wenzelm@19511
   615
    thy
wenzelm@19511
   616
    |> Sign.primitive_class (bclass, super)
wenzelm@19511
   617
    |> ax_classrel prep_classrel (map (fn c => (class, c)) super)
wenzelm@42375
   618
    |> Theory.add_deps_global "" (class_const class) (map class_const super)
wenzelm@19511
   619
  end;
wenzelm@19511
   620
wenzelm@19511
   621
in
wenzelm@19511
   622
wenzelm@24929
   623
val axiomatize_class = ax_class Sign.certify_class cert_classrel;
wenzelm@42375
   624
val axiomatize_class_cmd =
wenzelm@42375
   625
  ax_class (Proof_Context.read_class o Proof_Context.init_global) read_classrel;
wenzelm@24929
   626
val axiomatize_classrel = ax_classrel cert_classrel;
wenzelm@24929
   627
val axiomatize_classrel_cmd = ax_classrel read_classrel;
wenzelm@42360
   628
val axiomatize_arity = ax_arity Proof_Context.cert_arity;
wenzelm@42360
   629
val axiomatize_arity_cmd = ax_arity Proof_Context.read_arity;
wenzelm@19511
   630
wenzelm@19511
   631
end;
wenzelm@19511
   632
wenzelm@19511
   633
end;