src/Pure/axclass.ML
author haftmann
Wed Jan 21 16:47:04 2009 +0100 (2009-01-21)
changeset 29579 cb520b766e00
parent 29524 941ad06c7f9c
child 30211 556d1810cdad
child 30243 09d5944e224e
permissions -rw-r--r--
binding replaces bstring
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@24964
     5
parameters.
wenzelm@404
     6
*)
wenzelm@404
     7
wenzelm@404
     8
signature AX_CLASS =
wenzelm@3938
     9
sig
haftmann@24589
    10
  val define_class: bstring * class list -> string list ->
haftmann@29579
    11
    ((binding * attribute list) * term list) list -> theory -> class * theory
haftmann@24589
    12
  val add_classrel: thm -> theory -> theory
haftmann@24589
    13
  val add_arity: thm -> theory -> theory
haftmann@24589
    14
  val prove_classrel: class * class -> tactic -> theory -> theory
haftmann@24589
    15
  val prove_arity: string * sort list * sort -> tactic -> theory -> theory
wenzelm@24964
    16
  val get_info: theory -> class ->
wenzelm@24964
    17
    {def: thm, intro: thm, axioms: thm list, params: (string * typ) list}
wenzelm@19243
    18
  val class_intros: theory -> thm list
haftmann@20107
    19
  val class_of_param: theory -> string -> class option
wenzelm@19405
    20
  val cert_classrel: theory -> class * class -> class * class
wenzelm@19405
    21
  val read_classrel: theory -> xstring * xstring -> class * class
wenzelm@24929
    22
  val axiomatize_class: bstring * class list -> theory -> theory
wenzelm@24929
    23
  val axiomatize_class_cmd: bstring * xstring list -> theory -> theory
wenzelm@24929
    24
  val axiomatize_classrel: (class * class) list -> theory -> theory
wenzelm@24929
    25
  val axiomatize_classrel_cmd: (xstring * xstring) list -> theory -> theory
wenzelm@24929
    26
  val axiomatize_arity: arity -> theory -> theory
wenzelm@24929
    27
  val axiomatize_arity_cmd: xstring * string list * string -> theory -> theory
haftmann@25486
    28
  val instance_name: string * class -> string
haftmann@25597
    29
  val declare_overloaded: string * typ -> theory -> term * theory
haftmann@25597
    30
  val define_overloaded: string -> string * term -> theory -> thm * theory
haftmann@25597
    31
  val inst_tyco_of: theory -> string * typ -> string option
haftmann@25597
    32
  val unoverload: theory -> thm -> thm
haftmann@25597
    33
  val overload: theory -> thm -> thm
haftmann@25597
    34
  val unoverload_conv: theory -> conv
haftmann@25597
    35
  val overload_conv: theory -> conv
haftmann@25597
    36
  val unoverload_const: theory -> string * typ -> string
haftmann@25597
    37
  val param_of_inst: theory -> string * string -> string
haftmann@25597
    38
  val inst_of_param: theory -> string -> (string * string) option
haftmann@27497
    39
  val arity_property: theory -> class * string -> string -> string list
wenzelm@19574
    40
  type cache
wenzelm@24929
    41
  val of_sort: theory -> typ * sort -> cache -> thm list * cache  (*exception Sorts.CLASS_ERROR*)
wenzelm@19574
    42
  val cache: cache
haftmann@26246
    43
  val introN: string
haftmann@25617
    44
  val axiomsN: string
wenzelm@3938
    45
end;
wenzelm@404
    46
wenzelm@15801
    47
structure AxClass: AX_CLASS =
wenzelm@404
    48
struct
wenzelm@404
    49
wenzelm@19405
    50
(** theory data **)
wenzelm@423
    51
wenzelm@19405
    52
(* class parameters (canonical order) *)
wenzelm@423
    53
wenzelm@19405
    54
type param = string * class;
wenzelm@423
    55
wenzelm@19405
    56
fun add_param pp ((x, c): param) params =
wenzelm@19405
    57
  (case AList.lookup (op =) params x of
wenzelm@19405
    58
    NONE => (x, c) :: params
wenzelm@19405
    59
  | SOME c' => error ("Duplicate class parameter " ^ quote x ^
wenzelm@19405
    60
      " for " ^ Pretty.string_of_sort pp [c] ^
wenzelm@19405
    61
      (if c = c' then "" else " and " ^ Pretty.string_of_sort pp [c'])));
wenzelm@423
    62
wenzelm@19405
    63
fun merge_params _ ([], qs) = qs
wenzelm@19405
    64
  | merge_params pp (ps, qs) =
wenzelm@19405
    65
      fold_rev (fn q => if member (op =) ps q then I else add_param pp q) qs ps;
wenzelm@423
    66
wenzelm@423
    67
wenzelm@19511
    68
(* axclasses *)
wenzelm@6379
    69
wenzelm@19243
    70
val introN = "intro";
wenzelm@19511
    71
val superN = "super";
wenzelm@19243
    72
val axiomsN = "axioms";
wenzelm@19243
    73
wenzelm@19392
    74
datatype axclass = AxClass of
wenzelm@19460
    75
 {def: thm,
wenzelm@19392
    76
  intro: thm,
haftmann@21463
    77
  axioms: thm list,
haftmann@21925
    78
  params: (string * typ) list};
wenzelm@19392
    79
wenzelm@19460
    80
type axclasses = axclass Symtab.table * param list;
wenzelm@19392
    81
haftmann@27397
    82
fun make_axclass ((def, intro, axioms), params) = AxClass
haftmann@27397
    83
  {def = def, intro = intro, axioms = axioms, params = params};
wenzelm@19405
    84
wenzelm@19405
    85
fun merge_axclasses pp ((tab1, params1), (tab2, params2)) : axclasses =
wenzelm@19405
    86
  (Symtab.merge (K true) (tab1, tab2), merge_params pp (params1, params2));
wenzelm@19405
    87
wenzelm@19392
    88
wenzelm@19392
    89
(* instances *)
wenzelm@19392
    90
wenzelm@20628
    91
val classrel_prefix = "classrel_";
wenzelm@20628
    92
val arity_prefix = "arity_";
wenzelm@19511
    93
wenzelm@19574
    94
type instances =
wenzelm@19574
    95
  ((class * class) * thm) list *
wenzelm@19574
    96
  ((class * sort list) * thm) list Symtab.table;
wenzelm@6379
    97
wenzelm@19574
    98
fun merge_instances ((classrel1, arities1): instances, (classrel2, arities2)) =
wenzelm@19574
    99
 (merge (eq_fst op =) (classrel1, classrel2),
wenzelm@19574
   100
  Symtab.join (K (merge (eq_fst op =))) (arities1, arities2));
wenzelm@19392
   101
wenzelm@19392
   102
haftmann@25597
   103
(* instance parameters *)
haftmann@25597
   104
haftmann@25597
   105
type inst_params =
haftmann@25597
   106
  (string * thm) Symtab.table Symtab.table
haftmann@25597
   107
    (*constant name ~> type constructor ~> (constant name, equation)*)
haftmann@25597
   108
  * (string * string) Symtab.table; (*constant name ~> (constant name, type constructor)*)
haftmann@25597
   109
haftmann@25597
   110
fun merge_inst_params ((const_param1, param_const1), (const_param2, param_const2)) =
haftmann@25597
   111
  (Symtab.join  (K (Symtab.merge (K true))) (const_param1, const_param2),
haftmann@25597
   112
    Symtab.merge (K true) (param_const1, param_const2));
haftmann@25597
   113
haftmann@25597
   114
wenzelm@19511
   115
(* setup data *)
wenzelm@19392
   116
wenzelm@19392
   117
structure AxClassData = TheoryDataFun
wenzelm@22846
   118
(
haftmann@25597
   119
  type T = axclasses * (instances * inst_params);
haftmann@25597
   120
  val empty = ((Symtab.empty, []), (([], Symtab.empty), (Symtab.empty, Symtab.empty)));
wenzelm@19574
   121
  val copy = I;
wenzelm@19574
   122
  val extend = I;
haftmann@25597
   123
  fun merge pp ((axclasses1, (instances1, inst_params1)), (axclasses2, (instances2, inst_params2))) =
haftmann@25597
   124
    (merge_axclasses pp (axclasses1, axclasses2),
haftmann@25597
   125
      (merge_instances (instances1, instances2), merge_inst_params (inst_params1, inst_params2)));
wenzelm@22846
   126
);
wenzelm@6379
   127
wenzelm@6379
   128
wenzelm@19574
   129
(* maintain axclasses *)
wenzelm@19392
   130
wenzelm@19574
   131
val get_axclasses = #1 o AxClassData.get;
haftmann@25597
   132
val map_axclasses = AxClassData.map o apfst;
wenzelm@19574
   133
wenzelm@19574
   134
val lookup_def = Symtab.lookup o #1 o get_axclasses;
wenzelm@6379
   135
wenzelm@24929
   136
fun get_info thy c =
wenzelm@19511
   137
  (case lookup_def thy c of
wenzelm@19392
   138
    SOME (AxClass info) => info
wenzelm@21919
   139
  | NONE => error ("No such axclass: " ^ quote c));
wenzelm@6379
   140
wenzelm@19123
   141
fun class_intros thy =
wenzelm@19392
   142
  let
wenzelm@19392
   143
    fun add_intro c =
wenzelm@19511
   144
      (case lookup_def thy c of SOME (AxClass {intro, ...}) => cons intro | _ => I);
wenzelm@21931
   145
    val classes = Sign.all_classes thy;
wenzelm@19392
   146
  in map (Thm.class_triv thy) classes @ fold add_intro classes [] end;
wenzelm@15876
   147
wenzelm@15876
   148
wenzelm@19460
   149
fun get_params thy pred =
wenzelm@19574
   150
  let val params = #2 (get_axclasses thy);
wenzelm@19460
   151
  in fold (fn (x, c) => if pred c then cons x else I) params [] end;
wenzelm@19460
   152
wenzelm@19460
   153
fun params_of thy c = get_params thy (fn c' => c' = c);
wenzelm@19460
   154
fun all_params_of thy S = get_params thy (fn c => Sign.subsort thy (S, [c]));
wenzelm@19460
   155
wenzelm@24964
   156
fun class_of_param thy = AList.lookup (op =) (#2 (get_axclasses thy));
wenzelm@19460
   157
wenzelm@21919
   158
wenzelm@19511
   159
(* maintain instances *)
wenzelm@19503
   160
haftmann@25486
   161
fun instance_name (a, c) = NameSpace.base c ^ "_" ^ NameSpace.base a;
haftmann@25486
   162
haftmann@25597
   163
val get_instances = #1 o #2 o AxClassData.get;
haftmann@25597
   164
val map_instances = AxClassData.map o apsnd o apfst;
wenzelm@19528
   165
wenzelm@19528
   166
wenzelm@19574
   167
fun the_classrel thy (c1, c2) =
wenzelm@19574
   168
  (case AList.lookup (op =) (#1 (get_instances thy)) (c1, c2) of
wenzelm@19574
   169
    SOME th => Thm.transfer thy th
wenzelm@24920
   170
  | NONE => error ("Unproven class relation " ^
wenzelm@24920
   171
      Syntax.string_of_classrel (ProofContext.init thy) [c1, c2]));
wenzelm@19574
   172
wenzelm@19574
   173
fun put_classrel arg = map_instances (fn (classrel, arities) =>
wenzelm@19574
   174
  (insert (eq_fst op =) arg classrel, arities));
wenzelm@19503
   175
wenzelm@19503
   176
wenzelm@19574
   177
fun the_arity thy a (c, Ss) =
wenzelm@24929
   178
  (case AList.lookup (op =) (Symtab.lookup_list (#2 (get_instances thy)) a) (c, Ss) of
wenzelm@19574
   179
    SOME th => Thm.transfer thy th
wenzelm@24920
   180
  | NONE => error ("Unproven type arity " ^
wenzelm@24920
   181
      Syntax.string_of_arity (ProofContext.init thy) (a, Ss, [c])));
wenzelm@19503
   182
haftmann@27497
   183
fun arity_property thy (c, a) x =
haftmann@27547
   184
  Symtab.lookup_list (snd (get_instances thy)) a
haftmann@27497
   185
  |> map_filter (fn ((c', _), th) => if c = c'
haftmann@27547
   186
      then AList.lookup (op =) (Thm.get_tags th) x else NONE)
haftmann@27497
   187
  |> rev;
haftmann@27397
   188
haftmann@27547
   189
fun insert_arity_completions thy (t, ((c, Ss), th)) arities =
haftmann@27547
   190
  let
haftmann@27547
   191
    val algebra = Sign.classes_of thy;
haftmann@27547
   192
    val super_class_completions = Sign.super_classes thy c
haftmann@27547
   193
      |> filter_out (fn c1 => exists (fn ((c2, Ss2), _) => c1 = c2
haftmann@27547
   194
          andalso Sorts.sorts_le algebra (Ss2, Ss)) (Symtab.lookup_list arities t))
haftmann@27547
   195
    val tags = Thm.get_tags th;
wenzelm@27554
   196
    val completions = map (fn c1 => (Sorts.weaken algebra
haftmann@27547
   197
      (fn (th, c2) => fn c3 => th RS the_classrel thy (c2, c3)) (th, c) c1
haftmann@27547
   198
        |> Thm.map_tags (K tags) |> Thm.close_derivation, c1)) super_class_completions;
haftmann@27547
   199
    val arities' = fold (fn (th1, c1) => Symtab.cons_list (t, ((c1, Ss), th1)))
haftmann@27547
   200
      completions arities;
haftmann@27547
   201
  in (completions, arities') end;
wenzelm@19503
   202
haftmann@27547
   203
fun put_arity ((t, Ss, c), th) thy =
haftmann@27547
   204
  let
haftmann@27547
   205
    val th' = (Thm.map_tags o AList.default (op =))
haftmann@27547
   206
      (Markup.theory_nameN, Context.theory_name thy) th;
haftmann@27547
   207
    val arity' = (t, ((c, Ss), th'));
haftmann@27547
   208
  in
haftmann@27547
   209
    thy
haftmann@27547
   210
    |> map_instances (fn (classrel, arities) => (classrel,
haftmann@27547
   211
      arities
haftmann@27547
   212
      |> Symtab.insert_list (eq_fst op =) arity'
haftmann@27547
   213
      |> insert_arity_completions thy arity'
haftmann@27547
   214
      |> snd))
haftmann@27547
   215
  end;
wenzelm@19503
   216
haftmann@27547
   217
fun complete_arities thy = 
haftmann@27547
   218
  let
haftmann@27547
   219
    val arities = snd (get_instances thy);
haftmann@27547
   220
    val (completions, arities') = arities
haftmann@27547
   221
      |> fold_map (insert_arity_completions thy) (Symtab.dest_list arities)
haftmann@27547
   222
      |>> flat;
haftmann@27547
   223
  in if null completions
haftmann@27547
   224
    then NONE
haftmann@27547
   225
    else SOME (thy |> map_instances (fn (classrel, _) => (classrel, arities')))
haftmann@27547
   226
  end;
haftmann@27547
   227
haftmann@27547
   228
val _ = Context.>> (Context.map_theory (Theory.at_begin complete_arities));
haftmann@27397
   229
haftmann@27397
   230
haftmann@25597
   231
(* maintain instance parameters *)
haftmann@25597
   232
haftmann@25597
   233
val get_inst_params = #2 o #2 o AxClassData.get;
haftmann@25597
   234
val map_inst_params = AxClassData.map o apsnd o apsnd;
haftmann@25597
   235
haftmann@25597
   236
fun get_inst_param thy (c, tyco) =
haftmann@25597
   237
  (the o Symtab.lookup ((the o Symtab.lookup (fst (get_inst_params thy))) c)) tyco;
haftmann@25597
   238
haftmann@25597
   239
fun add_inst_param (c, tyco) inst = (map_inst_params o apfst
haftmann@25597
   240
      o Symtab.map_default (c, Symtab.empty)) (Symtab.update_new (tyco, inst))
haftmann@25597
   241
  #> (map_inst_params o apsnd) (Symtab.update_new (fst inst, (c, tyco)));
haftmann@25597
   242
haftmann@25597
   243
val inst_of_param = Symtab.lookup o snd o get_inst_params;
haftmann@25597
   244
val param_of_inst = fst oo get_inst_param;
haftmann@25597
   245
haftmann@25597
   246
fun inst_thms thy = (Symtab.fold (Symtab.fold (cons o snd o snd) o snd) o fst)
haftmann@25597
   247
  (get_inst_params thy) [];
haftmann@25597
   248
haftmann@25863
   249
fun inst_tyco_of thy = try (fst o dest_Type o the_single o Sign.const_typargs thy);
haftmann@25597
   250
haftmann@25597
   251
fun unoverload thy = MetaSimplifier.simplify true (inst_thms thy);
haftmann@25597
   252
fun overload thy = MetaSimplifier.simplify true (map Thm.symmetric (inst_thms thy));
haftmann@25597
   253
haftmann@25597
   254
fun unoverload_conv thy = MetaSimplifier.rewrite true (inst_thms thy);
haftmann@25597
   255
fun overload_conv thy = MetaSimplifier.rewrite true (map Thm.symmetric (inst_thms thy));
haftmann@25597
   256
haftmann@25597
   257
fun unoverload_const thy (c_ty as (c, _)) =
haftmann@25597
   258
  case class_of_param thy c
haftmann@25597
   259
   of SOME class => (case inst_tyco_of thy c_ty
haftmann@25597
   260
       of SOME tyco => try (param_of_inst thy) (c, tyco) |> the_default c
haftmann@25597
   261
        | NONE => c)
haftmann@25597
   262
    | NONE => c;
haftmann@25597
   263
wenzelm@404
   264
wenzelm@19511
   265
(** instances **)
wenzelm@19418
   266
wenzelm@19418
   267
(* class relations *)
wenzelm@19418
   268
wenzelm@19405
   269
fun cert_classrel thy raw_rel =
wenzelm@15876
   270
  let
wenzelm@26939
   271
    val string_of_sort = Syntax.string_of_sort_global thy;
wenzelm@19405
   272
    val (c1, c2) = pairself (Sign.certify_class thy) raw_rel;
wenzelm@24271
   273
    val _ = Sign.primitive_classrel (c1, c2) (Theory.copy thy);
wenzelm@19405
   274
    val _ =
wenzelm@19460
   275
      (case subtract (op =) (all_params_of thy [c1]) (all_params_of thy [c2]) of
wenzelm@19405
   276
        [] => ()
wenzelm@26939
   277
      | xs => raise TYPE ("Class " ^ string_of_sort [c1] ^ " lacks parameter(s) " ^
wenzelm@26939
   278
          commas_quote xs ^ " of " ^ string_of_sort [c2], [], []));
wenzelm@19405
   279
  in (c1, c2) end;
wenzelm@19405
   280
wenzelm@19405
   281
fun read_classrel thy raw_rel =
wenzelm@19405
   282
  cert_classrel thy (pairself (Sign.read_class thy) raw_rel)
wenzelm@19405
   283
    handle TYPE (msg, _, _) => error msg;
wenzelm@19405
   284
wenzelm@19405
   285
wenzelm@19405
   286
(* primitive rules *)
wenzelm@19405
   287
wenzelm@19405
   288
fun add_classrel th thy =
wenzelm@19405
   289
  let
wenzelm@19405
   290
    fun err () = raise THM ("add_classrel: malformed class relation", 0, [th]);
wenzelm@22691
   291
    val prop = Thm.plain_prop_of (Thm.transfer thy th);
wenzelm@19405
   292
    val rel = Logic.dest_classrel prop handle TERM _ => err ();
wenzelm@19405
   293
    val (c1, c2) = cert_classrel thy rel handle TYPE _ => err ();
wenzelm@19574
   294
  in
wenzelm@19574
   295
    thy
wenzelm@19574
   296
    |> Sign.primitive_classrel (c1, c2)
haftmann@29524
   297
    |> put_classrel ((c1, c2), Thm.close_derivation (Drule.unconstrainTs th))
haftmann@28014
   298
    |> perhaps complete_arities
wenzelm@19574
   299
  end;
wenzelm@15876
   300
wenzelm@19405
   301
fun add_arity th thy =
wenzelm@15876
   302
  let
wenzelm@19528
   303
    fun err () = raise THM ("add_arity: malformed type arity", 0, [th]);
wenzelm@22691
   304
    val prop = Thm.plain_prop_of (Thm.transfer thy th);
wenzelm@19528
   305
    val (t, Ss, c) = Logic.dest_arity prop handle TERM _ => err ();
wenzelm@24731
   306
    val _ = map (Sign.certify_sort thy) Ss = Ss orelse err ();
haftmann@26516
   307
    val _ = case filter_out (fn c => can (get_inst_param thy) (c, t)) (params_of thy c)
haftmann@26516
   308
     of [] => ()
haftmann@26516
   309
      | cs => Output.legacy_feature
haftmann@26516
   310
          ("Missing specifications for overloaded parameters " ^ commas_quote cs)
haftmann@27547
   311
    val th' = Drule.unconstrainTs th;
wenzelm@19574
   312
  in
wenzelm@19574
   313
    thy
wenzelm@19574
   314
    |> Sign.primitive_arity (t, Ss, [c])
haftmann@27397
   315
    |> put_arity ((t, Ss, c), th')
wenzelm@19574
   316
  end;
wenzelm@404
   317
wenzelm@404
   318
wenzelm@19243
   319
(* tactical proofs *)
wenzelm@15876
   320
wenzelm@19405
   321
fun prove_classrel raw_rel tac thy =
wenzelm@15876
   322
  let
wenzelm@24920
   323
    val ctxt = ProofContext.init thy;
wenzelm@19405
   324
    val (c1, c2) = cert_classrel thy raw_rel;
wenzelm@24920
   325
    val th = Goal.prove ctxt [] []
wenzelm@20049
   326
        (Logic.mk_classrel (c1, c2)) (fn _ => tac) handle ERROR msg =>
wenzelm@19243
   327
      cat_error msg ("The error(s) above occurred while trying to prove class relation " ^
wenzelm@24920
   328
        quote (Syntax.string_of_classrel ctxt [c1, c2]));
wenzelm@19511
   329
  in
wenzelm@19511
   330
    thy
haftmann@29579
   331
    |> PureThy.add_thms [((Binding.name
haftmann@29579
   332
        (prefix classrel_prefix (Logic.name_classrel (c1, c2))), th), [])]
wenzelm@19511
   333
    |-> (fn [th'] => add_classrel th')
wenzelm@19511
   334
  end;
wenzelm@404
   335
wenzelm@19243
   336
fun prove_arity raw_arity tac thy =
wenzelm@15876
   337
  let
wenzelm@24920
   338
    val ctxt = ProofContext.init thy;
wenzelm@19243
   339
    val arity = Sign.cert_arity thy raw_arity;
wenzelm@20628
   340
    val names = map (prefix arity_prefix) (Logic.name_arities arity);
wenzelm@19405
   341
    val props = Logic.mk_arities arity;
wenzelm@24920
   342
    val ths = Goal.prove_multi ctxt [] [] props
wenzelm@21687
   343
      (fn _ => Goal.precise_conjunction_tac (length props) 1 THEN tac) handle ERROR msg =>
wenzelm@19243
   344
        cat_error msg ("The error(s) above occurred while trying to prove type arity " ^
wenzelm@24920
   345
          quote (Syntax.string_of_arity ctxt arity));
wenzelm@19511
   346
  in
wenzelm@19511
   347
    thy
haftmann@29579
   348
    |> PureThy.add_thms (map (rpair []) (map Binding.name names ~~ ths))
wenzelm@19511
   349
    |-> fold add_arity
wenzelm@19511
   350
  end;
wenzelm@19511
   351
wenzelm@19511
   352
haftmann@25597
   353
(* instance parameters and overloaded definitions *)
haftmann@25597
   354
haftmann@25597
   355
(* declaration and definition of instances of overloaded constants *)
haftmann@25597
   356
haftmann@25597
   357
fun declare_overloaded (c, T) thy =
haftmann@25597
   358
  let
haftmann@25605
   359
    val class = case class_of_param thy c
haftmann@25605
   360
     of SOME class => class
haftmann@25605
   361
      | NONE => error ("Not a class parameter: " ^ quote c);
haftmann@25605
   362
    val tyco = case inst_tyco_of thy (c, T)
haftmann@25605
   363
     of SOME tyco => tyco
haftmann@25605
   364
      | NONE => error ("Illegal type for instantiation of class parameter: "
wenzelm@26939
   365
        ^ quote (c ^ " :: " ^ Syntax.string_of_typ_global thy T));
haftmann@25597
   366
    val name_inst = instance_name (tyco, class) ^ "_inst";
haftmann@25597
   367
    val c' = NameSpace.base c ^ "_" ^ NameSpace.base tyco;
haftmann@25597
   368
    val T' = Type.strip_sorts T;
haftmann@25597
   369
  in
haftmann@25597
   370
    thy
haftmann@25597
   371
    |> Sign.sticky_prefix name_inst
haftmann@25597
   372
    |> Sign.no_base_names
haftmann@28965
   373
    |> Sign.declare_const [] ((Binding.name c', T'), NoSyn)
haftmann@25597
   374
    |-> (fn const' as Const (c'', _) => Thm.add_def false true
haftmann@29579
   375
          (Binding.name (Thm.def_name c'), Logic.mk_equals (Const (c, T'), const'))
haftmann@25597
   376
    #>> Thm.varifyT
haftmann@25597
   377
    #-> (fn thm => add_inst_param (c, tyco) (c'', thm)
haftmann@29579
   378
    #> PureThy.add_thm ((Binding.name c', thm), [Thm.kind_internal])
haftmann@25597
   379
    #> snd
haftmann@25597
   380
    #> Sign.restore_naming thy
haftmann@25597
   381
    #> pair (Const (c, T))))
haftmann@25597
   382
  end;
haftmann@25597
   383
haftmann@25597
   384
fun define_overloaded name (c, t) thy =
haftmann@25597
   385
  let
haftmann@25597
   386
    val T = Term.fastype_of t;
haftmann@25597
   387
    val SOME tyco = inst_tyco_of thy (c, T);
haftmann@25597
   388
    val (c', eq) = get_inst_param thy (c, tyco);
haftmann@25597
   389
    val prop = Logic.mk_equals (Const (c', T), t);
haftmann@25597
   390
    val name' = Thm.def_name_optional
haftmann@25597
   391
      (NameSpace.base c ^ "_" ^ NameSpace.base tyco) name;
haftmann@25597
   392
  in
haftmann@25597
   393
    thy
haftmann@29579
   394
    |> Thm.add_def false false (Binding.name name', prop)
haftmann@25597
   395
    |>> (fn thm =>  Drule.transitive_thm OF [eq, thm])
haftmann@25597
   396
  end;
haftmann@25597
   397
haftmann@25597
   398
wenzelm@19511
   399
wenzelm@19511
   400
(** class definitions **)
wenzelm@19511
   401
wenzelm@23421
   402
fun split_defined n eq =
wenzelm@23421
   403
  let
wenzelm@23421
   404
    val intro =
wenzelm@23421
   405
      (eq RS Drule.equal_elim_rule2)
wenzelm@23421
   406
      |> Conjunction.curry_balanced n
wenzelm@23421
   407
      |> n = 0 ? Thm.eq_assumption 1;
wenzelm@23421
   408
    val dests =
wenzelm@23421
   409
      if n = 0 then []
wenzelm@23421
   410
      else
wenzelm@23421
   411
        (eq RS Drule.equal_elim_rule1)
wenzelm@23421
   412
        |> BalancedTree.dest (fn th =>
wenzelm@23421
   413
          (th RS Conjunction.conjunctionD1, th RS Conjunction.conjunctionD2)) n;
wenzelm@23421
   414
  in (intro, dests) end;
wenzelm@23421
   415
wenzelm@24964
   416
fun define_class (bclass, raw_super) raw_params raw_specs thy =
wenzelm@19511
   417
  let
wenzelm@19511
   418
    val ctxt = ProofContext.init thy;
wenzelm@24964
   419
    val pp = Syntax.pp ctxt;
wenzelm@19511
   420
wenzelm@19511
   421
wenzelm@24964
   422
    (* class *)
wenzelm@19511
   423
wenzelm@19511
   424
    val bconst = Logic.const_of_class bclass;
haftmann@28965
   425
    val class = Sign.full_bname thy bclass;
wenzelm@24731
   426
    val super = Sign.minimize_sort thy (Sign.certify_sort thy raw_super);
wenzelm@19511
   427
wenzelm@24964
   428
    fun check_constraint (a, S) =
wenzelm@24964
   429
      if Sign.subsort thy (super, S) then ()
wenzelm@24964
   430
      else error ("Sort constraint of type variable " ^
wenzelm@24964
   431
        setmp show_sorts true (Pretty.string_of_typ pp) (TFree (a, S)) ^
wenzelm@24964
   432
        " needs to be weaker than " ^ Pretty.string_of_sort pp super);
wenzelm@24964
   433
wenzelm@24964
   434
wenzelm@24964
   435
    (* params *)
wenzelm@24964
   436
wenzelm@24964
   437
    val params = raw_params |> map (fn p =>
wenzelm@24964
   438
      let
wenzelm@24964
   439
        val T = Sign.the_const_type thy p;
wenzelm@24964
   440
        val _ =
wenzelm@24964
   441
          (case Term.add_tvarsT T [] of
wenzelm@24964
   442
            [((a, _), S)] => check_constraint (a, S)
wenzelm@24964
   443
          | _ => error ("Exactly one type variable expected in class parameter " ^ quote p));
wenzelm@24964
   444
        val T' = Term.map_type_tvar (fn _ => TFree (Name.aT, [class])) T;
wenzelm@24964
   445
      in (p, T') end);
wenzelm@24964
   446
wenzelm@24964
   447
wenzelm@24964
   448
    (* axioms *)
wenzelm@24964
   449
wenzelm@19511
   450
    fun prep_axiom t =
wenzelm@19511
   451
      (case Term.add_tfrees t [] of
wenzelm@24964
   452
        [(a, S)] => check_constraint (a, S)
wenzelm@24964
   453
      | [] => ()
wenzelm@24964
   454
      | _ => error ("Multiple type variables in class axiom:\n" ^ Pretty.string_of_term pp t);
wenzelm@24964
   455
      t
wenzelm@24964
   456
      |> Term.map_types (Term.map_atyps (fn TFree _ => Term.aT [] | U => U))
wenzelm@24964
   457
      |> Logic.close_form);
wenzelm@19511
   458
wenzelm@24681
   459
    val axiomss = map (map (prep_axiom o Sign.cert_prop thy) o snd) raw_specs;
haftmann@22745
   460
    val name_atts = map fst raw_specs;
wenzelm@19511
   461
wenzelm@19511
   462
wenzelm@19511
   463
    (* definition *)
wenzelm@19511
   464
wenzelm@19511
   465
    val conjs = map (curry Logic.mk_inclass (Term.aT [])) super @ flat axiomss;
wenzelm@19511
   466
    val class_eq =
wenzelm@23421
   467
      Logic.mk_equals (Logic.mk_inclass (Term.aT [], class), Logic.mk_conjunction_balanced conjs);
wenzelm@19511
   468
wenzelm@19511
   469
    val ([def], def_thy) =
wenzelm@19511
   470
      thy
wenzelm@19511
   471
      |> Sign.primitive_class (bclass, super)
haftmann@29579
   472
      |> PureThy.add_defs false [((Binding.name (Thm.def_name bconst), class_eq), [])];
wenzelm@19511
   473
    val (raw_intro, (raw_classrel, raw_axioms)) =
wenzelm@23421
   474
      split_defined (length conjs) def ||> chop (length super);
wenzelm@19392
   475
wenzelm@19418
   476
wenzelm@19511
   477
    (* facts *)
wenzelm@19511
   478
wenzelm@19511
   479
    val class_triv = Thm.class_triv def_thy class;
wenzelm@19511
   480
    val ([(_, [intro]), (_, classrel), (_, axioms)], facts_thy) =
wenzelm@19511
   481
      def_thy
haftmann@27691
   482
      |> Sign.add_path bconst
haftmann@27691
   483
      |> Sign.no_base_names
haftmann@27691
   484
      |> PureThy.note_thmss ""
haftmann@28965
   485
        [((Binding.name introN, []), [([Drule.standard raw_intro], [])]),
haftmann@28965
   486
         ((Binding.name superN, []), [(map Drule.standard raw_classrel, [])]),
haftmann@28965
   487
         ((Binding.name axiomsN, []),
wenzelm@28083
   488
           [(map (fn th => Drule.standard (class_triv RS th)) raw_axioms, [])])]
haftmann@27691
   489
      ||> Sign.restore_naming def_thy;
wenzelm@19511
   490
wenzelm@24847
   491
wenzelm@19511
   492
    (* result *)
wenzelm@19511
   493
wenzelm@24964
   494
    val axclass = make_axclass ((def, intro, axioms), params);
wenzelm@19511
   495
    val result_thy =
wenzelm@19511
   496
      facts_thy
wenzelm@19574
   497
      |> fold put_classrel (map (pair class) super ~~ classrel)
wenzelm@19511
   498
      |> Sign.add_path bconst
haftmann@27691
   499
      |> PureThy.note_thmss "" (name_atts ~~ map Thm.simple_fact (unflat axiomss axioms)) |> snd
wenzelm@19511
   500
      |> Sign.restore_naming facts_thy
wenzelm@19574
   501
      |> map_axclasses (fn (axclasses, parameters) =>
wenzelm@21919
   502
        (Symtab.update (class, axclass) axclasses,
wenzelm@24964
   503
          fold (fn (x, _) => add_param pp (x, class)) params parameters));
wenzelm@19511
   504
wenzelm@19511
   505
  in (class, result_thy) end;
wenzelm@19511
   506
wenzelm@19511
   507
wenzelm@19531
   508
wenzelm@19511
   509
(** axiomatizations **)
wenzelm@19511
   510
wenzelm@19511
   511
local
wenzelm@19511
   512
wenzelm@20628
   513
fun axiomatize prep mk name add raw_args thy =
wenzelm@20628
   514
  let
wenzelm@20628
   515
    val args = prep thy raw_args;
wenzelm@20628
   516
    val specs = mk args;
wenzelm@20628
   517
    val names = name args;
haftmann@29579
   518
  in
haftmann@29579
   519
    thy
haftmann@29579
   520
    |> PureThy.add_axioms (map (rpair []) (map Binding.name names ~~ specs))
haftmann@29579
   521
    |-> fold add
haftmann@29579
   522
  end;
wenzelm@19511
   523
wenzelm@19511
   524
fun ax_classrel prep =
wenzelm@20628
   525
  axiomatize (map o prep) (map Logic.mk_classrel)
wenzelm@20628
   526
    (map (prefix classrel_prefix o Logic.name_classrel)) add_classrel;
wenzelm@19511
   527
wenzelm@19511
   528
fun ax_arity prep =
wenzelm@20628
   529
  axiomatize prep Logic.mk_arities
wenzelm@20628
   530
    (map (prefix arity_prefix) o Logic.name_arities) add_arity;
wenzelm@19511
   531
wenzelm@19706
   532
fun class_const c =
wenzelm@19706
   533
  (Logic.const_of_class c, Term.itselfT (Term.aT []) --> propT);
wenzelm@19706
   534
wenzelm@19511
   535
fun ax_class prep_class prep_classrel (bclass, raw_super) thy =
wenzelm@19511
   536
  let
haftmann@28965
   537
    val class = Sign.full_bname thy bclass;
wenzelm@24731
   538
    val super = map (prep_class thy) raw_super |> Sign.minimize_sort thy;
wenzelm@19511
   539
  in
wenzelm@19511
   540
    thy
wenzelm@19511
   541
    |> Sign.primitive_class (bclass, super)
wenzelm@19511
   542
    |> ax_classrel prep_classrel (map (fn c => (class, c)) super)
wenzelm@19706
   543
    |> Theory.add_deps "" (class_const class) (map class_const super)
wenzelm@19511
   544
  end;
wenzelm@19511
   545
wenzelm@19511
   546
in
wenzelm@19511
   547
wenzelm@24929
   548
val axiomatize_class = ax_class Sign.certify_class cert_classrel;
wenzelm@24929
   549
val axiomatize_class_cmd = ax_class Sign.read_class read_classrel;
wenzelm@24929
   550
val axiomatize_classrel = ax_classrel cert_classrel;
wenzelm@24929
   551
val axiomatize_classrel_cmd = ax_classrel read_classrel;
wenzelm@24929
   552
val axiomatize_arity = ax_arity Sign.cert_arity;
wenzelm@24929
   553
val axiomatize_arity_cmd = ax_arity Sign.read_arity;
wenzelm@19511
   554
wenzelm@19511
   555
end;
wenzelm@19511
   556
wenzelm@19511
   557
wenzelm@19511
   558
wenzelm@19511
   559
(** explicit derivations -- cached **)
wenzelm@19511
   560
wenzelm@19574
   561
datatype cache = Types of (class * thm) list Typtab.table;
wenzelm@19574
   562
wenzelm@19511
   563
local
wenzelm@19503
   564
wenzelm@19574
   565
fun lookup_type (Types cache) = AList.lookup (op =) o Typtab.lookup_list cache;
wenzelm@19574
   566
fun insert_type T der (Types cache) = Types (Typtab.insert_list (eq_fst op =) (T, der) cache);
wenzelm@19503
   567
wenzelm@19522
   568
fun derive_type _ (_, []) = []
wenzelm@19522
   569
  | derive_type thy (typ, sort) =
wenzelm@19522
   570
      let
wenzelm@19528
   571
        val vars = Term.fold_atyps
wenzelm@19522
   572
            (fn T as TFree (_, S) => insert (eq_fst op =) (T, S)
wenzelm@19522
   573
              | T as TVar (_, S) => insert (eq_fst op =) (T, S)
wenzelm@19528
   574
              | _ => I) typ [];
wenzelm@19574
   575
        val hyps = vars
wenzelm@19574
   576
          |> map (fn (T, S) => (T, Drule.sort_triv thy (T, S) ~~ S));
wenzelm@26939
   577
        val ths = (typ, sort)
wenzelm@26939
   578
          |> Sorts.of_sort_derivation (Syntax.pp_global thy) (Sign.classes_of thy)
wenzelm@22570
   579
           {class_relation =
wenzelm@19574
   580
              fn (th, c1) => fn c2 => th RS the_classrel thy (c1, c2),
wenzelm@22570
   581
            type_constructor =
wenzelm@19574
   582
              fn a => fn dom => fn c =>
wenzelm@19574
   583
                let val Ss = map (map snd) dom and ths = maps (map fst) dom
wenzelm@19574
   584
                in ths MRS the_arity thy a (c, Ss) end,
wenzelm@22570
   585
            type_variable =
wenzelm@19574
   586
              the_default [] o AList.lookup (op =) hyps};
wenzelm@19574
   587
      in ths end;
wenzelm@19503
   588
wenzelm@19511
   589
in
wenzelm@19511
   590
wenzelm@19574
   591
fun of_sort thy (typ, sort) cache =
wenzelm@19574
   592
  let
wenzelm@19574
   593
    val sort' = filter (is_none o lookup_type cache typ) sort;
wenzelm@19574
   594
    val ths' = derive_type thy (typ, sort')
wenzelm@19574
   595
      handle ERROR msg => cat_error msg ("The error(s) above occurred for sort derivation: " ^
wenzelm@26939
   596
        Syntax.string_of_typ_global thy typ ^ " :: " ^ Syntax.string_of_sort_global thy sort');
wenzelm@19574
   597
    val cache' = cache |> fold (insert_type typ) (sort' ~~ ths');
wenzelm@19574
   598
    val ths =
wenzelm@19574
   599
      sort |> map (fn c =>
wenzelm@19574
   600
        Goal.finish (the (lookup_type cache' typ c) RS
wenzelm@19574
   601
          Goal.init (Thm.cterm_of thy (Logic.mk_inclass (typ, c))))
wenzelm@20260
   602
        |> Thm.adjust_maxidx_thm ~1);
wenzelm@19574
   603
  in (ths, cache') end;
wenzelm@19503
   604
wenzelm@19511
   605
end;
wenzelm@19418
   606
wenzelm@24929
   607
val cache = Types Typtab.empty;
wenzelm@24929
   608
wenzelm@15876
   609
end;