src/Pure/Isar/class.ML
author haftmann
Sat Sep 15 19:27:44 2007 +0200 (2007-09-15)
changeset 24589 d3fca349736c
parent 24435 cabf8cd38258
child 24657 185502d54c3d
permissions -rw-r--r--
clarified class interfaces and internals
haftmann@24218
     1
(*  Title:      Pure/Isar/class.ML
haftmann@24218
     2
    ID:         $Id$
haftmann@24218
     3
    Author:     Florian Haftmann, TU Muenchen
haftmann@24218
     4
haftmann@24218
     5
Type classes derived from primitive axclasses and locales.
haftmann@24218
     6
*)
haftmann@24218
     7
haftmann@24218
     8
signature CLASS =
haftmann@24218
     9
sig
haftmann@24218
    10
  val fork_mixfix: bool -> string option -> mixfix -> mixfix * mixfix
haftmann@24218
    11
haftmann@24218
    12
  val axclass_cmd: bstring * xstring list
haftmann@24589
    13
    -> ((bstring * Attrib.src list) * string list) list
haftmann@24589
    14
    -> theory -> class * theory
haftmann@24589
    15
  val classrel_cmd: xstring * xstring -> theory -> Proof.state
haftmann@24218
    16
  val class: bstring -> class list -> Element.context_i Locale.element list
haftmann@24218
    17
    -> string list -> theory -> string * Proof.context
haftmann@24589
    18
  val class_cmd: bstring -> xstring list -> Element.context Locale.element list
haftmann@24589
    19
    -> xstring list -> theory -> string * Proof.context
haftmann@24423
    20
  val add_const_in_class: string -> (string * term) * Syntax.mixfix
haftmann@24423
    21
    -> theory -> theory
haftmann@24589
    22
  val interpretation_in_class: class * class -> theory -> Proof.state
haftmann@24589
    23
  val interpretation_in_class_cmd: xstring * xstring -> theory -> Proof.state
haftmann@24589
    24
  val prove_interpretation_in_class: tactic -> class * class -> theory -> theory
haftmann@24589
    25
  val intro_classes_tac: thm list -> tactic
haftmann@24589
    26
  val default_intro_classes_tac: thm list -> tactic
haftmann@24589
    27
  val class_of_locale: theory -> string -> class option
haftmann@24589
    28
  val print_classes: theory -> unit
haftmann@24423
    29
haftmann@24589
    30
  val instance_arity: (theory -> theory) -> arity list -> theory -> Proof.state
haftmann@24589
    31
  val instance: arity list -> ((bstring * Attrib.src list) * term) list
haftmann@24423
    32
    -> (thm list -> theory -> theory)
haftmann@24218
    33
    -> theory -> Proof.state
haftmann@24589
    34
  val instance_cmd: (bstring * xstring list * xstring) list
haftmann@24589
    35
    -> ((bstring * Attrib.src list) * xstring) list
haftmann@24423
    36
    -> (thm list -> theory -> theory)
haftmann@24218
    37
    -> theory -> Proof.state
haftmann@24589
    38
  val prove_instance: tactic -> arity list
haftmann@24218
    39
    -> ((bstring * Attrib.src list) * term) list
haftmann@24423
    40
    -> theory -> thm list * theory
haftmann@24423
    41
  val unoverload: theory -> conv
haftmann@24423
    42
  val overload: theory -> conv
haftmann@24423
    43
  val unoverload_const: theory -> string * typ -> string
haftmann@24423
    44
  val inst_const: theory -> string * string -> string
haftmann@24423
    45
  val param_const: theory -> string -> (string * string) option
haftmann@24435
    46
  val params_of_sort: theory -> sort -> (string * (string * typ)) list
haftmann@24218
    47
end;
haftmann@24218
    48
haftmann@24218
    49
structure Class : CLASS =
haftmann@24218
    50
struct
haftmann@24218
    51
haftmann@24218
    52
(** auxiliary **)
haftmann@24218
    53
haftmann@24218
    54
fun fork_mixfix is_loc some_class mx =
haftmann@24218
    55
  let
haftmann@24218
    56
    val mx' = Syntax.unlocalize_mixfix mx;
haftmann@24218
    57
    val mx_global = if is_some some_class orelse (is_loc andalso mx = mx')
haftmann@24218
    58
      then NoSyn else mx';
haftmann@24218
    59
    val mx_local = if is_loc then mx else NoSyn;
haftmann@24218
    60
  in (mx_global, mx_local) end;
haftmann@24218
    61
haftmann@24589
    62
fun prove_interpretation tac prfx_atts expr insts =
haftmann@24589
    63
  Locale.interpretation_i I prfx_atts expr insts
haftmann@24589
    64
  #> Proof.global_terminal_proof
haftmann@24589
    65
      (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@24589
    66
  #> ProofContext.theory_of;
haftmann@24589
    67
haftmann@24589
    68
fun prove_interpretation_in tac after_qed (name, expr) =
haftmann@24589
    69
  Locale.interpretation_in_locale
haftmann@24589
    70
      (ProofContext.theory after_qed) (name, expr)
haftmann@24589
    71
  #> Proof.global_terminal_proof
haftmann@24589
    72
      (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
haftmann@24589
    73
  #> ProofContext.theory_of;
haftmann@24589
    74
haftmann@24589
    75
fun OF_LAST thm1 thm2 =
haftmann@24589
    76
  let
haftmann@24589
    77
    val n = (length o Logic.strip_imp_prems o prop_of) thm2;
haftmann@24589
    78
  in (thm1 RSN (n, thm2)) end;
haftmann@24589
    79
haftmann@24589
    80
fun strip_all_ofclass thy sort =
haftmann@24589
    81
  let
haftmann@24589
    82
    val typ = TVar ((AxClass.param_tyvarname, 0), sort);
haftmann@24589
    83
    fun prem_inclass t =
haftmann@24589
    84
      case Logic.strip_imp_prems t
haftmann@24589
    85
       of ofcls :: _ => try Logic.dest_inclass ofcls
haftmann@24589
    86
        | [] => NONE;
haftmann@24589
    87
    fun strip_ofclass class thm =
haftmann@24589
    88
      thm OF (fst o AxClass.of_sort thy (typ, [class])) AxClass.cache;
haftmann@24589
    89
    fun strip thm = case (prem_inclass o Thm.prop_of) thm
haftmann@24589
    90
     of SOME (_, class) => thm |> strip_ofclass class |> strip
haftmann@24589
    91
      | NONE => thm;
haftmann@24589
    92
  in strip end;
haftmann@24589
    93
haftmann@24589
    94
haftmann@24589
    95
(** axclass command **)
haftmann@24589
    96
haftmann@24218
    97
fun axclass_cmd (class, raw_superclasses) raw_specs thy =
haftmann@24218
    98
  let
haftmann@24218
    99
    val ctxt = ProofContext.init thy;
haftmann@24218
   100
    val superclasses = map (Sign.read_class thy) raw_superclasses;
haftmann@24589
   101
    val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst)
haftmann@24589
   102
      raw_specs;
haftmann@24589
   103
    val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd)
haftmann@24589
   104
          raw_specs)
haftmann@24218
   105
      |> snd
haftmann@24218
   106
      |> (map o map) fst;
haftmann@24589
   107
  in
haftmann@24589
   108
    AxClass.define_class (class, superclasses) []
haftmann@24589
   109
      (name_atts ~~ axiomss) thy
haftmann@24589
   110
  end;
haftmann@24218
   111
haftmann@24218
   112
local
haftmann@24218
   113
haftmann@24218
   114
fun gen_instance mk_prop add_thm after_qed insts thy =
haftmann@24218
   115
  let
haftmann@24218
   116
    fun after_qed' results =
haftmann@24218
   117
      ProofContext.theory ((fold o fold) add_thm results #> after_qed);
haftmann@24218
   118
  in
haftmann@24218
   119
    thy
haftmann@24218
   120
    |> ProofContext.init
haftmann@24589
   121
    |> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])])
haftmann@24589
   122
        o maps (mk_prop thy)) insts)
haftmann@24218
   123
  end;
haftmann@24218
   124
haftmann@24218
   125
in
haftmann@24218
   126
haftmann@24589
   127
val instance_arity =
haftmann@24218
   128
  gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity;
haftmann@24589
   129
val classrel =
haftmann@24218
   130
  gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel))
haftmann@24218
   131
    AxClass.add_classrel I o single;
haftmann@24589
   132
val classrel_cmd =
haftmann@24589
   133
  gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel))
haftmann@24589
   134
    AxClass.add_classrel I o single;
haftmann@24218
   135
haftmann@24218
   136
end; (*local*)
haftmann@24218
   137
haftmann@24218
   138
haftmann@24589
   139
(** explicit constants for overloaded definitions **)
haftmann@24304
   140
haftmann@24304
   141
structure InstData = TheoryDataFun
haftmann@24304
   142
(
haftmann@24423
   143
  type T = (string * thm) Symtab.table Symtab.table * (string * string) Symtab.table;
haftmann@24423
   144
    (*constant name ~> type constructor ~> (constant name, equation),
haftmann@24423
   145
        constant name ~> (constant name, type constructor)*)
haftmann@24423
   146
  val empty = (Symtab.empty, Symtab.empty);
haftmann@24304
   147
  val copy = I;
haftmann@24304
   148
  val extend = I;
haftmann@24423
   149
  fun merge _ ((taba1, tabb1), (taba2, tabb2)) =
haftmann@24423
   150
    (Symtab.join (K (Symtab.merge (K true))) (taba1, taba2),
haftmann@24423
   151
      Symtab.merge (K true) (tabb1, tabb2));
haftmann@24304
   152
);
haftmann@24304
   153
haftmann@24589
   154
fun inst_thms f thy = (Symtab.fold (Symtab.fold (cons o f o snd o snd) o snd) o fst)
haftmann@24589
   155
    (InstData.get thy) [];
haftmann@24589
   156
fun add_inst (c, tyco) inst = (InstData.map o apfst
haftmann@24589
   157
      o Symtab.map_default (c, Symtab.empty)) (Symtab.update_new (tyco, inst))
haftmann@24423
   158
  #> (InstData.map o apsnd) (Symtab.update_new (fst inst, (c, tyco)));
haftmann@24304
   159
haftmann@24589
   160
fun unoverload thy = MetaSimplifier.rewrite false (inst_thms I thy);
haftmann@24589
   161
fun overload thy = MetaSimplifier.rewrite false (inst_thms symmetric thy);
haftmann@24304
   162
haftmann@24304
   163
fun inst_const thy (c, tyco) =
haftmann@24423
   164
  (fst o the o Symtab.lookup ((the o Symtab.lookup (fst (InstData.get thy))) c)) tyco;
haftmann@24423
   165
fun unoverload_const thy (c_ty as (c, _)) =
haftmann@24423
   166
  case AxClass.class_of_param thy c
haftmann@24423
   167
   of SOME class => (case Sign.const_typargs thy c_ty
haftmann@24589
   168
       of [Type (tyco, _)] => (case Symtab.lookup
haftmann@24589
   169
           ((the o Symtab.lookup (fst (InstData.get thy))) c) tyco
haftmann@24423
   170
             of SOME (c, _) => c
haftmann@24423
   171
              | NONE => c)
haftmann@24423
   172
        | [_] => c)
haftmann@24423
   173
    | NONE => c;
haftmann@24423
   174
haftmann@24423
   175
val param_const = Symtab.lookup o snd o InstData.get;
haftmann@24304
   176
haftmann@24304
   177
fun add_inst_def (class, tyco) (c, ty) thy =
haftmann@24304
   178
  let
haftmann@24304
   179
    val tyco_base = NameSpace.base tyco;
haftmann@24304
   180
    val name_inst = NameSpace.base class ^ "_" ^ tyco_base ^ "_inst";
haftmann@24304
   181
    val c_inst_base = NameSpace.base c ^ "_" ^ tyco_base;
haftmann@24304
   182
  in
haftmann@24304
   183
    thy
haftmann@24304
   184
    |> Sign.sticky_prefix name_inst
haftmann@24435
   185
    |> PureThy.simple_def ("", [])
haftmann@24435
   186
         (((c_inst_base, ty, Syntax.NoSyn), []), Const (c, ty))
haftmann@24435
   187
    |-> (fn (c_inst, thm) => add_inst (c, tyco) (c_inst, symmetric thm))
haftmann@24435
   188
    |> Sign.restore_naming thy
haftmann@24304
   189
  end;
haftmann@24304
   190
haftmann@24304
   191
fun add_inst_def' (class, tyco) (c, ty) thy =
haftmann@24423
   192
  if case Symtab.lookup (fst (InstData.get thy)) c
haftmann@24304
   193
   of NONE => true
haftmann@24304
   194
    | SOME tab => is_none (Symtab.lookup tab tyco)
haftmann@24304
   195
  then add_inst_def (class, tyco) (c, Logic.unvarifyT ty) thy
haftmann@24304
   196
  else thy;
haftmann@24304
   197
haftmann@24304
   198
fun add_def ((class, tyco), ((name, prop), atts)) thy =
haftmann@24304
   199
  let
haftmann@24589
   200
    val ((lhs as Const (c, ty), args), rhs) =
haftmann@24589
   201
      (apfst Term.strip_comb o Logic.dest_equals) prop;
haftmann@24304
   202
    fun add_inst' def ([], (Const (c_inst, ty))) =
haftmann@24423
   203
          if forall (fn TFree _ => true | _ => false) (Sign.const_typargs thy (c_inst, ty))
haftmann@24304
   204
          then add_inst (c, tyco) (c_inst, def)
haftmann@24304
   205
          else add_inst_def (class, tyco) (c, ty)
haftmann@24304
   206
      | add_inst' _ t = add_inst_def (class, tyco) (c, ty);
haftmann@24304
   207
  in
haftmann@24304
   208
    thy
haftmann@24304
   209
    |> PureThy.add_defs_i true [((name, prop), map (Attrib.attribute thy) atts)]
haftmann@24304
   210
    |-> (fn [def] => add_inst' def (args, rhs) #> pair def)
haftmann@24304
   211
  end;
haftmann@24304
   212
haftmann@24304
   213
haftmann@24589
   214
(** instances with implicit parameter handling **)
haftmann@24218
   215
haftmann@24218
   216
local
haftmann@24218
   217
haftmann@24218
   218
fun gen_read_def thy prep_att read_def ((raw_name, raw_atts), raw_t) =
haftmann@24218
   219
  let
haftmann@24218
   220
    val (_, t) = read_def thy (raw_name, raw_t);
haftmann@24218
   221
    val ((c, ty), _) = Sign.cert_def (Sign.pp thy) t;
haftmann@24218
   222
    val atts = map (prep_att thy) raw_atts;
haftmann@24218
   223
    val insts = Consts.typargs (Sign.consts_of thy) (c, ty);
haftmann@24218
   224
    val name = case raw_name
haftmann@24218
   225
     of "" => NONE
haftmann@24218
   226
      | _ => SOME raw_name;
haftmann@24218
   227
  in (c, (insts, ((name, t), atts))) end;
haftmann@24218
   228
haftmann@24218
   229
fun read_def_cmd thy = gen_read_def thy Attrib.intern_src Theory.read_axm;
haftmann@24218
   230
fun read_def thy = gen_read_def thy (K I) (K I);
haftmann@24218
   231
haftmann@24589
   232
fun gen_instance prep_arity read_def do_proof raw_arities raw_defs after_qed theory =
haftmann@24218
   233
  let
haftmann@24218
   234
    val arities = map (prep_arity theory) raw_arities;
haftmann@24218
   235
    val _ = if null arities then error "at least one arity must be given" else ();
haftmann@24218
   236
    val _ = case (duplicates (op =) o map #1) arities
haftmann@24218
   237
     of [] => ()
haftmann@24218
   238
      | dupl_tycos => error ("type constructors occur more than once in arities: "
haftmann@24218
   239
          ^ (commas o map quote) dupl_tycos);
haftmann@24589
   240
    val super_sort =
haftmann@24589
   241
      (Graph.all_succs o #classes o Sorts.rep_algebra o Sign.classes_of) theory;
haftmann@24218
   242
    fun get_consts_class tyco ty class =
haftmann@24218
   243
      let
haftmann@24218
   244
        val cs = (these o Option.map snd o try (AxClass.params_of_class theory)) class;
haftmann@24218
   245
        val subst_ty = map_type_tfree (K ty);
haftmann@24218
   246
      in
haftmann@24304
   247
        map (fn (c, ty) => (c, ((class, tyco), subst_ty ty))) cs
haftmann@24218
   248
      end;
haftmann@24218
   249
    fun get_consts_sort (tyco, asorts, sort) =
haftmann@24218
   250
      let
haftmann@24589
   251
        val ty = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort))
haftmann@24589
   252
          (Name.names Name.context "'a" asorts))
haftmann@24218
   253
      in maps (get_consts_class tyco ty) (super_sort sort) end;
haftmann@24218
   254
    val cs = maps get_consts_sort arities;
haftmann@24218
   255
    fun mk_typnorm thy (ty, ty_sc) =
haftmann@24218
   256
      case try (Sign.typ_match thy (Logic.varifyT ty_sc, ty)) Vartab.empty
haftmann@24218
   257
       of SOME env => SOME (Logic.varifyT #> Envir.typ_subst_TVars env #> Logic.unvarifyT)
haftmann@24218
   258
        | NONE => NONE;
haftmann@24218
   259
    fun read_defs defs cs thy_read =
haftmann@24218
   260
      let
haftmann@24218
   261
        fun read raw_def cs =
haftmann@24218
   262
          let
haftmann@24218
   263
            val (c, (inst, ((name_opt, t), atts))) = read_def thy_read raw_def;
haftmann@24218
   264
            val ty = Consts.instance (Sign.consts_of thy_read) (c, inst);
haftmann@24304
   265
            val ((class, tyco), ty') = case AList.lookup (op =) cs c
haftmann@24218
   266
             of NONE => error ("illegal definition for constant " ^ quote c)
haftmann@24218
   267
              | SOME class_ty => class_ty;
haftmann@24218
   268
            val name = case name_opt
haftmann@24218
   269
             of NONE => Thm.def_name (Logic.name_arity (tyco, [], c))
haftmann@24218
   270
              | SOME name => name;
haftmann@24218
   271
            val t' = case mk_typnorm thy_read (ty', ty)
haftmann@24218
   272
             of NONE => error ("illegal definition for constant " ^
haftmann@24218
   273
                  quote (c ^ "::" ^ setmp show_sorts true
haftmann@24218
   274
                    (Sign.string_of_typ thy_read) ty))
haftmann@24218
   275
              | SOME norm => map_types norm t
haftmann@24218
   276
          in (((class, tyco), ((name, t'), atts)), AList.delete (op =) c cs) end;
haftmann@24218
   277
      in fold_map read defs cs end;
haftmann@24304
   278
    val (defs, other_cs) = read_defs raw_defs cs
haftmann@24218
   279
      (fold Sign.primitive_arity arities (Theory.copy theory));
haftmann@24218
   280
    fun get_remove_contraint c thy =
haftmann@24218
   281
      let
haftmann@24218
   282
        val ty = Sign.the_const_constraint thy c;
haftmann@24218
   283
      in
haftmann@24218
   284
        thy
haftmann@24218
   285
        |> Sign.add_const_constraint_i (c, NONE)
haftmann@24218
   286
        |> pair (c, Logic.unvarifyT ty)
haftmann@24218
   287
      end;
haftmann@24423
   288
    fun after_qed' cs defs =
haftmann@24304
   289
      fold Sign.add_const_constraint_i (map (apsnd SOME) cs)
haftmann@24423
   290
      #> after_qed defs;
haftmann@24218
   291
  in
haftmann@24218
   292
    theory
haftmann@24218
   293
    |> fold_map get_remove_contraint (map fst cs |> distinct (op =))
haftmann@24304
   294
    ||>> fold_map add_def defs
haftmann@24304
   295
    ||> fold (fn (c, ((class, tyco), ty)) => add_inst_def' (class, tyco) (c, ty)) other_cs
haftmann@24423
   296
    |-> (fn (cs, defs) => do_proof (after_qed' cs defs) arities defs)
haftmann@24218
   297
  end;
haftmann@24218
   298
haftmann@24423
   299
fun tactic_proof tac f arities defs =
haftmann@24218
   300
  fold (fn arity => AxClass.prove_arity arity tac) arities
haftmann@24423
   301
  #> f
haftmann@24423
   302
  #> pair defs;
haftmann@24218
   303
haftmann@24218
   304
in
haftmann@24218
   305
haftmann@24589
   306
val instance = gen_instance Sign.cert_arity read_def
haftmann@24589
   307
  (fn f => fn arities => fn defs => instance_arity f arities);
haftmann@24589
   308
val instance_cmd = gen_instance Sign.read_arity read_def_cmd
haftmann@24589
   309
  (fn f => fn arities => fn defs => instance_arity f arities);
haftmann@24589
   310
fun prove_instance tac arities defs =
haftmann@24589
   311
  gen_instance Sign.cert_arity read_def
haftmann@24589
   312
    (tactic_proof tac) arities defs (K I);
haftmann@24218
   313
haftmann@24218
   314
end; (*local*)
haftmann@24218
   315
haftmann@24218
   316
haftmann@24218
   317
haftmann@24589
   318
(** class data **)
haftmann@24218
   319
haftmann@24218
   320
datatype class_data = ClassData of {
haftmann@24218
   321
  locale: string,
haftmann@24218
   322
  consts: (string * string) list
haftmann@24218
   323
    (*locale parameter ~> toplevel theory constant*),
haftmann@24218
   324
  v: string option,
haftmann@24589
   325
  inst: typ Symtab.table * term Symtab.table
haftmann@24589
   326
    (*canonical interpretation*),
haftmann@24218
   327
  intro: thm
haftmann@24218
   328
} * thm list (*derived defs*);
haftmann@24218
   329
haftmann@24218
   330
fun rep_classdata (ClassData c) = c;
haftmann@24218
   331
haftmann@24218
   332
fun merge_pair f1 f2 ((x1, y1), (x2, y2)) = (f1 (x1, x2), f2 (y1, y2));
haftmann@24218
   333
haftmann@24218
   334
structure ClassData = TheoryDataFun
haftmann@24218
   335
(
haftmann@24218
   336
  type T = class_data Graph.T * class Symtab.table (*locale name ~> class name*);
haftmann@24218
   337
  val empty = (Graph.empty, Symtab.empty);
haftmann@24218
   338
  val copy = I;
haftmann@24218
   339
  val extend = I;
haftmann@24218
   340
  fun merge _ = merge_pair (Graph.merge (K true)) (Symtab.merge (K true));
haftmann@24218
   341
);
haftmann@24218
   342
haftmann@24218
   343
haftmann@24218
   344
(* queries *)
haftmann@24218
   345
haftmann@24589
   346
val lookup_class_data = Option.map rep_classdata oo try o Graph.get_node
haftmann@24589
   347
  o fst o ClassData.get;
haftmann@24218
   348
fun class_of_locale thy = Symtab.lookup ((snd o ClassData.get) thy);
haftmann@24218
   349
haftmann@24589
   350
fun the_class_data thy class = case lookup_class_data thy class
haftmann@24589
   351
 of NONE => error ("undeclared class " ^ quote class)
haftmann@24589
   352
  | SOME data => data;
haftmann@24218
   353
haftmann@24218
   354
val ancestry = Graph.all_succs o fst o ClassData.get;
haftmann@24218
   355
haftmann@24435
   356
fun params_of_sort thy =
haftmann@24218
   357
  let
haftmann@24218
   358
    fun params class =
haftmann@24218
   359
      let
haftmann@24218
   360
        val const_typs = (#params o AxClass.get_definition thy) class;
haftmann@24218
   361
        val const_names = (#consts o fst o the_class_data thy) class;
haftmann@24218
   362
      in
haftmann@24218
   363
        (map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names
haftmann@24218
   364
      end;
haftmann@24218
   365
  in maps params o ancestry thy end;
haftmann@24218
   366
haftmann@24218
   367
fun these_defs thy = maps (these o Option.map snd o lookup_class_data thy) o ancestry thy;
haftmann@24218
   368
haftmann@24218
   369
fun these_intros thy =
haftmann@24218
   370
  Graph.fold (fn (_, (data, _)) => insert Thm.eq_thm ((#intro o fst o rep_classdata) data))
haftmann@24218
   371
    ((fst o ClassData.get) thy) [];
haftmann@24218
   372
haftmann@24218
   373
fun print_classes thy =
haftmann@24218
   374
  let
haftmann@24218
   375
    val algebra = Sign.classes_of thy;
haftmann@24218
   376
    val arities =
haftmann@24218
   377
      Symtab.empty
haftmann@24218
   378
      |> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) =>
haftmann@24218
   379
           Symtab.map_default (class, []) (insert (op =) tyco)) arities)
haftmann@24218
   380
             ((#arities o Sorts.rep_algebra) algebra);
haftmann@24218
   381
    val the_arities = these o Symtab.lookup arities;
haftmann@24218
   382
    fun mk_arity class tyco =
haftmann@24218
   383
      let
haftmann@24218
   384
        val Ss = Sorts.mg_domain algebra tyco [class];
haftmann@24218
   385
      in Sign.pretty_arity thy (tyco, Ss, [class]) end;
haftmann@24218
   386
    fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: "
haftmann@24218
   387
      ^ setmp show_sorts false (Sign.string_of_typ thy o Type.strip_sorts) ty);
haftmann@24218
   388
    fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [
haftmann@24218
   389
      (SOME o Pretty.str) ("class " ^ class ^ ":"),
haftmann@24218
   390
      (SOME o Pretty.block) [Pretty.str "supersort: ",
haftmann@24218
   391
        (Sign.pretty_sort thy o Sign.certify_sort thy o Sign.super_classes thy) class],
haftmann@24218
   392
      Option.map (Pretty.str o prefix "locale: " o #locale o fst) (lookup_class_data thy class),
haftmann@24218
   393
      ((fn [] => NONE | ps => (SOME o Pretty.block o Pretty.fbreaks) (Pretty.str "parameters:" :: ps)) o map mk_param
haftmann@24218
   394
        o these o Option.map #params o try (AxClass.get_definition thy)) class,
haftmann@24218
   395
      (SOME o Pretty.block o Pretty.breaks) [
haftmann@24218
   396
        Pretty.str "instances:",
haftmann@24218
   397
        Pretty.list "" "" (map (mk_arity class) (the_arities class))
haftmann@24218
   398
      ]
haftmann@24218
   399
    ]
haftmann@24218
   400
  in
haftmann@24589
   401
    (Pretty.writeln o Pretty.chunks o separate (Pretty.str "")
haftmann@24589
   402
      o map mk_entry o Sorts.all_classes) algebra
haftmann@24218
   403
  end;
haftmann@24218
   404
haftmann@24218
   405
haftmann@24218
   406
(* updaters *)
haftmann@24218
   407
haftmann@24589
   408
fun add_class_data ((class, superclasses), (locale, consts, v, inst, intro)) =
haftmann@24218
   409
  ClassData.map (fn (gr, tab) => (
haftmann@24218
   410
    gr
haftmann@24218
   411
    |> Graph.new_node (class, ClassData ({ locale = locale, consts = consts,
haftmann@24589
   412
         v = v, inst = inst, intro = intro }, []))
haftmann@24218
   413
    |> fold (curry Graph.add_edge class) superclasses,
haftmann@24218
   414
    tab
haftmann@24218
   415
    |> Symtab.update (locale, class)
haftmann@24218
   416
  ));
haftmann@24218
   417
haftmann@24218
   418
fun add_class_const_thm (class, thm) = (ClassData.map o apfst o Graph.map_node class)
haftmann@24218
   419
  (fn ClassData (data, thms) => ClassData (data, thm :: thms));
haftmann@24218
   420
haftmann@24589
   421
haftmann@24589
   422
(** rule calculation, tactics and methods **)
haftmann@24589
   423
haftmann@24589
   424
fun class_intro thy locale class sups =
haftmann@24589
   425
  let
haftmann@24589
   426
    fun class_elim class =
haftmann@24589
   427
      case (map Drule.unconstrainTs o #axioms o AxClass.get_definition thy) class
haftmann@24589
   428
       of [thm] => SOME thm
haftmann@24589
   429
        | [] => NONE;
haftmann@24589
   430
    val pred_intro = case Locale.intros thy locale
haftmann@24589
   431
     of ([ax_intro], [intro]) => intro |> OF_LAST ax_intro |> SOME
haftmann@24589
   432
      | ([intro], []) => SOME intro
haftmann@24589
   433
      | ([], [intro]) => SOME intro
haftmann@24589
   434
      | _ => NONE;
haftmann@24589
   435
    val pred_intro' = pred_intro
haftmann@24589
   436
      |> Option.map (fn intro => intro OF map_filter class_elim sups);
haftmann@24589
   437
    val class_intro = (#intro o AxClass.get_definition thy) class;
haftmann@24589
   438
    val raw_intro = case pred_intro'
haftmann@24589
   439
     of SOME pred_intro => class_intro |> OF_LAST pred_intro
haftmann@24589
   440
      | NONE => class_intro;
haftmann@24589
   441
    val sort = Sign.super_classes thy class;
haftmann@24589
   442
    val typ = TVar ((AxClass.param_tyvarname, 0), sort);
haftmann@24589
   443
    val defs = these_defs thy sups;
haftmann@24589
   444
  in
haftmann@24589
   445
    raw_intro
haftmann@24589
   446
    |> Drule.instantiate' [SOME (Thm.ctyp_of thy typ)] []
haftmann@24589
   447
    |> strip_all_ofclass thy sort
haftmann@24589
   448
    |> Thm.strip_shyps
haftmann@24589
   449
    |> MetaSimplifier.rewrite_rule defs
haftmann@24589
   450
    |> Drule.unconstrainTs
haftmann@24589
   451
  end;
haftmann@24589
   452
haftmann@24589
   453
fun class_interpretation class facts defs thy =
haftmann@24589
   454
  let
haftmann@24589
   455
    val ({ locale, inst, ... }, _) = the_class_data thy class;
haftmann@24589
   456
    val tac = (ALLGOALS o ProofContext.fact_tac) facts;
haftmann@24589
   457
    val prfx = Logic.const_of_class (NameSpace.base class);
haftmann@24589
   458
  in
haftmann@24589
   459
    prove_interpretation tac ((false, prfx), []) (Locale.Locale locale)
haftmann@24589
   460
      (inst, defs) thy
haftmann@24589
   461
  end;
haftmann@24589
   462
haftmann@24589
   463
fun interpretation_in_rule thy (class1, class2) =
haftmann@24589
   464
  let
haftmann@24589
   465
    fun mk_axioms class =
haftmann@24589
   466
      let
haftmann@24589
   467
        val ({ locale, inst = (_, insttab), ... }, _) = the_class_data thy class;
haftmann@24589
   468
      in
haftmann@24589
   469
        Locale.global_asms_of thy locale
haftmann@24589
   470
        |> maps snd
haftmann@24589
   471
        |> (map o map_aterms) (fn Free (s, _) => (the o Symtab.lookup insttab) s | t => t)
haftmann@24589
   472
        |> (map o map_types o map_atyps) (fn TFree _ => TFree ("'a", [class1]) | T => T)
haftmann@24589
   473
        |> map (ObjectLogic.ensure_propT thy)
haftmann@24589
   474
      end;
haftmann@24589
   475
    val (prems, concls) = pairself mk_axioms (class1, class2);
haftmann@24589
   476
  in
haftmann@24589
   477
    Goal.prove_global thy [] prems (Logic.mk_conjunction_list concls)
haftmann@24589
   478
      (Locale.intro_locales_tac true (ProofContext.init thy))
haftmann@24589
   479
  end;
haftmann@24218
   480
haftmann@24218
   481
fun intro_classes_tac facts st =
haftmann@24218
   482
  let
haftmann@24218
   483
    val thy = Thm.theory_of_thm st;
haftmann@24218
   484
    val classes = Sign.all_classes thy;
haftmann@24218
   485
    val class_trivs = map (Thm.class_triv thy) classes;
haftmann@24218
   486
    val class_intros = these_intros thy;
haftmann@24218
   487
    fun add_axclass_intro class =
haftmann@24218
   488
      case try (AxClass.get_definition thy) class of SOME {intro, ...} => cons intro | _ => I;
haftmann@24218
   489
    val axclass_intros = fold add_axclass_intro classes [];
haftmann@24218
   490
  in
haftmann@24218
   491
    st
haftmann@24218
   492
    |> ((ALLGOALS (Method.insert_tac facts THEN'
haftmann@24218
   493
          REPEAT_ALL_NEW (resolve_tac (class_trivs @ class_intros @ axclass_intros))))
haftmann@24218
   494
            THEN Tactic.distinct_subgoals_tac)
haftmann@24218
   495
  end;
haftmann@24218
   496
haftmann@24218
   497
fun default_intro_classes_tac [] = intro_classes_tac []
haftmann@24218
   498
  | default_intro_classes_tac _ = Tactical.no_tac;    (*no error message!*)
haftmann@24218
   499
haftmann@24218
   500
fun default_tac rules ctxt facts =
haftmann@24218
   501
  HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
haftmann@24218
   502
    default_intro_classes_tac facts;
haftmann@24218
   503
haftmann@24218
   504
val _ = Context.add_setup (Method.add_methods
haftmann@24218
   505
 [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
haftmann@24218
   506
    "back-chain introduction rules of classes"),
haftmann@24218
   507
  ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
haftmann@24218
   508
    "apply some intro/elim rule")]);
haftmann@24218
   509
haftmann@24218
   510
haftmann@24589
   511
(** classes and class target **)
haftmann@24218
   512
haftmann@24589
   513
(* class definition *)
haftmann@24218
   514
haftmann@24218
   515
local
haftmann@24218
   516
haftmann@24218
   517
fun read_param thy raw_t =
haftmann@24218
   518
  let
haftmann@24218
   519
    val t = Sign.read_term thy raw_t
haftmann@24218
   520
  in case try dest_Const t
haftmann@24218
   521
   of SOME (c, _) => c
haftmann@24218
   522
    | NONE => error ("Not a constant: " ^ Sign.string_of_term thy t)
haftmann@24218
   523
  end;
haftmann@24218
   524
haftmann@24218
   525
fun gen_class add_locale prep_class prep_param bname
haftmann@24218
   526
    raw_supclasses raw_elems raw_other_consts thy =
haftmann@24218
   527
  let
haftmann@24589
   528
    fun mk_instT class = Symtab.empty
haftmann@24589
   529
      |> Symtab.update (AxClass.param_tyvarname, TFree (AxClass.param_tyvarname, [class]));
haftmann@24589
   530
    fun mk_inst class param_names cs =
haftmann@24589
   531
      Symtab.empty
haftmann@24589
   532
      |> fold2 (fn v => fn (c, ty) => Symtab.update (v, Const
haftmann@24589
   533
           (c, Term.map_type_tfree (fn (v, _) => TFree (v, [class])) ty))) param_names cs;
haftmann@24218
   534
    (*FIXME need proper concept for reading locale statements*)
haftmann@24218
   535
    fun subst_classtyvar (_, _) =
haftmann@24218
   536
          TFree (AxClass.param_tyvarname, [])
haftmann@24218
   537
      | subst_classtyvar (v, sort) =
haftmann@24589
   538
          error ("Sort constraint illegal in type class, for type variable "
haftmann@24589
   539
            ^ v ^ "::" ^ Sign.string_of_sort thy sort);
haftmann@24218
   540
    (*val subst_classtyvars = Element.map_ctxt {name = I, var = I, term = I,
haftmann@24218
   541
      typ = Term.map_type_tfree subst_classtyvar, fact = I, attrib = I};*)
haftmann@24218
   542
    val other_consts = map (prep_param thy) raw_other_consts;
haftmann@24218
   543
    val (elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e)
haftmann@24218
   544
      | Locale.Expr i => apsnd (cons i)) raw_elems ([], []);
haftmann@24218
   545
    val supclasses = map (prep_class thy) raw_supclasses;
haftmann@24218
   546
    val sups = filter (is_some o lookup_class_data thy) supclasses
haftmann@24218
   547
      |> Sign.certify_sort thy;
haftmann@24218
   548
    val supsort = Sign.certify_sort thy supclasses;
haftmann@24218
   549
    val suplocales = map (Locale.Locale o #locale o fst o the_class_data thy) sups;
haftmann@24218
   550
    val supexpr = Locale.Merge (suplocales @ includes);
haftmann@24218
   551
    val supparams = (map fst o Locale.parameters_of_expr thy)
haftmann@24218
   552
      (Locale.Merge suplocales);
haftmann@24435
   553
    val supconsts = AList.make (the o AList.lookup (op =) (params_of_sort thy sups))
haftmann@24218
   554
      (map fst supparams);
haftmann@24218
   555
    (*val elems_constrains = map
haftmann@24218
   556
      (Element.Constrains o apsnd (Term.map_type_tfree subst_classtyvar)) supparams;*)
haftmann@24218
   557
    fun mk_tyvar (_, sort) = TFree (AxClass.param_tyvarname,
haftmann@24218
   558
      if Sign.subsort thy (supsort, sort) then sort else error
haftmann@24218
   559
        ("Sort " ^ Sign.string_of_sort thy sort
haftmann@24218
   560
          ^ " is less general than permitted least general sort "
haftmann@24218
   561
          ^ Sign.string_of_sort thy supsort));
haftmann@24218
   562
    fun extract_params thy name_locale =
haftmann@24218
   563
      let
haftmann@24218
   564
        val params = Locale.parameters_of thy name_locale;
haftmann@24218
   565
        val v = case (maps typ_tfrees o map (snd o fst)) params
haftmann@24218
   566
         of (v, _) :: _ => SOME v
haftmann@24218
   567
          | _ => NONE;
haftmann@24218
   568
      in
haftmann@24218
   569
        (v, (map (fst o fst) params, params
haftmann@24218
   570
        |> (map o apfst o apsnd o Term.map_type_tfree) mk_tyvar
haftmann@24218
   571
        |> (map o apsnd) (fork_mixfix true NONE #> fst)
haftmann@24218
   572
        |> chop (length supconsts)
haftmann@24218
   573
        |> snd))
haftmann@24218
   574
      end;
haftmann@24218
   575
    fun extract_assumes name_locale params thy cs =
haftmann@24218
   576
      let
haftmann@24218
   577
        val consts = supconsts @ (map (fst o fst) params ~~ cs);
haftmann@24218
   578
        fun subst (Free (c, ty)) =
haftmann@24218
   579
              Const ((fst o the o AList.lookup (op =) consts) c, ty)
haftmann@24218
   580
          | subst t = t;
haftmann@24218
   581
        val super_defs = these_defs thy sups;
haftmann@24218
   582
        fun prep_asm ((name, atts), ts) =
haftmann@24218
   583
          ((NameSpace.base name, map (Attrib.attribute thy) atts),
haftmann@24589
   584
            (map o map_aterms) subst ts);
haftmann@24218
   585
      in
haftmann@24218
   586
        Locale.global_asms_of thy name_locale
haftmann@24218
   587
        |> map prep_asm
haftmann@24218
   588
      end;
haftmann@24218
   589
    fun note_intro name_axclass class_intro =
haftmann@24218
   590
      PureThy.note_thmss_qualified "" ((Logic.const_of_class o NameSpace.base) name_axclass)
haftmann@24218
   591
        [(("intro", []), [([class_intro], [])])]
haftmann@24218
   592
      #> snd
haftmann@24218
   593
  in
haftmann@24218
   594
    thy
haftmann@24218
   595
    |> add_locale (SOME "") bname supexpr ((*elems_constrains @*) elems)
haftmann@24218
   596
    |-> (fn name_locale => ProofContext.theory_result (
haftmann@24218
   597
      `(fn thy => extract_params thy name_locale)
haftmann@24218
   598
      #-> (fn (v, (param_names, params)) =>
haftmann@24589
   599
        AxClass.define_class_params (bname, supsort) params
haftmann@24589
   600
          (extract_assumes name_locale params) other_consts
haftmann@24589
   601
      #-> (fn (name_axclass, (consts, axioms)) =>
haftmann@24218
   602
        `(fn thy => class_intro thy name_locale name_axclass sups)
haftmann@24218
   603
      #-> (fn class_intro =>
haftmann@24218
   604
        add_class_data ((name_axclass, sups),
haftmann@24218
   605
          (name_locale, map (fst o fst) params ~~ map fst consts, v,
haftmann@24589
   606
            (mk_instT name_axclass, mk_inst name_axclass param_names
haftmann@24589
   607
              (map snd supconsts @ consts)), class_intro))
haftmann@24218
   608
      #> note_intro name_axclass class_intro
haftmann@24589
   609
      #> class_interpretation name_axclass axioms []
haftmann@24218
   610
      #> pair name_axclass
haftmann@24218
   611
      )))))
haftmann@24218
   612
  end;
haftmann@24218
   613
haftmann@24218
   614
in
haftmann@24218
   615
haftmann@24218
   616
val class_cmd = gen_class Locale.add_locale Sign.intern_class read_param;
haftmann@24218
   617
val class = gen_class Locale.add_locale_i Sign.certify_class (K I);
haftmann@24218
   618
haftmann@24218
   619
end; (*local*)
haftmann@24218
   620
haftmann@24218
   621
haftmann@24589
   622
(* definition in class target *)
haftmann@24218
   623
haftmann@24218
   624
fun export_fixes thy class =
haftmann@24218
   625
  let
haftmann@24218
   626
    val v = (#v o fst o the_class_data thy) class;
haftmann@24218
   627
    val constrain_sort = curry (Sorts.inter_sort (Sign.classes_of thy)) [class];
haftmann@24218
   628
    val subst_typ = Term.map_type_tfree (fn var as (w, sort) =>
haftmann@24218
   629
      if SOME w = v then TFree (w, constrain_sort sort) else TFree var);
haftmann@24435
   630
    val consts = params_of_sort thy [class];
haftmann@24218
   631
    fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) consts v
haftmann@24218
   632
         of SOME (c, _) => Const (c, ty)
haftmann@24218
   633
          | NONE => t)
haftmann@24218
   634
      | subst_aterm t = t;
haftmann@24218
   635
  in map_types subst_typ #> Term.map_aterms subst_aterm end;
haftmann@24218
   636
haftmann@24218
   637
fun add_const_in_class class ((c, rhs), syn) thy =
haftmann@24218
   638
  let
haftmann@24218
   639
    val prfx = (Logic.const_of_class o NameSpace.base) class;
haftmann@24218
   640
    fun mk_name inject c =
haftmann@24218
   641
      let
haftmann@24218
   642
        val n1 = Sign.full_name thy c;
haftmann@24218
   643
        val n2 = NameSpace.qualifier n1;
haftmann@24218
   644
        val n3 = NameSpace.base n1;
haftmann@24218
   645
      in NameSpace.implode (n2 :: inject @ [n3]) end;
haftmann@24218
   646
    val abbr' = mk_name [prfx, prfx] c;
haftmann@24218
   647
    val rhs' = export_fixes thy class rhs;
haftmann@24218
   648
    val ty' = Term.fastype_of rhs';
haftmann@24218
   649
    val def = (c, Logic.mk_equals (Const (mk_name [prfx] c, ty'), rhs'));
haftmann@24218
   650
    val (syn', _) = fork_mixfix true NONE syn;
haftmann@24218
   651
    fun interpret def =
haftmann@24218
   652
      let
haftmann@24589
   653
        val def' = symmetric def;
haftmann@24218
   654
        val def_eq = Thm.prop_of def';
haftmann@24218
   655
      in
haftmann@24589
   656
        class_interpretation class [def'] [def_eq]
haftmann@24218
   657
        #> add_class_const_thm (class, def')
haftmann@24218
   658
      end;
haftmann@24218
   659
  in
haftmann@24218
   660
    thy
haftmann@24218
   661
    |> Sign.hide_consts_i true [abbr']
haftmann@24218
   662
    |> Sign.add_path prfx
haftmann@24218
   663
    |> Sign.add_consts_authentic [(c, ty', syn')]
haftmann@24218
   664
    |> Sign.parent_path
haftmann@24218
   665
    |> Sign.sticky_prefix prfx
haftmann@24218
   666
    |> PureThy.add_defs_i false [(def, [])]
haftmann@24218
   667
    |-> (fn [def] => interpret def)
haftmann@24218
   668
    |> Sign.restore_naming thy
haftmann@24218
   669
  end;
haftmann@24218
   670
haftmann@24589
   671
haftmann@24589
   672
(* interpretation in class target *)
haftmann@24589
   673
haftmann@24589
   674
local
haftmann@24589
   675
haftmann@24589
   676
fun gen_interpretation_in_class prep_class do_proof (raw_class, raw_superclass) theory =
haftmann@24589
   677
  let
haftmann@24589
   678
    val class = prep_class theory raw_class;
haftmann@24589
   679
    val superclass = prep_class theory raw_superclass;
haftmann@24589
   680
    val loc_name = (#locale o fst o the_class_data theory) class;
haftmann@24589
   681
    val loc_expr = (Locale.Locale o #locale o fst o the_class_data theory) superclass;
haftmann@24589
   682
    fun prove_classrel (class, superclass) thy =
haftmann@24589
   683
      let
haftmann@24589
   684
        val classes = (Graph.all_succs o #classes o Sorts.rep_algebra
haftmann@24589
   685
              o Sign.classes_of) thy [superclass]
haftmann@24589
   686
          |> filter_out (fn class' => Sign.subsort thy ([class], [class']));
haftmann@24589
   687
        fun instance_subclass (class1, class2) thy  =
haftmann@24589
   688
          let
haftmann@24589
   689
            val interp = interpretation_in_rule thy (class1, class2);
haftmann@24589
   690
            val ax = #axioms (AxClass.get_definition thy class1);
haftmann@24589
   691
            val intro = #intro (AxClass.get_definition thy class2)
haftmann@24589
   692
              |> Drule.instantiate' [SOME (Thm.ctyp_of thy
haftmann@24589
   693
                  (TVar ((AxClass.param_tyvarname, 0), [class1])))] [];
haftmann@24589
   694
            val thm = 
haftmann@24589
   695
              intro
haftmann@24589
   696
              |> OF_LAST (interp OF ax)
haftmann@24589
   697
              |> strip_all_ofclass thy (Sign.super_classes thy class2);
haftmann@24589
   698
          in
haftmann@24589
   699
            thy |> AxClass.add_classrel thm
haftmann@24589
   700
          end;
haftmann@24589
   701
      in
haftmann@24589
   702
        thy |> fold_rev (curry instance_subclass class) classes
haftmann@24589
   703
      end;
haftmann@24589
   704
  in
haftmann@24589
   705
    theory
haftmann@24589
   706
    |> do_proof (prove_classrel (class, superclass)) (loc_name, loc_expr)
haftmann@24589
   707
  end;
haftmann@24589
   708
haftmann@24589
   709
in
haftmann@24589
   710
haftmann@24589
   711
val interpretation_in_class = gen_interpretation_in_class Sign.certify_class
haftmann@24589
   712
  (Locale.interpretation_in_locale o ProofContext.theory);
haftmann@24589
   713
val interpretation_in_class_cmd = gen_interpretation_in_class Sign.read_class
haftmann@24589
   714
  (Locale.interpretation_in_locale o ProofContext.theory);
haftmann@24589
   715
val prove_interpretation_in_class = gen_interpretation_in_class Sign.certify_class
haftmann@24589
   716
  o prove_interpretation_in;
haftmann@24589
   717
haftmann@24589
   718
end; (*local*)
haftmann@24589
   719
haftmann@24218
   720
end;