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