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