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