src/Pure/Isar/class.ML
author haftmann
Wed Jan 21 16:47:02 2009 +0100 (2009-01-21)
changeset 29575 41d604e59e93
parent 29558 9846af6c6d6a
child 29608 564ea783ace8
permissions -rw-r--r--
improved and corrected reading of class specs -- still draft version
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@29358
    27
(** define classes **)
haftmann@24218
    28
haftmann@24218
    29
local
haftmann@24218
    30
haftmann@29547
    31
fun calculate thy class sups base_sort param_map assm_axiom =
haftmann@29547
    32
  let
haftmann@29547
    33
    val empty_ctxt = ProofContext.init thy;
haftmann@29547
    34
haftmann@29547
    35
    (* instantiation of canonical interpretation *)
haftmann@29547
    36
    (*FIXME inst_morph should be calculated manually and not instantiate constraint*)
haftmann@29575
    37
    val aT = TFree (Name.aT, base_sort);
haftmann@29547
    38
    val (([props], [(_, inst_morph)], export_morph), _) = empty_ctxt
haftmann@29547
    39
      |> Expression.cert_goal_expression ([(class, (("", false),
haftmann@29547
    40
           Expression.Named ((map o apsnd) Const param_map)))], []);
haftmann@29547
    41
haftmann@29547
    42
    (* witness for canonical interpretation *)
haftmann@29547
    43
    val prop = try the_single props;
haftmann@29547
    44
    val wit = Option.map (fn prop => let
haftmann@29547
    45
        val sup_axioms = map_filter (fst o rules thy) sups;
haftmann@29547
    46
        val loc_intro_tac = case Locale.intros_of thy class
haftmann@29547
    47
          of (_, NONE) => all_tac
haftmann@29547
    48
           | (_, SOME intro) => ALLGOALS (Tactic.rtac intro);
haftmann@29547
    49
        val tac = loc_intro_tac
haftmann@29547
    50
          THEN ALLGOALS (ProofContext.fact_tac (sup_axioms @ the_list assm_axiom))
haftmann@29547
    51
      in Element.prove_witness empty_ctxt prop tac end) prop;
haftmann@29547
    52
    val axiom = Option.map Element.conclude_witness wit;
haftmann@29547
    53
haftmann@29547
    54
    (* canonical interpretation *)
haftmann@29547
    55
    val base_morph = inst_morph
haftmann@29547
    56
      $> Morphism.binding_morphism
haftmann@29547
    57
           (Binding.add_prefix false (class_prefix class))
haftmann@29547
    58
      $> Element.satisfy_morphism (the_list wit);
haftmann@29547
    59
    val defs = these_defs thy sups;
haftmann@29547
    60
    val eq_morph = Element.eq_morphism thy defs;
haftmann@29547
    61
    val morph = base_morph $> eq_morph;
haftmann@29547
    62
haftmann@29547
    63
    (* assm_intro *)
haftmann@29547
    64
    fun prove_assm_intro thm = 
haftmann@29547
    65
      let
haftmann@29547
    66
        val prop = thm |> Thm.prop_of |> Logic.unvarify
haftmann@29547
    67
          |> Morphism.term (inst_morph $> eq_morph) 
haftmann@29547
    68
          |> (map_types o map_atyps) (K aT);
haftmann@29547
    69
        fun tac ctxt = LocalDefs.unfold_tac ctxt (map Thm.symmetric defs) (*FIXME*)
haftmann@29547
    70
          THEN ALLGOALS (ProofContext.fact_tac [thm]);
haftmann@29547
    71
      in Goal.prove_global thy [] [] prop (tac o #context) end;
haftmann@29547
    72
    val assm_intro = Option.map prove_assm_intro
haftmann@29547
    73
      (fst (Locale.intros_of thy class));
haftmann@29547
    74
haftmann@29547
    75
    (* of_class *)
haftmann@29547
    76
    val of_class_prop_concl = Logic.mk_inclass (aT, class);
haftmann@29547
    77
    val of_class_prop = case prop of NONE => of_class_prop_concl
haftmann@29547
    78
      | SOME prop => Logic.mk_implies (Morphism.term inst_morph prop,
haftmann@29547
    79
          of_class_prop_concl) |> (map_types o map_atyps) (K aT)
haftmann@29547
    80
    val sup_of_classes = map (snd o rules thy) sups;
haftmann@29547
    81
    val loc_axiom_intros = map Drule.standard' (Locale.axioms_of thy class);
haftmann@29547
    82
    val axclass_intro = #intro (AxClass.get_info thy class);
haftmann@29547
    83
    val base_sort_trivs = Drule.sort_triv thy (aT, base_sort);
haftmann@29547
    84
    val tac = REPEAT (SOMEGOAL
haftmann@29547
    85
      (Tactic.match_tac (axclass_intro :: sup_of_classes
haftmann@29547
    86
         @ loc_axiom_intros @ base_sort_trivs)
haftmann@29547
    87
           ORELSE' Tactic.assume_tac));
haftmann@29547
    88
    val of_class = Goal.prove_global thy [] [] of_class_prop (K tac);
haftmann@29547
    89
haftmann@29547
    90
  in (base_morph, morph, export_morph, axiom, assm_intro, of_class) end;
haftmann@29547
    91
haftmann@29575
    92
fun add_typ_check level name f = Context.proof_map (Syntax.add_typ_check level name (fn xs => fn ctxt =>
haftmann@29575
    93
  let val xs' = f xs in if eq_list (op =) (xs, xs') then NONE else SOME (xs', ctxt) end));
haftmann@29575
    94
haftmann@29575
    95
fun singleton_infer_param change_sort = (map o map_atyps) (fn T as TVar (vi as (_, i), sort) =>
haftmann@29575
    96
      if TypeInfer.is_param vi then TypeInfer.param i (Name.aT, change_sort sort)
haftmann@29575
    97
      else error ("Illegal schematic type variable in class specification: " ^ Term.string_of_vname vi)
haftmann@29575
    98
        (*FIXME does not occur*)
haftmann@29575
    99
  | T as TFree (v, sort) =>
haftmann@29575
   100
      if v = Name.aT then T
haftmann@29575
   101
      else error ("No type variable other than " ^ Name.aT ^ " allowed in class specification"));
haftmann@29575
   102
haftmann@29575
   103
val singleton_fixate = (map o map_atyps) (fn TVar (vi, sort)
haftmann@29575
   104
  => TFree (Name.aT, sort) | T => T);
haftmann@29575
   105
haftmann@29575
   106
fun add_tfrees_of_element (Element.Fixes fxs) = fold (fn (_, SOME T, _) => Term.add_tfreesT T
haftmann@29575
   107
      | _ => I) fxs
haftmann@29575
   108
  | add_tfrees_of_element (Element.Constrains cnstrs) = fold (Term.add_tfreesT o snd) cnstrs
haftmann@29575
   109
  | add_tfrees_of_element (Element.Assumes assms) = fold (fold (fn (t, ts) =>
haftmann@29575
   110
      Term.add_tfrees t #> fold Term.add_tfrees ts) o snd) assms
haftmann@29575
   111
  | add_tfrees_of_element _ = I;
haftmann@29575
   112
haftmann@29575
   113
fun fork_syn (Element.Fixes xs) =
haftmann@29575
   114
      fold_map (fn (c, ty, syn) => cons (Binding.base_name c, syn) #> pair (c, ty, NoSyn)) xs
haftmann@29575
   115
      #>> Element.Fixes
haftmann@29575
   116
  | fork_syn x = pair x;
haftmann@29575
   117
haftmann@29575
   118
fun prep_class_spec prep_class prep_decl thy raw_supclasses raw_elems =
haftmann@29575
   119
  let
haftmann@29575
   120
    (* prepare import *)
haftmann@29575
   121
    val inter_sort = curry (Sorts.inter_sort (Sign.classes_of thy));
haftmann@29575
   122
    val (sups, others_basesort) = map (prep_class thy) raw_supclasses
haftmann@29575
   123
      |> Sign.minimize_sort thy
haftmann@29575
   124
      |> List.partition (is_class thy);
haftmann@29575
   125
haftmann@29575
   126
    val supparams = (map o apsnd) (snd o snd) (these_params thy sups);
haftmann@29575
   127
    val supparam_names = map fst supparams;
haftmann@29575
   128
    val _ = if has_duplicates (op =) supparam_names
haftmann@29575
   129
      then error ("Duplicate parameter(s) in superclasses: "
haftmann@29575
   130
        ^ (commas o map quote o duplicates (op =)) supparam_names)
haftmann@29575
   131
      else ();
haftmann@29575
   132
    val supexpr = (map (fn sup => (sup, (("", false), Expression.Positional [])))
haftmann@29575
   133
      sups, []);
haftmann@29575
   134
    val given_basesort = fold inter_sort (map (base_sort thy) sups) others_basesort;
haftmann@29575
   135
haftmann@29575
   136
    (* infer types and base sort *)
haftmann@29575
   137
    val base_constraints = (map o apsnd)
haftmann@29575
   138
      (map_type_tfree (K (TVar ((Name.aT, 0), given_basesort))) o fst o snd)
haftmann@29575
   139
        (these_operations thy sups);
haftmann@29575
   140
    val ((_, _, inferred_elems), _) = ProofContext.init thy
haftmann@29575
   141
      |> fold (ProofContext.add_const_constraint o apsnd SOME) base_constraints
haftmann@29575
   142
      |> add_typ_check ~1 "singleton_infer_param" (singleton_infer_param (inter_sort given_basesort))
haftmann@29575
   143
      |> add_typ_check ~2 "singleton_fixate" singleton_fixate
haftmann@29575
   144
      |> prep_decl supexpr raw_elems;
haftmann@29575
   145
    (*FIXME propagation of given base sort into class spec broken*)
haftmann@29575
   146
    (*FIXME check for *all* side conditions here, extra check function for elements,
haftmann@29575
   147
      less side-condition checks in check phase*)
haftmann@29575
   148
    val base_sort = if null inferred_elems then given_basesort else
haftmann@29575
   149
      case fold add_tfrees_of_element inferred_elems []
haftmann@29575
   150
       of [] => error "No type variable in class specification"
haftmann@29575
   151
        | [(_, sort)] => sort
haftmann@29575
   152
        | _ => error "Multiple type variables in class specification"
haftmann@29575
   153
    val sup_sort = inter_sort base_sort sups
haftmann@29575
   154
haftmann@29575
   155
    (* process elements as class specification *)
haftmann@29575
   156
    val begin_ctxt = begin sups base_sort
haftmann@29575
   157
      #> fold (Variable.declare_constraints o Free) ((map o apsnd o map_atyps)
haftmann@29575
   158
          (K (TFree (Name.aT, base_sort))) supparams)
haftmann@29575
   159
            (*FIXME should constraints be issued in begin?*)
haftmann@29575
   160
    val ((_, _, syntax_elems), _) = ProofContext.init thy
haftmann@29575
   161
      |> begin_ctxt
haftmann@29575
   162
      |> Expression.cert_declaration supexpr inferred_elems;
haftmann@29575
   163
    val (elems, global_syntax) = fold_map fork_syn syntax_elems [];
haftmann@29575
   164
    val constrain = Element.Constrains ((map o apsnd o map_atyps)
haftmann@29575
   165
      (K (TFree (Name.aT, base_sort))) supparams);
haftmann@29575
   166
      (*FIXME 2009 perhaps better: control type variable by explicit
haftmann@29575
   167
      parameter instantiation of import expression*)
haftmann@29575
   168
  in (((sups, supparam_names), (sup_sort, base_sort, supexpr)), (constrain :: elems, global_syntax)) end;
haftmann@29575
   169
haftmann@29575
   170
val cert_class_spec = prep_class_spec (K I) Expression.cert_declaration;
haftmann@29575
   171
val read_class_spec = prep_class_spec Sign.intern_class Expression.cert_read_declaration;
haftmann@29575
   172
haftmann@29575
   173
(*fun prep_class_spec prep_class process_decl thy raw_supclasses raw_elems =
haftmann@24218
   174
  let
haftmann@29526
   175
    (*FIXME 2009 simplify*)
haftmann@24748
   176
    val supclasses = map (prep_class thy) raw_supclasses;
haftmann@24748
   177
    val supsort = Sign.minimize_sort thy supclasses;
haftmann@29547
   178
    val (sups, bases) = List.partition (is_class thy) supsort;
haftmann@29509
   179
    val base_sort = if null sups then supsort else
haftmann@29547
   180
      Library.foldr (Sorts.inter_sort (Sign.classes_of thy))
haftmann@29547
   181
        (map (base_sort thy) sups, bases);
haftmann@29509
   182
    val supparams = (map o apsnd) (snd o snd) (these_params thy sups);
haftmann@29509
   183
    val supparam_names = map fst supparams;
haftmann@26995
   184
    val _ = if has_duplicates (op =) supparam_names
haftmann@26995
   185
      then error ("Duplicate parameter(s) in superclasses: "
haftmann@26995
   186
        ^ (commas o map quote o duplicates (op =)) supparam_names)
haftmann@26995
   187
      else ();
haftmann@29509
   188
haftmann@29509
   189
    val supexpr = (map (fn sup => (sup, (("", false), Expression.Positional [])))
haftmann@29509
   190
      sups, []);
haftmann@24748
   191
    val constrain = Element.Constrains ((map o apsnd o map_atyps)
haftmann@26167
   192
      (K (TFree (Name.aT, base_sort))) supparams);
haftmann@29526
   193
      (*FIXME 2009 perhaps better: control type variable by explicit
haftmann@29509
   194
      parameter instantiation of import expression*)
haftmann@29509
   195
    val begin_ctxt = begin sups base_sort
haftmann@29509
   196
      #> fold (Variable.declare_constraints o Free) ((map o apsnd o map_atyps)
haftmann@29509
   197
          (K (TFree (Name.aT, base_sort))) supparams) (*FIXME
haftmann@29509
   198
            should constraints be issued in begin?*)
haftmann@29509
   199
    val ((_, _, syntax_elems), _) = ProofContext.init thy
haftmann@29509
   200
      |> begin_ctxt
haftmann@29509
   201
      |> process_decl supexpr raw_elems;
haftmann@25683
   202
    fun fork_syn (Element.Fixes xs) =
haftmann@29006
   203
          fold_map (fn (c, ty, syn) => cons (Binding.base_name c, syn) #> pair (c, ty, NoSyn)) xs
haftmann@25683
   204
          #>> Element.Fixes
haftmann@25683
   205
      | fork_syn x = pair x;
haftmann@29509
   206
    val (elems, global_syntax) = fold_map fork_syn syntax_elems [];
haftmann@29509
   207
  in (((sups, supparam_names), (supsort, base_sort, supexpr)), (constrain :: elems, global_syntax)) end;
haftmann@24748
   208
haftmann@29558
   209
val cert_class_spec = prep_class_spec (K I) Expression.cert_declaration;
haftmann@29575
   210
val read_class_spec = prep_class_spec Sign.intern_class Expression.cert_read_declaration;*)
haftmann@24748
   211
haftmann@28715
   212
fun add_consts bname class base_sort sups supparams global_syntax thy =
wenzelm@24968
   213
  let
haftmann@29526
   214
    (*FIXME 2009 simplify*)
haftmann@29509
   215
    val supconsts = supparams
haftmann@26518
   216
      |> AList.make (snd o the o AList.lookup (op =) (these_params thy sups))
haftmann@25683
   217
      |> (map o apsnd o apsnd o map_atyps o K o TFree) (Name.aT, [class]);
haftmann@29509
   218
    val all_params = Locale.params_of thy class;
haftmann@28715
   219
    val raw_params = (snd o chop (length supparams)) all_params;
haftmann@29509
   220
    fun add_const (b, SOME raw_ty, _) thy =
haftmann@25683
   221
      let
haftmann@29509
   222
        val v = Binding.base_name b;
haftmann@28965
   223
        val c = Sign.full_bname thy v;
haftmann@25683
   224
        val ty = map_atyps (K (TFree (Name.aT, base_sort))) raw_ty;
haftmann@25683
   225
        val ty0 = Type.strip_sorts ty;
haftmann@25683
   226
        val ty' = map_atyps (K (TFree (Name.aT, [class]))) ty0;
haftmann@25683
   227
        val syn = (the_default NoSyn o AList.lookup (op =) global_syntax) v;
haftmann@25683
   228
      in
haftmann@25683
   229
        thy
haftmann@28965
   230
        |> Sign.declare_const [] ((Binding.name v, ty0), syn)
haftmann@25683
   231
        |> snd
haftmann@25683
   232
        |> pair ((v, ty), (c, ty'))
haftmann@25683
   233
      end;
haftmann@28715
   234
  in
haftmann@28715
   235
    thy
haftmann@29547
   236
    |> Sign.add_path (class_prefix class)
haftmann@28715
   237
    |> fold_map add_const raw_params
haftmann@28715
   238
    ||> Sign.restore_naming thy
haftmann@28715
   239
    |-> (fn params => pair (supconsts @ (map o apfst) fst params, params))
haftmann@28715
   240
  end;
haftmann@28715
   241
haftmann@28715
   242
fun adjungate_axclass bname class base_sort sups supsort supparams global_syntax thy =
haftmann@28715
   243
  let
haftmann@29526
   244
    (*FIXME 2009 simplify*)
haftmann@25683
   245
    fun globalize param_map = map_aterms
haftmann@25683
   246
      (fn Free (v, ty) => Const ((fst o the o AList.lookup (op =) param_map) v, ty)
haftmann@25683
   247
        | t => t);
haftmann@29509
   248
    val raw_pred = Locale.intros_of thy class
haftmann@25683
   249
      |> fst
haftmann@29509
   250
      |> Option.map (Logic.unvarify o Logic.strip_imp_concl o Thm.prop_of);
haftmann@25683
   251
    fun get_axiom thy = case (#axioms o AxClass.get_info thy) class
haftmann@25683
   252
     of [] => NONE
haftmann@25683
   253
      | [thm] => SOME thm;
wenzelm@24968
   254
  in
wenzelm@24968
   255
    thy
haftmann@28715
   256
    |> add_consts bname class base_sort sups supparams global_syntax
haftmann@25683
   257
    |-> (fn (param_map, params) => AxClass.define_class (bname, supsort)
haftmann@26518
   258
          (map (fst o snd) params)
haftmann@29526
   259
          [((Binding.empty, []),
haftmann@29509
   260
            Option.map (globalize param_map) raw_pred |> the_list)]
haftmann@25683
   261
    #> snd
haftmann@25683
   262
    #> `get_axiom
haftmann@25683
   263
    #-> (fn assm_axiom => fold (Sign.add_const_constraint o apsnd SOME o snd) params
haftmann@29526
   264
    #> pair (param_map, params, assm_axiom)))
wenzelm@24968
   265
  end;
wenzelm@24968
   266
haftmann@26518
   267
fun gen_class prep_spec bname raw_supclasses raw_elems thy =
haftmann@24748
   268
  let
haftmann@28965
   269
    val class = Sign.full_bname thy bname;
haftmann@29509
   270
    val (((sups, supparams), (supsort, base_sort, supexpr)), (elems, global_syntax)) =
haftmann@26247
   271
      prep_spec thy raw_supclasses raw_elems;
haftmann@24218
   272
  in
haftmann@24218
   273
    thy
haftmann@29509
   274
    |> Expression.add_locale bname "" supexpr elems
haftmann@29509
   275
    |> snd |> LocalTheory.exit_global
haftmann@26518
   276
    |> adjungate_axclass bname class base_sort sups supsort supparams global_syntax
haftmann@29526
   277
    |-> (fn (param_map, params, assm_axiom) =>
haftmann@29547
   278
       `(fn thy => calculate thy class sups base_sort param_map assm_axiom)
haftmann@29547
   279
    #-> (fn (base_morph, morph, export_morph, axiom, assm_intro, of_class) =>
haftmann@29547
   280
       Locale.add_registration (class, (morph, export_morph))
haftmann@29547
   281
    #> Locale.activate_global_facts (class, morph $> export_morph)
haftmann@29547
   282
    #> register class sups params base_sort base_morph axiom assm_intro of_class))
haftmann@29378
   283
    |> TheoryTarget.init (SOME class)
haftmann@25038
   284
    |> pair class
haftmann@24218
   285
  end;
haftmann@24218
   286
haftmann@24218
   287
in
haftmann@24218
   288
haftmann@29509
   289
val class = gen_class cert_class_spec;
haftmann@26518
   290
val class_cmd = gen_class read_class_spec;
haftmann@24218
   291
haftmann@24218
   292
end; (*local*)
haftmann@24218
   293
haftmann@24218
   294
haftmann@29358
   295
(** subclass relations **)
haftmann@25462
   296
haftmann@29358
   297
local
haftmann@25462
   298
haftmann@29358
   299
fun gen_subclass prep_class do_proof raw_sup lthy =
haftmann@25462
   300
  let
haftmann@29358
   301
    val thy = ProofContext.theory_of lthy;
haftmann@29558
   302
    val proto_sup = prep_class thy raw_sup;
haftmann@29558
   303
    val proto_sub = case TheoryTarget.peek lthy
haftmann@29558
   304
     of {is_class = false, ...} => error "Not in a class context"
haftmann@29358
   305
      | {target, ...} => target;
haftmann@29558
   306
    val (sub, sup) = AxClass.cert_classrel thy (proto_sub, proto_sup)
haftmann@29509
   307
haftmann@29509
   308
    val expr = ([(sup, (("", false), Expression.Positional []))], []);
haftmann@29558
   309
    val (([props], deps, export), goal_ctxt) =
haftmann@29509
   310
      Expression.cert_goal_expression expr lthy;
haftmann@29526
   311
    val some_prop = try the_single props;
haftmann@29558
   312
    val some_dep_morph = try the_single (map snd deps);
haftmann@29558
   313
    fun after_qed some_wit =
haftmann@29558
   314
      ProofContext.theory (register_subclass (sub, sup)
haftmann@29558
   315
        some_dep_morph some_wit export)
haftmann@29558
   316
      #> ProofContext.theory_of #> TheoryTarget.init (SOME sub);
haftmann@29558
   317
  in do_proof after_qed some_prop goal_ctxt end;
haftmann@25485
   318
haftmann@29575
   319
fun user_proof after_qed some_prop =
haftmann@29575
   320
  Element.witness_proof (after_qed o try the_single o the_single)
haftmann@29575
   321
    [the_list some_prop];
haftmann@25485
   322
haftmann@29575
   323
fun tactic_proof tac after_qed some_prop ctxt =
haftmann@29575
   324
  after_qed (Option.map
haftmann@29575
   325
    (fn prop => Element.prove_witness ctxt prop tac) some_prop) ctxt;
haftmann@28666
   326
haftmann@29358
   327
in
haftmann@28666
   328
haftmann@29358
   329
val subclass = gen_subclass (K I) user_proof;
haftmann@29358
   330
fun prove_subclass tac = gen_subclass (K I) (tactic_proof tac);
haftmann@29358
   331
val subclass_cmd = gen_subclass Sign.read_class user_proof;
haftmann@25462
   332
haftmann@29358
   333
end; (*local*)
haftmann@29358
   334
haftmann@24218
   335
end;