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