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