src/Pure/Isar/class.ML
author wenzelm
Tue Sep 25 13:28:37 2007 +0200 (2007-09-25)
changeset 24707 dfeb98f84e93
parent 24701 f8bfd592a6dc
child 24731 c25aa6ae64ec
permissions -rw-r--r--
Syntax.parse/check/read;
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@24218
    16
  val class: bstring -> class list -> Element.context_i Locale.element list
haftmann@24218
    17
    -> string list -> theory -> string * Proof.context
haftmann@24589
    18
  val class_cmd: 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@24657
    49
  val init_ref: (class -> Proof.context -> (theory -> theory) * Proof.context) ref
haftmann@24657
    50
  val init: class -> Proof.context -> (theory -> theory) * Proof.context;
haftmann@24657
    51
  val init_default: class -> Proof.context -> (theory -> theory) * Proof.context;
haftmann@24657
    52
  val remove_constraints: class -> theory -> (string * typ) list * theory
haftmann@24657
    53
  val class_term_check: theory -> class -> term list -> Proof.context -> term list * Proof.context
haftmann@24657
    54
  val local_param: theory -> class -> string -> (term * (class * int)) option
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
haftmann@24589
    90
    val typ = TVar ((AxClass.param_tyvarname, 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@24657
   102
fun get_remove_contraint c thy =
haftmann@24657
   103
  let
haftmann@24657
   104
    val ty = Sign.the_const_constraint thy c;
haftmann@24657
   105
  in
haftmann@24657
   106
    thy
haftmann@24657
   107
    |> Sign.add_const_constraint_i (c, NONE)
haftmann@24657
   108
    |> pair (c, Logic.unvarifyT ty)
haftmann@24657
   109
  end;
haftmann@24657
   110
haftmann@24589
   111
haftmann@24589
   112
(** axclass command **)
haftmann@24589
   113
haftmann@24218
   114
fun axclass_cmd (class, raw_superclasses) raw_specs thy =
haftmann@24218
   115
  let
haftmann@24218
   116
    val ctxt = ProofContext.init thy;
haftmann@24218
   117
    val superclasses = map (Sign.read_class thy) raw_superclasses;
haftmann@24589
   118
    val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst)
haftmann@24589
   119
      raw_specs;
haftmann@24589
   120
    val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd)
haftmann@24589
   121
          raw_specs)
haftmann@24218
   122
      |> snd
haftmann@24218
   123
      |> (map o map) fst;
haftmann@24589
   124
  in
haftmann@24589
   125
    AxClass.define_class (class, superclasses) []
haftmann@24589
   126
      (name_atts ~~ axiomss) thy
haftmann@24589
   127
  end;
haftmann@24218
   128
haftmann@24218
   129
local
haftmann@24218
   130
haftmann@24218
   131
fun gen_instance mk_prop add_thm after_qed insts thy =
haftmann@24218
   132
  let
haftmann@24218
   133
    fun after_qed' results =
haftmann@24218
   134
      ProofContext.theory ((fold o fold) add_thm results #> after_qed);
haftmann@24218
   135
  in
haftmann@24218
   136
    thy
haftmann@24218
   137
    |> ProofContext.init
haftmann@24589
   138
    |> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])])
haftmann@24589
   139
        o maps (mk_prop thy)) insts)
haftmann@24218
   140
  end;
haftmann@24218
   141
haftmann@24218
   142
in
haftmann@24218
   143
haftmann@24589
   144
val instance_arity =
haftmann@24218
   145
  gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity;
haftmann@24589
   146
val classrel =
haftmann@24218
   147
  gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel))
haftmann@24218
   148
    AxClass.add_classrel I o single;
haftmann@24589
   149
val classrel_cmd =
haftmann@24589
   150
  gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel))
haftmann@24589
   151
    AxClass.add_classrel I o single;
haftmann@24218
   152
haftmann@24218
   153
end; (*local*)
haftmann@24218
   154
haftmann@24218
   155
haftmann@24589
   156
(** explicit constants for overloaded definitions **)
haftmann@24304
   157
haftmann@24304
   158
structure InstData = TheoryDataFun
haftmann@24304
   159
(
haftmann@24423
   160
  type T = (string * thm) Symtab.table Symtab.table * (string * string) Symtab.table;
haftmann@24423
   161
    (*constant name ~> type constructor ~> (constant name, equation),
haftmann@24423
   162
        constant name ~> (constant name, type constructor)*)
haftmann@24423
   163
  val empty = (Symtab.empty, Symtab.empty);
haftmann@24304
   164
  val copy = I;
haftmann@24304
   165
  val extend = I;
haftmann@24423
   166
  fun merge _ ((taba1, tabb1), (taba2, tabb2)) =
haftmann@24423
   167
    (Symtab.join (K (Symtab.merge (K true))) (taba1, taba2),
haftmann@24423
   168
      Symtab.merge (K true) (tabb1, tabb2));
haftmann@24304
   169
);
haftmann@24304
   170
haftmann@24589
   171
fun inst_thms f thy = (Symtab.fold (Symtab.fold (cons o f o snd o snd) o snd) o fst)
haftmann@24589
   172
    (InstData.get thy) [];
haftmann@24589
   173
fun add_inst (c, tyco) inst = (InstData.map o apfst
haftmann@24589
   174
      o Symtab.map_default (c, Symtab.empty)) (Symtab.update_new (tyco, inst))
haftmann@24423
   175
  #> (InstData.map o apsnd) (Symtab.update_new (fst inst, (c, tyco)));
haftmann@24304
   176
haftmann@24589
   177
fun unoverload thy = MetaSimplifier.rewrite false (inst_thms I thy);
haftmann@24589
   178
fun overload thy = MetaSimplifier.rewrite false (inst_thms symmetric thy);
haftmann@24304
   179
haftmann@24304
   180
fun inst_const thy (c, tyco) =
haftmann@24423
   181
  (fst o the o Symtab.lookup ((the o Symtab.lookup (fst (InstData.get thy))) c)) tyco;
haftmann@24423
   182
fun unoverload_const thy (c_ty as (c, _)) =
haftmann@24423
   183
  case AxClass.class_of_param thy c
haftmann@24423
   184
   of SOME class => (case Sign.const_typargs thy c_ty
haftmann@24589
   185
       of [Type (tyco, _)] => (case Symtab.lookup
haftmann@24589
   186
           ((the o Symtab.lookup (fst (InstData.get thy))) c) tyco
haftmann@24423
   187
             of SOME (c, _) => c
haftmann@24423
   188
              | NONE => c)
haftmann@24423
   189
        | [_] => c)
haftmann@24423
   190
    | NONE => c;
haftmann@24423
   191
haftmann@24423
   192
val param_const = Symtab.lookup o snd o InstData.get;
haftmann@24304
   193
haftmann@24304
   194
fun add_inst_def (class, tyco) (c, ty) thy =
haftmann@24304
   195
  let
haftmann@24304
   196
    val tyco_base = NameSpace.base tyco;
haftmann@24304
   197
    val name_inst = NameSpace.base class ^ "_" ^ tyco_base ^ "_inst";
haftmann@24304
   198
    val c_inst_base = NameSpace.base c ^ "_" ^ tyco_base;
haftmann@24304
   199
  in
haftmann@24304
   200
    thy
haftmann@24304
   201
    |> Sign.sticky_prefix name_inst
haftmann@24435
   202
    |> PureThy.simple_def ("", [])
haftmann@24435
   203
         (((c_inst_base, ty, Syntax.NoSyn), []), Const (c, ty))
haftmann@24435
   204
    |-> (fn (c_inst, thm) => add_inst (c, tyco) (c_inst, symmetric thm))
haftmann@24435
   205
    |> Sign.restore_naming thy
haftmann@24304
   206
  end;
haftmann@24304
   207
haftmann@24304
   208
fun add_inst_def' (class, tyco) (c, ty) thy =
haftmann@24423
   209
  if case Symtab.lookup (fst (InstData.get thy)) c
haftmann@24304
   210
   of NONE => true
haftmann@24304
   211
    | SOME tab => is_none (Symtab.lookup tab tyco)
haftmann@24304
   212
  then add_inst_def (class, tyco) (c, Logic.unvarifyT ty) thy
haftmann@24304
   213
  else thy;
haftmann@24304
   214
haftmann@24304
   215
fun add_def ((class, tyco), ((name, prop), atts)) thy =
haftmann@24304
   216
  let
haftmann@24589
   217
    val ((lhs as Const (c, ty), args), rhs) =
haftmann@24589
   218
      (apfst Term.strip_comb o Logic.dest_equals) prop;
haftmann@24701
   219
    fun (*add_inst' def ([], (Const (c_inst, ty))) =
haftmann@24423
   220
          if forall (fn TFree _ => true | _ => false) (Sign.const_typargs thy (c_inst, ty))
haftmann@24304
   221
          then add_inst (c, tyco) (c_inst, def)
haftmann@24304
   222
          else add_inst_def (class, tyco) (c, ty)
haftmann@24701
   223
      |*) add_inst' _ t = add_inst_def (class, tyco) (c, ty);
haftmann@24304
   224
  in
haftmann@24304
   225
    thy
haftmann@24304
   226
    |> PureThy.add_defs_i true [((name, prop), map (Attrib.attribute thy) atts)]
haftmann@24304
   227
    |-> (fn [def] => add_inst' def (args, rhs) #> pair def)
haftmann@24304
   228
  end;
haftmann@24304
   229
haftmann@24304
   230
haftmann@24589
   231
(** instances with implicit parameter handling **)
haftmann@24218
   232
haftmann@24218
   233
local
haftmann@24218
   234
wenzelm@24707
   235
fun gen_read_def thy prep_att parse_prop ((raw_name, raw_atts), raw_t) =
haftmann@24218
   236
  let
wenzelm@24707
   237
    val ctxt = ProofContext.init thy;
wenzelm@24707
   238
    val t = parse_prop ctxt raw_t |> Syntax.check_prop ctxt;
haftmann@24218
   239
    val ((c, ty), _) = Sign.cert_def (Sign.pp thy) t;
haftmann@24218
   240
    val atts = map (prep_att thy) raw_atts;
haftmann@24218
   241
    val insts = Consts.typargs (Sign.consts_of thy) (c, ty);
haftmann@24218
   242
    val name = case raw_name
haftmann@24218
   243
     of "" => NONE
haftmann@24218
   244
      | _ => SOME raw_name;
haftmann@24218
   245
  in (c, (insts, ((name, t), atts))) end;
haftmann@24218
   246
wenzelm@24707
   247
fun read_def_cmd thy = gen_read_def thy Attrib.intern_src Syntax.parse_prop;
haftmann@24218
   248
fun read_def thy = gen_read_def thy (K I) (K I);
haftmann@24218
   249
haftmann@24589
   250
fun gen_instance prep_arity read_def do_proof raw_arities raw_defs after_qed theory =
haftmann@24218
   251
  let
haftmann@24218
   252
    val arities = map (prep_arity theory) raw_arities;
haftmann@24218
   253
    val _ = if null arities then error "at least one arity must be given" else ();
haftmann@24218
   254
    val _ = case (duplicates (op =) o map #1) arities
haftmann@24218
   255
     of [] => ()
haftmann@24218
   256
      | dupl_tycos => error ("type constructors occur more than once in arities: "
haftmann@24218
   257
          ^ (commas o map quote) dupl_tycos);
haftmann@24589
   258
    val super_sort =
haftmann@24589
   259
      (Graph.all_succs o #classes o Sorts.rep_algebra o Sign.classes_of) theory;
haftmann@24218
   260
    fun get_consts_class tyco ty class =
haftmann@24218
   261
      let
haftmann@24218
   262
        val cs = (these o Option.map snd o try (AxClass.params_of_class theory)) class;
haftmann@24218
   263
        val subst_ty = map_type_tfree (K ty);
haftmann@24218
   264
      in
haftmann@24304
   265
        map (fn (c, ty) => (c, ((class, tyco), subst_ty ty))) cs
haftmann@24218
   266
      end;
haftmann@24218
   267
    fun get_consts_sort (tyco, asorts, sort) =
haftmann@24218
   268
      let
haftmann@24589
   269
        val ty = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort))
haftmann@24589
   270
          (Name.names Name.context "'a" asorts))
haftmann@24218
   271
      in maps (get_consts_class tyco ty) (super_sort sort) end;
haftmann@24218
   272
    val cs = maps get_consts_sort arities;
haftmann@24218
   273
    fun mk_typnorm thy (ty, ty_sc) =
haftmann@24218
   274
      case try (Sign.typ_match thy (Logic.varifyT ty_sc, ty)) Vartab.empty
haftmann@24218
   275
       of SOME env => SOME (Logic.varifyT #> Envir.typ_subst_TVars env #> Logic.unvarifyT)
haftmann@24218
   276
        | NONE => NONE;
haftmann@24218
   277
    fun read_defs defs cs thy_read =
haftmann@24218
   278
      let
haftmann@24218
   279
        fun read raw_def cs =
haftmann@24218
   280
          let
haftmann@24218
   281
            val (c, (inst, ((name_opt, t), atts))) = read_def thy_read raw_def;
haftmann@24218
   282
            val ty = Consts.instance (Sign.consts_of thy_read) (c, inst);
haftmann@24304
   283
            val ((class, tyco), ty') = case AList.lookup (op =) cs c
haftmann@24218
   284
             of NONE => error ("illegal definition for constant " ^ quote c)
haftmann@24218
   285
              | SOME class_ty => class_ty;
haftmann@24218
   286
            val name = case name_opt
haftmann@24218
   287
             of NONE => Thm.def_name (Logic.name_arity (tyco, [], c))
haftmann@24218
   288
              | SOME name => name;
haftmann@24218
   289
            val t' = case mk_typnorm thy_read (ty', ty)
haftmann@24218
   290
             of NONE => error ("illegal definition for constant " ^
haftmann@24218
   291
                  quote (c ^ "::" ^ setmp show_sorts true
haftmann@24218
   292
                    (Sign.string_of_typ thy_read) ty))
haftmann@24218
   293
              | SOME norm => map_types norm t
haftmann@24218
   294
          in (((class, tyco), ((name, t'), atts)), AList.delete (op =) c cs) end;
haftmann@24218
   295
      in fold_map read defs cs end;
haftmann@24304
   296
    val (defs, other_cs) = read_defs raw_defs cs
haftmann@24218
   297
      (fold Sign.primitive_arity arities (Theory.copy theory));
haftmann@24423
   298
    fun after_qed' cs defs =
haftmann@24304
   299
      fold Sign.add_const_constraint_i (map (apsnd SOME) cs)
haftmann@24423
   300
      #> after_qed defs;
haftmann@24218
   301
  in
haftmann@24218
   302
    theory
haftmann@24218
   303
    |> fold_map get_remove_contraint (map fst cs |> distinct (op =))
haftmann@24304
   304
    ||>> fold_map add_def defs
haftmann@24304
   305
    ||> fold (fn (c, ((class, tyco), ty)) => add_inst_def' (class, tyco) (c, ty)) other_cs
haftmann@24423
   306
    |-> (fn (cs, defs) => do_proof (after_qed' cs defs) arities defs)
haftmann@24218
   307
  end;
haftmann@24218
   308
haftmann@24423
   309
fun tactic_proof tac f arities defs =
haftmann@24218
   310
  fold (fn arity => AxClass.prove_arity arity tac) arities
haftmann@24423
   311
  #> f
haftmann@24423
   312
  #> pair defs;
haftmann@24218
   313
haftmann@24218
   314
in
haftmann@24218
   315
haftmann@24589
   316
val instance = gen_instance Sign.cert_arity read_def
haftmann@24589
   317
  (fn f => fn arities => fn defs => instance_arity f arities);
haftmann@24589
   318
val instance_cmd = gen_instance Sign.read_arity read_def_cmd
haftmann@24589
   319
  (fn f => fn arities => fn defs => instance_arity f arities);
haftmann@24589
   320
fun prove_instance tac arities defs =
haftmann@24589
   321
  gen_instance Sign.cert_arity read_def
haftmann@24589
   322
    (tactic_proof tac) arities defs (K I);
haftmann@24218
   323
haftmann@24218
   324
end; (*local*)
haftmann@24218
   325
haftmann@24218
   326
haftmann@24218
   327
haftmann@24589
   328
(** class data **)
haftmann@24218
   329
haftmann@24218
   330
datatype class_data = ClassData of {
haftmann@24218
   331
  locale: string,
haftmann@24218
   332
  consts: (string * string) list
haftmann@24657
   333
    (*locale parameter ~> theory constant name*),
haftmann@24657
   334
  v: string,
haftmann@24589
   335
  inst: typ Symtab.table * term Symtab.table
haftmann@24589
   336
    (*canonical interpretation*),
haftmann@24657
   337
  intro: thm,
haftmann@24657
   338
  defs: thm list,
haftmann@24657
   339
  localized: (string * (term * (class * int))) list
haftmann@24657
   340
    (*theory constant name ~> (locale parameter, (class, instantiaton index of class typ))*)
haftmann@24657
   341
};
haftmann@24218
   342
haftmann@24657
   343
fun rep_class_data (ClassData d) = d;
haftmann@24657
   344
fun mk_class_data ((locale, consts, v, inst, intro), (defs, localized)) =
haftmann@24657
   345
  ClassData { locale = locale, consts = consts, v = v, inst = inst, intro = intro,
haftmann@24657
   346
    defs = defs, localized = localized };
haftmann@24657
   347
fun map_class_data f (ClassData { locale, consts, v, inst, intro, defs, localized }) =
haftmann@24657
   348
  mk_class_data (f ((locale, consts, v, inst, intro), (defs, localized)))
haftmann@24657
   349
fun merge_class_data _ (ClassData { locale = locale, consts = consts, v = v, inst = inst,
haftmann@24657
   350
    intro = intro, defs = defs1, localized = localized1 },
haftmann@24657
   351
  ClassData { locale = _, consts = _, v = _, inst = _, intro = _,
haftmann@24657
   352
    defs = defs2, localized = localized2 }) =
haftmann@24657
   353
  mk_class_data ((locale, consts, v, inst, intro),
haftmann@24657
   354
    (Thm.merge_thms (defs1, defs2), AList.merge (op =) (K true) (localized1, localized2)));
haftmann@24218
   355
haftmann@24218
   356
fun merge_pair f1 f2 ((x1, y1), (x2, y2)) = (f1 (x1, x2), f2 (y1, y2));
haftmann@24218
   357
haftmann@24218
   358
structure ClassData = TheoryDataFun
haftmann@24218
   359
(
haftmann@24657
   360
  type T = class_data Graph.T * class Symtab.table
haftmann@24657
   361
    (*locale name ~> class name*);
haftmann@24218
   362
  val empty = (Graph.empty, Symtab.empty);
haftmann@24218
   363
  val copy = I;
haftmann@24218
   364
  val extend = I;
haftmann@24657
   365
  fun merge _ = merge_pair (Graph.join merge_class_data) (Symtab.merge (K true));
haftmann@24218
   366
);
haftmann@24218
   367
haftmann@24218
   368
haftmann@24218
   369
(* queries *)
haftmann@24218
   370
haftmann@24657
   371
val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node
haftmann@24589
   372
  o fst o ClassData.get;
haftmann@24218
   373
fun class_of_locale thy = Symtab.lookup ((snd o ClassData.get) thy);
haftmann@24218
   374
haftmann@24589
   375
fun the_class_data thy class = case lookup_class_data thy class
haftmann@24589
   376
 of NONE => error ("undeclared class " ^ quote class)
haftmann@24589
   377
  | SOME data => data;
haftmann@24218
   378
haftmann@24218
   379
val ancestry = Graph.all_succs o fst o ClassData.get;
haftmann@24218
   380
haftmann@24435
   381
fun params_of_sort thy =
haftmann@24218
   382
  let
haftmann@24218
   383
    fun params class =
haftmann@24218
   384
      let
haftmann@24218
   385
        val const_typs = (#params o AxClass.get_definition thy) class;
haftmann@24657
   386
        val const_names = (#consts o the_class_data thy) class;
haftmann@24218
   387
      in
haftmann@24218
   388
        (map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names
haftmann@24218
   389
      end;
haftmann@24218
   390
  in maps params o ancestry thy end;
haftmann@24218
   391
haftmann@24657
   392
fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy;
haftmann@24218
   393
haftmann@24218
   394
fun these_intros thy =
haftmann@24657
   395
  Graph.fold (fn (_, (data, _)) => insert Thm.eq_thm ((#intro o rep_class_data) data))
haftmann@24218
   396
    ((fst o ClassData.get) thy) [];
haftmann@24218
   397
haftmann@24657
   398
fun these_localized thy class =
haftmann@24657
   399
  maps (#localized o the_class_data thy) (ancestry thy [class]);
haftmann@24657
   400
haftmann@24657
   401
fun local_param thy = AList.lookup (op =) o these_localized thy;
haftmann@24657
   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: ",
haftmann@24218
   421
        (Sign.pretty_sort thy o Sign.certify_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@24589
   438
fun add_class_data ((class, superclasses), (locale, consts, v, inst, intro)) =
haftmann@24218
   439
  ClassData.map (fn (gr, tab) => (
haftmann@24218
   440
    gr
haftmann@24657
   441
    |> Graph.new_node (class, mk_class_data ((locale, (map o apfst) fst consts, v, inst, intro),
haftmann@24657
   442
         ([], map (apsnd (rpair (class, 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@24657
   448
fun add_class_const_def (class, (entry, def)) =
haftmann@24657
   449
  (ClassData.map o apfst o Graph.map_node class o map_class_data o apsnd)
haftmann@24657
   450
    (fn (defs, localized) => (def :: defs, (apsnd o apsnd) (pair class) entry :: localized));
haftmann@24218
   451
haftmann@24589
   452
haftmann@24589
   453
(** rule calculation, tactics and methods **)
haftmann@24589
   454
haftmann@24589
   455
fun class_intro thy locale class sups =
haftmann@24589
   456
  let
haftmann@24589
   457
    fun class_elim class =
haftmann@24589
   458
      case (map Drule.unconstrainTs o #axioms o AxClass.get_definition thy) class
haftmann@24589
   459
       of [thm] => SOME thm
haftmann@24589
   460
        | [] => NONE;
haftmann@24589
   461
    val pred_intro = case Locale.intros thy locale
haftmann@24589
   462
     of ([ax_intro], [intro]) => intro |> OF_LAST ax_intro |> SOME
haftmann@24589
   463
      | ([intro], []) => SOME intro
haftmann@24589
   464
      | ([], [intro]) => SOME intro
haftmann@24589
   465
      | _ => NONE;
haftmann@24589
   466
    val pred_intro' = pred_intro
haftmann@24589
   467
      |> Option.map (fn intro => intro OF map_filter class_elim sups);
haftmann@24589
   468
    val class_intro = (#intro o AxClass.get_definition thy) class;
haftmann@24589
   469
    val raw_intro = case pred_intro'
haftmann@24589
   470
     of SOME pred_intro => class_intro |> OF_LAST pred_intro
haftmann@24589
   471
      | NONE => class_intro;
haftmann@24589
   472
    val sort = Sign.super_classes thy class;
haftmann@24589
   473
    val typ = TVar ((AxClass.param_tyvarname, 0), sort);
haftmann@24589
   474
    val defs = these_defs thy sups;
haftmann@24589
   475
  in
haftmann@24589
   476
    raw_intro
haftmann@24589
   477
    |> Drule.instantiate' [SOME (Thm.ctyp_of thy typ)] []
haftmann@24589
   478
    |> strip_all_ofclass thy sort
haftmann@24589
   479
    |> Thm.strip_shyps
haftmann@24589
   480
    |> MetaSimplifier.rewrite_rule defs
haftmann@24589
   481
    |> Drule.unconstrainTs
haftmann@24589
   482
  end;
haftmann@24589
   483
haftmann@24589
   484
fun class_interpretation class facts defs thy =
haftmann@24589
   485
  let
haftmann@24657
   486
    val { locale, inst, ... } = the_class_data thy class;
haftmann@24589
   487
    val tac = (ALLGOALS o ProofContext.fact_tac) facts;
haftmann@24589
   488
    val prfx = Logic.const_of_class (NameSpace.base class);
haftmann@24589
   489
  in
haftmann@24589
   490
    prove_interpretation tac ((false, prfx), []) (Locale.Locale locale)
haftmann@24589
   491
      (inst, defs) thy
haftmann@24589
   492
  end;
haftmann@24589
   493
haftmann@24589
   494
fun interpretation_in_rule thy (class1, class2) =
haftmann@24589
   495
  let
haftmann@24589
   496
    fun mk_axioms class =
haftmann@24589
   497
      let
haftmann@24657
   498
        val { locale, inst = (_, insttab), ... } = the_class_data thy class;
haftmann@24589
   499
      in
haftmann@24589
   500
        Locale.global_asms_of thy locale
haftmann@24589
   501
        |> maps snd
haftmann@24589
   502
        |> (map o map_aterms) (fn Free (s, _) => (the o Symtab.lookup insttab) s | t => t)
haftmann@24589
   503
        |> (map o map_types o map_atyps) (fn TFree _ => TFree ("'a", [class1]) | T => T)
haftmann@24589
   504
        |> map (ObjectLogic.ensure_propT thy)
haftmann@24589
   505
      end;
haftmann@24589
   506
    val (prems, concls) = pairself mk_axioms (class1, class2);
haftmann@24589
   507
  in
haftmann@24589
   508
    Goal.prove_global thy [] prems (Logic.mk_conjunction_list concls)
haftmann@24589
   509
      (Locale.intro_locales_tac true (ProofContext.init thy))
haftmann@24589
   510
  end;
haftmann@24218
   511
haftmann@24218
   512
fun intro_classes_tac facts st =
haftmann@24218
   513
  let
haftmann@24218
   514
    val thy = Thm.theory_of_thm st;
haftmann@24218
   515
    val classes = Sign.all_classes thy;
haftmann@24218
   516
    val class_trivs = map (Thm.class_triv thy) classes;
haftmann@24218
   517
    val class_intros = these_intros thy;
haftmann@24218
   518
    fun add_axclass_intro class =
haftmann@24218
   519
      case try (AxClass.get_definition thy) class of SOME {intro, ...} => cons intro | _ => I;
haftmann@24218
   520
    val axclass_intros = fold add_axclass_intro classes [];
haftmann@24218
   521
  in
haftmann@24218
   522
    st
haftmann@24218
   523
    |> ((ALLGOALS (Method.insert_tac facts THEN'
haftmann@24218
   524
          REPEAT_ALL_NEW (resolve_tac (class_trivs @ class_intros @ axclass_intros))))
haftmann@24218
   525
            THEN Tactic.distinct_subgoals_tac)
haftmann@24218
   526
  end;
haftmann@24218
   527
haftmann@24218
   528
fun default_intro_classes_tac [] = intro_classes_tac []
haftmann@24218
   529
  | default_intro_classes_tac _ = Tactical.no_tac;    (*no error message!*)
haftmann@24218
   530
haftmann@24218
   531
fun default_tac rules ctxt facts =
haftmann@24218
   532
  HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
haftmann@24218
   533
    default_intro_classes_tac facts;
haftmann@24218
   534
haftmann@24218
   535
val _ = Context.add_setup (Method.add_methods
haftmann@24218
   536
 [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
haftmann@24218
   537
    "back-chain introduction rules of classes"),
haftmann@24218
   538
  ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
haftmann@24218
   539
    "apply some intro/elim rule")]);
haftmann@24218
   540
haftmann@24218
   541
haftmann@24589
   542
(** classes and class target **)
haftmann@24218
   543
haftmann@24589
   544
(* class definition *)
haftmann@24218
   545
haftmann@24218
   546
local
haftmann@24218
   547
wenzelm@24707
   548
fun read_param thy raw_t =  (* FIXME ProofContext.read_const (!?) *)
haftmann@24218
   549
  let
wenzelm@24707
   550
    val t = Syntax.read_term_global thy raw_t
haftmann@24218
   551
  in case try dest_Const t
haftmann@24218
   552
   of SOME (c, _) => c
haftmann@24218
   553
    | NONE => error ("Not a constant: " ^ Sign.string_of_term thy t)
haftmann@24218
   554
  end;
haftmann@24218
   555
haftmann@24218
   556
fun gen_class add_locale prep_class prep_param bname
haftmann@24218
   557
    raw_supclasses raw_elems raw_other_consts thy =
haftmann@24218
   558
  let
haftmann@24589
   559
    fun mk_instT class = Symtab.empty
haftmann@24589
   560
      |> Symtab.update (AxClass.param_tyvarname, TFree (AxClass.param_tyvarname, [class]));
haftmann@24589
   561
    fun mk_inst class param_names cs =
haftmann@24589
   562
      Symtab.empty
haftmann@24589
   563
      |> fold2 (fn v => fn (c, ty) => Symtab.update (v, Const
haftmann@24589
   564
           (c, Term.map_type_tfree (fn (v, _) => TFree (v, [class])) ty))) param_names cs;
haftmann@24218
   565
    (*FIXME need proper concept for reading locale statements*)
haftmann@24218
   566
    fun subst_classtyvar (_, _) =
haftmann@24218
   567
          TFree (AxClass.param_tyvarname, [])
haftmann@24218
   568
      | subst_classtyvar (v, sort) =
haftmann@24589
   569
          error ("Sort constraint illegal in type class, for type variable "
haftmann@24589
   570
            ^ v ^ "::" ^ Sign.string_of_sort thy sort);
haftmann@24218
   571
    (*val subst_classtyvars = Element.map_ctxt {name = I, var = I, term = I,
haftmann@24218
   572
      typ = Term.map_type_tfree subst_classtyvar, fact = I, attrib = I};*)
haftmann@24218
   573
    val other_consts = map (prep_param thy) raw_other_consts;
haftmann@24218
   574
    val (elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e)
haftmann@24218
   575
      | Locale.Expr i => apsnd (cons i)) raw_elems ([], []);
haftmann@24218
   576
    val supclasses = map (prep_class thy) raw_supclasses;
haftmann@24218
   577
    val sups = filter (is_some o lookup_class_data thy) supclasses
haftmann@24218
   578
      |> Sign.certify_sort thy;
haftmann@24218
   579
    val supsort = Sign.certify_sort thy supclasses;
haftmann@24657
   580
    val suplocales = map (Locale.Locale o #locale o the_class_data thy) sups;
haftmann@24218
   581
    val supexpr = Locale.Merge (suplocales @ includes);
haftmann@24218
   582
    val supparams = (map fst o Locale.parameters_of_expr thy)
haftmann@24218
   583
      (Locale.Merge suplocales);
haftmann@24435
   584
    val supconsts = AList.make (the o AList.lookup (op =) (params_of_sort thy sups))
haftmann@24218
   585
      (map fst supparams);
haftmann@24218
   586
    (*val elems_constrains = map
haftmann@24218
   587
      (Element.Constrains o apsnd (Term.map_type_tfree subst_classtyvar)) supparams;*)
haftmann@24218
   588
    fun mk_tyvar (_, sort) = TFree (AxClass.param_tyvarname,
haftmann@24218
   589
      if Sign.subsort thy (supsort, sort) then sort else error
haftmann@24218
   590
        ("Sort " ^ Sign.string_of_sort thy sort
haftmann@24218
   591
          ^ " is less general than permitted least general sort "
haftmann@24218
   592
          ^ Sign.string_of_sort thy supsort));
haftmann@24218
   593
    fun extract_params thy name_locale =
haftmann@24218
   594
      let
haftmann@24218
   595
        val params = Locale.parameters_of thy name_locale;
haftmann@24218
   596
        val v = case (maps typ_tfrees o map (snd o fst)) params
haftmann@24657
   597
         of (v, _) :: _ => v
haftmann@24657
   598
          | [] => AxClass.param_tyvarname;
haftmann@24218
   599
      in
haftmann@24657
   600
        (v, (map fst params, params
haftmann@24218
   601
        |> (map o apfst o apsnd o Term.map_type_tfree) mk_tyvar
haftmann@24218
   602
        |> (map o apsnd) (fork_mixfix true NONE #> fst)
haftmann@24218
   603
        |> chop (length supconsts)
haftmann@24218
   604
        |> snd))
haftmann@24218
   605
      end;
haftmann@24218
   606
    fun extract_assumes name_locale params thy cs =
haftmann@24218
   607
      let
haftmann@24218
   608
        val consts = supconsts @ (map (fst o fst) params ~~ cs);
haftmann@24218
   609
        fun subst (Free (c, ty)) =
haftmann@24218
   610
              Const ((fst o the o AList.lookup (op =) consts) c, ty)
haftmann@24218
   611
          | subst t = t;
haftmann@24218
   612
        fun prep_asm ((name, atts), ts) =
haftmann@24218
   613
          ((NameSpace.base name, map (Attrib.attribute thy) atts),
haftmann@24589
   614
            (map o map_aterms) subst ts);
haftmann@24218
   615
      in
haftmann@24218
   616
        Locale.global_asms_of thy name_locale
haftmann@24218
   617
        |> map prep_asm
haftmann@24218
   618
      end;
haftmann@24218
   619
    fun note_intro name_axclass class_intro =
haftmann@24218
   620
      PureThy.note_thmss_qualified "" ((Logic.const_of_class o NameSpace.base) name_axclass)
haftmann@24218
   621
        [(("intro", []), [([class_intro], [])])]
haftmann@24218
   622
      #> snd
haftmann@24218
   623
  in
haftmann@24218
   624
    thy
haftmann@24218
   625
    |> add_locale (SOME "") bname supexpr ((*elems_constrains @*) elems)
haftmann@24218
   626
    |-> (fn name_locale => ProofContext.theory_result (
haftmann@24218
   627
      `(fn thy => extract_params thy name_locale)
haftmann@24657
   628
      #-> (fn (v, (globals, params)) =>
haftmann@24589
   629
        AxClass.define_class_params (bname, supsort) params
haftmann@24589
   630
          (extract_assumes name_locale params) other_consts
haftmann@24589
   631
      #-> (fn (name_axclass, (consts, axioms)) =>
haftmann@24218
   632
        `(fn thy => class_intro thy name_locale name_axclass sups)
haftmann@24218
   633
      #-> (fn class_intro =>
haftmann@24218
   634
        add_class_data ((name_axclass, sups),
haftmann@24657
   635
          (name_locale, map fst params ~~ map fst consts, v,
haftmann@24657
   636
            (mk_instT name_axclass, mk_inst name_axclass (map fst globals)
haftmann@24589
   637
              (map snd supconsts @ consts)), class_intro))
haftmann@24218
   638
      #> note_intro name_axclass class_intro
haftmann@24589
   639
      #> class_interpretation name_axclass axioms []
haftmann@24218
   640
      #> pair name_axclass
haftmann@24218
   641
      )))))
haftmann@24218
   642
  end;
haftmann@24218
   643
haftmann@24218
   644
in
haftmann@24218
   645
haftmann@24218
   646
val class_cmd = gen_class Locale.add_locale Sign.intern_class read_param;
haftmann@24218
   647
val class = gen_class Locale.add_locale_i Sign.certify_class (K I);
haftmann@24218
   648
haftmann@24218
   649
end; (*local*)
haftmann@24218
   650
haftmann@24218
   651
haftmann@24657
   652
(* class target context *)
haftmann@24657
   653
haftmann@24657
   654
fun remove_constraints class thy =
haftmann@24657
   655
  thy |> fold_map (get_remove_contraint o fst) (these_localized thy class);
haftmann@24657
   656
haftmann@24657
   657
haftmann@24589
   658
(* definition in class target *)
haftmann@24218
   659
haftmann@24218
   660
fun export_fixes thy class =
haftmann@24218
   661
  let
haftmann@24435
   662
    val consts = params_of_sort thy [class];
haftmann@24218
   663
    fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) consts v
haftmann@24218
   664
         of SOME (c, _) => Const (c, ty)
haftmann@24218
   665
          | NONE => t)
haftmann@24218
   666
      | subst_aterm t = t;
haftmann@24657
   667
  in Term.map_aterms subst_aterm end;
haftmann@24218
   668
haftmann@24218
   669
fun add_const_in_class class ((c, rhs), syn) thy =
haftmann@24218
   670
  let
haftmann@24218
   671
    val prfx = (Logic.const_of_class o NameSpace.base) class;
haftmann@24657
   672
    fun mk_name c =
haftmann@24218
   673
      let
haftmann@24218
   674
        val n1 = Sign.full_name thy c;
haftmann@24218
   675
        val n2 = NameSpace.qualifier n1;
haftmann@24218
   676
        val n3 = NameSpace.base n1;
haftmann@24657
   677
      in NameSpace.implode [n2, prfx, n3] end;
haftmann@24657
   678
    val v = (#v o the_class_data thy) class;
haftmann@24657
   679
    val constrain_sort = curry (Sorts.inter_sort (Sign.classes_of thy)) [class];
haftmann@24657
   680
    val subst_typ = Term.map_type_tfree (fn var as (w, sort) =>
haftmann@24657
   681
      if w = v then TFree (w, constrain_sort sort) else TFree var);
haftmann@24218
   682
    val rhs' = export_fixes thy class rhs;
haftmann@24218
   683
    val ty' = Term.fastype_of rhs';
haftmann@24657
   684
    val ty'' = subst_typ ty';
haftmann@24657
   685
    val c' = mk_name c;
haftmann@24657
   686
    val def = (c, Logic.mk_equals (Const (c', ty'), rhs'));
haftmann@24218
   687
    val (syn', _) = fork_mixfix true NONE syn;
haftmann@24657
   688
    fun interpret def thy =
haftmann@24218
   689
      let
haftmann@24589
   690
        val def' = symmetric def;
haftmann@24218
   691
        val def_eq = Thm.prop_of def';
haftmann@24657
   692
        val typargs = Sign.const_typargs thy (c', fastype_of rhs);
haftmann@24657
   693
        val typidx = find_index (fn TFree (w, _) => v = w | _ => false) typargs;
haftmann@24218
   694
      in
haftmann@24657
   695
        thy
haftmann@24657
   696
        |> class_interpretation class [def'] [def_eq]
haftmann@24657
   697
        |> add_class_const_def (class, ((c', (rhs, typidx)), def'))
haftmann@24218
   698
      end;
haftmann@24218
   699
  in
haftmann@24218
   700
    thy
haftmann@24218
   701
    |> Sign.add_path prfx
haftmann@24218
   702
    |> Sign.add_consts_authentic [(c, ty', syn')]
haftmann@24218
   703
    |> Sign.parent_path
haftmann@24218
   704
    |> Sign.sticky_prefix prfx
haftmann@24218
   705
    |> PureThy.add_defs_i false [(def, [])]
haftmann@24218
   706
    |-> (fn [def] => interpret def)
haftmann@24657
   707
    |> Sign.add_const_constraint_i (c', SOME ty'')
haftmann@24218
   708
    |> Sign.restore_naming thy
haftmann@24218
   709
  end;
haftmann@24218
   710
haftmann@24589
   711
haftmann@24589
   712
(* interpretation in class target *)
haftmann@24589
   713
haftmann@24589
   714
local
haftmann@24589
   715
haftmann@24589
   716
fun gen_interpretation_in_class prep_class do_proof (raw_class, raw_superclass) theory =
haftmann@24589
   717
  let
haftmann@24589
   718
    val class = prep_class theory raw_class;
haftmann@24589
   719
    val superclass = prep_class theory raw_superclass;
haftmann@24657
   720
    val loc_name = (#locale o the_class_data theory) class;
haftmann@24657
   721
    val loc_expr = (Locale.Locale o #locale o the_class_data theory) superclass;
haftmann@24589
   722
    fun prove_classrel (class, superclass) thy =
haftmann@24589
   723
      let
haftmann@24589
   724
        val classes = (Graph.all_succs o #classes o Sorts.rep_algebra
haftmann@24589
   725
              o Sign.classes_of) thy [superclass]
haftmann@24589
   726
          |> filter_out (fn class' => Sign.subsort thy ([class], [class']));
haftmann@24589
   727
        fun instance_subclass (class1, class2) thy  =
haftmann@24589
   728
          let
haftmann@24589
   729
            val interp = interpretation_in_rule thy (class1, class2);
haftmann@24589
   730
            val ax = #axioms (AxClass.get_definition thy class1);
haftmann@24589
   731
            val intro = #intro (AxClass.get_definition thy class2)
haftmann@24589
   732
              |> Drule.instantiate' [SOME (Thm.ctyp_of thy
haftmann@24589
   733
                  (TVar ((AxClass.param_tyvarname, 0), [class1])))] [];
haftmann@24589
   734
            val thm = 
haftmann@24589
   735
              intro
haftmann@24589
   736
              |> OF_LAST (interp OF ax)
haftmann@24589
   737
              |> strip_all_ofclass thy (Sign.super_classes thy class2);
haftmann@24589
   738
          in
haftmann@24589
   739
            thy |> AxClass.add_classrel thm
haftmann@24589
   740
          end;
haftmann@24589
   741
      in
haftmann@24589
   742
        thy |> fold_rev (curry instance_subclass class) classes
haftmann@24589
   743
      end;
haftmann@24589
   744
  in
haftmann@24589
   745
    theory
haftmann@24589
   746
    |> do_proof (prove_classrel (class, superclass)) (loc_name, loc_expr)
haftmann@24589
   747
  end;
haftmann@24589
   748
haftmann@24589
   749
in
haftmann@24589
   750
haftmann@24589
   751
val interpretation_in_class = gen_interpretation_in_class Sign.certify_class
haftmann@24589
   752
  (Locale.interpretation_in_locale o ProofContext.theory);
haftmann@24589
   753
val interpretation_in_class_cmd = gen_interpretation_in_class Sign.read_class
haftmann@24589
   754
  (Locale.interpretation_in_locale o ProofContext.theory);
haftmann@24589
   755
val prove_interpretation_in_class = gen_interpretation_in_class Sign.certify_class
haftmann@24589
   756
  o prove_interpretation_in;
haftmann@24589
   757
haftmann@24589
   758
end; (*local*)
haftmann@24589
   759
haftmann@24657
   760
(*experimental*)
haftmann@24657
   761
fun class_term_check thy class =
haftmann@24657
   762
  let
haftmann@24657
   763
    val algebra = Sign.classes_of thy;
haftmann@24657
   764
    val { v, ... } = the_class_data thy class;
haftmann@24657
   765
    fun add_constrain_classtyp sort' (ty as TFree (v, _)) =
haftmann@24657
   766
          AList.map_default (op =) (v, []) (curry (Sorts.inter_sort algebra) sort')
haftmann@24657
   767
      | add_constrain_classtyp sort' (Type (tyco, tys)) = case Sorts.mg_domain algebra tyco sort'
haftmann@24657
   768
         of sorts => fold2 add_constrain_classtyp sorts tys;
haftmann@24657
   769
    fun class_arg c idx ty =
haftmann@24657
   770
      let
haftmann@24657
   771
        val typargs = Sign.const_typargs thy (c, ty);
haftmann@24657
   772
        fun classtyp (t as TFree (w, _)) = if w = v then NONE else SOME t
haftmann@24657
   773
          | classtyp t = SOME t;
haftmann@24657
   774
      in classtyp (nth typargs idx) end;
haftmann@24657
   775
    fun add_inst (c, ty) (terminsts, typinsts) = case local_param thy class c
haftmann@24657
   776
     of NONE => (terminsts, typinsts)
haftmann@24657
   777
      | SOME (t, (class', idx)) => (case class_arg c idx ty
haftmann@24657
   778
         of NONE => (((c, ty), t) :: terminsts, typinsts)
haftmann@24657
   779
          | SOME ty => (terminsts, add_constrain_classtyp [class'] ty typinsts));
haftmann@24657
   780
  in pair o (fn ts => let
haftmann@24657
   781
    val cs = (fold o fold_aterms) (fn Const c_ty => insert (op =) c_ty | _ => I) ts [];
haftmann@24657
   782
    val (terminsts, typinsts) = fold add_inst cs ([], []);
haftmann@24657
   783
  in
haftmann@24657
   784
    ts
haftmann@24657
   785
    |> (map o map_aterms) (fn t as Const c_ty => the_default t (AList.lookup (op =) terminsts c_ty)
haftmann@24657
   786
         | t => t)
haftmann@24657
   787
    |> (map o map_types o map_atyps) (fn t as TFree (v, sort) =>
haftmann@24657
   788
         case AList.lookup (op =) typinsts v
haftmann@24657
   789
          of SOME sort' => TFree (v, Sorts.inter_sort algebra (sort, sort'))
haftmann@24657
   790
           | NONE => t)
haftmann@24657
   791
  end) end;
haftmann@24657
   792
haftmann@24657
   793
val init_ref = ref (K (pair I) : class -> Proof.context -> (theory -> theory) * Proof.context);
haftmann@24657
   794
fun init class = ! init_ref class;
haftmann@24657
   795
haftmann@24657
   796
fun init_default class ctxt =
haftmann@24657
   797
  let
haftmann@24657
   798
    val thy = ProofContext.theory_of ctxt;
haftmann@24657
   799
    val term_check = class_term_check thy class;
haftmann@24657
   800
  in
haftmann@24657
   801
    ctxt
haftmann@24657
   802
    (*|> ProofContext.theory_result (remove_constraints class)*)
haftmann@24657
   803
    |> Context.proof_map (Syntax.add_term_check term_check)
haftmann@24657
   804
    (*|>> fold (fn (c, ty) => Sign.add_const_constraint_i (c, SOME ty))*)
haftmann@24657
   805
    |> pair I
haftmann@24657
   806
  end;
haftmann@24657
   807
haftmann@24218
   808
end;