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