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