src/Pure/Isar/class.ML
author haftmann
Mon Oct 15 15:29:43 2007 +0200 (2007-10-15)
changeset 25038 522abf8a5f87
parent 25024 0615bb9955dd
child 25060 17c313217998
permissions -rw-r--r--
canonical interpretation interface
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
wenzelm@25010
    10
  val fork_mixfix: bool -> bool -> mixfix -> mixfix * mixfix
haftmann@24218
    11
haftmann@24218
    12
  val axclass_cmd: bstring * xstring list
haftmann@24589
    13
    -> ((bstring * Attrib.src list) * string list) list
haftmann@24589
    14
    -> theory -> class * theory
haftmann@24589
    15
  val classrel_cmd: xstring * xstring -> theory -> Proof.state
haftmann@24914
    16
haftmann@25002
    17
  val class: bstring -> class list -> Element.context_i Locale.element list
haftmann@24218
    18
    -> string list -> theory -> string * Proof.context
haftmann@25002
    19
  val class_cmd: bstring -> xstring list -> Element.context Locale.element list
haftmann@24589
    20
    -> xstring list -> theory -> string * Proof.context
haftmann@24914
    21
  val init: class -> Proof.context -> Proof.context;
haftmann@25038
    22
  val add_const_in_class: string -> (string * mixfix) * (string * term)
haftmann@25038
    23
    -> theory -> string * theory
haftmann@25038
    24
  val add_abbrev_in_class: string -> Syntax.mode -> (string * mixfix) * (string * term)
haftmann@25038
    25
    -> theory -> string * theory
haftmann@25002
    26
  val remove_constraint: class -> string -> Proof.context -> Proof.context
haftmann@25038
    27
  val is_class: theory -> class -> bool
haftmann@25002
    28
  val these_params: theory -> sort -> (string * (string * typ)) list
haftmann@24589
    29
  val intro_classes_tac: thm list -> tactic
haftmann@24589
    30
  val default_intro_classes_tac: thm list -> tactic
haftmann@24589
    31
  val print_classes: theory -> unit
haftmann@25002
    32
  val uncheck: bool ref
haftmann@24423
    33
haftmann@24589
    34
  val instance_arity: (theory -> theory) -> arity list -> theory -> Proof.state
haftmann@24589
    35
  val instance: arity list -> ((bstring * Attrib.src list) * term) list
haftmann@24423
    36
    -> (thm list -> theory -> theory)
haftmann@24218
    37
    -> theory -> Proof.state
haftmann@24589
    38
  val instance_cmd: (bstring * xstring list * xstring) list
haftmann@24589
    39
    -> ((bstring * Attrib.src list) * xstring) list
haftmann@24423
    40
    -> (thm list -> theory -> theory)
haftmann@24218
    41
    -> theory -> Proof.state
haftmann@24589
    42
  val prove_instance: tactic -> arity list
haftmann@24218
    43
    -> ((bstring * Attrib.src list) * term) list
haftmann@24423
    44
    -> theory -> thm list * theory
haftmann@24423
    45
  val unoverload: theory -> conv
haftmann@24423
    46
  val overload: theory -> conv
haftmann@24423
    47
  val unoverload_const: theory -> string * typ -> string
haftmann@24423
    48
  val inst_const: theory -> string * string -> string
haftmann@24423
    49
  val param_const: theory -> string -> (string * string) option
haftmann@24218
    50
end;
haftmann@24218
    51
haftmann@24218
    52
structure Class : CLASS =
haftmann@24218
    53
struct
haftmann@24218
    54
haftmann@24218
    55
(** auxiliary **)
haftmann@24218
    56
wenzelm@25010
    57
fun fork_mixfix is_locale is_class mx =
haftmann@24218
    58
  let
haftmann@24218
    59
    val mx' = Syntax.unlocalize_mixfix mx;
wenzelm@25010
    60
    val mx_global = if not is_locale orelse (is_class andalso not (mx = mx'))
haftmann@24901
    61
      then mx' else NoSyn;
wenzelm@25010
    62
    val mx_local = if is_locale then mx else NoSyn;
haftmann@24218
    63
  in (mx_global, mx_local) end;
haftmann@24218
    64
haftmann@25002
    65
fun prove_interpretation tac prfx_atts expr inst =
haftmann@25002
    66
  Locale.interpretation_i I prfx_atts expr inst
haftmann@24589
    67
  #> Proof.global_terminal_proof
haftmann@24589
    68
      (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@24589
    69
  #> ProofContext.theory_of;
haftmann@24589
    70
wenzelm@25020
    71
fun OF_LAST thm1 thm2 = thm1 RSN (Thm.nprems_of thm2, thm2);
haftmann@24589
    72
haftmann@24589
    73
fun strip_all_ofclass thy sort =
haftmann@24589
    74
  let
wenzelm@24847
    75
    val typ = TVar ((Name.aT, 0), sort);
haftmann@24589
    76
    fun prem_inclass t =
haftmann@24589
    77
      case Logic.strip_imp_prems t
haftmann@24589
    78
       of ofcls :: _ => try Logic.dest_inclass ofcls
haftmann@24589
    79
        | [] => NONE;
haftmann@24589
    80
    fun strip_ofclass class thm =
haftmann@24589
    81
      thm OF (fst o AxClass.of_sort thy (typ, [class])) AxClass.cache;
haftmann@24589
    82
    fun strip thm = case (prem_inclass o Thm.prop_of) thm
haftmann@24589
    83
     of SOME (_, class) => thm |> strip_ofclass class |> strip
haftmann@24589
    84
      | NONE => thm;
haftmann@24589
    85
  in strip end;
haftmann@24589
    86
haftmann@25038
    87
fun get_remove_global_constraint c thy =
haftmann@25038
    88
  let
haftmann@25038
    89
    val ty = Sign.the_const_constraint thy c;
haftmann@25038
    90
  in
haftmann@25038
    91
    thy
haftmann@25038
    92
    |> Sign.add_const_constraint (c, NONE)
haftmann@25038
    93
    |> pair (c, Logic.unvarifyT ty)
haftmann@25038
    94
  end;
haftmann@25038
    95
haftmann@24589
    96
haftmann@24589
    97
(** axclass command **)
haftmann@24589
    98
haftmann@24218
    99
fun axclass_cmd (class, raw_superclasses) raw_specs thy =
haftmann@24218
   100
  let
haftmann@24218
   101
    val ctxt = ProofContext.init thy;
haftmann@24218
   102
    val superclasses = map (Sign.read_class thy) raw_superclasses;
haftmann@24589
   103
    val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst)
haftmann@24589
   104
      raw_specs;
haftmann@24589
   105
    val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd)
haftmann@24589
   106
          raw_specs)
haftmann@24218
   107
      |> snd
haftmann@24218
   108
      |> (map o map) fst;
haftmann@24589
   109
  in
haftmann@24589
   110
    AxClass.define_class (class, superclasses) []
haftmann@24589
   111
      (name_atts ~~ axiomss) thy
haftmann@24589
   112
  end;
haftmann@24218
   113
haftmann@24218
   114
local
haftmann@24218
   115
haftmann@24218
   116
fun gen_instance mk_prop add_thm after_qed insts thy =
haftmann@24218
   117
  let
haftmann@24218
   118
    fun after_qed' results =
haftmann@24218
   119
      ProofContext.theory ((fold o fold) add_thm results #> after_qed);
haftmann@24218
   120
  in
haftmann@24218
   121
    thy
haftmann@24218
   122
    |> ProofContext.init
haftmann@24589
   123
    |> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])])
haftmann@24589
   124
        o maps (mk_prop thy)) insts)
haftmann@24218
   125
  end;
haftmann@24218
   126
haftmann@24218
   127
in
haftmann@24218
   128
haftmann@24589
   129
val instance_arity =
haftmann@24218
   130
  gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity;
haftmann@24589
   131
val classrel =
haftmann@24218
   132
  gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel))
haftmann@24218
   133
    AxClass.add_classrel I o single;
haftmann@24589
   134
val classrel_cmd =
haftmann@24589
   135
  gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel))
haftmann@24589
   136
    AxClass.add_classrel I o single;
haftmann@24218
   137
haftmann@24218
   138
end; (*local*)
haftmann@24218
   139
haftmann@24218
   140
haftmann@24589
   141
(** explicit constants for overloaded definitions **)
haftmann@24304
   142
haftmann@24304
   143
structure InstData = TheoryDataFun
haftmann@24304
   144
(
haftmann@24423
   145
  type T = (string * thm) Symtab.table Symtab.table * (string * string) Symtab.table;
haftmann@24423
   146
    (*constant name ~> type constructor ~> (constant name, equation),
haftmann@24423
   147
        constant name ~> (constant name, type constructor)*)
haftmann@24423
   148
  val empty = (Symtab.empty, Symtab.empty);
haftmann@24304
   149
  val copy = I;
haftmann@24304
   150
  val extend = I;
haftmann@24423
   151
  fun merge _ ((taba1, tabb1), (taba2, tabb2)) =
haftmann@24423
   152
    (Symtab.join (K (Symtab.merge (K true))) (taba1, taba2),
haftmann@24423
   153
      Symtab.merge (K true) (tabb1, tabb2));
haftmann@24304
   154
);
haftmann@24304
   155
wenzelm@25020
   156
fun inst_thms thy = (Symtab.fold (Symtab.fold (cons o snd o snd) o snd) o fst)
haftmann@24589
   157
    (InstData.get thy) [];
haftmann@24589
   158
fun add_inst (c, tyco) inst = (InstData.map o apfst
haftmann@24589
   159
      o Symtab.map_default (c, Symtab.empty)) (Symtab.update_new (tyco, inst))
haftmann@24423
   160
  #> (InstData.map o apsnd) (Symtab.update_new (fst inst, (c, tyco)));
haftmann@24304
   161
wenzelm@25020
   162
fun unoverload thy = MetaSimplifier.rewrite true (inst_thms thy);
wenzelm@25020
   163
fun overload thy = MetaSimplifier.rewrite true (map Thm.symmetric (inst_thms thy));
haftmann@24304
   164
haftmann@24304
   165
fun inst_const thy (c, tyco) =
haftmann@24423
   166
  (fst o the o Symtab.lookup ((the o Symtab.lookup (fst (InstData.get thy))) c)) tyco;
haftmann@24423
   167
fun unoverload_const thy (c_ty as (c, _)) =
haftmann@24423
   168
  case AxClass.class_of_param thy c
haftmann@24423
   169
   of SOME class => (case Sign.const_typargs thy c_ty
haftmann@24589
   170
       of [Type (tyco, _)] => (case Symtab.lookup
haftmann@24589
   171
           ((the o Symtab.lookup (fst (InstData.get thy))) c) tyco
haftmann@24423
   172
             of SOME (c, _) => c
haftmann@24423
   173
              | NONE => c)
haftmann@24423
   174
        | [_] => c)
haftmann@24423
   175
    | NONE => c;
haftmann@24423
   176
haftmann@24423
   177
val param_const = Symtab.lookup o snd o InstData.get;
haftmann@24304
   178
haftmann@24304
   179
fun add_inst_def (class, tyco) (c, ty) thy =
haftmann@24304
   180
  let
wenzelm@25024
   181
    val tyco_base = Sign.base_name tyco;
wenzelm@25024
   182
    val name_inst = Sign.base_name class ^ "_" ^ tyco_base ^ "_inst";
wenzelm@25024
   183
    val c_inst_base = Sign.base_name c ^ "_" ^ tyco_base;
haftmann@24304
   184
  in
haftmann@24304
   185
    thy
haftmann@24304
   186
    |> Sign.sticky_prefix name_inst
wenzelm@25020
   187
    |> Sign.declare_const [] (c_inst_base, ty, NoSyn)
wenzelm@24968
   188
    |-> (fn const as Const (c_inst, _) =>
wenzelm@24968
   189
      PureThy.add_defs_i false
wenzelm@24968
   190
        [((Thm.def_name c_inst_base, Logic.mk_equals (const, Const (c, ty))), [])]
wenzelm@24968
   191
      #-> (fn [thm] => add_inst (c, tyco) (c_inst, Thm.symmetric thm)))
haftmann@24435
   192
    |> Sign.restore_naming thy
haftmann@24304
   193
  end;
haftmann@24304
   194
haftmann@24304
   195
fun add_inst_def' (class, tyco) (c, ty) thy =
haftmann@24423
   196
  if case Symtab.lookup (fst (InstData.get thy)) c
haftmann@24304
   197
   of NONE => true
haftmann@24304
   198
    | SOME tab => is_none (Symtab.lookup tab tyco)
haftmann@24304
   199
  then add_inst_def (class, tyco) (c, Logic.unvarifyT ty) thy
haftmann@24304
   200
  else thy;
haftmann@24304
   201
haftmann@24304
   202
fun add_def ((class, tyco), ((name, prop), atts)) thy =
haftmann@24304
   203
  let
haftmann@24589
   204
    val ((lhs as Const (c, ty), args), rhs) =
haftmann@24589
   205
      (apfst Term.strip_comb o Logic.dest_equals) prop;
haftmann@24701
   206
    fun (*add_inst' def ([], (Const (c_inst, ty))) =
haftmann@24423
   207
          if forall (fn TFree _ => true | _ => false) (Sign.const_typargs thy (c_inst, ty))
haftmann@24304
   208
          then add_inst (c, tyco) (c_inst, def)
haftmann@24304
   209
          else add_inst_def (class, tyco) (c, ty)
haftmann@24701
   210
      |*) add_inst' _ t = add_inst_def (class, tyco) (c, ty);
haftmann@24304
   211
  in
haftmann@24304
   212
    thy
wenzelm@25020
   213
    |> PureThy.add_defs_i true [((name, prop), map (Attrib.attribute_i thy) atts)]
haftmann@24304
   214
    |-> (fn [def] => add_inst' def (args, rhs) #> pair def)
haftmann@24304
   215
  end;
haftmann@24304
   216
haftmann@24304
   217
haftmann@24589
   218
(** instances with implicit parameter handling **)
haftmann@24218
   219
haftmann@24218
   220
local
haftmann@24218
   221
wenzelm@24707
   222
fun gen_read_def thy prep_att parse_prop ((raw_name, raw_atts), raw_t) =
haftmann@24218
   223
  let
wenzelm@24707
   224
    val ctxt = ProofContext.init thy;
wenzelm@24707
   225
    val t = parse_prop ctxt raw_t |> Syntax.check_prop ctxt;
wenzelm@24981
   226
    val ((c, ty), _) = Sign.cert_def ctxt t;
haftmann@24218
   227
    val atts = map (prep_att thy) raw_atts;
haftmann@24218
   228
    val insts = Consts.typargs (Sign.consts_of thy) (c, ty);
haftmann@24218
   229
    val name = case raw_name
haftmann@24218
   230
     of "" => NONE
haftmann@24218
   231
      | _ => SOME raw_name;
haftmann@24218
   232
  in (c, (insts, ((name, t), atts))) end;
haftmann@24218
   233
wenzelm@24707
   234
fun read_def_cmd thy = gen_read_def thy Attrib.intern_src Syntax.parse_prop;
haftmann@24218
   235
fun read_def thy = gen_read_def thy (K I) (K I);
haftmann@24218
   236
haftmann@24589
   237
fun gen_instance prep_arity read_def do_proof raw_arities raw_defs after_qed theory =
haftmann@24218
   238
  let
haftmann@24218
   239
    val arities = map (prep_arity theory) raw_arities;
wenzelm@25020
   240
    val _ = if null arities then error "At least one arity must be given" else ();
haftmann@24218
   241
    val _ = case (duplicates (op =) o map #1) arities
haftmann@24218
   242
     of [] => ()
wenzelm@25020
   243
      | dupl_tycos => error ("Type constructors occur more than once in arities: "
wenzelm@25020
   244
          ^ commas_quote dupl_tycos);
haftmann@24218
   245
    fun get_consts_class tyco ty class =
haftmann@24218
   246
      let
wenzelm@24968
   247
        val cs = (these o try (#params o AxClass.get_info theory)) class;
haftmann@24218
   248
        val subst_ty = map_type_tfree (K ty);
haftmann@24218
   249
      in
haftmann@24304
   250
        map (fn (c, ty) => (c, ((class, tyco), subst_ty ty))) cs
haftmann@24218
   251
      end;
haftmann@24218
   252
    fun get_consts_sort (tyco, asorts, sort) =
haftmann@24218
   253
      let
haftmann@24589
   254
        val ty = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort))
wenzelm@24847
   255
          (Name.names Name.context Name.aT asorts))
wenzelm@24731
   256
      in maps (get_consts_class tyco ty) (Sign.complete_sort theory sort) end;
haftmann@24218
   257
    val cs = maps get_consts_sort arities;
haftmann@24218
   258
    fun mk_typnorm thy (ty, ty_sc) =
haftmann@24218
   259
      case try (Sign.typ_match thy (Logic.varifyT ty_sc, ty)) Vartab.empty
haftmann@24218
   260
       of SOME env => SOME (Logic.varifyT #> Envir.typ_subst_TVars env #> Logic.unvarifyT)
haftmann@24218
   261
        | NONE => NONE;
haftmann@24218
   262
    fun read_defs defs cs thy_read =
haftmann@24218
   263
      let
haftmann@24218
   264
        fun read raw_def cs =
haftmann@24218
   265
          let
haftmann@24218
   266
            val (c, (inst, ((name_opt, t), atts))) = read_def thy_read raw_def;
haftmann@24218
   267
            val ty = Consts.instance (Sign.consts_of thy_read) (c, inst);
haftmann@24304
   268
            val ((class, tyco), ty') = case AList.lookup (op =) cs c
wenzelm@25020
   269
             of NONE => error ("Illegal definition for constant " ^ quote c)
haftmann@24218
   270
              | SOME class_ty => class_ty;
haftmann@24218
   271
            val name = case name_opt
haftmann@24218
   272
             of NONE => Thm.def_name (Logic.name_arity (tyco, [], c))
haftmann@24218
   273
              | SOME name => name;
haftmann@24218
   274
            val t' = case mk_typnorm thy_read (ty', ty)
wenzelm@25020
   275
             of NONE => error ("Illegal definition for constant " ^
haftmann@24218
   276
                  quote (c ^ "::" ^ setmp show_sorts true
haftmann@24218
   277
                    (Sign.string_of_typ thy_read) ty))
haftmann@24218
   278
              | SOME norm => map_types norm t
haftmann@24218
   279
          in (((class, tyco), ((name, t'), atts)), AList.delete (op =) c cs) end;
haftmann@24218
   280
      in fold_map read defs cs end;
haftmann@24304
   281
    val (defs, other_cs) = read_defs raw_defs cs
haftmann@24218
   282
      (fold Sign.primitive_arity arities (Theory.copy theory));
haftmann@24423
   283
    fun after_qed' cs defs =
wenzelm@24766
   284
      fold Sign.add_const_constraint (map (apsnd SOME) cs)
haftmann@24423
   285
      #> after_qed defs;
haftmann@24218
   286
  in
haftmann@24218
   287
    theory
haftmann@25038
   288
    |> fold_map get_remove_global_constraint (map fst cs |> distinct (op =))
haftmann@24304
   289
    ||>> fold_map add_def defs
haftmann@24304
   290
    ||> fold (fn (c, ((class, tyco), ty)) => add_inst_def' (class, tyco) (c, ty)) other_cs
haftmann@24423
   291
    |-> (fn (cs, defs) => do_proof (after_qed' cs defs) arities defs)
haftmann@24218
   292
  end;
haftmann@24218
   293
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@24589
   301
val instance = gen_instance Sign.cert_arity read_def
haftmann@24589
   302
  (fn f => fn arities => fn defs => instance_arity f arities);
haftmann@24589
   303
val instance_cmd = gen_instance Sign.read_arity read_def_cmd
haftmann@24589
   304
  (fn f => fn arities => fn defs => instance_arity f arities);
haftmann@24589
   305
fun prove_instance tac arities defs =
haftmann@24589
   306
  gen_instance Sign.cert_arity read_def
haftmann@24589
   307
    (tactic_proof tac) arities defs (K I);
haftmann@24218
   308
haftmann@24218
   309
end; (*local*)
haftmann@24218
   310
haftmann@24218
   311
haftmann@24218
   312
haftmann@24589
   313
(** class data **)
haftmann@24218
   314
haftmann@24218
   315
datatype class_data = ClassData of {
haftmann@24218
   316
  consts: (string * string) list
haftmann@24836
   317
    (*locale parameter ~> constant name*),
haftmann@24748
   318
  local_sort: sort,
haftmann@25038
   319
  inst: (typ option list * term option list) * term Symtab.table
haftmann@25038
   320
    (*canonical interpretation FIXME*),
haftmann@24657
   321
  intro: thm,
haftmann@24657
   322
  defs: thm list,
haftmann@25002
   323
  operations: (string * (term * (typ * int))) list
haftmann@25002
   324
    (*constant name ~> (locale term, (constant constraint, instantiaton index of class typ))*),
haftmann@25002
   325
  operations_rev: (string * string) list
haftmann@25002
   326
    (*locale operation ~> constant name*)
haftmann@24657
   327
};
haftmann@24218
   328
haftmann@24657
   329
fun rep_class_data (ClassData d) = d;
haftmann@25038
   330
fun mk_class_data ((consts, local_sort, inst, intro),
haftmann@25002
   331
    (defs, operations, operations_rev)) =
haftmann@25038
   332
  ClassData { consts = consts, local_sort = local_sort, inst = inst,
haftmann@25002
   333
    intro = intro, defs = defs, operations = operations,
haftmann@25002
   334
    operations_rev = operations_rev };
haftmann@25038
   335
fun map_class_data f (ClassData { consts, local_sort, inst, intro,
haftmann@25002
   336
    defs, operations, operations_rev }) =
haftmann@25038
   337
  mk_class_data (f ((consts, local_sort, inst, intro),
haftmann@25002
   338
    (defs, operations, operations_rev)));
haftmann@25038
   339
fun merge_class_data _ (ClassData { consts = consts,
haftmann@25002
   340
    local_sort = local_sort, inst = inst, intro = intro,
haftmann@25002
   341
    defs = defs1, operations = operations1, operations_rev = operations_rev1 },
haftmann@25038
   342
  ClassData { consts = _, local_sort = _, inst = _, intro = _,
haftmann@25002
   343
    defs = defs2, operations = operations2, operations_rev = operations_rev2 }) =
haftmann@25038
   344
  mk_class_data ((consts, local_sort, inst, intro),
haftmann@24914
   345
    (Thm.merge_thms (defs1, defs2),
haftmann@25002
   346
      AList.merge (op =) (K true) (operations1, operations2),
haftmann@25002
   347
      AList.merge (op =) (K true) (operations_rev1, operations_rev2)));
haftmann@24218
   348
haftmann@24218
   349
structure ClassData = TheoryDataFun
haftmann@24218
   350
(
haftmann@25038
   351
  type T = class_data Graph.T
haftmann@25038
   352
  val empty = Graph.empty;
haftmann@24218
   353
  val copy = I;
haftmann@24218
   354
  val extend = I;
haftmann@25038
   355
  fun merge _ = Graph.join merge_class_data;
haftmann@24218
   356
);
haftmann@24218
   357
haftmann@24218
   358
haftmann@24218
   359
(* queries *)
haftmann@24218
   360
haftmann@25038
   361
val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node o ClassData.get;
haftmann@24218
   362
haftmann@24589
   363
fun the_class_data thy class = case lookup_class_data thy class
wenzelm@25020
   364
 of NONE => error ("Undeclared class " ^ quote class)
haftmann@24589
   365
  | SOME data => data;
haftmann@24218
   366
haftmann@25038
   367
val is_class = is_some oo lookup_class_data;
haftmann@25038
   368
haftmann@25038
   369
val ancestry = Graph.all_succs o ClassData.get;
haftmann@24218
   370
haftmann@25002
   371
fun these_params thy =
haftmann@24218
   372
  let
haftmann@24218
   373
    fun params class =
haftmann@24218
   374
      let
wenzelm@24930
   375
        val const_typs = (#params o AxClass.get_info thy) class;
haftmann@24657
   376
        val const_names = (#consts o the_class_data thy) class;
haftmann@24218
   377
      in
haftmann@24218
   378
        (map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names
haftmann@24218
   379
      end;
haftmann@24218
   380
  in maps params o ancestry thy end;
haftmann@24218
   381
haftmann@24657
   382
fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy;
haftmann@24218
   383
haftmann@24218
   384
fun these_intros thy =
haftmann@24657
   385
  Graph.fold (fn (_, (data, _)) => insert Thm.eq_thm ((#intro o rep_class_data) data))
haftmann@25038
   386
    (ClassData.get thy) [];
haftmann@24218
   387
haftmann@24836
   388
fun these_operations thy =
haftmann@24836
   389
  maps (#operations o the_class_data thy) o ancestry thy;
haftmann@24657
   390
haftmann@25002
   391
fun these_operations_rev thy =
haftmann@25002
   392
  maps (#operations_rev o the_class_data thy) o ancestry thy;
haftmann@24914
   393
haftmann@25002
   394
fun local_operation thy = AList.lookup (op =) o these_operations thy;
haftmann@25002
   395
haftmann@25002
   396
fun global_operation thy = AList.lookup (op =) o these_operations_rev thy;
haftmann@24657
   397
haftmann@24901
   398
fun sups_local_sort thy sort =
haftmann@24901
   399
  let
haftmann@24901
   400
    val sups = filter (is_some o lookup_class_data thy) sort
haftmann@24901
   401
      |> Sign.minimize_sort thy;
haftmann@24901
   402
    val local_sort = case sups
haftmann@24901
   403
     of sup :: _ => #local_sort (the_class_data thy sup)
haftmann@24901
   404
      | [] => sort;
haftmann@24901
   405
  in (sups, local_sort) end;
haftmann@24901
   406
haftmann@24218
   407
fun print_classes thy =
haftmann@24218
   408
  let
wenzelm@24920
   409
    val ctxt = ProofContext.init thy;
wenzelm@24920
   410
haftmann@24218
   411
    val algebra = Sign.classes_of thy;
haftmann@24218
   412
    val arities =
haftmann@24218
   413
      Symtab.empty
haftmann@24218
   414
      |> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) =>
haftmann@24218
   415
           Symtab.map_default (class, []) (insert (op =) tyco)) arities)
haftmann@24218
   416
             ((#arities o Sorts.rep_algebra) algebra);
haftmann@24218
   417
    val the_arities = these o Symtab.lookup arities;
haftmann@24218
   418
    fun mk_arity class tyco =
haftmann@24218
   419
      let
haftmann@24218
   420
        val Ss = Sorts.mg_domain algebra tyco [class];
wenzelm@24920
   421
      in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end;
haftmann@24218
   422
    fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: "
wenzelm@24920
   423
      ^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty);
haftmann@24218
   424
    fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [
haftmann@24218
   425
      (SOME o Pretty.str) ("class " ^ class ^ ":"),
haftmann@24218
   426
      (SOME o Pretty.block) [Pretty.str "supersort: ",
wenzelm@24920
   427
        (Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class],
haftmann@25038
   428
      if is_class thy class then (SOME o Pretty.str) ("locale: " ^ class) else NONE,
haftmann@24218
   429
      ((fn [] => NONE | ps => (SOME o Pretty.block o Pretty.fbreaks) (Pretty.str "parameters:" :: ps)) o map mk_param
wenzelm@24930
   430
        o these o Option.map #params o try (AxClass.get_info thy)) class,
haftmann@24218
   431
      (SOME o Pretty.block o Pretty.breaks) [
haftmann@24218
   432
        Pretty.str "instances:",
haftmann@24218
   433
        Pretty.list "" "" (map (mk_arity class) (the_arities class))
haftmann@24218
   434
      ]
haftmann@24218
   435
    ]
haftmann@24218
   436
  in
haftmann@24589
   437
    (Pretty.writeln o Pretty.chunks o separate (Pretty.str "")
haftmann@24589
   438
      o map mk_entry o Sorts.all_classes) algebra
haftmann@24218
   439
  end;
haftmann@24218
   440
haftmann@24218
   441
haftmann@24218
   442
(* updaters *)
haftmann@24218
   443
haftmann@25038
   444
fun add_class_data ((class, superclasses), (cs, local_sort, inst, intro)) thy =
haftmann@25002
   445
  let
haftmann@25038
   446
    (*FIXME*)
haftmann@25038
   447
    val is_empty = null (fold (fn ((_, ty), _) => fold_atyps cons ty) cs [])
haftmann@25038
   448
      andalso null ((fold o fold_types o fold_atyps) cons
haftmann@25038
   449
        (maps snd (Locale.global_asms_of thy class)) []);
haftmann@25038
   450
    (*FIXME*)
haftmann@25038
   451
    val inst_params = map
haftmann@25038
   452
      (SOME o the o Symtab.lookup inst o fst o fst)
haftmann@25038
   453
        (Locale.parameters_of_expr thy (Locale.Locale class));
haftmann@25038
   454
    val instT = if is_empty then [] else [SOME (TFree (Name.aT, [class]))];
haftmann@25038
   455
    val inst' = ((instT, inst_params), inst);
haftmann@25002
   456
    val operations = map (fn (v_ty, (c, ty)) => (c, (Free v_ty, (ty, 0)))) cs;
haftmann@25002
   457
    val cs = (map o pairself) fst cs;
haftmann@25038
   458
    val add_class = Graph.new_node (class,
haftmann@25038
   459
        mk_class_data ((cs, local_sort, inst', intro), ([], operations, [])))
haftmann@25002
   460
      #> fold (curry Graph.add_edge class) superclasses;
haftmann@25002
   461
  in
haftmann@25038
   462
    ClassData.map add_class thy
haftmann@25002
   463
  end;
haftmann@24218
   464
haftmann@25002
   465
fun register_operation class (entry, some_def) =
haftmann@25038
   466
  (ClassData.map o Graph.map_node class o map_class_data o apsnd)
haftmann@25002
   467
    (fn (defs, operations, operations_rev) =>
haftmann@25002
   468
      (case some_def of NONE => defs | SOME def => def :: defs,
haftmann@25002
   469
        entry :: operations, (*FIXME*)operations_rev));
haftmann@24218
   470
haftmann@24589
   471
haftmann@24589
   472
(** rule calculation, tactics and methods **)
haftmann@24589
   473
wenzelm@25024
   474
val class_prefix = Logic.const_of_class o Sign.base_name;
wenzelm@25024
   475
haftmann@25038
   476
fun class_intro thy class sups =
haftmann@24589
   477
  let
haftmann@24589
   478
    fun class_elim class =
wenzelm@25020
   479
      case (#axioms o AxClass.get_info thy) class
wenzelm@25020
   480
       of [thm] => SOME (Drule.unconstrainTs thm)
haftmann@24589
   481
        | [] => NONE;
haftmann@25038
   482
    val pred_intro = case Locale.intros thy class
haftmann@24589
   483
     of ([ax_intro], [intro]) => intro |> OF_LAST ax_intro |> SOME
haftmann@24589
   484
      | ([intro], []) => SOME intro
haftmann@24589
   485
      | ([], [intro]) => SOME intro
haftmann@24589
   486
      | _ => NONE;
haftmann@24589
   487
    val pred_intro' = pred_intro
haftmann@24589
   488
      |> Option.map (fn intro => intro OF map_filter class_elim sups);
wenzelm@24930
   489
    val class_intro = (#intro o AxClass.get_info thy) class;
haftmann@24589
   490
    val raw_intro = case pred_intro'
haftmann@24589
   491
     of SOME pred_intro => class_intro |> OF_LAST pred_intro
haftmann@24589
   492
      | NONE => class_intro;
haftmann@24589
   493
    val sort = Sign.super_classes thy class;
wenzelm@24847
   494
    val typ = TVar ((Name.aT, 0), sort);
haftmann@24589
   495
    val defs = these_defs thy sups;
haftmann@24589
   496
  in
haftmann@24589
   497
    raw_intro
haftmann@24589
   498
    |> Drule.instantiate' [SOME (Thm.ctyp_of thy typ)] []
haftmann@24589
   499
    |> strip_all_ofclass thy sort
haftmann@24589
   500
    |> Thm.strip_shyps
haftmann@24589
   501
    |> MetaSimplifier.rewrite_rule defs
haftmann@24589
   502
    |> Drule.unconstrainTs
haftmann@24589
   503
  end;
haftmann@24589
   504
haftmann@24589
   505
fun class_interpretation class facts defs thy =
haftmann@24589
   506
  let
haftmann@25038
   507
    val params = these_params thy [class];
haftmann@25038
   508
    val { inst = ((_, inst), _), ... } = the_class_data thy class;
haftmann@25038
   509
    (*val _ = tracing ("interpreting with " ^ cat_lines (map (setmp show_sorts true makestring)
haftmann@25038
   510
      (map_filter I inst)));*)
wenzelm@25020
   511
    val tac = ALLGOALS (ProofContext.fact_tac facts);
haftmann@25038
   512
    val prfx = class_prefix class;
haftmann@24589
   513
  in
haftmann@25038
   514
    thy
haftmann@25038
   515
    |> fold_map (get_remove_global_constraint o fst o snd) params
haftmann@25038
   516
    ||> prove_interpretation tac ((false, prfx), []) (Locale.Locale class) (inst, defs)
haftmann@25038
   517
    |-> (fn cs => fold (Sign.add_const_constraint o apsnd SOME) cs)
haftmann@24589
   518
  end;
haftmann@24218
   519
haftmann@24218
   520
fun intro_classes_tac facts st =
haftmann@24218
   521
  let
haftmann@24218
   522
    val thy = Thm.theory_of_thm st;
haftmann@24218
   523
    val classes = Sign.all_classes thy;
haftmann@24218
   524
    val class_trivs = map (Thm.class_triv thy) classes;
haftmann@24218
   525
    val class_intros = these_intros thy;
wenzelm@24930
   526
    val axclass_intros = map_filter (try (#intro o AxClass.get_info thy)) classes;
haftmann@24218
   527
  in
wenzelm@24930
   528
    (ALLGOALS (Method.insert_tac facts THEN'
wenzelm@24930
   529
      REPEAT_ALL_NEW (resolve_tac (class_trivs @ class_intros @ axclass_intros)))
wenzelm@24930
   530
    THEN Tactic.distinct_subgoals_tac) st
haftmann@24218
   531
  end;
haftmann@24218
   532
haftmann@24218
   533
fun default_intro_classes_tac [] = intro_classes_tac []
wenzelm@24930
   534
  | default_intro_classes_tac _ = no_tac;
haftmann@24218
   535
haftmann@24218
   536
fun default_tac rules ctxt facts =
haftmann@24218
   537
  HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
haftmann@24218
   538
    default_intro_classes_tac facts;
haftmann@24218
   539
haftmann@24218
   540
val _ = Context.add_setup (Method.add_methods
haftmann@24218
   541
 [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
haftmann@24218
   542
    "back-chain introduction rules of classes"),
haftmann@24218
   543
  ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
haftmann@24218
   544
    "apply some intro/elim rule")]);
haftmann@24218
   545
haftmann@24218
   546
haftmann@24589
   547
(** classes and class target **)
haftmann@24218
   548
haftmann@25002
   549
(* class context syntax *)
haftmann@24748
   550
haftmann@25002
   551
fun internal_remove_constraint local_sort (c, (_, (ty, typidx))) ctxt =
haftmann@24914
   552
  let
haftmann@25002
   553
    val consts = ProofContext.consts_of ctxt;
haftmann@25002
   554
    val typargs = Consts.typargs consts (c, ty);
haftmann@25002
   555
    val typargs' = nth_map typidx (K (TVar ((Name.aT, 0), local_sort))) typargs;
haftmann@25002
   556
    val ty' = Consts.instance consts (c, typargs');
haftmann@25002
   557
  in ProofContext.add_const_constraint (c, SOME ty') ctxt end;
haftmann@25002
   558
haftmann@25002
   559
fun remove_constraint class c ctxt =
haftmann@25002
   560
  let
haftmann@25002
   561
    val thy = ProofContext.theory_of ctxt;
haftmann@25002
   562
    val SOME entry = local_operation thy [class] c;
haftmann@24914
   563
  in
haftmann@25002
   564
    internal_remove_constraint
haftmann@25002
   565
      ((#local_sort o the_class_data thy) class) (c, entry) ctxt
haftmann@24914
   566
  end;
haftmann@24914
   567
haftmann@24914
   568
fun sort_term_check sups local_sort ts ctxt =
haftmann@24748
   569
  let
haftmann@24901
   570
    val thy = ProofContext.theory_of ctxt;
haftmann@24901
   571
    val local_operation = local_operation thy sups;
haftmann@25002
   572
    val constraints = these_operations thy sups |> (map o apsnd) (fst o snd);
haftmann@24901
   573
    val consts = ProofContext.consts_of ctxt;
haftmann@24901
   574
    fun check_typ (c, ty) (t', idx) = case nth (Consts.typargs consts (c, ty)) idx
haftmann@24901
   575
     of TFree (v, _) => if v = Name.aT
haftmann@24901
   576
          then apfst (AList.update (op =) ((c, ty), t')) else I
haftmann@24901
   577
      | TVar (vi, _) => if TypeInfer.is_param vi
haftmann@24901
   578
          then apfst (AList.update (op =) ((c, ty), t'))
haftmann@24901
   579
            #> apsnd (insert (op =) vi) else I
haftmann@24901
   580
      | _ => I;
haftmann@24901
   581
    fun add_const (Const (c, ty)) = (case local_operation c
haftmann@25002
   582
         of SOME (t', (_, idx)) => check_typ (c, ty) (t', idx)
haftmann@24901
   583
          | NONE => I)
haftmann@24901
   584
      | add_const _ = I;
haftmann@24901
   585
    val (cs, typarams) = (fold o fold_aterms) add_const ts ([], []);
haftmann@24901
   586
    val ts' = map (map_aterms
haftmann@24901
   587
        (fn t as Const (c, ty) => the_default t (AList.lookup (op =) cs (c, ty)) | t => t)
haftmann@24901
   588
      #> (map_types o map_type_tvar) (fn var as (vi, _) => if member (op =) typarams vi
haftmann@24901
   589
           then TFree (Name.aT, local_sort) else TVar var)) ts;
haftmann@24901
   590
    val ctxt' = fold (ProofContext.add_const_constraint o apsnd SOME) constraints ctxt;
haftmann@24901
   591
  in (ts', ctxt') end;
haftmann@24748
   592
haftmann@25002
   593
val uncheck = ref false;
haftmann@25002
   594
haftmann@25002
   595
fun sort_term_uncheck sups ts ctxt =
haftmann@25002
   596
  let
haftmann@25002
   597
    val thy = ProofContext.theory_of ctxt;
haftmann@25002
   598
    val global_param = AList.lookup (op =) (these_params thy sups) #> Option.map fst;
haftmann@25002
   599
    val global_operation = global_operation thy sups;
haftmann@25002
   600
    fun globalize (t as Free (v, ty)) = (case global_param v
haftmann@25002
   601
         of SOME c => Const (c, ty)
haftmann@25002
   602
          | NONE => t)
haftmann@25002
   603
      | globalize (t as Const (c, ty)) = (case global_operation c
haftmann@25002
   604
         of SOME c => Const (c, ty)
haftmann@25002
   605
          | NONE => t)
haftmann@25002
   606
      | globalize t = t;
haftmann@25002
   607
    val ts' = if ! uncheck then (map o map_aterms) globalize ts else ts;
haftmann@25002
   608
  in (ts', ctxt) end;
haftmann@25002
   609
haftmann@24914
   610
fun init_class_ctxt sups local_sort ctxt =
haftmann@24914
   611
  let
haftmann@24914
   612
    val operations = these_operations (ProofContext.theory_of ctxt) sups;
haftmann@24914
   613
  in
haftmann@24914
   614
    ctxt
haftmann@24914
   615
    |> Variable.declare_term
haftmann@24914
   616
        (Logic.mk_type (TFree (Name.aT, local_sort)))
haftmann@25002
   617
    |> fold (internal_remove_constraint local_sort) operations
haftmann@24914
   618
    |> Context.proof_map (Syntax.add_term_check 50 "class"
haftmann@25002
   619
        (sort_term_check sups local_sort)
haftmann@25002
   620
        #> Syntax.add_term_uncheck 50 "class"
haftmann@25002
   621
          (sort_term_uncheck sups))
haftmann@24914
   622
  end;
haftmann@24901
   623
haftmann@24901
   624
fun init class ctxt =
haftmann@24914
   625
  init_class_ctxt [class]
haftmann@24914
   626
    ((#local_sort o the_class_data (ProofContext.theory_of ctxt)) class) ctxt;
haftmann@24914
   627
haftmann@24748
   628
haftmann@24589
   629
(* class definition *)
haftmann@24218
   630
haftmann@24218
   631
local
haftmann@24218
   632
haftmann@24748
   633
fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems =
haftmann@24218
   634
  let
haftmann@24748
   635
    val supclasses = map (prep_class thy) raw_supclasses;
haftmann@24901
   636
    val (sups, local_sort) = sups_local_sort thy supclasses;
haftmann@24748
   637
    val supsort = Sign.minimize_sort thy supclasses;
haftmann@25038
   638
    val suplocales = map Locale.Locale sups;
haftmann@24748
   639
    val (raw_elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e)
haftmann@24748
   640
      | Locale.Expr i => apsnd (cons (prep_expr thy i))) raw_includes_elems ([], []);
haftmann@24748
   641
    val supexpr = Locale.Merge suplocales;
haftmann@24748
   642
    val supparams = (map fst o Locale.parameters_of_expr thy) supexpr;
haftmann@25002
   643
    val supconsts = AList.make (the o AList.lookup (op =) (these_params thy sups))
haftmann@24748
   644
      (map fst supparams);
haftmann@24748
   645
    val mergeexpr = Locale.Merge (suplocales @ includes);
haftmann@24748
   646
    val constrain = Element.Constrains ((map o apsnd o map_atyps)
wenzelm@24847
   647
      (fn TFree (_, sort) => TFree (Name.aT, sort)) supparams);
haftmann@24748
   648
  in
haftmann@24748
   649
    ProofContext.init thy
haftmann@24748
   650
    |> Locale.cert_expr supexpr [constrain]
haftmann@24748
   651
    |> snd
haftmann@24914
   652
    |> init_class_ctxt sups local_sort
haftmann@24748
   653
    |> process_expr Locale.empty raw_elems
haftmann@24748
   654
    |> fst
haftmann@24836
   655
    |> (fn elems => ((((sups, supconsts), (supsort, local_sort, mergeexpr)),
haftmann@24748
   656
          (*FIXME*) if null includes then constrain :: elems else elems)))
haftmann@24748
   657
  end;
haftmann@24748
   658
haftmann@24748
   659
val read_class_spec = gen_class_spec Sign.intern_class Locale.intern_expr Locale.read_expr;
haftmann@24748
   660
val check_class_spec = gen_class_spec (K I) (K I) Locale.cert_expr;
haftmann@24748
   661
wenzelm@24968
   662
fun define_class_params (name, raw_superclasses) raw_consts raw_dep_axioms other_consts thy =
wenzelm@24968
   663
  let
wenzelm@24968
   664
    val superclasses = map (Sign.certify_class thy) raw_superclasses;
wenzelm@24968
   665
    val consts = (map o apfst o apsnd) (Sign.certify_typ thy) raw_consts;
wenzelm@24968
   666
    fun add_const ((c, ty), syn) = Sign.declare_const [] (c, ty, syn) #>> Term.dest_Const;
wenzelm@24968
   667
    fun mk_axioms cs thy =
wenzelm@24968
   668
      raw_dep_axioms thy cs
wenzelm@24968
   669
      |> (map o apsnd o map) (Sign.cert_prop thy)
wenzelm@24968
   670
      |> rpair thy;
haftmann@25002
   671
    fun constrain_typs class = (map o apsnd o Term.map_type_tfree)
haftmann@25002
   672
      (fn (v, _) => TFree (v, [class]))
wenzelm@24968
   673
  in
wenzelm@24968
   674
    thy
wenzelm@24968
   675
    |> Sign.add_path (Logic.const_of_class name)
wenzelm@24968
   676
    |> fold_map add_const consts
wenzelm@24968
   677
    ||> Sign.restore_naming thy
wenzelm@24968
   678
    |-> (fn cs => mk_axioms cs
wenzelm@24968
   679
    #-> (fn axioms_prop => AxClass.define_class (name, superclasses)
wenzelm@24968
   680
           (map fst cs @ other_consts) axioms_prop
haftmann@25002
   681
    #-> (fn class => `(fn _ => constrain_typs class cs)
haftmann@25002
   682
    #-> (fn cs' => `(fn thy => AxClass.get_info thy class)
haftmann@25002
   683
    #-> (fn {axioms, ...} => fold (Sign.add_const_constraint o apsnd SOME) cs'
haftmann@25002
   684
    #> pair (class, (cs', axioms)))))))
wenzelm@24968
   685
  end;
wenzelm@24968
   686
haftmann@25002
   687
fun gen_class prep_spec prep_param bname
haftmann@24748
   688
    raw_supclasses raw_includes_elems raw_other_consts thy =
haftmann@24748
   689
  let
haftmann@25038
   690
    val class = Sign.full_name thy bname;
haftmann@24836
   691
    val (((sups, supconsts), (supsort, local_sort, mergeexpr)), elems) =
haftmann@24748
   692
      prep_spec thy raw_supclasses raw_includes_elems;
wenzelm@24968
   693
    val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts;
haftmann@24589
   694
    fun mk_inst class param_names cs =
haftmann@24589
   695
      Symtab.empty
haftmann@24589
   696
      |> fold2 (fn v => fn (c, ty) => Symtab.update (v, Const
haftmann@24589
   697
           (c, Term.map_type_tfree (fn (v, _) => TFree (v, [class])) ty))) param_names cs;
haftmann@25038
   698
    fun extract_params thy =
haftmann@24218
   699
      let
haftmann@25038
   700
        val params = Locale.parameters_of thy class;
haftmann@24748
   701
        val _ = if Sign.subsort thy (supsort, local_sort) then () else error
haftmann@24748
   702
          ("Sort " ^ Sign.string_of_sort thy local_sort
haftmann@24748
   703
            ^ " is less general than permitted least general sort "
haftmann@24748
   704
            ^ Sign.string_of_sort thy supsort);
haftmann@24218
   705
      in
haftmann@24901
   706
        (map fst params, params
wenzelm@24847
   707
        |> (map o apfst o apsnd o Term.map_type_tfree) (K (TFree (Name.aT, local_sort)))
wenzelm@25010
   708
        |> (map o apsnd) (fork_mixfix true true #> fst)
haftmann@24218
   709
        |> chop (length supconsts)
haftmann@24901
   710
        |> snd)
haftmann@24218
   711
      end;
haftmann@25038
   712
    fun extract_assumes params thy cs =
haftmann@24218
   713
      let
haftmann@24218
   714
        val consts = supconsts @ (map (fst o fst) params ~~ cs);
haftmann@24218
   715
        fun subst (Free (c, ty)) =
haftmann@24218
   716
              Const ((fst o the o AList.lookup (op =) consts) c, ty)
haftmann@24218
   717
          | subst t = t;
haftmann@24218
   718
        fun prep_asm ((name, atts), ts) =
wenzelm@25024
   719
          ((Sign.base_name name, map (Attrib.attribute_i thy) atts),
haftmann@24589
   720
            (map o map_aterms) subst ts);
haftmann@24218
   721
      in
haftmann@25038
   722
        Locale.global_asms_of thy class
haftmann@24218
   723
        |> map prep_asm
haftmann@24218
   724
      end;
haftmann@25038
   725
    fun note_intro class_intro =
haftmann@25038
   726
      PureThy.note_thmss_qualified "" (class_prefix class)
haftmann@24218
   727
        [(("intro", []), [([class_intro], [])])]
haftmann@24218
   728
      #> snd
haftmann@24218
   729
  in
haftmann@24218
   730
    thy
haftmann@24748
   731
    |> Locale.add_locale_i (SOME "") bname mergeexpr elems
haftmann@25038
   732
    |> snd
haftmann@25038
   733
    |> ProofContext.theory (`extract_params
haftmann@24901
   734
      #-> (fn (globals, params) =>
wenzelm@24968
   735
        define_class_params (bname, supsort) params
haftmann@25038
   736
          (extract_assumes params) other_consts
haftmann@25038
   737
      #-> (fn (_, (consts, axioms)) =>
haftmann@25038
   738
        `(fn thy => class_intro thy class sups)
haftmann@24218
   739
      #-> (fn class_intro =>
haftmann@25038
   740
        add_class_data ((class, sups),
haftmann@25038
   741
          (map fst params ~~ consts, local_sort,
haftmann@25038
   742
            mk_inst class (map fst globals) (map snd supconsts @ consts),
haftmann@25038
   743
              class_intro))
haftmann@25038
   744
      #> note_intro class_intro
haftmann@25038
   745
      #> class_interpretation class axioms []
haftmann@25038
   746
      ))))
haftmann@25038
   747
    |> pair class
haftmann@24218
   748
  end;
haftmann@24218
   749
haftmann@24218
   750
in
haftmann@24218
   751
wenzelm@24968
   752
val class_cmd = gen_class read_class_spec ((#1 o Term.dest_Const) oo Sign.read_const);
haftmann@24748
   753
val class = gen_class check_class_spec (K I);
haftmann@24218
   754
haftmann@24218
   755
end; (*local*)
haftmann@24218
   756
haftmann@24218
   757
haftmann@24589
   758
(* definition in class target *)
haftmann@24218
   759
haftmann@24218
   760
fun export_fixes thy class =
haftmann@24218
   761
  let
haftmann@25002
   762
    val cs = these_params thy [class];
haftmann@25002
   763
    fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) cs v
haftmann@24218
   764
         of SOME (c, _) => Const (c, ty)
haftmann@24218
   765
          | NONE => t)
haftmann@24218
   766
      | subst_aterm t = t;
haftmann@24657
   767
  in Term.map_aterms subst_aterm end;
haftmann@24218
   768
haftmann@24901
   769
fun mk_operation_entry thy (c, rhs) =
haftmann@24901
   770
  let
haftmann@25002
   771
    val ty = Logic.unvarifyT (Sign.the_const_constraint thy c);
haftmann@24914
   772
    val typargs = Sign.const_typargs thy (c, ty);
haftmann@24901
   773
    val typidx = find_index (fn TFree (w, _) => Name.aT = w | _ => false) typargs;
haftmann@25002
   774
  in (c, (rhs, (ty, typidx))) end;
haftmann@24901
   775
haftmann@25038
   776
fun add_const_in_class class ((c, mx), (c_loc, rhs)) thy =
haftmann@24218
   777
  let
haftmann@25038
   778
    val _ = tracing c_loc;
wenzelm@25024
   779
    val prfx = class_prefix class;
wenzelm@25024
   780
    val thy' = thy |> Sign.add_path prfx;
wenzelm@25024
   781
wenzelm@25024
   782
    val rhs' = export_fixes thy' class rhs;
haftmann@24657
   783
    val subst_typ = Term.map_type_tfree (fn var as (w, sort) =>
haftmann@25002
   784
      if w = Name.aT then TFree (w, [class]) else TFree var);
haftmann@24218
   785
    val ty' = Term.fastype_of rhs';
haftmann@24657
   786
    val ty'' = subst_typ ty';
wenzelm@25024
   787
    val c' = Sign.full_name thy' c;
haftmann@25038
   788
    val c'' = NameSpace.full (Sign.naming_of thy' |> NameSpace.add_path prfx) c;
haftmann@24657
   789
    val def = (c, Logic.mk_equals (Const (c', ty'), rhs'));
wenzelm@25024
   790
    val (mx', _) = fork_mixfix true true mx;
haftmann@24657
   791
    fun interpret def thy =
haftmann@24218
   792
      let
haftmann@24589
   793
        val def' = symmetric def;
haftmann@25002
   794
        val def_eq = (map_types Logic.unvarifyT o Thm.prop_of) def';
haftmann@24218
   795
      in
haftmann@24657
   796
        thy
haftmann@24657
   797
        |> class_interpretation class [def'] [def_eq]
haftmann@25002
   798
        |> Sign.add_const_constraint (c', SOME ty'')
haftmann@25002
   799
        |> `(fn thy => mk_operation_entry thy (c', rhs))
haftmann@25002
   800
        |-> (fn entry => register_operation class (entry, SOME def'))
haftmann@24218
   801
      end;
haftmann@24218
   802
  in
wenzelm@25024
   803
    thy'
haftmann@25038
   804
    |> Sign.hide_consts_i false [c'']
wenzelm@25024
   805
    |> Sign.declare_const [] (c, ty', mx') |> snd
haftmann@24218
   806
    |> Sign.parent_path
haftmann@24218
   807
    |> Sign.sticky_prefix prfx
haftmann@24218
   808
    |> PureThy.add_defs_i false [(def, [])]
haftmann@24218
   809
    |-> (fn [def] => interpret def)
haftmann@24218
   810
    |> Sign.restore_naming thy
haftmann@24914
   811
    |> pair c'
haftmann@24218
   812
  end;
haftmann@24218
   813
haftmann@24901
   814
haftmann@24901
   815
(* abbreviation in class target *)
haftmann@24901
   816
haftmann@25038
   817
fun add_abbrev_in_class class prmode ((c, mx), (c_loc, rhs)) thy =
haftmann@24836
   818
  let
haftmann@25038
   819
    val _ = tracing c_loc;
wenzelm@25024
   820
    val prfx = class_prefix class;
haftmann@25038
   821
    val naming = Sign.naming_of thy |> NameSpace.add_path prfx |> NameSpace.add_path prfx;
haftmann@25038
   822
      (*FIXME*)
wenzelm@25024
   823
    val c' = NameSpace.full naming c;
haftmann@24901
   824
    val rhs' = export_fixes thy class rhs;
wenzelm@25020
   825
    val ty' = Term.fastype_of rhs';
haftmann@25002
   826
    val entry = mk_operation_entry thy (c', rhs);
haftmann@24836
   827
  in
haftmann@24836
   828
    thy
wenzelm@25024
   829
    |> Sign.notation true prmode [(Const (c', ty'), mx)]
haftmann@25002
   830
    |> register_operation class (entry, NONE)
haftmann@24914
   831
    |> pair c'
haftmann@24836
   832
  end;
haftmann@24836
   833
haftmann@24218
   834
end;