src/Pure/Isar/class.ML
author haftmann
Fri Aug 24 14:14:20 2007 +0200 (2007-08-24 ago)
changeset 24423 ae9cd0e92423
parent 24304 69d40a562ba4
child 24435 cabf8cd38258
permissions -rw-r--r--
overloaded definitions accompanied by explicit constants
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@24218
    10
  val fork_mixfix: bool -> string option -> mixfix -> mixfix * mixfix
haftmann@24218
    11
haftmann@24218
    12
  val axclass_cmd: bstring * xstring list
haftmann@24218
    13
    -> ((bstring * Attrib.src list) * string list) list -> theory -> class * theory
haftmann@24218
    14
  val class: bstring -> class list -> Element.context_i Locale.element list
haftmann@24218
    15
    -> string list -> theory -> string * Proof.context
haftmann@24218
    16
  val class_cmd: bstring -> string list -> Element.context Locale.element list
haftmann@24218
    17
    -> string list -> theory -> string * Proof.context
haftmann@24423
    18
  val class_of_locale: theory -> string -> class option
haftmann@24423
    19
  val add_const_in_class: string -> (string * term) * Syntax.mixfix
haftmann@24423
    20
    -> theory -> theory
haftmann@24423
    21
haftmann@24218
    22
  val instance_arity: arity list -> ((bstring * Attrib.src list) * term) list
haftmann@24423
    23
    -> (thm list -> theory -> theory)
haftmann@24218
    24
    -> theory -> Proof.state
haftmann@24218
    25
  val instance_arity_cmd: (bstring * string list * string) list
haftmann@24218
    26
    -> ((bstring * Attrib.src list) * string) list
haftmann@24423
    27
    -> (thm list -> theory -> theory)
haftmann@24218
    28
    -> theory -> Proof.state
haftmann@24218
    29
  val prove_instance_arity: tactic -> arity list
haftmann@24218
    30
    -> ((bstring * Attrib.src list) * term) list
haftmann@24423
    31
    -> theory -> thm list * theory
haftmann@24423
    32
  val unoverload: theory -> conv
haftmann@24423
    33
  val overload: theory -> conv
haftmann@24423
    34
  val unoverload_const: theory -> string * typ -> string
haftmann@24423
    35
  val inst_const: theory -> string * string -> string
haftmann@24423
    36
  val param_const: theory -> string -> (string * string) option
haftmann@24423
    37
  val intro_classes_tac: thm list -> tactic
haftmann@24423
    38
  val default_intro_classes_tac: thm list -> tactic
haftmann@24423
    39
haftmann@24218
    40
  val instance_class: class * class -> theory -> Proof.state
haftmann@24218
    41
  val instance_class_cmd: string * string -> theory -> Proof.state
haftmann@24218
    42
  val instance_sort: class * sort -> theory -> Proof.state
haftmann@24218
    43
  val instance_sort_cmd: string * string -> theory -> Proof.state
haftmann@24218
    44
  val prove_instance_sort: tactic -> class * sort -> theory -> theory
haftmann@24218
    45
haftmann@24218
    46
  val print_classes: theory -> unit
haftmann@24218
    47
end;
haftmann@24218
    48
haftmann@24218
    49
structure Class : CLASS =
haftmann@24218
    50
struct
haftmann@24218
    51
haftmann@24218
    52
(** auxiliary **)
haftmann@24218
    53
haftmann@24218
    54
fun fork_mixfix is_loc some_class mx =
haftmann@24218
    55
  let
haftmann@24218
    56
    val mx' = Syntax.unlocalize_mixfix mx;
haftmann@24218
    57
    val mx_global = if is_some some_class orelse (is_loc andalso mx = mx')
haftmann@24218
    58
      then NoSyn else mx';
haftmann@24218
    59
    val mx_local = if is_loc then mx else NoSyn;
haftmann@24218
    60
  in (mx_global, mx_local) end;
haftmann@24218
    61
haftmann@24218
    62
fun axclass_cmd (class, raw_superclasses) raw_specs thy =
haftmann@24218
    63
  let
haftmann@24218
    64
    val ctxt = ProofContext.init thy;
haftmann@24218
    65
    val superclasses = map (Sign.read_class thy) raw_superclasses;
haftmann@24218
    66
    val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst) raw_specs;
haftmann@24218
    67
    val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd) raw_specs)
haftmann@24218
    68
      |> snd
haftmann@24218
    69
      |> (map o map) fst;
haftmann@24218
    70
  in AxClass.define_class (class, superclasses) [] (name_atts ~~ axiomss) thy end;
haftmann@24218
    71
haftmann@24218
    72
haftmann@24218
    73
(** axclasses with implicit parameter handling **)
haftmann@24218
    74
haftmann@24218
    75
(* axclass instances *)
haftmann@24218
    76
haftmann@24218
    77
local
haftmann@24218
    78
haftmann@24218
    79
fun gen_instance mk_prop add_thm after_qed insts thy =
haftmann@24218
    80
  let
haftmann@24218
    81
    fun after_qed' results =
haftmann@24218
    82
      ProofContext.theory ((fold o fold) add_thm results #> after_qed);
haftmann@24218
    83
  in
haftmann@24218
    84
    thy
haftmann@24218
    85
    |> ProofContext.init
haftmann@24218
    86
    |> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])]) o maps (mk_prop thy)) insts)
haftmann@24218
    87
  end;
haftmann@24218
    88
haftmann@24218
    89
in
haftmann@24218
    90
haftmann@24218
    91
val axclass_instance_arity =
haftmann@24218
    92
  gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity;
haftmann@24218
    93
val axclass_instance_sort =
haftmann@24218
    94
  gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel))
haftmann@24218
    95
    AxClass.add_classrel I o single;
haftmann@24218
    96
haftmann@24218
    97
end; (*local*)
haftmann@24218
    98
haftmann@24218
    99
haftmann@24218
   100
(* introducing axclasses with implicit parameter handling *)
haftmann@24218
   101
haftmann@24218
   102
fun axclass_params (name, raw_superclasses) raw_consts raw_dep_axioms other_consts thy =
haftmann@24218
   103
  let
haftmann@24218
   104
    val superclasses = map (Sign.certify_class thy) raw_superclasses;
haftmann@24218
   105
    val consts = (map o apfst o apsnd) (Sign.certify_typ thy) raw_consts;
haftmann@24218
   106
    val prefix = Logic.const_of_class name;
haftmann@24218
   107
    fun mk_const_name c = NameSpace.map_base (NameSpace.append prefix)
haftmann@24218
   108
      (Sign.full_name thy c);
haftmann@24218
   109
    fun add_const ((c, ty), syn) =
haftmann@24218
   110
      Sign.add_consts_authentic [(c, ty, syn)]
haftmann@24218
   111
      #> pair (mk_const_name c, ty);
haftmann@24218
   112
    fun mk_axioms cs thy =
haftmann@24218
   113
      raw_dep_axioms thy cs
haftmann@24218
   114
      |> (map o apsnd o map) (Sign.cert_prop thy)
haftmann@24218
   115
      |> rpair thy;
haftmann@24218
   116
    fun add_constraint class (c, ty) =
haftmann@24218
   117
      Sign.add_const_constraint_i (c, SOME
haftmann@24218
   118
        (Term.map_type_tfree (fn (v, _) => TFree (v, [class])) ty));
haftmann@24218
   119
  in
haftmann@24218
   120
    thy
haftmann@24218
   121
    |> Theory.add_path prefix
haftmann@24218
   122
    |> fold_map add_const consts
haftmann@24218
   123
    ||> Theory.restore_naming thy
haftmann@24218
   124
    |-> (fn cs => mk_axioms cs
haftmann@24218
   125
    #-> (fn axioms_prop => AxClass.define_class (name, superclasses)
haftmann@24218
   126
           (map fst cs @ other_consts) axioms_prop
haftmann@24218
   127
    #-> (fn class => `(fn thy => AxClass.get_definition thy class)
haftmann@24218
   128
    #-> (fn {intro, axioms, ...} => fold (add_constraint class) cs
haftmann@24218
   129
    #> pair (class, ((intro, (map Thm.prop_of axioms, axioms)), cs))))))
haftmann@24218
   130
  end;
haftmann@24218
   131
haftmann@24218
   132
haftmann@24304
   133
(* explicit constants for overloaded definitions *)
haftmann@24304
   134
haftmann@24304
   135
structure InstData = TheoryDataFun
haftmann@24304
   136
(
haftmann@24423
   137
  type T = (string * thm) Symtab.table Symtab.table * (string * string) Symtab.table;
haftmann@24423
   138
    (*constant name ~> type constructor ~> (constant name, equation),
haftmann@24423
   139
        constant name ~> (constant name, type constructor)*)
haftmann@24423
   140
  val empty = (Symtab.empty, Symtab.empty);
haftmann@24304
   141
  val copy = I;
haftmann@24304
   142
  val extend = I;
haftmann@24423
   143
  fun merge _ ((taba1, tabb1), (taba2, tabb2)) =
haftmann@24423
   144
    (Symtab.join (K (Symtab.merge (K true))) (taba1, taba2),
haftmann@24423
   145
      Symtab.merge (K true) (tabb1, tabb2));
haftmann@24304
   146
);
haftmann@24304
   147
haftmann@24304
   148
fun inst_thms f thy =
haftmann@24423
   149
  (Symtab.fold (Symtab.fold (cons o f o snd o snd) o snd) o fst) (InstData.get thy) [];
haftmann@24423
   150
fun add_inst (c, tyco) inst = (InstData.map o apfst o Symtab.map_default (c, Symtab.empty))
haftmann@24423
   151
  (Symtab.update_new (tyco, inst))
haftmann@24423
   152
  #> (InstData.map o apsnd) (Symtab.update_new (fst inst, (c, tyco)));
haftmann@24304
   153
haftmann@24423
   154
fun unoverload thy thm = MetaSimplifier.rewrite false (inst_thms I thy) thm;
haftmann@24423
   155
fun overload thy thm = MetaSimplifier.rewrite false (inst_thms symmetric thy) thm;
haftmann@24304
   156
haftmann@24304
   157
fun inst_const thy (c, tyco) =
haftmann@24423
   158
  (fst o the o Symtab.lookup ((the o Symtab.lookup (fst (InstData.get thy))) c)) tyco;
haftmann@24423
   159
fun unoverload_const thy (c_ty as (c, _)) =
haftmann@24423
   160
  case AxClass.class_of_param thy c
haftmann@24423
   161
   of SOME class => (case Sign.const_typargs thy c_ty
haftmann@24423
   162
       of [Type (tyco, _)] =>
haftmann@24423
   163
            (case Symtab.lookup ((the o Symtab.lookup (fst (InstData.get thy))) c) tyco
haftmann@24423
   164
             of SOME (c, _) => c
haftmann@24423
   165
              | NONE => c)
haftmann@24423
   166
        | [_] => c)
haftmann@24423
   167
    | NONE => c;
haftmann@24423
   168
haftmann@24423
   169
val param_const = Symtab.lookup o snd o InstData.get;
haftmann@24304
   170
haftmann@24304
   171
fun add_inst_def (class, tyco) (c, ty) thy =
haftmann@24304
   172
  let
haftmann@24304
   173
    val tyco_base = NameSpace.base tyco;
haftmann@24304
   174
    val name_inst = NameSpace.base class ^ "_" ^ tyco_base ^ "_inst";
haftmann@24304
   175
    val c_inst_base = NameSpace.base c ^ "_" ^ tyco_base;
haftmann@24304
   176
  in
haftmann@24304
   177
    thy
haftmann@24304
   178
    |> Sign.sticky_prefix name_inst
haftmann@24304
   179
    |> Sign.add_consts_i [(c_inst_base, ty, Syntax.NoSyn)]
haftmann@24304
   180
    |> `(fn thy => Sign.full_name thy c_inst_base)
haftmann@24304
   181
    |-> (fn c_inst => PureThy.add_defs_i true
haftmann@24304
   182
          [((Thm.def_name c_inst_base, Logic.mk_equals (Const (c_inst, ty), Const (c, ty))), [])]
haftmann@24304
   183
    #-> (fn [def] => add_inst (c, tyco) (c_inst, symmetric def))
haftmann@24304
   184
    #> Sign.restore_naming thy)
haftmann@24304
   185
  end;
haftmann@24304
   186
haftmann@24304
   187
fun add_inst_def' (class, tyco) (c, ty) thy =
haftmann@24423
   188
  if case Symtab.lookup (fst (InstData.get thy)) c
haftmann@24304
   189
   of NONE => true
haftmann@24304
   190
    | SOME tab => is_none (Symtab.lookup tab tyco)
haftmann@24304
   191
  then add_inst_def (class, tyco) (c, Logic.unvarifyT ty) thy
haftmann@24304
   192
  else thy;
haftmann@24304
   193
haftmann@24304
   194
fun add_def ((class, tyco), ((name, prop), atts)) thy =
haftmann@24304
   195
  let
haftmann@24304
   196
    val ((lhs as Const (c, ty), args), rhs) = (apfst Term.strip_comb o Logic.dest_equals) prop;
haftmann@24304
   197
    fun add_inst' def ([], (Const (c_inst, ty))) =
haftmann@24423
   198
          if forall (fn TFree _ => true | _ => false) (Sign.const_typargs thy (c_inst, ty))
haftmann@24304
   199
          then add_inst (c, tyco) (c_inst, def)
haftmann@24304
   200
          else add_inst_def (class, tyco) (c, ty)
haftmann@24304
   201
      | add_inst' _ t = add_inst_def (class, tyco) (c, ty);
haftmann@24304
   202
  in
haftmann@24304
   203
    thy
haftmann@24304
   204
    |> PureThy.add_defs_i true [((name, prop), map (Attrib.attribute thy) atts)]
haftmann@24304
   205
    |-> (fn [def] => add_inst' def (args, rhs) #> pair def)
haftmann@24304
   206
  end;
haftmann@24304
   207
haftmann@24304
   208
haftmann@24218
   209
(* instances with implicit parameter handling *)
haftmann@24218
   210
haftmann@24218
   211
local
haftmann@24218
   212
haftmann@24218
   213
fun gen_read_def thy prep_att read_def ((raw_name, raw_atts), raw_t) =
haftmann@24218
   214
  let
haftmann@24218
   215
    val (_, t) = read_def thy (raw_name, raw_t);
haftmann@24218
   216
    val ((c, ty), _) = Sign.cert_def (Sign.pp thy) t;
haftmann@24218
   217
    val atts = map (prep_att thy) raw_atts;
haftmann@24218
   218
    val insts = Consts.typargs (Sign.consts_of thy) (c, ty);
haftmann@24218
   219
    val name = case raw_name
haftmann@24218
   220
     of "" => NONE
haftmann@24218
   221
      | _ => SOME raw_name;
haftmann@24218
   222
  in (c, (insts, ((name, t), atts))) end;
haftmann@24218
   223
haftmann@24218
   224
fun read_def_cmd thy = gen_read_def thy Attrib.intern_src Theory.read_axm;
haftmann@24218
   225
fun read_def thy = gen_read_def thy (K I) (K I);
haftmann@24218
   226
haftmann@24423
   227
fun gen_instance_arity prep_arity read_def do_proof raw_arities raw_defs after_qed theory =
haftmann@24218
   228
  let
haftmann@24218
   229
    val arities = map (prep_arity theory) raw_arities;
haftmann@24218
   230
    val _ = if null arities then error "at least one arity must be given" else ();
haftmann@24218
   231
    val _ = case (duplicates (op =) o map #1) arities
haftmann@24218
   232
     of [] => ()
haftmann@24218
   233
      | dupl_tycos => error ("type constructors occur more than once in arities: "
haftmann@24218
   234
          ^ (commas o map quote) dupl_tycos);
haftmann@24218
   235
    val super_sort = (Graph.all_succs o #classes o Sorts.rep_algebra o Sign.classes_of) theory
haftmann@24218
   236
    fun get_consts_class tyco ty class =
haftmann@24218
   237
      let
haftmann@24218
   238
        val cs = (these o Option.map snd o try (AxClass.params_of_class theory)) class;
haftmann@24218
   239
        val subst_ty = map_type_tfree (K ty);
haftmann@24218
   240
      in
haftmann@24304
   241
        map (fn (c, ty) => (c, ((class, tyco), subst_ty ty))) cs
haftmann@24218
   242
      end;
haftmann@24218
   243
    fun get_consts_sort (tyco, asorts, sort) =
haftmann@24218
   244
      let
haftmann@24218
   245
        val ty = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort)) (Name.names Name.context "'a" asorts))
haftmann@24218
   246
      in maps (get_consts_class tyco ty) (super_sort sort) end;
haftmann@24218
   247
    val cs = maps get_consts_sort arities;
haftmann@24218
   248
    fun mk_typnorm thy (ty, ty_sc) =
haftmann@24218
   249
      case try (Sign.typ_match thy (Logic.varifyT ty_sc, ty)) Vartab.empty
haftmann@24218
   250
       of SOME env => SOME (Logic.varifyT #> Envir.typ_subst_TVars env #> Logic.unvarifyT)
haftmann@24218
   251
        | NONE => NONE;
haftmann@24218
   252
    fun read_defs defs cs thy_read =
haftmann@24218
   253
      let
haftmann@24218
   254
        fun read raw_def cs =
haftmann@24218
   255
          let
haftmann@24218
   256
            val (c, (inst, ((name_opt, t), atts))) = read_def thy_read raw_def;
haftmann@24218
   257
            val ty = Consts.instance (Sign.consts_of thy_read) (c, inst);
haftmann@24304
   258
            val ((class, tyco), ty') = case AList.lookup (op =) cs c
haftmann@24218
   259
             of NONE => error ("illegal definition for constant " ^ quote c)
haftmann@24218
   260
              | SOME class_ty => class_ty;
haftmann@24218
   261
            val name = case name_opt
haftmann@24218
   262
             of NONE => Thm.def_name (Logic.name_arity (tyco, [], c))
haftmann@24218
   263
              | SOME name => name;
haftmann@24218
   264
            val t' = case mk_typnorm thy_read (ty', ty)
haftmann@24218
   265
             of NONE => error ("illegal definition for constant " ^
haftmann@24218
   266
                  quote (c ^ "::" ^ setmp show_sorts true
haftmann@24218
   267
                    (Sign.string_of_typ thy_read) ty))
haftmann@24218
   268
              | SOME norm => map_types norm t
haftmann@24218
   269
          in (((class, tyco), ((name, t'), atts)), AList.delete (op =) c cs) end;
haftmann@24218
   270
      in fold_map read defs cs end;
haftmann@24304
   271
    val (defs, other_cs) = read_defs raw_defs cs
haftmann@24218
   272
      (fold Sign.primitive_arity arities (Theory.copy theory));
haftmann@24218
   273
    fun get_remove_contraint c thy =
haftmann@24218
   274
      let
haftmann@24218
   275
        val ty = Sign.the_const_constraint thy c;
haftmann@24218
   276
      in
haftmann@24218
   277
        thy
haftmann@24218
   278
        |> Sign.add_const_constraint_i (c, NONE)
haftmann@24218
   279
        |> pair (c, Logic.unvarifyT ty)
haftmann@24218
   280
      end;
haftmann@24423
   281
    fun after_qed' cs defs =
haftmann@24304
   282
      fold Sign.add_const_constraint_i (map (apsnd SOME) cs)
haftmann@24423
   283
      #> after_qed defs;
haftmann@24218
   284
  in
haftmann@24218
   285
    theory
haftmann@24218
   286
    |> fold_map get_remove_contraint (map fst cs |> distinct (op =))
haftmann@24304
   287
    ||>> fold_map add_def defs
haftmann@24304
   288
    ||> fold (fn (c, ((class, tyco), ty)) => add_inst_def' (class, tyco) (c, ty)) other_cs
haftmann@24423
   289
    |-> (fn (cs, defs) => do_proof (after_qed' cs defs) arities defs)
haftmann@24218
   290
  end;
haftmann@24218
   291
haftmann@24218
   292
fun instance_arity_cmd' do_proof = gen_instance_arity Sign.read_arity read_def_cmd do_proof;
haftmann@24218
   293
fun instance_arity' do_proof = gen_instance_arity Sign.cert_arity read_def do_proof;
haftmann@24423
   294
fun tactic_proof tac f arities defs =
haftmann@24218
   295
  fold (fn arity => AxClass.prove_arity arity tac) arities
haftmann@24423
   296
  #> f
haftmann@24423
   297
  #> pair defs;
haftmann@24218
   298
haftmann@24218
   299
in
haftmann@24218
   300
haftmann@24423
   301
val instance_arity_cmd = instance_arity_cmd'
haftmann@24423
   302
  (fn f => fn arities => fn defs => axclass_instance_arity f arities);
haftmann@24423
   303
val instance_arity = instance_arity'
haftmann@24423
   304
  (fn f => fn arities => fn defs => axclass_instance_arity f arities);
haftmann@24423
   305
fun prove_instance_arity tac arities defs =
haftmann@24423
   306
  instance_arity' (tactic_proof tac) arities defs (K I);
haftmann@24218
   307
haftmann@24218
   308
end; (*local*)
haftmann@24218
   309
haftmann@24218
   310
haftmann@24218
   311
haftmann@24218
   312
(** combining locales and axclasses **)
haftmann@24218
   313
haftmann@24218
   314
(* theory data *)
haftmann@24218
   315
haftmann@24218
   316
datatype class_data = ClassData of {
haftmann@24218
   317
  locale: string,
haftmann@24218
   318
  consts: (string * string) list
haftmann@24218
   319
    (*locale parameter ~> toplevel theory constant*),
haftmann@24218
   320
  v: string option,
haftmann@24218
   321
  intro: thm
haftmann@24218
   322
} * thm list (*derived defs*);
haftmann@24218
   323
haftmann@24218
   324
fun rep_classdata (ClassData c) = c;
haftmann@24218
   325
haftmann@24218
   326
fun merge_pair f1 f2 ((x1, y1), (x2, y2)) = (f1 (x1, x2), f2 (y1, y2));
haftmann@24218
   327
haftmann@24218
   328
structure ClassData = TheoryDataFun
haftmann@24218
   329
(
haftmann@24218
   330
  type T = class_data Graph.T * class Symtab.table (*locale name ~> class name*);
haftmann@24218
   331
  val empty = (Graph.empty, Symtab.empty);
haftmann@24218
   332
  val copy = I;
haftmann@24218
   333
  val extend = I;
haftmann@24218
   334
  fun merge _ = merge_pair (Graph.merge (K true)) (Symtab.merge (K true));
haftmann@24218
   335
);
haftmann@24218
   336
haftmann@24218
   337
haftmann@24218
   338
(* queries *)
haftmann@24218
   339
haftmann@24218
   340
val lookup_class_data = Option.map rep_classdata oo try o Graph.get_node o fst o ClassData.get;
haftmann@24218
   341
fun class_of_locale thy = Symtab.lookup ((snd o ClassData.get) thy);
haftmann@24218
   342
haftmann@24218
   343
fun the_class_data thy class =
haftmann@24218
   344
  case lookup_class_data thy class
haftmann@24218
   345
    of NONE => error ("undeclared class " ^ quote class)
haftmann@24218
   346
     | SOME data => data;
haftmann@24218
   347
haftmann@24218
   348
val ancestry = Graph.all_succs o fst o ClassData.get;
haftmann@24218
   349
haftmann@24218
   350
fun param_map thy =
haftmann@24218
   351
  let
haftmann@24218
   352
    fun params class =
haftmann@24218
   353
      let
haftmann@24218
   354
        val const_typs = (#params o AxClass.get_definition thy) class;
haftmann@24218
   355
        val const_names = (#consts o fst o the_class_data thy) class;
haftmann@24218
   356
      in
haftmann@24218
   357
        (map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names
haftmann@24218
   358
      end;
haftmann@24218
   359
  in maps params o ancestry thy end;
haftmann@24218
   360
haftmann@24218
   361
fun these_defs thy = maps (these o Option.map snd o lookup_class_data thy) o ancestry thy;
haftmann@24218
   362
haftmann@24218
   363
fun these_intros thy =
haftmann@24218
   364
  Graph.fold (fn (_, (data, _)) => insert Thm.eq_thm ((#intro o fst o rep_classdata) data))
haftmann@24218
   365
    ((fst o ClassData.get) thy) [];
haftmann@24218
   366
haftmann@24218
   367
fun print_classes thy =
haftmann@24218
   368
  let
haftmann@24218
   369
    val algebra = Sign.classes_of thy;
haftmann@24218
   370
    val arities =
haftmann@24218
   371
      Symtab.empty
haftmann@24218
   372
      |> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) =>
haftmann@24218
   373
           Symtab.map_default (class, []) (insert (op =) tyco)) arities)
haftmann@24218
   374
             ((#arities o Sorts.rep_algebra) algebra);
haftmann@24218
   375
    val the_arities = these o Symtab.lookup arities;
haftmann@24218
   376
    fun mk_arity class tyco =
haftmann@24218
   377
      let
haftmann@24218
   378
        val Ss = Sorts.mg_domain algebra tyco [class];
haftmann@24218
   379
      in Sign.pretty_arity thy (tyco, Ss, [class]) end;
haftmann@24218
   380
    fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: "
haftmann@24218
   381
      ^ setmp show_sorts false (Sign.string_of_typ thy o Type.strip_sorts) ty);
haftmann@24218
   382
    fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [
haftmann@24218
   383
      (SOME o Pretty.str) ("class " ^ class ^ ":"),
haftmann@24218
   384
      (SOME o Pretty.block) [Pretty.str "supersort: ",
haftmann@24218
   385
        (Sign.pretty_sort thy o Sign.certify_sort thy o Sign.super_classes thy) class],
haftmann@24218
   386
      Option.map (Pretty.str o prefix "locale: " o #locale o fst) (lookup_class_data thy class),
haftmann@24218
   387
      ((fn [] => NONE | ps => (SOME o Pretty.block o Pretty.fbreaks) (Pretty.str "parameters:" :: ps)) o map mk_param
haftmann@24218
   388
        o these o Option.map #params o try (AxClass.get_definition thy)) class,
haftmann@24218
   389
      (SOME o Pretty.block o Pretty.breaks) [
haftmann@24218
   390
        Pretty.str "instances:",
haftmann@24218
   391
        Pretty.list "" "" (map (mk_arity class) (the_arities class))
haftmann@24218
   392
      ]
haftmann@24218
   393
    ]
haftmann@24218
   394
  in
haftmann@24218
   395
    (Pretty.writeln o Pretty.chunks o separate (Pretty.str "") o map mk_entry o Sorts.all_classes)
haftmann@24218
   396
      algebra
haftmann@24218
   397
  end;
haftmann@24218
   398
haftmann@24218
   399
haftmann@24218
   400
(* updaters *)
haftmann@24218
   401
haftmann@24218
   402
fun add_class_data ((class, superclasses), (locale, consts, v, intro)) =
haftmann@24218
   403
  ClassData.map (fn (gr, tab) => (
haftmann@24218
   404
    gr
haftmann@24218
   405
    |> Graph.new_node (class, ClassData ({ locale = locale, consts = consts,
haftmann@24218
   406
         v = v, intro = intro }, []))
haftmann@24218
   407
    |> fold (curry Graph.add_edge class) superclasses,
haftmann@24218
   408
    tab
haftmann@24218
   409
    |> Symtab.update (locale, class)
haftmann@24218
   410
  ));
haftmann@24218
   411
haftmann@24218
   412
fun add_class_const_thm (class, thm) = (ClassData.map o apfst o Graph.map_node class)
haftmann@24218
   413
  (fn ClassData (data, thms) => ClassData (data, thm :: thms));
haftmann@24218
   414
haftmann@24218
   415
(* tactics and methods *)
haftmann@24218
   416
haftmann@24218
   417
fun intro_classes_tac facts st =
haftmann@24218
   418
  let
haftmann@24218
   419
    val thy = Thm.theory_of_thm st;
haftmann@24218
   420
    val classes = Sign.all_classes thy;
haftmann@24218
   421
    val class_trivs = map (Thm.class_triv thy) classes;
haftmann@24218
   422
    val class_intros = these_intros thy;
haftmann@24218
   423
    fun add_axclass_intro class =
haftmann@24218
   424
      case try (AxClass.get_definition thy) class of SOME {intro, ...} => cons intro | _ => I;
haftmann@24218
   425
    val axclass_intros = fold add_axclass_intro classes [];
haftmann@24218
   426
  in
haftmann@24218
   427
    st
haftmann@24218
   428
    |> ((ALLGOALS (Method.insert_tac facts THEN'
haftmann@24218
   429
          REPEAT_ALL_NEW (resolve_tac (class_trivs @ class_intros @ axclass_intros))))
haftmann@24218
   430
            THEN Tactic.distinct_subgoals_tac)
haftmann@24218
   431
  end;
haftmann@24218
   432
haftmann@24218
   433
fun default_intro_classes_tac [] = intro_classes_tac []
haftmann@24218
   434
  | default_intro_classes_tac _ = Tactical.no_tac;    (*no error message!*)
haftmann@24218
   435
haftmann@24218
   436
fun default_tac rules ctxt facts =
haftmann@24218
   437
  HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
haftmann@24218
   438
    default_intro_classes_tac facts;
haftmann@24218
   439
haftmann@24218
   440
val _ = Context.add_setup (Method.add_methods
haftmann@24218
   441
 [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
haftmann@24218
   442
    "back-chain introduction rules of classes"),
haftmann@24218
   443
  ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
haftmann@24218
   444
    "apply some intro/elim rule")]);
haftmann@24218
   445
haftmann@24218
   446
haftmann@24218
   447
(* tactical interfaces to locale commands *)
haftmann@24218
   448
haftmann@24218
   449
fun prove_interpretation tac prfx_atts expr insts thy =
haftmann@24218
   450
  thy
haftmann@24218
   451
  |> Locale.interpretation_i I prfx_atts expr insts
haftmann@24218
   452
  |> Proof.global_terminal_proof (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@24218
   453
  |> ProofContext.theory_of;
haftmann@24218
   454
haftmann@24218
   455
fun prove_interpretation_in tac after_qed (name, expr) thy =
haftmann@24218
   456
  thy
haftmann@24218
   457
  |> Locale.interpretation_in_locale (ProofContext.theory after_qed) (name, expr)
haftmann@24218
   458
  |> Proof.global_terminal_proof (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@24218
   459
  |> ProofContext.theory_of;
haftmann@24218
   460
haftmann@24218
   461
haftmann@24218
   462
(* constructing class introduction and other rules from axclass and locale rules *)
haftmann@24218
   463
haftmann@24218
   464
fun mk_instT class = Symtab.empty
haftmann@24218
   465
  |> Symtab.update (AxClass.param_tyvarname, TFree (AxClass.param_tyvarname, [class]));
haftmann@24218
   466
haftmann@24218
   467
fun mk_inst class param_names cs =
haftmann@24218
   468
  Symtab.empty
haftmann@24218
   469
  |> fold2 (fn v => fn (c, ty) => Symtab.update (v, Const
haftmann@24218
   470
       (c, Term.map_type_tfree (fn (v, _) => TFree (v, [class])) ty))) param_names cs;
haftmann@24218
   471
haftmann@24218
   472
fun OF_LAST thm1 thm2 =
haftmann@24218
   473
  let
haftmann@24218
   474
    val n = (length o Logic.strip_imp_prems o prop_of) thm2;
haftmann@24218
   475
  in (thm1 RSN (n, thm2)) end;
haftmann@24218
   476
haftmann@24218
   477
fun strip_all_ofclass thy sort =
haftmann@24218
   478
  let
haftmann@24218
   479
    val typ = TVar ((AxClass.param_tyvarname, 0), sort);
haftmann@24218
   480
    fun prem_inclass t =
haftmann@24218
   481
      case Logic.strip_imp_prems t
haftmann@24218
   482
       of ofcls :: _ => try Logic.dest_inclass ofcls
haftmann@24218
   483
        | [] => NONE;
haftmann@24218
   484
    fun strip_ofclass class thm =
haftmann@24218
   485
      thm OF (fst o AxClass.of_sort thy (typ, [class])) AxClass.cache;
haftmann@24218
   486
    fun strip thm = case (prem_inclass o Thm.prop_of) thm
haftmann@24218
   487
     of SOME (_, class) => thm |> strip_ofclass class |> strip
haftmann@24218
   488
      | NONE => thm;
haftmann@24218
   489
  in strip end;
haftmann@24218
   490
haftmann@24218
   491
fun class_intro thy locale class sups =
haftmann@24218
   492
  let
haftmann@24218
   493
    fun class_elim class =
haftmann@24218
   494
      case (map Drule.unconstrainTs o #axioms o AxClass.get_definition thy) class
haftmann@24218
   495
       of [thm] => SOME thm
haftmann@24218
   496
        | [] => NONE;
haftmann@24218
   497
    val pred_intro = case Locale.intros thy locale
haftmann@24218
   498
     of ([ax_intro], [intro]) => intro |> OF_LAST ax_intro |> SOME
haftmann@24218
   499
      | ([intro], []) => SOME intro
haftmann@24218
   500
      | ([], [intro]) => SOME intro
haftmann@24218
   501
      | _ => NONE;
haftmann@24218
   502
    val pred_intro' = pred_intro
haftmann@24218
   503
      |> Option.map (fn intro => intro OF map_filter class_elim sups);
haftmann@24218
   504
    val class_intro = (#intro o AxClass.get_definition thy) class;
haftmann@24218
   505
    val raw_intro = case pred_intro'
haftmann@24218
   506
     of SOME pred_intro => class_intro |> OF_LAST pred_intro
haftmann@24218
   507
      | NONE => class_intro;
haftmann@24218
   508
    val sort = Sign.super_classes thy class;
haftmann@24218
   509
    val typ = TVar ((AxClass.param_tyvarname, 0), sort);
haftmann@24218
   510
    val defs = these_defs thy sups;
haftmann@24218
   511
  in
haftmann@24218
   512
    raw_intro
haftmann@24218
   513
    |> Drule.instantiate' [SOME (Thm.ctyp_of thy typ)] []
haftmann@24218
   514
    |> strip_all_ofclass thy sort
haftmann@24218
   515
    |> Thm.strip_shyps
haftmann@24218
   516
    |> MetaSimplifier.rewrite_rule defs
haftmann@24218
   517
    |> Drule.unconstrainTs
haftmann@24218
   518
  end;
haftmann@24218
   519
haftmann@24218
   520
fun interpretation_in_rule thy (class1, class2) =
haftmann@24218
   521
  let
haftmann@24218
   522
    val (params, consts) = split_list (param_map thy [class1]);
haftmann@24218
   523
    (*FIXME also remember this at add_class*)
haftmann@24218
   524
    fun mk_axioms class =
haftmann@24218
   525
      let
haftmann@24218
   526
        val name_locale = (#locale o fst o the_class_data thy) class;
haftmann@24218
   527
        val inst = mk_inst class params consts;
haftmann@24218
   528
      in
haftmann@24218
   529
        Locale.global_asms_of thy name_locale
haftmann@24218
   530
        |> maps snd
haftmann@24218
   531
        |> (map o map_aterms) (fn Free (s, _) => (the o Symtab.lookup inst) s | t => t)
haftmann@24218
   532
        |> (map o map_types o map_atyps) (fn TFree _ => TFree ("'a", [class1]) | T => T)
haftmann@24218
   533
        |> map (ObjectLogic.ensure_propT thy)
haftmann@24218
   534
      end;
haftmann@24218
   535
    val (prems, concls) = pairself mk_axioms (class1, class2);
haftmann@24218
   536
  in
haftmann@24218
   537
    Goal.prove_global thy [] prems (Logic.mk_conjunction_list concls)
haftmann@24218
   538
      (Locale.intro_locales_tac true (ProofContext.init thy))
haftmann@24218
   539
  end;
haftmann@24218
   540
haftmann@24218
   541
haftmann@24218
   542
(* classes *)
haftmann@24218
   543
haftmann@24218
   544
local
haftmann@24218
   545
haftmann@24218
   546
fun read_param thy raw_t =
haftmann@24218
   547
  let
haftmann@24218
   548
    val t = Sign.read_term thy raw_t
haftmann@24218
   549
  in case try dest_Const t
haftmann@24218
   550
   of SOME (c, _) => c
haftmann@24218
   551
    | NONE => error ("Not a constant: " ^ Sign.string_of_term thy t)
haftmann@24218
   552
  end;
haftmann@24218
   553
haftmann@24218
   554
fun gen_class add_locale prep_class prep_param bname
haftmann@24218
   555
    raw_supclasses raw_elems raw_other_consts thy =
haftmann@24218
   556
  let
haftmann@24218
   557
    (*FIXME need proper concept for reading locale statements*)
haftmann@24218
   558
    fun subst_classtyvar (_, _) =
haftmann@24218
   559
          TFree (AxClass.param_tyvarname, [])
haftmann@24218
   560
      | subst_classtyvar (v, sort) =
haftmann@24218
   561
          error ("Sort constraint illegal in type class, for type variable " ^ v ^ "::" ^ Sign.string_of_sort thy sort);
haftmann@24218
   562
    (*val subst_classtyvars = Element.map_ctxt {name = I, var = I, term = I,
haftmann@24218
   563
      typ = Term.map_type_tfree subst_classtyvar, fact = I, attrib = I};*)
haftmann@24218
   564
    val other_consts = map (prep_param thy) raw_other_consts;
haftmann@24218
   565
    val (elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e)
haftmann@24218
   566
      | Locale.Expr i => apsnd (cons i)) raw_elems ([], []);
haftmann@24218
   567
    val supclasses = map (prep_class thy) raw_supclasses;
haftmann@24218
   568
    val sups = filter (is_some o lookup_class_data thy) supclasses
haftmann@24218
   569
      |> Sign.certify_sort thy;
haftmann@24218
   570
    val supsort = Sign.certify_sort thy supclasses;
haftmann@24218
   571
    val suplocales = map (Locale.Locale o #locale o fst o the_class_data thy) sups;
haftmann@24218
   572
    val supexpr = Locale.Merge (suplocales @ includes);
haftmann@24218
   573
    val supparams = (map fst o Locale.parameters_of_expr thy)
haftmann@24218
   574
      (Locale.Merge suplocales);
haftmann@24218
   575
    val supconsts = AList.make (the o AList.lookup (op =) (param_map thy sups))
haftmann@24218
   576
      (map fst supparams);
haftmann@24218
   577
    (*val elems_constrains = map
haftmann@24218
   578
      (Element.Constrains o apsnd (Term.map_type_tfree subst_classtyvar)) supparams;*)
haftmann@24218
   579
    fun mk_tyvar (_, sort) = TFree (AxClass.param_tyvarname,
haftmann@24218
   580
      if Sign.subsort thy (supsort, sort) then sort else error
haftmann@24218
   581
        ("Sort " ^ Sign.string_of_sort thy sort
haftmann@24218
   582
          ^ " is less general than permitted least general sort "
haftmann@24218
   583
          ^ Sign.string_of_sort thy supsort));
haftmann@24218
   584
    fun extract_params thy name_locale =
haftmann@24218
   585
      let
haftmann@24218
   586
        val params = Locale.parameters_of thy name_locale;
haftmann@24218
   587
        val v = case (maps typ_tfrees o map (snd o fst)) params
haftmann@24218
   588
         of (v, _) :: _ => SOME v
haftmann@24218
   589
          | _ => NONE;
haftmann@24218
   590
      in
haftmann@24218
   591
        (v, (map (fst o fst) params, params
haftmann@24218
   592
        |> (map o apfst o apsnd o Term.map_type_tfree) mk_tyvar
haftmann@24218
   593
        |> (map o apsnd) (fork_mixfix true NONE #> fst)
haftmann@24218
   594
        |> chop (length supconsts)
haftmann@24218
   595
        |> snd))
haftmann@24218
   596
      end;
haftmann@24218
   597
    fun extract_assumes name_locale params thy cs =
haftmann@24218
   598
      let
haftmann@24218
   599
        val consts = supconsts @ (map (fst o fst) params ~~ cs);
haftmann@24218
   600
        fun subst (Free (c, ty)) =
haftmann@24218
   601
              Const ((fst o the o AList.lookup (op =) consts) c, ty)
haftmann@24218
   602
          | subst t = t;
haftmann@24218
   603
        val super_defs = these_defs thy sups;
haftmann@24218
   604
        fun prep_asm ((name, atts), ts) =
haftmann@24218
   605
          ((NameSpace.base name, map (Attrib.attribute thy) atts),
haftmann@24218
   606
            (map o map_aterms) ((*MetaSimplifier.rewrite_term thy super_defs [] o *)subst) ts);
haftmann@24218
   607
      in
haftmann@24218
   608
        Locale.global_asms_of thy name_locale
haftmann@24218
   609
        |> map prep_asm
haftmann@24218
   610
      end;
haftmann@24218
   611
    fun note_intro name_axclass class_intro =
haftmann@24218
   612
      PureThy.note_thmss_qualified "" ((Logic.const_of_class o NameSpace.base) name_axclass)
haftmann@24218
   613
        [(("intro", []), [([class_intro], [])])]
haftmann@24218
   614
      #> snd
haftmann@24218
   615
  in
haftmann@24218
   616
    thy
haftmann@24218
   617
    |> add_locale (SOME "") bname supexpr ((*elems_constrains @*) elems)
haftmann@24218
   618
    |-> (fn name_locale => ProofContext.theory_result (
haftmann@24218
   619
      `(fn thy => extract_params thy name_locale)
haftmann@24218
   620
      #-> (fn (v, (param_names, params)) =>
haftmann@24218
   621
        axclass_params (bname, supsort) params (extract_assumes name_locale params) other_consts
haftmann@24218
   622
      #-> (fn (name_axclass, ((_, (ax_terms, ax_axioms)), consts)) =>
haftmann@24218
   623
        `(fn thy => class_intro thy name_locale name_axclass sups)
haftmann@24218
   624
      #-> (fn class_intro =>
haftmann@24218
   625
        add_class_data ((name_axclass, sups),
haftmann@24218
   626
          (name_locale, map (fst o fst) params ~~ map fst consts, v,
haftmann@24218
   627
            class_intro))
haftmann@24218
   628
        (*FIXME: class_data should already contain data relevant
haftmann@24218
   629
          for interpretation; use this later for class target*)
haftmann@24218
   630
        (*FIXME: general export_fixes which may be parametrized
haftmann@24218
   631
          with pieces of an emerging class*)
haftmann@24218
   632
      #> note_intro name_axclass class_intro
haftmann@24218
   633
      #> prove_interpretation ((ALLGOALS o ProofContext.fact_tac) ax_axioms)
haftmann@24218
   634
          ((false, Logic.const_of_class bname), []) (Locale.Locale name_locale)
haftmann@24218
   635
          ((mk_instT name_axclass, mk_inst name_axclass param_names (map snd supconsts @ consts)), [])
haftmann@24218
   636
      #> pair name_axclass
haftmann@24218
   637
      )))))
haftmann@24218
   638
  end;
haftmann@24218
   639
haftmann@24218
   640
in
haftmann@24218
   641
haftmann@24218
   642
val class_cmd = gen_class Locale.add_locale Sign.intern_class read_param;
haftmann@24218
   643
val class = gen_class Locale.add_locale_i Sign.certify_class (K I);
haftmann@24218
   644
haftmann@24218
   645
end; (*local*)
haftmann@24218
   646
haftmann@24218
   647
local
haftmann@24218
   648
haftmann@24218
   649
fun instance_subclass (class1, class2) thy  =
haftmann@24218
   650
  let
haftmann@24218
   651
    val interp = interpretation_in_rule thy (class1, class2);
haftmann@24218
   652
    val ax = #axioms (AxClass.get_definition thy class1);
haftmann@24218
   653
    val intro = #intro (AxClass.get_definition thy class2)
haftmann@24218
   654
      |> Drule.instantiate' [SOME (Thm.ctyp_of thy
haftmann@24218
   655
          (TVar ((AxClass.param_tyvarname, 0), [class1])))] [];
haftmann@24218
   656
    val thm = 
haftmann@24218
   657
      intro
haftmann@24218
   658
      |> OF_LAST (interp OF ax)
haftmann@24218
   659
      |> strip_all_ofclass thy (Sign.super_classes thy class2);
haftmann@24218
   660
  in
haftmann@24218
   661
    thy |> AxClass.add_classrel thm
haftmann@24218
   662
  end;
haftmann@24218
   663
haftmann@24218
   664
fun instance_subsort (class, sort) thy =
haftmann@24218
   665
  let
haftmann@24218
   666
    val super_sort = (Graph.all_succs o #classes o Sorts.rep_algebra
haftmann@24218
   667
      o Sign.classes_of) thy sort;
haftmann@24218
   668
    val classes = filter_out (fn class' => Sign.subsort thy ([class], [class']))
haftmann@24218
   669
      (rev super_sort);
haftmann@24218
   670
  in
haftmann@24218
   671
    thy |> fold (curry instance_subclass class) classes
haftmann@24218
   672
  end;
haftmann@24218
   673
haftmann@24218
   674
fun instance_sort' do_proof (class, sort) theory =
haftmann@24218
   675
  let
haftmann@24218
   676
    val loc_name = (#locale o fst o the_class_data theory) class;
haftmann@24218
   677
    val loc_expr =
haftmann@24218
   678
      (Locale.Merge o map (Locale.Locale o #locale o fst o the_class_data theory)) sort;
haftmann@24218
   679
  in
haftmann@24218
   680
    theory
haftmann@24218
   681
    |> do_proof (instance_subsort (class, sort)) (loc_name, loc_expr)
haftmann@24218
   682
  end;
haftmann@24218
   683
haftmann@24218
   684
fun gen_instance_sort prep_class prep_sort (raw_class, raw_sort) theory =
haftmann@24218
   685
  let
haftmann@24218
   686
    val class = prep_class theory raw_class;
haftmann@24218
   687
    val sort = prep_sort theory raw_sort;
haftmann@24218
   688
  in
haftmann@24218
   689
    theory
haftmann@24218
   690
    |> instance_sort' (Locale.interpretation_in_locale o ProofContext.theory) (class, sort)
haftmann@24218
   691
  end;
haftmann@24218
   692
haftmann@24218
   693
fun gen_instance_class prep_class (raw_class, raw_superclass) theory =
haftmann@24218
   694
  let
haftmann@24218
   695
    val class = prep_class theory raw_class;
haftmann@24218
   696
    val superclass = prep_class theory raw_superclass;
haftmann@24218
   697
  in
haftmann@24218
   698
    theory
haftmann@24218
   699
    |> axclass_instance_sort (class, superclass)
haftmann@24218
   700
  end;
haftmann@24218
   701
haftmann@24218
   702
in
haftmann@24218
   703
wenzelm@24276
   704
val instance_sort_cmd = gen_instance_sort Sign.read_class Syntax.global_read_sort;
haftmann@24218
   705
val instance_sort = gen_instance_sort Sign.certify_class Sign.certify_sort;
haftmann@24218
   706
val prove_instance_sort = instance_sort' o prove_interpretation_in;
haftmann@24218
   707
val instance_class_cmd = gen_instance_class Sign.read_class;
haftmann@24218
   708
val instance_class = gen_instance_class Sign.certify_class;
haftmann@24218
   709
haftmann@24218
   710
end; (*local*)
haftmann@24218
   711
haftmann@24218
   712
haftmann@24218
   713
(** class target **)
haftmann@24218
   714
haftmann@24218
   715
fun export_fixes thy class =
haftmann@24218
   716
  let
haftmann@24218
   717
    val v = (#v o fst o the_class_data thy) class;
haftmann@24218
   718
    val constrain_sort = curry (Sorts.inter_sort (Sign.classes_of thy)) [class];
haftmann@24218
   719
    val subst_typ = Term.map_type_tfree (fn var as (w, sort) =>
haftmann@24218
   720
      if SOME w = v then TFree (w, constrain_sort sort) else TFree var);
haftmann@24218
   721
    val consts = param_map thy [class];
haftmann@24218
   722
    fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) consts v
haftmann@24218
   723
         of SOME (c, _) => Const (c, ty)
haftmann@24218
   724
          | NONE => t)
haftmann@24218
   725
      | subst_aterm t = t;
haftmann@24218
   726
  in map_types subst_typ #> Term.map_aterms subst_aterm end;
haftmann@24218
   727
haftmann@24218
   728
fun add_const_in_class class ((c, rhs), syn) thy =
haftmann@24218
   729
  let
haftmann@24218
   730
    val prfx = (Logic.const_of_class o NameSpace.base) class;
haftmann@24218
   731
    fun mk_name inject c =
haftmann@24218
   732
      let
haftmann@24218
   733
        val n1 = Sign.full_name thy c;
haftmann@24218
   734
        val n2 = NameSpace.qualifier n1;
haftmann@24218
   735
        val n3 = NameSpace.base n1;
haftmann@24218
   736
      in NameSpace.implode (n2 :: inject @ [n3]) end;
haftmann@24218
   737
    val abbr' = mk_name [prfx, prfx] c;
haftmann@24218
   738
    val rhs' = export_fixes thy class rhs;
haftmann@24218
   739
    val ty' = Term.fastype_of rhs';
haftmann@24218
   740
    val def = (c, Logic.mk_equals (Const (mk_name [prfx] c, ty'), rhs'));
haftmann@24218
   741
    val (syn', _) = fork_mixfix true NONE syn;
haftmann@24218
   742
    fun interpret def =
haftmann@24218
   743
      let
haftmann@24218
   744
        val def' = symmetric def
haftmann@24218
   745
        val tac = (ALLGOALS o ProofContext.fact_tac) [def'];
haftmann@24218
   746
        val name_locale = (#locale o fst o the_class_data thy) class;
haftmann@24218
   747
        val def_eq = Thm.prop_of def';
haftmann@24218
   748
        val (params, consts) = split_list (param_map thy [class]);
haftmann@24218
   749
      in
haftmann@24218
   750
        prove_interpretation tac ((false, prfx), []) (Locale.Locale name_locale)
haftmann@24218
   751
          ((mk_instT class, mk_inst class params consts), [def_eq])
haftmann@24218
   752
        #> add_class_const_thm (class, def')
haftmann@24218
   753
      end;
haftmann@24218
   754
  in
haftmann@24218
   755
    thy
haftmann@24218
   756
    |> Sign.hide_consts_i true [abbr']
haftmann@24218
   757
    |> Sign.add_path prfx
haftmann@24218
   758
    |> Sign.add_consts_authentic [(c, ty', syn')]
haftmann@24218
   759
    |> Sign.parent_path
haftmann@24218
   760
    |> Sign.sticky_prefix prfx
haftmann@24218
   761
    |> PureThy.add_defs_i false [(def, [])]
haftmann@24218
   762
    |-> (fn [def] => interpret def)
haftmann@24218
   763
    |> Sign.restore_naming thy
haftmann@24218
   764
  end;
haftmann@24218
   765
haftmann@24218
   766
end;