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