src/Pure/Isar/class.ML
author haftmann
Wed Feb 27 21:41:05 2008 +0100 (2008-02-27)
changeset 26167 ccc9007a7164
parent 25999 f8bcd311d501
child 26238 c30bb8182da2
permissions -rw-r--r--
proper merge of base sorts
     1 (*  Title:      Pure/Isar/class.ML
     2     ID:         $Id$
     3     Author:     Florian Haftmann, TU Muenchen
     4 
     5 Type classes derived from primitive axclasses and locales.
     6 *)
     7 
     8 signature CLASS =
     9 sig
    10   (*classes*)
    11   val class: bstring -> class list -> Element.context_i Locale.element list
    12     -> string list -> theory -> string * Proof.context
    13   val class_cmd: bstring -> xstring list -> Element.context Locale.element list
    14     -> xstring list -> theory -> string * Proof.context
    15 
    16   val init: class -> theory -> Proof.context
    17   val declare: string -> Markup.property list
    18     -> (string * mixfix) * term -> theory -> theory
    19   val abbrev: string -> Syntax.mode -> Markup.property list
    20     -> (string * mixfix) * term -> theory -> theory
    21   val refresh_syntax: class -> Proof.context -> Proof.context
    22 
    23   val intro_classes_tac: thm list -> tactic
    24   val default_intro_classes_tac: thm list -> tactic
    25   val prove_subclass: class * class -> thm -> theory -> theory
    26 
    27   val class_prefix: string -> string
    28   val is_class: theory -> class -> bool
    29   val these_params: theory -> sort -> (string * (string * typ)) list
    30   val print_classes: theory -> unit
    31 
    32   (*instances*)
    33   val init_instantiation: string list * (string * sort) list * sort -> theory -> local_theory
    34   val instantiation_instance: (local_theory -> local_theory) -> local_theory -> Proof.state
    35   val prove_instantiation_instance: (Proof.context -> tactic) -> local_theory -> local_theory
    36   val conclude_instantiation: local_theory -> local_theory
    37   val instantiation_param: local_theory -> string -> string option
    38   val confirm_declaration: string -> local_theory -> local_theory
    39   val pretty_instantiation: local_theory -> Pretty.T
    40 
    41   (*old axclass layer*)
    42   val axclass_cmd: bstring * xstring list
    43     -> ((bstring * Attrib.src list) * string list) list
    44     -> theory -> class * theory
    45   val classrel_cmd: xstring * xstring -> theory -> Proof.state
    46 
    47   (*old instance layer*)
    48   val instance_arity: (theory -> theory) -> arity -> theory -> Proof.state
    49   val instance_arity_cmd: bstring * xstring list * xstring -> theory -> Proof.state
    50 end;
    51 
    52 structure Class : CLASS =
    53 struct
    54 
    55 (** auxiliary **)
    56 
    57 val classN = "class";
    58 val introN = "intro";
    59 
    60 fun prove_interpretation tac prfx_atts expr inst =
    61   Locale.interpretation_i I prfx_atts expr inst
    62   #> Proof.global_terminal_proof
    63       (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
    64   #> ProofContext.theory_of;
    65 
    66 fun prove_interpretation_in tac after_qed (name, expr) =
    67   Locale.interpretation_in_locale
    68       (ProofContext.theory after_qed) (name, expr)
    69   #> Proof.global_terminal_proof
    70       (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
    71   #> ProofContext.theory_of;
    72 
    73 fun get_remove_global_constraint c thy =
    74   let
    75     val ty = Sign.the_const_constraint thy c;
    76   in
    77     thy
    78     |> Sign.add_const_constraint (c, NONE)
    79     |> pair (c, Logic.unvarifyT ty)
    80   end;
    81 
    82 
    83 (** primitive axclass and instance commands **)
    84 
    85 fun axclass_cmd (class, raw_superclasses) raw_specs thy =
    86   let
    87     val ctxt = ProofContext.init thy;
    88     val superclasses = map (Sign.read_class thy) raw_superclasses;
    89     val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst)
    90       raw_specs;
    91     val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd)
    92           raw_specs)
    93       |> snd
    94       |> (map o map) fst;
    95   in
    96     AxClass.define_class (class, superclasses) []
    97       (name_atts ~~ axiomss) thy
    98   end;
    99 
   100 local
   101 
   102 fun gen_instance mk_prop add_thm after_qed insts thy =
   103   let
   104     fun after_qed' results =
   105       ProofContext.theory ((fold o fold) add_thm results #> after_qed);
   106   in
   107     thy
   108     |> ProofContext.init
   109     |> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])])
   110         o mk_prop thy) insts)
   111   end;
   112 
   113 in
   114 
   115 val instance_arity =
   116   gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity;
   117 val instance_arity_cmd =
   118   gen_instance (Logic.mk_arities oo Sign.read_arity) AxClass.add_arity I;
   119 val classrel =
   120   gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel)) AxClass.add_classrel I;
   121 val classrel_cmd =
   122   gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel)) AxClass.add_classrel I;
   123 
   124 end; (*local*)
   125 
   126 
   127 (** class data **)
   128 
   129 datatype class_data = ClassData of {
   130   consts: (string * string) list
   131     (*locale parameter ~> constant name*),
   132   base_sort: sort,
   133   inst: term option list
   134     (*canonical interpretation*),
   135   morphism: theory -> thm list -> morphism,
   136     (*partial morphism of canonical interpretation*)
   137   assm_intro: thm option,
   138   of_class: thm,
   139   axiom: thm option,
   140   defs: thm list,
   141   operations: (string * (class * (typ * term))) list
   142 };
   143 
   144 fun rep_class_data (ClassData d) = d;
   145 fun mk_class_data ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom),
   146     (defs, operations)) =
   147   ClassData { consts = consts, base_sort = base_sort, inst = inst,
   148     morphism = morphism, assm_intro = assm_intro, of_class = of_class, axiom = axiom, 
   149     defs = defs, operations = operations };
   150 fun map_class_data f (ClassData { consts, base_sort, inst, morphism,
   151     assm_intro, of_class, axiom, defs, operations }) =
   152   mk_class_data (f ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom),
   153     (defs, operations)));
   154 fun merge_class_data _ (ClassData { consts = consts,
   155     base_sort = base_sort, inst = inst, morphism = morphism, assm_intro = assm_intro,
   156     of_class = of_class, axiom = axiom, defs = defs1, operations = operations1 },
   157   ClassData { consts = _, base_sort = _, inst = _, morphism = _, assm_intro = _,
   158     of_class = _, axiom = _, defs = defs2, operations = operations2 }) =
   159   mk_class_data ((consts, base_sort, inst, morphism, assm_intro, of_class, axiom),
   160     (Thm.merge_thms (defs1, defs2),
   161       AList.merge (op =) (K true) (operations1, operations2)));
   162 
   163 structure ClassData = TheoryDataFun
   164 (
   165   type T = class_data Graph.T
   166   val empty = Graph.empty;
   167   val copy = I;
   168   val extend = I;
   169   fun merge _ = Graph.join merge_class_data;
   170 );
   171 
   172 
   173 (* queries *)
   174 
   175 val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node o ClassData.get;
   176 
   177 fun the_class_data thy class = case lookup_class_data thy class
   178  of NONE => error ("Undeclared class " ^ quote class)
   179   | SOME data => data;
   180 
   181 val is_class = is_some oo lookup_class_data;
   182 
   183 val ancestry = Graph.all_succs o ClassData.get;
   184 
   185 fun these_params thy =
   186   let
   187     fun params class =
   188       let
   189         val const_typs = (#params o AxClass.get_info thy) class;
   190         val const_names = (#consts o the_class_data thy) class;
   191       in
   192         (map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names
   193       end;
   194   in maps params o ancestry thy end;
   195 
   196 fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy;
   197 
   198 fun partial_morphism thy class = #morphism (the_class_data thy class) thy [];
   199 fun morphism thy class = #morphism (the_class_data thy class) thy (these_defs thy [class]);
   200 
   201 fun these_assm_intros thy =
   202   Graph.fold (fn (_, (data, _)) => fold (insert Thm.eq_thm)
   203     ((the_list o #assm_intro o rep_class_data) data)) (ClassData.get thy) [];
   204 
   205 fun these_operations thy =
   206   maps (#operations o the_class_data thy) o ancestry thy;
   207 
   208 fun print_classes thy =
   209   let
   210     val ctxt = ProofContext.init thy;
   211     val algebra = Sign.classes_of thy;
   212     val arities =
   213       Symtab.empty
   214       |> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) =>
   215            Symtab.map_default (class, []) (insert (op =) tyco)) arities)
   216              ((#arities o Sorts.rep_algebra) algebra);
   217     val the_arities = these o Symtab.lookup arities;
   218     fun mk_arity class tyco =
   219       let
   220         val Ss = Sorts.mg_domain algebra tyco [class];
   221       in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end;
   222     fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: "
   223       ^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty);
   224     fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [
   225       (SOME o Pretty.str) ("class " ^ Sign.extern_class thy class ^ ":"),
   226       (SOME o Pretty.block) [Pretty.str "supersort: ",
   227         (Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class],
   228       if is_class thy class then (SOME o Pretty.str)
   229         ("locale: " ^ Locale.extern thy class) else NONE,
   230       ((fn [] => NONE | ps => (SOME o Pretty.block o Pretty.fbreaks)
   231           (Pretty.str "parameters:" :: ps)) o map mk_param
   232         o these o Option.map #params o try (AxClass.get_info thy)) class,
   233       (SOME o Pretty.block o Pretty.breaks) [
   234         Pretty.str "instances:",
   235         Pretty.list "" "" (map (mk_arity class) (the_arities class))
   236       ]
   237     ]
   238   in
   239     (Pretty.writeln o Pretty.chunks o separate (Pretty.str "")
   240       o map mk_entry o Sorts.all_classes) algebra
   241   end;
   242 
   243 
   244 (* updaters *)
   245 
   246 fun add_class_data ((class, superclasses),
   247     (params, base_sort, inst, phi, axiom, assm_intro, of_class)) thy =
   248   let
   249     val operations = map (fn (v_ty as (_, ty), (c, _)) =>
   250       (c, (class, (ty, Free v_ty)))) params;
   251     val add_class = Graph.new_node (class,
   252         mk_class_data (((map o pairself) fst params, base_sort,
   253           map (SOME o Const) inst, phi, assm_intro, of_class, axiom), ([], operations)))
   254       #> fold (curry Graph.add_edge class) superclasses;
   255   in ClassData.map add_class thy end;
   256 
   257 fun register_operation class (c, (t, some_def)) thy =
   258   let
   259     val base_sort = (#base_sort o the_class_data thy) class;
   260     val prep_typ = map_atyps
   261       (fn TVar (vi as (v, _), sort) => if Name.aT = v
   262         then TFree (v, base_sort) else TVar (vi, sort));
   263     val t' = map_types prep_typ t;
   264     val ty' = Term.fastype_of t';
   265   in
   266     thy
   267     |> (ClassData.map o Graph.map_node class o map_class_data o apsnd)
   268       (fn (defs, operations) =>
   269         (fold cons (the_list some_def) defs,
   270           (c, (class, (ty', t'))) :: operations))
   271   end;
   272 
   273 
   274 (** rule calculation, tactics and methods **)
   275 
   276 val class_prefix = Logic.const_of_class o Sign.base_name;
   277 
   278 fun calculate thy sups base_sort assm_axiom param_map class =
   279   let
   280     (*static parts of morphism*)
   281     val subst_typ = map_atyps (fn TFree (v, sort) =>
   282           if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort)
   283       | ty => ty);
   284     fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) param_map v
   285          of SOME (c, _) => Const (c, ty)
   286           | NONE => t)
   287       | subst_aterm t = t;
   288     fun instantiate thy sort = Thm.instantiate ([pairself (Thm.ctyp_of thy o TVar o pair (Name.aT, 0))
   289       (base_sort, sort)], map (fn (v, (c, ty)) => pairself (Thm.cterm_of thy)
   290         (Var ((v, 0), map_atyps (fn _ => TVar ((Name.aT, 0), sort)) ty),
   291           Const (c, map_atyps (fn _ => TVar ((Name.aT, 0), sort)) ty))) param_map);
   292     val instantiate_base_sort = instantiate thy base_sort;
   293     val instantiate_class = instantiate thy [class];
   294     val (proto_assm_intro, locale_intro) = Locale.intros thy class
   295       |> pairself (try the_single);
   296     val axiom_premises = map_filter (#axiom o the_class_data thy) sups
   297       @ the_list assm_axiom;
   298     val axiom = locale_intro
   299       |> Option.map (Drule.standard o (fn thm => thm OF axiom_premises) o instantiate_class)
   300       |> (fn x as SOME _ => x | NONE => assm_axiom);
   301     val lift_axiom = case axiom
   302      of SOME axiom => (fn thm => Thm.implies_elim thm axiom)
   303       | NONE => I;
   304 
   305     (*dynamic parts of morphism*)
   306     fun rew_term thy defs = Pattern.rewrite_term thy
   307       (map (Logic.dest_equals o Thm.prop_of) defs) [];
   308     fun subst_term thy defs = map_aterms subst_aterm #> rew_term thy defs
   309       #> map_types subst_typ;
   310     fun subst_thm defs = Drule.standard' #> instantiate_class #> lift_axiom
   311       #> MetaSimplifier.rewrite_rule defs;
   312     fun morphism thy defs = 
   313       Morphism.typ_morphism subst_typ
   314       $> Morphism.term_morphism (subst_term thy defs)
   315       $> Morphism.thm_morphism (subst_thm defs);
   316 
   317     (*class rules*)
   318     val defs = these_defs thy sups;
   319     val assm_intro = proto_assm_intro
   320       |> Option.map instantiate_base_sort
   321       |> Option.map (MetaSimplifier.rewrite_rule defs)
   322       |> Option.map Goal.close_result;
   323     val fixate = Thm.instantiate
   324       (map (pairself (Thm.ctyp_of thy)) [(TVar ((Name.aT, 0), []), TFree (Name.aT, base_sort)),
   325         (TVar ((Name.aT, 0), base_sort), TFree (Name.aT, base_sort))], [])
   326     val class_intro = (fixate o #intro o AxClass.get_info thy) class;
   327     val of_class_sups = if null sups
   328       then map (fixate o Thm.class_triv thy) base_sort
   329       else map (fixate o #of_class o the_class_data thy) sups;
   330     val locale_dests = map Drule.standard' (Locale.dests thy class);
   331     val num_trivs = case length locale_dests
   332      of 0 => if is_none axiom then 0 else 1
   333       | n => n;
   334     val pred_trivs = if num_trivs = 0 then []
   335       else the axiom
   336         |> Thm.prop_of
   337         |> (map_types o map_atyps o K) (TFree (Name.aT, base_sort))
   338         |> (Thm.assume o Thm.cterm_of thy)
   339         |> replicate num_trivs;
   340     val of_class = (class_intro OF of_class_sups OF locale_dests OF pred_trivs)
   341       |> Drule.standard'
   342       |> Goal.close_result;
   343   in (morphism, axiom, assm_intro, of_class) end;
   344 
   345 fun class_interpretation class facts defs thy =
   346   let
   347     val params = these_params thy [class];
   348     val inst = (#inst o the_class_data thy) class;
   349     val tac = ALLGOALS (ProofContext.fact_tac facts);
   350     val prfx = class_prefix class;
   351   in
   352     thy
   353     |> fold_map (get_remove_global_constraint o fst o snd) params
   354     ||> prove_interpretation tac ((false, prfx), []) (Locale.Locale class)
   355           (inst, map (fn def => (("", []), def)) defs)
   356     |-> (fn cs => fold (Sign.add_const_constraint o apsnd SOME) cs)
   357   end;
   358 
   359 fun prove_subclass (sub, sup) thm thy =
   360   let
   361     val of_class = (#of_class o the_class_data thy) sup;
   362     val intro = Drule.standard' (of_class OF [Drule.standard' thm]);
   363     val classrel = intro OF (the_list o #axiom o the_class_data thy) sub;
   364   in
   365     thy
   366     |> AxClass.add_classrel classrel
   367     |> prove_interpretation_in (ALLGOALS (ProofContext.fact_tac [thm]))
   368          I (sub, Locale.Locale sup)
   369     |> ClassData.map (Graph.add_edge (sub, sup))
   370   end;
   371 
   372 fun intro_classes_tac facts st =
   373   let
   374     val thy = Thm.theory_of_thm st;
   375     val classes = Sign.all_classes thy;
   376     val class_trivs = map (Thm.class_triv thy) classes;
   377     val class_intros = map_filter (try (#intro o AxClass.get_info thy)) classes;
   378     val assm_intros = these_assm_intros thy;
   379   in
   380     Method.intros_tac (class_trivs @ class_intros @ assm_intros) facts st
   381   end;
   382 
   383 fun default_intro_classes_tac [] = intro_classes_tac []
   384   | default_intro_classes_tac _ = no_tac;
   385 
   386 fun default_tac rules ctxt facts =
   387   HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
   388     default_intro_classes_tac facts;
   389 
   390 val _ = Context.add_setup (Method.add_methods
   391  [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
   392     "back-chain introduction rules of classes"),
   393   ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
   394     "apply some intro/elim rule")]);
   395 
   396 
   397 (** classes and class target **)
   398 
   399 (* class context syntax *)
   400 
   401 structure ClassSyntax = ProofDataFun(
   402   type T = {
   403     local_constraints: (string * typ) list,
   404     global_constraints: (string * typ) list,
   405     base_sort: sort,
   406     operations: (string * (typ * term)) list,
   407     unchecks: (term * term) list,
   408     passed: bool
   409   };
   410   fun init _ = {
   411     local_constraints = [],
   412     global_constraints = [],
   413     base_sort = [],
   414     operations = [],
   415     unchecks = [],
   416     passed = true
   417   };;
   418 );
   419 
   420 fun synchronize_syntax sups base_sort ctxt =
   421   let
   422     val thy = ProofContext.theory_of ctxt;
   423     fun subst_class_typ sort = map_atyps
   424       (fn TFree _ => TVar ((Name.aT, 0), sort) | ty' => ty');
   425     val operations = these_operations thy sups;
   426     val local_constraints =
   427       (map o apsnd) (subst_class_typ base_sort o fst o snd) operations;
   428     val global_constraints =
   429       (map o apsnd) (fn (class, (ty, _)) => subst_class_typ [class] ty) operations;
   430     fun declare_const (c, _) =
   431       let val b = Sign.base_name c
   432       in Sign.intern_const thy b = c ? Variable.declare_const (b, c) end;
   433     val unchecks = map (fn (c, (_, (ty, t))) => (t, Const (c, ty))) operations;
   434   in
   435     ctxt
   436     |> fold declare_const local_constraints
   437     |> fold (ProofContext.add_const_constraint o apsnd SOME) local_constraints
   438     |> ClassSyntax.put {
   439         local_constraints = local_constraints,
   440         global_constraints = global_constraints,
   441         base_sort = base_sort,
   442         operations = (map o apsnd) snd operations,
   443         unchecks = unchecks,
   444         passed = false
   445       }
   446   end;
   447 
   448 fun refresh_syntax class ctxt =
   449   let
   450     val thy = ProofContext.theory_of ctxt;
   451     val base_sort = (#base_sort o the_class_data thy) class;
   452   in synchronize_syntax [class] base_sort ctxt end;
   453 
   454 val mark_passed = ClassSyntax.map
   455   (fn { local_constraints, global_constraints, base_sort, operations, unchecks, passed } =>
   456     { local_constraints = local_constraints, global_constraints = global_constraints,
   457       base_sort = base_sort, operations = operations, unchecks = unchecks, passed = true });
   458 
   459 fun sort_term_check ts ctxt =
   460   let
   461     val { local_constraints, global_constraints, base_sort, operations, passed, ... } =
   462       ClassSyntax.get ctxt;
   463     fun check_improve (Const (c, ty)) = (case AList.lookup (op =) local_constraints c
   464          of SOME ty0 => (case try (Type.raw_match (ty0, ty)) Vartab.empty
   465              of SOME tyenv => (case Vartab.lookup tyenv (Name.aT, 0)
   466                  of SOME (_, TVar (tvar as (vi, _))) =>
   467                       if TypeInfer.is_param vi then cons tvar else I
   468                   | _ => I)
   469               | NONE => I)
   470           | NONE => I)
   471       | check_improve _ = I;
   472     val improvements = (fold o fold_aterms) check_improve ts [];
   473     val ts' = (map o map_types o map_atyps) (fn ty as TVar tvar =>
   474         if member (op =) improvements tvar
   475           then TFree (Name.aT, base_sort) else ty | ty => ty) ts;
   476     fun check t0 = Envir.expand_term (fn Const (c, ty) => (case AList.lookup (op =) operations c
   477          of SOME (ty0, t) =>
   478               if Type.typ_instance (ProofContext.tsig_of ctxt) (ty, ty0)
   479               then SOME (ty0, check t) else NONE
   480           | NONE => NONE)
   481       | _ => NONE) t0;
   482     val ts'' = map check ts';
   483   in if eq_list (op aconv) (ts, ts'') andalso passed then NONE
   484   else
   485     ctxt
   486     |> fold (ProofContext.add_const_constraint o apsnd SOME) global_constraints
   487     |> mark_passed
   488     |> pair ts''
   489     |> SOME
   490   end;
   491 
   492 fun sort_term_uncheck ts ctxt =
   493   let
   494     val thy = ProofContext.theory_of ctxt;
   495     val unchecks = (#unchecks o ClassSyntax.get) ctxt;
   496     val ts' = map (Pattern.rewrite_term thy unchecks []) ts;
   497   in if eq_list (op aconv) (ts, ts') then NONE else SOME (ts', ctxt) end;
   498 
   499 fun init_ctxt sups base_sort ctxt =
   500   ctxt
   501   |> Variable.declare_term
   502       (Logic.mk_type (TFree (Name.aT, base_sort)))
   503   |> synchronize_syntax sups base_sort
   504   |> Context.proof_map (
   505       Syntax.add_term_check 0 "class" sort_term_check
   506       #> Syntax.add_term_uncheck 0 "class" sort_term_uncheck)
   507 
   508 fun init class thy =
   509   thy
   510   |> Locale.init class
   511   |> init_ctxt [class] ((#base_sort o the_class_data thy) class);
   512 
   513 
   514 (* class definition *)
   515 
   516 local
   517 
   518 fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems =
   519   let
   520     val supclasses = map (prep_class thy) raw_supclasses;
   521     val supsort = Sign.minimize_sort thy supclasses;
   522     val sups = filter (is_class thy) supsort;
   523     val base_sort = if null sups then supsort else
   524       foldr1 (Sorts.inter_sort (Sign.classes_of thy))
   525         (map (#base_sort o the_class_data thy) sups);
   526     val suplocales = map Locale.Locale sups;
   527     val (raw_elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e)
   528       | Locale.Expr i => apsnd (cons (prep_expr thy i))) raw_includes_elems ([], []);
   529     val supexpr = Locale.Merge suplocales;
   530     val supparams = (map fst o Locale.parameters_of_expr thy) supexpr;
   531     val mergeexpr = Locale.Merge (suplocales @ includes);
   532     val constrain = Element.Constrains ((map o apsnd o map_atyps)
   533       (K (TFree (Name.aT, base_sort))) supparams);
   534     fun fork_syn (Element.Fixes xs) =
   535           fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs
   536           #>> Element.Fixes
   537       | fork_syn x = pair x;
   538     fun fork_syntax elems =
   539       let
   540         val (elems', global_syntax) = fold_map fork_syn elems [];
   541       in (if null includes (*FIXME*) then constrain :: elems' else elems', global_syntax) end;
   542     val (elems, global_syntax) =
   543       ProofContext.init thy
   544       |> Locale.cert_expr supexpr [constrain]
   545       |> snd
   546       |> init_ctxt sups base_sort
   547       |> process_expr Locale.empty raw_elems
   548       |> fst
   549       |> fork_syntax
   550   in (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) end;
   551 
   552 val read_class_spec = gen_class_spec Sign.intern_class Locale.intern_expr Locale.read_expr;
   553 val check_class_spec = gen_class_spec (K I) (K I) Locale.cert_expr;
   554 
   555 fun adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts thy =
   556   let
   557     val supconsts = map fst supparams
   558       |> AList.make (the o AList.lookup (op =) (these_params thy sups))
   559       |> (map o apsnd o apsnd o map_atyps o K o TFree) (Name.aT, [class]);
   560     val all_params = map fst (Locale.parameters_of thy class);
   561     fun add_const (v, raw_ty) thy =
   562       let
   563         val c = Sign.full_name thy v;
   564         val ty = map_atyps (K (TFree (Name.aT, base_sort))) raw_ty;
   565         val ty0 = Type.strip_sorts ty;
   566         val ty' = map_atyps (K (TFree (Name.aT, [class]))) ty0;
   567         val syn = (the_default NoSyn o AList.lookup (op =) global_syntax) v;
   568       in
   569         thy
   570         |> Sign.declare_const [] (v, ty0, syn)
   571         |> snd
   572         |> pair ((v, ty), (c, ty'))
   573       end;
   574     fun add_consts raw_params thy =
   575       thy
   576       |> Sign.add_path (Logic.const_of_class bname)
   577       |> fold_map add_const raw_params
   578       ||> Sign.restore_naming thy
   579       |-> (fn params => pair (supconsts @ (map o apfst) fst params, params));
   580     fun globalize param_map = map_aterms
   581       (fn Free (v, ty) => Const ((fst o the o AList.lookup (op =) param_map) v, ty)
   582         | t => t);
   583     val raw_pred = Locale.intros thy class
   584       |> fst
   585       |> map (Logic.unvarify o Logic.strip_imp_concl o Thm.prop_of);
   586     fun get_axiom thy = case (#axioms o AxClass.get_info thy) class
   587      of [] => NONE
   588       | [thm] => SOME thm;
   589   in
   590     thy
   591     |> add_consts ((snd o chop (length supparams)) all_params)
   592     |-> (fn (param_map, params) => AxClass.define_class (bname, supsort)
   593           (map (fst o snd) params @ other_consts)
   594           [((bname ^ "_" ^ AxClass.axiomsN, []), map (globalize param_map) raw_pred)]
   595     #> snd
   596     #> `get_axiom
   597     #-> (fn assm_axiom => fold (Sign.add_const_constraint o apsnd SOME o snd) params
   598     #> pair (param_map, params, assm_axiom)))
   599   end;
   600 
   601 fun gen_class prep_spec prep_param bname
   602     raw_supclasses raw_includes_elems raw_other_consts thy =
   603   let
   604     val class = Sign.full_name thy bname;
   605     val (((sups, supparams), (supsort, base_sort, mergeexpr)), (elems, global_syntax)) =
   606       prep_spec thy raw_supclasses raw_includes_elems;
   607     val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts;
   608   in
   609     thy
   610     |> Locale.add_locale_i (SOME "") bname mergeexpr elems
   611     |> snd
   612     |> ProofContext.theory_of
   613     |> adjungate_axclass bname class base_sort sups supsort supparams global_syntax other_consts
   614     |-> (fn (param_map, params, assm_axiom) =>
   615          `(fn thy => calculate thy sups base_sort assm_axiom param_map class)
   616     #-> (fn (morphism, axiom, assm_intro, of_class) =>
   617         add_class_data ((class, sups), (params, base_sort,
   618           map snd param_map, morphism, axiom, assm_intro, of_class))
   619     #> class_interpretation class (the_list axiom) []))
   620     |> init class
   621     |> pair class
   622   end;
   623 
   624 fun read_const thy = #1 o Term.dest_Const o ProofContext.read_const (ProofContext.init thy);
   625 
   626 in
   627 
   628 val class_cmd = gen_class read_class_spec read_const;
   629 val class = gen_class check_class_spec (K I);
   630 
   631 end; (*local*)
   632 
   633 
   634 (* class target *)
   635 
   636 fun declare class pos ((c, mx), dict) thy =
   637   let
   638     val prfx = class_prefix class;
   639     val thy' = thy |> Sign.add_path prfx;
   640     val phi = partial_morphism thy' class;
   641 
   642     val c' = Sign.full_name thy' c;
   643     val dict' = Morphism.term phi dict;
   644     val dict_def = map_types Logic.unvarifyT dict';
   645     val ty' = Term.fastype_of dict_def;
   646     val ty'' = Type.strip_sorts ty';
   647     val def_eq = Logic.mk_equals (Const (c', ty'), dict_def);
   648     fun get_axiom thy = ((Thm.varifyT o Thm.symmetric o Thm.get_axiom_i thy) c', thy);
   649   in
   650     thy'
   651     |> Sign.declare_const pos (c, ty'', mx) |> snd
   652     |> Thm.add_def false false (c, def_eq)
   653     |>> Thm.symmetric
   654     ||>> get_axiom
   655     |-> (fn (def, def') => class_interpretation class [def] [Thm.prop_of def]
   656           #> register_operation class (c', (dict', SOME def')))
   657     |> Sign.restore_naming thy
   658     |> Sign.add_const_constraint (c', SOME ty')
   659   end;
   660 
   661 fun abbrev class prmode pos ((c, mx), rhs) thy =
   662   let
   663     val prfx = class_prefix class;
   664     val thy' = thy |> Sign.add_path prfx;
   665     val phi = morphism thy class;
   666 
   667     val c' = Sign.full_name thy' c;
   668     val rhs' = Morphism.term phi rhs;
   669     val ty' = Logic.unvarifyT (Term.fastype_of rhs');
   670   in
   671     thy'
   672     |> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') |> snd
   673     |> Sign.add_const_constraint (c', SOME ty')
   674     |> Sign.notation true prmode [(Const (c', ty'), mx)]
   675     |> register_operation class (c', (rhs', NONE))
   676     |> Sign.restore_naming thy
   677   end;
   678 
   679 
   680 (** instantiation target **)
   681 
   682 (* bookkeeping *)
   683 
   684 datatype instantiation = Instantiation of {
   685   arities: string list * (string * sort) list * sort,
   686   params: ((string * string) * (string * typ)) list
   687     (*(instantiation parameter, type constructor), (local instantiation parameter, typ)*)
   688 }
   689 
   690 structure Instantiation = ProofDataFun
   691 (
   692   type T = instantiation
   693   fun init _ = Instantiation { arities = ([], [], []), params = [] };
   694 );
   695 
   696 fun mk_instantiation (arities, params) =
   697   Instantiation { arities = arities, params = params };
   698 fun get_instantiation lthy = case Instantiation.get (LocalTheory.target_of lthy)
   699  of Instantiation data => data;
   700 fun map_instantiation f = (LocalTheory.target o Instantiation.map)
   701   (fn Instantiation { arities, params } => mk_instantiation (f (arities, params)));
   702 
   703 fun the_instantiation lthy = case get_instantiation lthy
   704  of { arities = ([], [], []), ... } => error "No instantiation target"
   705   | data => data;
   706 
   707 val instantiation_params = #params o get_instantiation;
   708 
   709 fun instantiation_param lthy v = instantiation_params lthy
   710   |> find_first (fn (_, (v', _)) => v = v')
   711   |> Option.map (fst o fst);
   712 
   713 fun confirm_declaration c = (map_instantiation o apsnd)
   714   (filter_out (fn (_, (c', _)) => c' = c));
   715 
   716 
   717 (* syntax *)
   718 
   719 fun inst_term_check ts lthy =
   720   let
   721     val params = instantiation_params lthy;
   722     val tsig = ProofContext.tsig_of lthy;
   723     val thy = ProofContext.theory_of lthy;
   724 
   725     fun check_improve (Const (c, ty)) = (case AxClass.inst_tyco_of thy (c, ty)
   726          of SOME tyco => (case AList.lookup (op =) params (c, tyco)
   727              of SOME (_, ty') => perhaps (try (Type.typ_match tsig (ty, ty')))
   728               | NONE => I)
   729           | NONE => I)
   730       | check_improve _ = I;
   731     val subst_param = map_aterms (fn t as Const (c, ty) =>
   732         (case AxClass.inst_tyco_of thy (c, ty)
   733          of SOME tyco => (case AList.lookup (op =) params (c, tyco)
   734              of SOME v_ty => Free v_ty
   735               | NONE => t)
   736           | NONE => t)
   737       | t => t);
   738 
   739     val improvement = (fold o fold_aterms) check_improve ts Vartab.empty;
   740     val ts' = (map o map_types) (Envir.typ_subst_TVars improvement) ts;
   741     val ts'' = map subst_param ts';
   742   in if eq_list (op aconv) (ts, ts'') then NONE else SOME (ts'', lthy) end;
   743 
   744 fun inst_term_uncheck ts lthy =
   745   let
   746     val params = instantiation_params lthy;
   747     val ts' = (map o map_aterms) (fn t as Free (v, ty) =>
   748        (case get_first (fn ((c, _), (v', _)) => if v = v' then SOME c else NONE) params
   749          of SOME c => Const (c, ty)
   750           | NONE => t)
   751       | t => t) ts;
   752   in if eq_list (op aconv) (ts, ts') then NONE else SOME (ts', lthy) end;
   753 
   754 
   755 (* target *)
   756 
   757 val sanatize_name = (*FIXME*)
   758   let
   759     fun is_valid s = Symbol.is_ascii_letter s orelse Symbol.is_ascii_digit s
   760       orelse s = "'" orelse s = "_";
   761     val is_junk = not o is_valid andf Symbol.is_regular;
   762     val junk = Scan.many is_junk;
   763     val scan_valids = Symbol.scanner "Malformed input"
   764       ((junk |--
   765         (Scan.optional (Scan.one Symbol.is_ascii_letter) "x" ^^ (Scan.many is_valid >> implode)
   766         --| junk))
   767       ::: Scan.repeat ((Scan.many1 is_valid >> implode) --| junk));
   768   in
   769     explode #> scan_valids #> implode
   770   end;
   771 
   772 fun init_instantiation (tycos, vs, sort) thy =
   773   let
   774     val _ = if null tycos then error "At least one arity must be given" else ();
   775     val _ = map (the_class_data thy) sort;
   776     fun type_name "*" = "prod"
   777       | type_name "+" = "sum"
   778       | type_name s = sanatize_name (NameSpace.base s); (*FIXME*)
   779     fun get_param tyco (param, (c, ty)) = if can (AxClass.param_of_inst thy) (c, tyco)
   780       then NONE else SOME ((c, tyco),
   781         (param ^ "_" ^ type_name tyco, map_atyps (K (Type (tyco, map TFree vs))) ty));
   782     val params = map_product get_param tycos (these_params thy sort) |> map_filter I;
   783   in
   784     thy
   785     |> ProofContext.init
   786     |> Instantiation.put (mk_instantiation ((tycos, vs, sort), params))
   787     |> fold (Variable.declare_term o Logic.mk_type o TFree) vs
   788     |> fold (Variable.declare_names o Free o snd) params
   789     |> fold (fn tyco => ProofContext.add_arity (tyco, map snd vs, sort)) tycos
   790     |> Context.proof_map (
   791         Syntax.add_term_check 0 "instance" inst_term_check
   792         #> Syntax.add_term_uncheck 0 "instance" inst_term_uncheck)
   793   end;
   794 
   795 fun gen_instantiation_instance do_proof after_qed lthy =
   796   let
   797     val (tycos, vs, sort) = (#arities o the_instantiation) lthy;
   798     val arities_proof = maps (fn tyco => Logic.mk_arities (tyco, map snd vs, sort)) tycos;
   799     fun after_qed' results =
   800       LocalTheory.theory (fold (AxClass.add_arity o Thm.varifyT) results)
   801       #> after_qed;
   802   in
   803     lthy
   804     |> do_proof after_qed' arities_proof
   805   end;
   806 
   807 val instantiation_instance = gen_instantiation_instance (fn after_qed => fn ts =>
   808   Proof.theorem_i NONE (after_qed o map the_single) (map (fn t => [(t, [])]) ts));
   809 
   810 fun prove_instantiation_instance tac = gen_instantiation_instance (fn after_qed =>
   811   fn ts => fn lthy => after_qed (map (fn t => Goal.prove lthy [] [] t
   812     (fn {context, ...} => tac context)) ts) lthy) I;
   813 
   814 fun conclude_instantiation lthy =
   815   let
   816     val { arities, params } = the_instantiation lthy;
   817     val (tycos, vs, sort) = arities;
   818     val thy = ProofContext.theory_of lthy;
   819     val _ = map (fn tyco => if Sign.of_sort thy
   820         (Type (tyco, map TFree vs), sort)
   821       then () else error ("Missing instance proof for type " ^ quote (Sign.extern_type thy tyco)))
   822         tycos;
   823     (*this checkpoint should move to AxClass as soon as "attach" has disappeared*)
   824     val _ = case map (fst o snd) params
   825      of [] => ()
   826       | cs => Output.legacy_feature
   827           ("Missing specifications for overloaded parameters " ^ commas_quote cs)
   828   in lthy end;
   829 
   830 fun pretty_instantiation lthy =
   831   let
   832     val { arities, params } = the_instantiation lthy;
   833     val (tycos, vs, sort) = arities;
   834     val thy = ProofContext.theory_of lthy;
   835     fun pr_arity tyco = Syntax.pretty_arity lthy (tyco, map snd vs, sort);
   836     fun pr_param ((c, _), (v, ty)) =
   837       (Pretty.block o Pretty.breaks) [Pretty.str v, Pretty.str "==",
   838         (Pretty.str o Sign.extern_const thy) c, Pretty.str "::", Sign.pretty_typ thy ty];
   839   in
   840     (Pretty.block o Pretty.fbreaks)
   841       (Pretty.str "instantiation" :: map pr_arity tycos @ map pr_param params)
   842   end;
   843 
   844 end;
   845