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