src/Pure/Isar/class.ML
author haftmann
Sun Feb 01 19:58:02 2009 +0100 (2009-02-01)
changeset 29702 a7512f22e916
parent 29665 2b956243d123
child 29797 08ef36ed2f8a
permissions -rw-r--r--
proper declared constants in class expressions
haftmann@29358
     1
(*  Title:      Pure/Isar/ML
haftmann@24218
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@24218
     3
haftmann@29575
     4
Type classes derived from primitive axclasses and locales - interfaces.
haftmann@24218
     5
*)
haftmann@24218
     6
haftmann@24218
     7
signature CLASS =
haftmann@24218
     8
sig
haftmann@29358
     9
  include CLASS_TARGET
haftmann@29439
    10
    (*FIXME the split into class_target.ML, theory_target.ML and
haftmann@29439
    11
      class.ML is artificial*)
haftmann@29358
    12
haftmann@26247
    13
  val class: bstring -> class list -> Element.context_i list
haftmann@29378
    14
    -> theory -> string * local_theory
haftmann@26247
    15
  val class_cmd: bstring -> xstring list -> Element.context list
haftmann@29378
    16
    -> theory -> string * local_theory
haftmann@29358
    17
  val prove_subclass: tactic -> class -> local_theory -> local_theory
haftmann@29358
    18
  val subclass: class -> local_theory -> Proof.state
haftmann@29358
    19
  val subclass_cmd: xstring -> local_theory -> Proof.state
haftmann@24218
    20
end;
haftmann@24218
    21
haftmann@24218
    22
structure Class : CLASS =
haftmann@24218
    23
struct
haftmann@24218
    24
haftmann@29358
    25
open Class_Target;
haftmann@28715
    26
haftmann@29665
    27
(** class definitions **)
haftmann@24218
    28
haftmann@24218
    29
local
haftmann@24218
    30
haftmann@29665
    31
(* calculating class-related rules including canonical interpretation *)
haftmann@29665
    32
haftmann@29547
    33
fun calculate thy class sups base_sort param_map assm_axiom =
haftmann@29547
    34
  let
haftmann@29547
    35
    val empty_ctxt = ProofContext.init thy;
haftmann@29547
    36
haftmann@29547
    37
    (* instantiation of canonical interpretation *)
haftmann@29575
    38
    val aT = TFree (Name.aT, base_sort);
haftmann@29627
    39
    val param_map_const = (map o apsnd) Const param_map;
haftmann@29627
    40
    val param_map_inst = (map o apsnd)
haftmann@29627
    41
      (Const o apsnd (map_atyps (K aT))) param_map;
haftmann@29627
    42
    val const_morph = Element.inst_morphism thy
haftmann@29627
    43
      (Symtab.empty, Symtab.make param_map_inst);
haftmann@29547
    44
    val (([props], [(_, inst_morph)], export_morph), _) = empty_ctxt
haftmann@29547
    45
      |> Expression.cert_goal_expression ([(class, (("", false),
haftmann@29627
    46
           Expression.Named param_map_const))], []);
haftmann@29547
    47
haftmann@29547
    48
    (* witness for canonical interpretation *)
haftmann@29547
    49
    val prop = try the_single props;
haftmann@29547
    50
    val wit = Option.map (fn prop => let
haftmann@29547
    51
        val sup_axioms = map_filter (fst o rules thy) sups;
haftmann@29547
    52
        val loc_intro_tac = case Locale.intros_of thy class
haftmann@29547
    53
          of (_, NONE) => all_tac
haftmann@29547
    54
           | (_, SOME intro) => ALLGOALS (Tactic.rtac intro);
haftmann@29547
    55
        val tac = loc_intro_tac
haftmann@29547
    56
          THEN ALLGOALS (ProofContext.fact_tac (sup_axioms @ the_list assm_axiom))
haftmann@29547
    57
      in Element.prove_witness empty_ctxt prop tac end) prop;
haftmann@29547
    58
    val axiom = Option.map Element.conclude_witness wit;
haftmann@29547
    59
haftmann@29547
    60
    (* canonical interpretation *)
haftmann@29547
    61
    val base_morph = inst_morph
haftmann@29547
    62
      $> Morphism.binding_morphism
haftmann@29547
    63
           (Binding.add_prefix false (class_prefix class))
haftmann@29547
    64
      $> Element.satisfy_morphism (the_list wit);
haftmann@29547
    65
    val defs = these_defs thy sups;
haftmann@29547
    66
    val eq_morph = Element.eq_morphism thy defs;
haftmann@29547
    67
    val morph = base_morph $> eq_morph;
haftmann@29547
    68
haftmann@29547
    69
    (* assm_intro *)
haftmann@29547
    70
    fun prove_assm_intro thm = 
haftmann@29547
    71
      let
haftmann@29627
    72
        val ((_, [thm']), _) = Variable.import_thms true [thm] empty_ctxt;
haftmann@29627
    73
        val thm'' = Morphism.thm (const_morph $> eq_morph) thm';
haftmann@29627
    74
        val tac = ALLGOALS (ProofContext.fact_tac [thm'']);
haftmann@29627
    75
      in Goal.prove_global thy [] [] (Thm.prop_of thm'') (K tac) end;
haftmann@29547
    76
    val assm_intro = Option.map prove_assm_intro
haftmann@29547
    77
      (fst (Locale.intros_of thy class));
haftmann@29547
    78
haftmann@29547
    79
    (* of_class *)
haftmann@29547
    80
    val of_class_prop_concl = Logic.mk_inclass (aT, class);
haftmann@29547
    81
    val of_class_prop = case prop of NONE => of_class_prop_concl
haftmann@29627
    82
      | SOME prop => Logic.mk_implies (Morphism.term const_morph
haftmann@29627
    83
          ((map_types o map_atyps) (K aT) prop), of_class_prop_concl);
haftmann@29547
    84
    val sup_of_classes = map (snd o rules thy) sups;
haftmann@29547
    85
    val loc_axiom_intros = map Drule.standard' (Locale.axioms_of thy class);
haftmann@29547
    86
    val axclass_intro = #intro (AxClass.get_info thy class);
haftmann@29547
    87
    val base_sort_trivs = Drule.sort_triv thy (aT, base_sort);
haftmann@29547
    88
    val tac = REPEAT (SOMEGOAL
haftmann@29547
    89
      (Tactic.match_tac (axclass_intro :: sup_of_classes
haftmann@29547
    90
         @ loc_axiom_intros @ base_sort_trivs)
haftmann@29547
    91
           ORELSE' Tactic.assume_tac));
haftmann@29547
    92
    val of_class = Goal.prove_global thy [] [] of_class_prop (K tac);
haftmann@29547
    93
haftmann@29547
    94
  in (base_morph, morph, export_morph, axiom, assm_intro, of_class) end;
haftmann@29547
    95
haftmann@29632
    96
haftmann@29665
    97
(* reading and processing class specifications *)
haftmann@29665
    98
haftmann@29665
    99
fun prep_class_elems prep_decl thy supexpr sups proto_base_sort raw_elems =
haftmann@29632
   100
  let
haftmann@29665
   101
haftmann@29665
   102
    (* user space type system: only permits 'a type variable, improves towards 'a *)
haftmann@29665
   103
    val base_constraints = (map o apsnd)
haftmann@29665
   104
      (map_type_tfree (K (TVar ((Name.aT, 0), proto_base_sort))) o fst o snd)
haftmann@29665
   105
        (these_operations thy sups);
haftmann@29665
   106
    val reject_bcd_etc = (map o map_atyps) (fn T as TFree (v, sort) =>
haftmann@29665
   107
          if v = Name.aT then T
haftmann@29665
   108
          else error ("No type variable other than " ^ Name.aT ^ " allowed in class specification")
haftmann@29665
   109
      | T => T);
haftmann@29665
   110
    fun singleton_fixate thy algebra Ts =
haftmann@29665
   111
      let
haftmann@29665
   112
        fun extract f = (fold o fold_atyps) f Ts [];
haftmann@29665
   113
        val tfrees = extract
haftmann@29665
   114
          (fn TFree (v, sort) => insert (op =) (v, sort) | _ => I);
haftmann@29665
   115
        val inferred_sort = extract
haftmann@29665
   116
          (fn TVar (_, sort) => curry (Sorts.inter_sort algebra) sort | _ => I);
haftmann@29665
   117
        val fixate_sort = if null tfrees then inferred_sort
haftmann@29665
   118
          else let val a_sort = (snd o the_single) tfrees
haftmann@29665
   119
          in if Sorts.sort_le algebra (a_sort, inferred_sort)
haftmann@29665
   120
            then Sorts.inter_sort algebra (a_sort, inferred_sort)
haftmann@29665
   121
            else error ("Type inference imposes additional sort constraint "
haftmann@29665
   122
              ^ Syntax.string_of_sort_global thy inferred_sort
haftmann@29665
   123
              ^ " of type parameter " ^ Name.aT ^ " of sort "
haftmann@29665
   124
              ^ Syntax.string_of_sort_global thy a_sort)
haftmann@29665
   125
          end
haftmann@29665
   126
      in (map o map_atyps) (K (TFree (Name.aT, fixate_sort))) Ts end;
haftmann@29665
   127
    fun add_typ_check level name f = Context.proof_map (Syntax.add_typ_check level name (fn xs => fn ctxt =>
haftmann@29665
   128
      let val xs' = f xs in if eq_list (op =) (xs, xs') then NONE else SOME (xs', ctxt) end));
haftmann@29632
   129
haftmann@29665
   130
    (* preproceesing elements, retrieving base sort from type-checked elements *)
haftmann@29702
   131
    val init_class_body = fold (ProofContext.add_const_constraint o apsnd SOME) base_constraints
haftmann@29702
   132
      #> redeclare_operations thy sups
haftmann@29702
   133
      #> add_typ_check 10 "reject_bcd_etc" reject_bcd_etc
haftmann@29702
   134
      #> add_typ_check ~10 "singleton_fixate" (singleton_fixate thy (Sign.classes_of thy));
haftmann@29665
   135
    val ((_, _, inferred_elems), _) = ProofContext.init thy
haftmann@29702
   136
      |> prep_decl supexpr init_class_body raw_elems;
haftmann@29665
   137
    fun fold_element_types f (Element.Fixes fxs) = fold (fn (_, SOME T, _) => f T) fxs
haftmann@29665
   138
      | fold_element_types f (Element.Constrains cnstrs) = fold (f o snd) cnstrs
haftmann@29665
   139
      | fold_element_types f (Element.Assumes assms) = fold (fold (fn (t, ts) =>
haftmann@29665
   140
          fold_types f t #> (fold o fold_types) f ts) o snd) assms
haftmann@29665
   141
      | fold_element_types f (Element.Defines _) =
haftmann@29665
   142
          error ("\"defines\" element not allowed in class specification.")
haftmann@29665
   143
      | fold_element_types f (Element.Notes _) =
haftmann@29665
   144
          error ("\"notes\" element not allowed in class specification.");
haftmann@29665
   145
    val base_sort = if null inferred_elems then proto_base_sort else
haftmann@29665
   146
      case (fold o fold_element_types) Term.add_tfreesT inferred_elems []
haftmann@29665
   147
       of [] => error "No type variable in class specification"
haftmann@29665
   148
        | [(_, sort)] => sort
haftmann@29665
   149
        | _ => error "Multiple type variables in class specification"
haftmann@29575
   150
haftmann@29665
   151
  in (base_sort, inferred_elems) end;
haftmann@29575
   152
haftmann@29665
   153
val cert_class_elems = prep_class_elems Expression.cert_declaration;
haftmann@29665
   154
val read_class_elems = prep_class_elems Expression.cert_read_declaration;
haftmann@29575
   155
haftmann@29665
   156
fun prep_class_spec prep_class prep_class_elems thy raw_supclasses raw_elems =
haftmann@29575
   157
  let
haftmann@29665
   158
haftmann@29575
   159
    (* prepare import *)
haftmann@29575
   160
    val inter_sort = curry (Sorts.inter_sort (Sign.classes_of thy));
haftmann@29608
   161
    val sups = map (prep_class thy) raw_supclasses
haftmann@29608
   162
      |> Sign.minimize_sort thy;
haftmann@29608
   163
    val _ = case filter_out (is_class thy) sups
haftmann@29608
   164
     of [] => ()
haftmann@29665
   165
      | no_classes => error ("No proper classes: " ^ commas (map quote no_classes));
haftmann@29608
   166
          val supparams = (map o apsnd) (snd o snd) (these_params thy sups);
haftmann@29575
   167
    val supparam_names = map fst supparams;
haftmann@29575
   168
    val _ = if has_duplicates (op =) supparam_names
haftmann@29575
   169
      then error ("Duplicate parameter(s) in superclasses: "
haftmann@29575
   170
        ^ (commas o map quote o duplicates (op =)) supparam_names)
haftmann@29575
   171
      else ();
haftmann@29575
   172
    val supexpr = (map (fn sup => (sup, (("", false), Expression.Positional [])))
haftmann@29575
   173
      sups, []);
haftmann@29608
   174
    val given_basesort = fold inter_sort (map (base_sort thy) sups) [];
haftmann@29575
   175
haftmann@29575
   176
    (* infer types and base sort *)
haftmann@29665
   177
    val (base_sort, inferred_elems) = prep_class_elems thy supexpr sups
haftmann@29665
   178
      given_basesort raw_elems;
haftmann@29575
   179
    val sup_sort = inter_sort base_sort sups
haftmann@29575
   180
haftmann@29575
   181
    (* process elements as class specification *)
haftmann@29665
   182
    val class_ctxt = begin sups base_sort (ProofContext.init thy)
haftmann@29665
   183
    val ((_, _, syntax_elems), _) = class_ctxt
haftmann@29665
   184
      (*#> fold (Variable.declare_constraints o Free) ((map o apsnd o map_atyps)
haftmann@29665
   185
          (K (TFree (Name.aT, base_sort))) supparams) FIXME really necessary?*)
haftmann@29575
   186
            (*FIXME should constraints be issued in begin?*)
haftmann@29702
   187
      |> Expression.cert_declaration supexpr I inferred_elems;
haftmann@29665
   188
    fun check_vars e vs = if null vs
haftmann@29665
   189
      then error ("No type variable in part of specification element "
haftmann@29665
   190
        ^ (Pretty.output o Pretty.chunks) (Element.pretty_ctxt class_ctxt e))
haftmann@29665
   191
      else ();
haftmann@29665
   192
    fun check_element (e as Element.Fixes fxs) =
haftmann@29665
   193
          map (fn (_, SOME T, _) => check_vars e (Term.add_tfreesT T [])) fxs
haftmann@29665
   194
      | check_element (e as Element.Assumes assms) =
haftmann@29665
   195
          maps (fn (_, ts_pss) => map
haftmann@29665
   196
            (fn (t, _) => check_vars e (Term.add_tfrees t [])) ts_pss) assms
haftmann@29665
   197
      | check_element e = [()];
haftmann@29665
   198
    val _ = map check_element syntax_elems;
haftmann@29665
   199
    fun fork_syn (Element.Fixes xs) =
haftmann@29665
   200
          fold_map (fn (c, ty, syn) => cons (Binding.base_name c, syn) #> pair (c, ty, NoSyn)) xs
haftmann@29665
   201
          #>> Element.Fixes
haftmann@29665
   202
      | fork_syn x = pair x;
haftmann@29575
   203
    val (elems, global_syntax) = fold_map fork_syn syntax_elems [];
haftmann@29575
   204
    val constrain = Element.Constrains ((map o apsnd o map_atyps)
haftmann@29575
   205
      (K (TFree (Name.aT, base_sort))) supparams);
haftmann@29575
   206
      (*FIXME 2009 perhaps better: control type variable by explicit
haftmann@29575
   207
      parameter instantiation of import expression*)
haftmann@29665
   208
haftmann@29575
   209
  in (((sups, supparam_names), (sup_sort, base_sort, supexpr)), (constrain :: elems, global_syntax)) end;
haftmann@29575
   210
haftmann@29665
   211
val cert_class_spec = prep_class_spec (K I) cert_class_elems;
haftmann@29665
   212
val read_class_spec = prep_class_spec Sign.intern_class read_class_elems;
haftmann@29665
   213
haftmann@29665
   214
haftmann@29665
   215
(* class establishment *)
haftmann@29575
   216
haftmann@28715
   217
fun add_consts bname class base_sort sups supparams global_syntax thy =
wenzelm@24968
   218
  let
haftmann@29526
   219
    (*FIXME 2009 simplify*)
haftmann@29509
   220
    val supconsts = supparams
haftmann@26518
   221
      |> AList.make (snd o the o AList.lookup (op =) (these_params thy sups))
haftmann@25683
   222
      |> (map o apsnd o apsnd o map_atyps o K o TFree) (Name.aT, [class]);
haftmann@29509
   223
    val all_params = Locale.params_of thy class;
haftmann@28715
   224
    val raw_params = (snd o chop (length supparams)) all_params;
haftmann@29509
   225
    fun add_const (b, SOME raw_ty, _) thy =
haftmann@25683
   226
      let
haftmann@29509
   227
        val v = Binding.base_name b;
haftmann@28965
   228
        val c = Sign.full_bname thy v;
haftmann@25683
   229
        val ty = map_atyps (K (TFree (Name.aT, base_sort))) raw_ty;
haftmann@25683
   230
        val ty0 = Type.strip_sorts ty;
haftmann@25683
   231
        val ty' = map_atyps (K (TFree (Name.aT, [class]))) ty0;
haftmann@25683
   232
        val syn = (the_default NoSyn o AList.lookup (op =) global_syntax) v;
haftmann@25683
   233
      in
haftmann@25683
   234
        thy
haftmann@28965
   235
        |> Sign.declare_const [] ((Binding.name v, ty0), syn)
haftmann@25683
   236
        |> snd
haftmann@25683
   237
        |> pair ((v, ty), (c, ty'))
haftmann@25683
   238
      end;
haftmann@28715
   239
  in
haftmann@28715
   240
    thy
haftmann@29547
   241
    |> Sign.add_path (class_prefix class)
haftmann@28715
   242
    |> fold_map add_const raw_params
haftmann@28715
   243
    ||> Sign.restore_naming thy
haftmann@28715
   244
    |-> (fn params => pair (supconsts @ (map o apfst) fst params, params))
haftmann@28715
   245
  end;
haftmann@28715
   246
haftmann@28715
   247
fun adjungate_axclass bname class base_sort sups supsort supparams global_syntax thy =
haftmann@28715
   248
  let
haftmann@29526
   249
    (*FIXME 2009 simplify*)
haftmann@25683
   250
    fun globalize param_map = map_aterms
haftmann@25683
   251
      (fn Free (v, ty) => Const ((fst o the o AList.lookup (op =) param_map) v, ty)
haftmann@25683
   252
        | t => t);
haftmann@29509
   253
    val raw_pred = Locale.intros_of thy class
haftmann@25683
   254
      |> fst
haftmann@29509
   255
      |> Option.map (Logic.unvarify o Logic.strip_imp_concl o Thm.prop_of);
haftmann@25683
   256
    fun get_axiom thy = case (#axioms o AxClass.get_info thy) class
haftmann@25683
   257
     of [] => NONE
haftmann@25683
   258
      | [thm] => SOME thm;
wenzelm@24968
   259
  in
wenzelm@24968
   260
    thy
haftmann@28715
   261
    |> add_consts bname class base_sort sups supparams global_syntax
haftmann@25683
   262
    |-> (fn (param_map, params) => AxClass.define_class (bname, supsort)
haftmann@26518
   263
          (map (fst o snd) params)
haftmann@29526
   264
          [((Binding.empty, []),
haftmann@29509
   265
            Option.map (globalize param_map) raw_pred |> the_list)]
haftmann@25683
   266
    #> snd
haftmann@25683
   267
    #> `get_axiom
haftmann@25683
   268
    #-> (fn assm_axiom => fold (Sign.add_const_constraint o apsnd SOME o snd) params
haftmann@29526
   269
    #> pair (param_map, params, assm_axiom)))
wenzelm@24968
   270
  end;
wenzelm@24968
   271
haftmann@26518
   272
fun gen_class prep_spec bname raw_supclasses raw_elems thy =
haftmann@24748
   273
  let
haftmann@28965
   274
    val class = Sign.full_bname thy bname;
haftmann@29509
   275
    val (((sups, supparams), (supsort, base_sort, supexpr)), (elems, global_syntax)) =
haftmann@26247
   276
      prep_spec thy raw_supclasses raw_elems;
haftmann@24218
   277
  in
haftmann@24218
   278
    thy
haftmann@29509
   279
    |> Expression.add_locale bname "" supexpr elems
haftmann@29509
   280
    |> snd |> LocalTheory.exit_global
haftmann@26518
   281
    |> adjungate_axclass bname class base_sort sups supsort supparams global_syntax
haftmann@29526
   282
    |-> (fn (param_map, params, assm_axiom) =>
haftmann@29547
   283
       `(fn thy => calculate thy class sups base_sort param_map assm_axiom)
haftmann@29547
   284
    #-> (fn (base_morph, morph, export_morph, axiom, assm_intro, of_class) =>
haftmann@29547
   285
       Locale.add_registration (class, (morph, export_morph))
haftmann@29547
   286
    #> Locale.activate_global_facts (class, morph $> export_morph)
haftmann@29547
   287
    #> register class sups params base_sort base_morph axiom assm_intro of_class))
haftmann@29378
   288
    |> TheoryTarget.init (SOME class)
haftmann@25038
   289
    |> pair class
haftmann@24218
   290
  end;
haftmann@24218
   291
haftmann@24218
   292
in
haftmann@24218
   293
haftmann@29509
   294
val class = gen_class cert_class_spec;
haftmann@26518
   295
val class_cmd = gen_class read_class_spec;
haftmann@24218
   296
haftmann@24218
   297
end; (*local*)
haftmann@24218
   298
haftmann@24218
   299
haftmann@29358
   300
(** subclass relations **)
haftmann@25462
   301
haftmann@29358
   302
local
haftmann@25462
   303
haftmann@29358
   304
fun gen_subclass prep_class do_proof raw_sup lthy =
haftmann@25462
   305
  let
haftmann@29358
   306
    val thy = ProofContext.theory_of lthy;
haftmann@29558
   307
    val proto_sup = prep_class thy raw_sup;
haftmann@29558
   308
    val proto_sub = case TheoryTarget.peek lthy
haftmann@29558
   309
     of {is_class = false, ...} => error "Not in a class context"
haftmann@29358
   310
      | {target, ...} => target;
haftmann@29558
   311
    val (sub, sup) = AxClass.cert_classrel thy (proto_sub, proto_sup)
haftmann@29509
   312
haftmann@29509
   313
    val expr = ([(sup, (("", false), Expression.Positional []))], []);
haftmann@29558
   314
    val (([props], deps, export), goal_ctxt) =
haftmann@29509
   315
      Expression.cert_goal_expression expr lthy;
haftmann@29526
   316
    val some_prop = try the_single props;
haftmann@29558
   317
    val some_dep_morph = try the_single (map snd deps);
haftmann@29558
   318
    fun after_qed some_wit =
haftmann@29558
   319
      ProofContext.theory (register_subclass (sub, sup)
haftmann@29558
   320
        some_dep_morph some_wit export)
haftmann@29558
   321
      #> ProofContext.theory_of #> TheoryTarget.init (SOME sub);
haftmann@29558
   322
  in do_proof after_qed some_prop goal_ctxt end;
haftmann@25485
   323
haftmann@29575
   324
fun user_proof after_qed some_prop =
haftmann@29575
   325
  Element.witness_proof (after_qed o try the_single o the_single)
haftmann@29575
   326
    [the_list some_prop];
haftmann@25485
   327
haftmann@29575
   328
fun tactic_proof tac after_qed some_prop ctxt =
haftmann@29575
   329
  after_qed (Option.map
haftmann@29575
   330
    (fn prop => Element.prove_witness ctxt prop tac) some_prop) ctxt;
haftmann@28666
   331
haftmann@29358
   332
in
haftmann@28666
   333
haftmann@29358
   334
val subclass = gen_subclass (K I) user_proof;
haftmann@29358
   335
fun prove_subclass tac = gen_subclass (K I) (tactic_proof tac);
haftmann@29358
   336
val subclass_cmd = gen_subclass Sign.read_class user_proof;
haftmann@25462
   337
haftmann@29358
   338
end; (*local*)
haftmann@29358
   339
haftmann@24218
   340
end;