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