src/Pure/Isar/class.ML
author haftmann
Wed Oct 24 07:19:52 2007 +0200 (2007-10-24)
changeset 25163 f737a88a3248
parent 25146 c2a41f31cacb
child 25195 62638dcafe38
permissions -rw-r--r--
tuned
     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   val axclass_cmd: bstring * xstring list
    11     -> ((bstring * Attrib.src list) * string list) list
    12     -> theory -> class * theory
    13   val classrel_cmd: xstring * xstring -> theory -> Proof.state
    14 
    15   val class: bstring -> class list -> Element.context_i Locale.element list
    16     -> string list -> theory -> string * Proof.context
    17   val class_cmd: bstring -> xstring list -> Element.context Locale.element list
    18     -> xstring list -> theory -> string * Proof.context
    19   val is_class: theory -> class -> bool
    20   val these_params: theory -> sort -> (string * (string * typ)) list
    21   val init: class -> Proof.context -> Proof.context
    22   val add_logical_const: string -> Markup.property list
    23     -> (string * mixfix) * term -> theory -> theory
    24   val add_syntactic_const: string -> Syntax.mode -> Markup.property list
    25     -> (string * mixfix) * term -> theory -> theory
    26   val refresh_syntax: class -> Proof.context -> Proof.context
    27   val intro_classes_tac: thm list -> tactic
    28   val default_intro_classes_tac: thm list -> tactic
    29   val print_classes: theory -> unit
    30   val uncheck: bool ref
    31 
    32   val instance_arity: (theory -> theory) -> arity list -> theory -> Proof.state
    33   val instance: arity list -> ((bstring * Attrib.src list) * term) list
    34     -> (thm list -> theory -> theory)
    35     -> theory -> Proof.state
    36   val instance_cmd: (bstring * xstring list * xstring) list
    37     -> ((bstring * Attrib.src list) * xstring) list
    38     -> (thm list -> theory -> theory)
    39     -> theory -> Proof.state
    40   val prove_instance: tactic -> arity list
    41     -> ((bstring * Attrib.src list) * term) list
    42     -> theory -> thm list * theory
    43   val unoverload: theory -> conv
    44   val overload: theory -> conv
    45   val unoverload_const: theory -> string * typ -> string
    46   val inst_const: theory -> string * string -> string
    47   val param_const: theory -> string -> (string * string) option
    48 end;
    49 
    50 structure Class : CLASS =
    51 struct
    52 
    53 (** auxiliary **)
    54 
    55 val classN = "class";
    56 val introN = "intro";
    57 
    58 fun prove_interpretation tac prfx_atts expr inst =
    59   Locale.interpretation_i I prfx_atts expr inst
    60   #> Proof.global_terminal_proof
    61       (Method.Basic (K (Method.SIMPLE_METHOD tac), Position.none), NONE)
    62   #> ProofContext.theory_of;
    63 
    64 fun OF_LAST thm1 thm2 = thm1 RSN (Thm.nprems_of thm2, thm2);
    65 
    66 fun strip_all_ofclass thy sort =
    67   let
    68     val typ = TVar ((Name.aT, 0), sort);
    69     fun prem_inclass t =
    70       case Logic.strip_imp_prems t
    71        of ofcls :: _ => try Logic.dest_inclass ofcls
    72         | [] => NONE;
    73     fun strip_ofclass class thm =
    74       thm OF (fst o AxClass.of_sort thy (typ, [class])) AxClass.cache;
    75     fun strip thm = case (prem_inclass o Thm.prop_of) thm
    76      of SOME (_, class) => thm |> strip_ofclass class |> strip
    77       | NONE => thm;
    78   in strip end;
    79 
    80 fun get_remove_global_constraint c thy =
    81   let
    82     val ty = Sign.the_const_constraint thy c;
    83   in
    84     thy
    85     |> Sign.add_const_constraint (c, NONE)
    86     |> pair (c, Logic.unvarifyT ty)
    87   end;
    88 
    89 
    90 (** axclass command **)
    91 
    92 fun axclass_cmd (class, raw_superclasses) raw_specs thy =
    93   let
    94     val ctxt = ProofContext.init thy;
    95     val superclasses = map (Sign.read_class thy) raw_superclasses;
    96     val name_atts = map ((apsnd o map) (Attrib.attribute thy) o fst)
    97       raw_specs;
    98     val axiomss = ProofContext.read_propp (ctxt, map (map (rpair []) o snd)
    99           raw_specs)
   100       |> snd
   101       |> (map o map) fst;
   102   in
   103     AxClass.define_class (class, superclasses) []
   104       (name_atts ~~ axiomss) thy
   105   end;
   106 
   107 local
   108 
   109 fun gen_instance mk_prop add_thm after_qed insts thy =
   110   let
   111     fun after_qed' results =
   112       ProofContext.theory ((fold o fold) add_thm results #> after_qed);
   113   in
   114     thy
   115     |> ProofContext.init
   116     |> Proof.theorem_i NONE after_qed' ((map (fn t => [(t, [])])
   117         o maps (mk_prop thy)) insts)
   118   end;
   119 
   120 in
   121 
   122 val instance_arity =
   123   gen_instance (Logic.mk_arities oo Sign.cert_arity) AxClass.add_arity;
   124 val classrel =
   125   gen_instance (single oo (Logic.mk_classrel oo AxClass.cert_classrel))
   126     AxClass.add_classrel I o single;
   127 val classrel_cmd =
   128   gen_instance (single oo (Logic.mk_classrel oo AxClass.read_classrel))
   129     AxClass.add_classrel I o single;
   130 
   131 end; (*local*)
   132 
   133 
   134 (** explicit constants for overloaded definitions **)
   135 
   136 structure InstData = TheoryDataFun
   137 (
   138   type T = (string * thm) Symtab.table Symtab.table * (string * string) Symtab.table;
   139     (*constant name ~> type constructor ~> (constant name, equation),
   140         constant name ~> (constant name, type constructor)*)
   141   val empty = (Symtab.empty, Symtab.empty);
   142   val copy = I;
   143   val extend = I;
   144   fun merge _ ((taba1, tabb1), (taba2, tabb2)) =
   145     (Symtab.join (K (Symtab.merge (K true))) (taba1, taba2),
   146       Symtab.merge (K true) (tabb1, tabb2));
   147 );
   148 
   149 fun inst_thms thy = (Symtab.fold (Symtab.fold (cons o snd o snd) o snd) o fst)
   150     (InstData.get thy) [];
   151 fun add_inst (c, tyco) inst = (InstData.map o apfst
   152       o Symtab.map_default (c, Symtab.empty)) (Symtab.update_new (tyco, inst))
   153   #> (InstData.map o apsnd) (Symtab.update_new (fst inst, (c, tyco)));
   154 
   155 fun unoverload thy = MetaSimplifier.rewrite true (inst_thms thy);
   156 fun overload thy = MetaSimplifier.rewrite true (map Thm.symmetric (inst_thms thy));
   157 
   158 fun inst_const thy (c, tyco) =
   159   (fst o the o Symtab.lookup ((the o Symtab.lookup (fst (InstData.get thy))) c)) tyco;
   160 fun unoverload_const thy (c_ty as (c, _)) =
   161   case AxClass.class_of_param thy c
   162    of SOME class => (case Sign.const_typargs thy c_ty
   163        of [Type (tyco, _)] => (case Symtab.lookup
   164            ((the o Symtab.lookup (fst (InstData.get thy))) c) tyco
   165              of SOME (c, _) => c
   166               | NONE => c)
   167         | [_] => c)
   168     | NONE => c;
   169 
   170 val param_const = Symtab.lookup o snd o InstData.get;
   171 
   172 fun add_inst_def (class, tyco) (c, ty) thy =
   173   let
   174     val tyco_base = Sign.base_name tyco;
   175     val name_inst = Sign.base_name class ^ "_" ^ tyco_base ^ "_inst";
   176     val c_inst_base = Sign.base_name c ^ "_" ^ tyco_base;
   177   in
   178     thy
   179     |> Sign.sticky_prefix name_inst
   180     |> Sign.declare_const [] (c_inst_base, ty, NoSyn)
   181     |-> (fn const as Const (c_inst, _) =>
   182       PureThy.add_defs_i false
   183         [((Thm.def_name c_inst_base, Logic.mk_equals (const, Const (c, ty))), [])]
   184       #-> (fn [thm] => add_inst (c, tyco) (c_inst, Thm.symmetric thm)))
   185     |> Sign.restore_naming thy
   186   end;
   187 
   188 fun add_inst_def' (class, tyco) (c, ty) thy =
   189   if case Symtab.lookup (fst (InstData.get thy)) c
   190    of NONE => true
   191     | SOME tab => is_none (Symtab.lookup tab tyco)
   192   then add_inst_def (class, tyco) (c, Logic.unvarifyT ty) thy
   193   else thy;
   194 
   195 fun add_def ((class, tyco), ((name, prop), atts)) thy =
   196   let
   197     val ((lhs as Const (c, ty), args), rhs) =
   198       (apfst Term.strip_comb o Logic.dest_equals) prop;
   199     fun (*add_inst' def ([], (Const (c_inst, ty))) =
   200           if forall (fn TFree _ => true | _ => false) (Sign.const_typargs thy (c_inst, ty))
   201           then add_inst (c, tyco) (c_inst, def)
   202           else add_inst_def (class, tyco) (c, ty)
   203       |*) add_inst' _ t = add_inst_def (class, tyco) (c, ty);
   204   in
   205     thy
   206     |> PureThy.add_defs_i true [((name, prop), map (Attrib.attribute_i thy) atts)]
   207     |-> (fn [def] => add_inst' def (args, rhs) #> pair def)
   208   end;
   209 
   210 
   211 (** instances with implicit parameter handling **)
   212 
   213 local
   214 
   215 fun gen_read_def thy prep_att parse_prop ((raw_name, raw_atts), raw_t) =
   216   let
   217     val ctxt = ProofContext.init thy;
   218     val t = parse_prop ctxt raw_t |> Syntax.check_prop ctxt;
   219     val ((c, ty), _) = Sign.cert_def ctxt t;
   220     val atts = map (prep_att thy) raw_atts;
   221     val insts = Consts.typargs (Sign.consts_of thy) (c, ty);
   222     val name = case raw_name
   223      of "" => NONE
   224       | _ => SOME raw_name;
   225   in (c, (insts, ((name, t), atts))) end;
   226 
   227 fun read_def_cmd thy = gen_read_def thy Attrib.intern_src Syntax.parse_prop;
   228 fun read_def thy = gen_read_def thy (K I) (K I);
   229 
   230 fun gen_instance prep_arity read_def do_proof raw_arities raw_defs after_qed theory =
   231   let
   232     val arities = map (prep_arity theory) raw_arities;
   233     val _ = if null arities then error "At least one arity must be given" else ();
   234     val _ = case (duplicates (op =) o map #1) arities
   235      of [] => ()
   236       | dupl_tycos => error ("Type constructors occur more than once in arities: "
   237           ^ commas_quote dupl_tycos);
   238     fun get_consts_class tyco ty class =
   239       let
   240         val cs = (these o try (#params o AxClass.get_info theory)) class;
   241         val subst_ty = map_type_tfree (K ty);
   242       in
   243         map (fn (c, ty) => (c, ((class, tyco), subst_ty ty))) cs
   244       end;
   245     fun get_consts_sort (tyco, asorts, sort) =
   246       let
   247         val ty = Type (tyco, map (fn (v, sort) => TVar ((v, 0), sort))
   248           (Name.names Name.context Name.aT asorts))
   249       in maps (get_consts_class tyco ty) (Sign.complete_sort theory sort) end;
   250     val cs = maps get_consts_sort arities;
   251     fun mk_typnorm thy (ty, ty_sc) =
   252       case try (Sign.typ_match thy (Logic.varifyT ty_sc, ty)) Vartab.empty
   253        of SOME env => SOME (Logic.varifyT #> Envir.typ_subst_TVars env #> Logic.unvarifyT)
   254         | NONE => NONE;
   255     fun read_defs defs cs thy_read =
   256       let
   257         fun read raw_def cs =
   258           let
   259             val (c, (inst, ((name_opt, t), atts))) = read_def thy_read raw_def;
   260             val ty = Consts.instance (Sign.consts_of thy_read) (c, inst);
   261             val ((class, tyco), ty') = case AList.lookup (op =) cs c
   262              of NONE => error ("Illegal definition for constant " ^ quote c)
   263               | SOME class_ty => class_ty;
   264             val name = case name_opt
   265              of NONE => Thm.def_name (Logic.name_arity (tyco, [], c))
   266               | SOME name => name;
   267             val t' = case mk_typnorm thy_read (ty', ty)
   268              of NONE => error ("Illegal definition for constant " ^
   269                   quote (c ^ "::" ^ setmp show_sorts true
   270                     (Sign.string_of_typ thy_read) ty))
   271               | SOME norm => map_types norm t
   272           in (((class, tyco), ((name, t'), atts)), AList.delete (op =) c cs) end;
   273       in fold_map read defs cs end;
   274     val (defs, other_cs) = read_defs raw_defs cs
   275       (fold Sign.primitive_arity arities (Theory.copy theory));
   276     fun after_qed' cs defs =
   277       fold Sign.add_const_constraint (map (apsnd SOME) cs)
   278       #> after_qed defs;
   279   in
   280     theory
   281     |> fold_map get_remove_global_constraint (map fst cs |> distinct (op =))
   282     ||>> fold_map add_def defs
   283     ||> fold (fn (c, ((class, tyco), ty)) => add_inst_def' (class, tyco) (c, ty)) other_cs
   284     |-> (fn (cs, defs) => do_proof (after_qed' cs defs) arities defs)
   285   end;
   286 
   287 fun tactic_proof tac f arities defs =
   288   fold (fn arity => AxClass.prove_arity arity tac) arities
   289   #> f
   290   #> pair defs;
   291 
   292 in
   293 
   294 val instance = gen_instance Sign.cert_arity read_def
   295   (fn f => fn arities => fn defs => instance_arity f arities);
   296 val instance_cmd = gen_instance Sign.read_arity read_def_cmd
   297   (fn f => fn arities => fn defs => instance_arity f arities);
   298 fun prove_instance tac arities defs =
   299   gen_instance Sign.cert_arity read_def
   300     (tactic_proof tac) arities defs (K I);
   301 
   302 end; (*local*)
   303 
   304 
   305 
   306 (** class data **)
   307 
   308 datatype class_data = ClassData of {
   309   consts: (string * string) list
   310     (*locale parameter ~> constant name*),
   311   base_sort: sort,
   312   inst: term option list
   313     (*canonical interpretation*),
   314   morphism: morphism,
   315     (*partial morphism of canonical interpretation*)
   316   intro: thm,
   317   defs: thm list,
   318   operations: (string * ((term * (typ * int)) * (term * typ))) list
   319     (*constant name ~> ((locale term,
   320         (constant constraint, instantiaton index of class typ)), locale term & typ for uncheck)*)
   321 };
   322 
   323 fun rep_class_data (ClassData d) = d;
   324 fun mk_class_data ((consts, base_sort, inst, morphism, intro),
   325     (defs, operations)) =
   326   ClassData { consts = consts, base_sort = base_sort, inst = inst,
   327     morphism = morphism, intro = intro, defs = defs,
   328     operations = operations };
   329 fun map_class_data f (ClassData { consts, base_sort, inst, morphism, intro,
   330     defs, operations }) =
   331   mk_class_data (f ((consts, base_sort, inst, morphism, intro),
   332     (defs, operations)));
   333 fun merge_class_data _ (ClassData { consts = consts,
   334     base_sort = base_sort, inst = inst, morphism = morphism, intro = intro,
   335     defs = defs1, operations = operations1 },
   336   ClassData { consts = _, base_sort = _, inst = _, morphism = _, intro = _,
   337     defs = defs2, operations = operations2 }) =
   338   mk_class_data ((consts, base_sort, inst, morphism, intro),
   339     (Thm.merge_thms (defs1, defs2),
   340       AList.merge (op =) (K true) (operations1, operations2)));
   341 
   342 structure ClassData = TheoryDataFun
   343 (
   344   type T = class_data Graph.T
   345   val empty = Graph.empty;
   346   val copy = I;
   347   val extend = I;
   348   fun merge _ = Graph.join merge_class_data;
   349 );
   350 
   351 
   352 (* queries *)
   353 
   354 val lookup_class_data = Option.map rep_class_data oo try o Graph.get_node o ClassData.get;
   355 
   356 fun the_class_data thy class = case lookup_class_data thy class
   357  of NONE => error ("Undeclared class " ^ quote class)
   358   | SOME data => data;
   359 
   360 val is_class = is_some oo lookup_class_data;
   361 
   362 val ancestry = Graph.all_succs o ClassData.get;
   363 
   364 fun these_params thy =
   365   let
   366     fun params class =
   367       let
   368         val const_typs = (#params o AxClass.get_info thy) class;
   369         val const_names = (#consts o the_class_data thy) class;
   370       in
   371         (map o apsnd) (fn c => (c, (the o AList.lookup (op =) const_typs) c)) const_names
   372       end;
   373   in maps params o ancestry thy end;
   374 
   375 fun these_defs thy = maps (these o Option.map #defs o lookup_class_data thy) o ancestry thy;
   376 
   377 fun morphism thy = #morphism o the_class_data thy;
   378 
   379 fun these_intros thy =
   380   Graph.fold (fn (_, (data, _)) => insert Thm.eq_thm ((#intro o rep_class_data) data))
   381     (ClassData.get thy) [];
   382 
   383 fun these_operations thy =
   384   maps (#operations o the_class_data thy) o ancestry thy;
   385 
   386 fun local_operation thy = AList.lookup (op =) o these_operations thy;
   387 
   388 fun sups_base_sort thy sort =
   389   let
   390     val sups = filter (is_class thy) sort
   391       |> Sign.minimize_sort thy;
   392     val base_sort = case sups
   393      of _ :: _ => maps (#base_sort o the_class_data thy) sups
   394           |> Sign.minimize_sort thy
   395       | [] => sort;
   396   in (sups, base_sort) end;
   397 
   398 fun print_classes thy =
   399   let
   400     val ctxt = ProofContext.init thy;
   401     val algebra = Sign.classes_of thy;
   402     val arities =
   403       Symtab.empty
   404       |> Symtab.fold (fn (tyco, arities) => fold (fn (class, _) =>
   405            Symtab.map_default (class, []) (insert (op =) tyco)) arities)
   406              ((#arities o Sorts.rep_algebra) algebra);
   407     val the_arities = these o Symtab.lookup arities;
   408     fun mk_arity class tyco =
   409       let
   410         val Ss = Sorts.mg_domain algebra tyco [class];
   411       in Syntax.pretty_arity ctxt (tyco, Ss, [class]) end;
   412     fun mk_param (c, ty) = Pretty.str (Sign.extern_const thy c ^ " :: "
   413       ^ setmp show_sorts false (Syntax.string_of_typ ctxt o Type.strip_sorts) ty);
   414     fun mk_entry class = (Pretty.block o Pretty.fbreaks o map_filter I) [
   415       (SOME o Pretty.str) ("class " ^ Sign.extern_class thy class ^ ":"),
   416       (SOME o Pretty.block) [Pretty.str "supersort: ",
   417         (Syntax.pretty_sort ctxt o Sign.minimize_sort thy o Sign.super_classes thy) class],
   418       if is_class thy class then (SOME o Pretty.str)
   419         ("locale: " ^ Locale.extern thy class) else NONE,
   420       ((fn [] => NONE | ps => (SOME o Pretty.block o Pretty.fbreaks)
   421           (Pretty.str "parameters:" :: ps)) o map mk_param
   422         o these o Option.map #params o try (AxClass.get_info thy)) class,
   423       (SOME o Pretty.block o Pretty.breaks) [
   424         Pretty.str "instances:",
   425         Pretty.list "" "" (map (mk_arity class) (the_arities class))
   426       ]
   427     ]
   428   in
   429     (Pretty.writeln o Pretty.chunks o separate (Pretty.str "")
   430       o map mk_entry o Sorts.all_classes) algebra
   431   end;
   432 
   433 
   434 (* updaters *)
   435 
   436 fun add_class_data ((class, superclasses), (cs, base_sort, inst, phi, intro)) thy =
   437   let
   438     val operations = map (fn (v_ty as (_, ty'), (c, ty)) =>
   439       (c, ((Free v_ty, (Logic.varifyT ty, 0)), (Free v_ty, ty')))) cs;
   440     val cs = (map o pairself) fst cs;
   441     val add_class = Graph.new_node (class,
   442         mk_class_data ((cs, base_sort, map (SOME o Const) inst, phi, intro), ([], operations)))
   443       #> fold (curry Graph.add_edge class) superclasses;
   444   in
   445     ClassData.map add_class thy
   446   end;
   447 
   448 fun register_operation class ((c, (t, t_rev)), some_def) thy =
   449   let
   450     val ty = Sign.the_const_constraint thy c;
   451     val typargs = Sign.const_typargs thy (c, ty);
   452     val typidx = find_index (fn TVar ((v, _), _) => Name.aT = v | _ => false) typargs;
   453     val t_rev' = (map_types o map_atyps)
   454       (fn ty as TFree (v, _) => if Name.aT = v then TFree (v, []) else ty | ty => ty) t_rev;
   455     val ty' = Term.fastype_of t_rev';
   456   in
   457     thy
   458     |> (ClassData.map o Graph.map_node class o map_class_data o apsnd)
   459       (fn (defs, operations) =>
   460         (fold cons (the_list some_def) defs,
   461           (c, ((t, (ty, typidx)), (t_rev', ty'))) :: operations))
   462   end;
   463 
   464 
   465 (** rule calculation, tactics and methods **)
   466 
   467 val class_prefix = Logic.const_of_class o Sign.base_name;
   468 
   469 fun calculate_morphism class cs =
   470   let
   471     val subst_typ = Term.map_type_tfree (fn var as (v, sort) =>
   472       if v = Name.aT then TVar ((v, 0), [class]) else TVar ((v, 0), sort));
   473     fun subst_aterm (t as Free (v, ty)) = (case AList.lookup (op =) cs v
   474          of SOME (c, _) => Const (c, ty)
   475           | NONE => t)
   476       | subst_aterm t = t;
   477     val subst_term = map_aterms subst_aterm #> map_types subst_typ;
   478   in
   479     Morphism.identity
   480     $> Morphism.term_morphism subst_term
   481     $> Morphism.typ_morphism subst_typ
   482   end;
   483 
   484 fun class_intro thy class sups =
   485   let
   486     fun class_elim class =
   487       case (#axioms o AxClass.get_info thy) class
   488        of [thm] => SOME (Drule.unconstrainTs thm)
   489         | [] => NONE;
   490     val pred_intro = case Locale.intros thy class
   491      of ([ax_intro], [intro]) => intro |> OF_LAST ax_intro |> SOME
   492       | ([intro], []) => SOME intro
   493       | ([], [intro]) => SOME intro
   494       | _ => NONE;
   495     val pred_intro' = pred_intro
   496       |> Option.map (fn intro => intro OF map_filter class_elim sups);
   497     val class_intro = (#intro o AxClass.get_info thy) class;
   498     val raw_intro = case pred_intro'
   499      of SOME pred_intro => class_intro |> OF_LAST pred_intro
   500       | NONE => class_intro;
   501     val sort = Sign.super_classes thy class;
   502     val typ = TVar ((Name.aT, 0), sort);
   503     val defs = these_defs thy sups;
   504   in
   505     raw_intro
   506     |> Drule.instantiate' [SOME (Thm.ctyp_of thy typ)] []
   507     |> strip_all_ofclass thy sort
   508     |> Thm.strip_shyps
   509     |> MetaSimplifier.rewrite_rule defs
   510     |> Drule.unconstrainTs
   511   end;
   512 
   513 fun class_interpretation class facts defs thy =
   514   let
   515     val params = these_params thy [class];
   516     val inst = (#inst o the_class_data thy) class;
   517     val tac = ALLGOALS (ProofContext.fact_tac facts);
   518     val prfx = class_prefix class;
   519   in
   520     thy
   521     |> fold_map (get_remove_global_constraint o fst o snd) params
   522     ||> prove_interpretation tac ((false, prfx), []) (Locale.Locale class)
   523           (inst, map (fn def => (("", []), def)) defs)
   524     |-> (fn cs => fold (Sign.add_const_constraint o apsnd SOME) cs)
   525   end;
   526 
   527 fun intro_classes_tac facts st =
   528   let
   529     val thy = Thm.theory_of_thm st;
   530     val classes = Sign.all_classes thy;
   531     val class_trivs = map (Thm.class_triv thy) classes;
   532     val class_intros = these_intros thy;
   533     val axclass_intros = map_filter (try (#intro o AxClass.get_info thy)) classes;
   534   in
   535     (ALLGOALS (Method.insert_tac facts THEN'
   536       REPEAT_ALL_NEW (resolve_tac (class_trivs @ class_intros @ axclass_intros)))
   537     THEN Tactic.distinct_subgoals_tac) st
   538   end;
   539 
   540 fun default_intro_classes_tac [] = intro_classes_tac []
   541   | default_intro_classes_tac _ = no_tac;
   542 
   543 fun default_tac rules ctxt facts =
   544   HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
   545     default_intro_classes_tac facts;
   546 
   547 val _ = Context.add_setup (Method.add_methods
   548  [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
   549     "back-chain introduction rules of classes"),
   550   ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac),
   551     "apply some intro/elim rule")]);
   552 
   553 
   554 (** classes and class target **)
   555 
   556 (* class context syntax *)
   557 
   558 structure ClassSyntax = ProofDataFun(
   559   type T = {
   560     constraints: (string * typ) list,
   561     base_sort: sort,
   562     local_operation: string * typ -> (typ * term) option,
   563     rews: (term * term) list,
   564     passed: bool
   565   } option;
   566   fun init _ = NONE;
   567 );
   568 
   569 fun synchronize_syntax thy sups base_sort ctxt =
   570   let
   571     val operations = these_operations thy sups;
   572 
   573     (* constraints *)
   574     fun local_constraint (c, ((_, (ty, _)),_ )) =
   575       let
   576         val ty' = ty
   577           |> map_atyps (fn ty as TVar ((v, 0), _) =>
   578                if v = Name.aT then TVar ((v, 0), base_sort) else ty)
   579           |> SOME;
   580       in (c, ty') end
   581     val constraints = (map o apsnd) (fst o snd o fst) operations;
   582 
   583     (* check phase *)
   584     val typargs = Consts.typargs (ProofContext.consts_of ctxt);
   585     fun check_const (c, ty) ((t, (_, idx)), _) =
   586       ((nth (typargs (c, ty)) idx), t);
   587     fun local_operation (c_ty as (c, _)) = AList.lookup (op =) operations c
   588       |> Option.map (check_const c_ty);
   589 
   590     (* uncheck phase *)
   591     val rews = map (fn (c, (_, (t, ty))) => (t, Const (c, ty))) operations;
   592   in
   593     ctxt
   594     |> fold (ProofContext.add_const_constraint o local_constraint) operations
   595     |> ClassSyntax.map (K (SOME {
   596         constraints = constraints,
   597         base_sort = base_sort,
   598         local_operation = local_operation,
   599         rews = rews,
   600         passed = false
   601       }))
   602   end;
   603 
   604 fun refresh_syntax class ctxt =
   605   let
   606     val thy = ProofContext.theory_of ctxt;
   607     val base_sort = (#base_sort o the_class_data thy) class;
   608   in synchronize_syntax thy [class] base_sort ctxt end;
   609 
   610 val mark_passed = (ClassSyntax.map o Option.map)
   611   (fn { constraints, base_sort, local_operation, rews, passed } =>
   612     { constraints = constraints, base_sort = base_sort,
   613       local_operation = local_operation, rews = rews, passed = true });
   614 
   615 fun sort_term_check ts ctxt =
   616   let
   617     val { constraints, base_sort, local_operation, passed, ... } =
   618       the (ClassSyntax.get ctxt);
   619     fun check_typ (c, ty) (TFree (v, _), t) = if v = Name.aT
   620           then apfst (AList.update (op =) ((c, ty), t)) else I
   621       | check_typ (c, ty) (TVar (vi, _), t) = if TypeInfer.is_param vi
   622           then apfst (AList.update (op =) ((c, ty), t))
   623             #> apsnd (insert (op =) vi) else I
   624       | check_typ _ _ = I;
   625     fun add_const (Const c_ty) = Option.map (check_typ c_ty) (local_operation c_ty)
   626           |> the_default I
   627       | add_const _ = I;
   628     val (cs, typarams) = (fold o fold_aterms) add_const ts ([], []);
   629     val subst_typ = map_type_tvar (fn var as (vi, _) =>
   630       if member (op =) typarams vi then TFree (Name.aT, base_sort) else TVar var);
   631     val subst_term = map_aterms
   632         (fn t as Const (c, ty) => the_default t (AList.lookup (op =) cs (c, ty)) | t => t)
   633           #> map_types subst_typ;
   634     val ts' = map subst_term ts;
   635   in if eq_list (op aconv) (ts, ts') andalso passed then NONE
   636   else
   637     ctxt
   638     |> fold (ProofContext.add_const_constraint o apsnd SOME) constraints
   639     |> mark_passed
   640     |> pair ts'
   641     |> SOME
   642   end;
   643 
   644 val uncheck = ref true;
   645 
   646 fun sort_term_uncheck ts ctxt =
   647   let
   648     (*FIXME abbreviations*)
   649     val thy = ProofContext.theory_of ctxt;
   650     val rews = (#rews o the o ClassSyntax.get) ctxt;
   651     val ts' = if ! uncheck
   652       then map (Pattern.rewrite_term thy rews []) ts else ts;
   653   in if eq_list (op aconv) (ts, ts') then NONE else SOME (ts', ctxt) end;
   654 
   655 fun init_ctxt thy sups base_sort ctxt =
   656   ctxt
   657   |> Variable.declare_term
   658       (Logic.mk_type (TFree (Name.aT, base_sort)))
   659   |> synchronize_syntax thy sups base_sort
   660   |> Context.proof_map (
   661       Syntax.add_term_check 0 "class" sort_term_check
   662       #> Syntax.add_term_uncheck 0 "class" sort_term_uncheck)
   663 
   664 fun init class ctxt =
   665   let
   666     val thy = ProofContext.theory_of ctxt;
   667   in
   668     init_ctxt thy [class] ((#base_sort o the_class_data thy) class) ctxt
   669   end;
   670 
   671 
   672 (* class definition *)
   673 
   674 local
   675 
   676 fun gen_class_spec prep_class prep_expr process_expr thy raw_supclasses raw_includes_elems =
   677   let
   678     val supclasses = map (prep_class thy) raw_supclasses;
   679     val (sups, base_sort) = sups_base_sort thy supclasses;
   680     val supsort = Sign.minimize_sort thy supclasses;
   681     val suplocales = map Locale.Locale sups;
   682     val (raw_elems, includes) = fold_rev (fn Locale.Elem e => apfst (cons e)
   683       | Locale.Expr i => apsnd (cons (prep_expr thy i))) raw_includes_elems ([], []);
   684     val supexpr = Locale.Merge suplocales;
   685     val supparams = (map fst o Locale.parameters_of_expr thy) supexpr;
   686     val supconsts = AList.make (the o AList.lookup (op =) (these_params thy sups))
   687       (map fst supparams);
   688     val mergeexpr = Locale.Merge (suplocales @ includes);
   689     val constrain = Element.Constrains ((map o apsnd o map_atyps)
   690       (fn TFree (_, sort) => TFree (Name.aT, sort)) supparams);
   691   in
   692     ProofContext.init thy
   693     |> Locale.cert_expr supexpr [constrain]
   694     |> snd
   695     |> init_ctxt thy sups base_sort
   696     |> process_expr Locale.empty raw_elems
   697     |> fst
   698     |> (fn elems => ((((sups, supconsts), (supsort, base_sort, mergeexpr)),
   699           (*FIXME*) if null includes then constrain :: elems else elems)))
   700   end;
   701 
   702 val read_class_spec = gen_class_spec Sign.intern_class Locale.intern_expr Locale.read_expr;
   703 val check_class_spec = gen_class_spec (K I) (K I) Locale.cert_expr;
   704 
   705 fun define_class_params (name, raw_superclasses) raw_consts raw_dep_axioms other_consts thy =
   706   let
   707     val superclasses = map (Sign.certify_class thy) raw_superclasses;
   708     val consts = (map o apfst o apsnd) (Sign.certify_typ thy) raw_consts;
   709     fun add_const ((c, ty), syn) =
   710       Sign.declare_const [] (c, Type.strip_sorts ty, syn) #>> Term.dest_Const;
   711     fun mk_axioms cs thy =
   712       raw_dep_axioms thy cs
   713       |> (map o apsnd o map) (Sign.cert_prop thy)
   714       |> rpair thy;
   715     fun constrain_typs class = (map o apsnd o Term.map_type_tfree)
   716       (fn (v, _) => TFree (v, [class]))
   717   in
   718     thy
   719     |> Sign.add_path (Logic.const_of_class name)
   720     |> fold_map add_const consts
   721     ||> Sign.restore_naming thy
   722     |-> (fn cs => mk_axioms cs
   723     #-> (fn axioms_prop => AxClass.define_class (name, superclasses)
   724            (map fst cs @ other_consts) axioms_prop
   725     #-> (fn class => `(fn _ => constrain_typs class cs)
   726     #-> (fn cs' => `(fn thy => AxClass.get_info thy class)
   727     #-> (fn {axioms, ...} => fold (Sign.add_const_constraint o apsnd SOME) cs'
   728     #> pair (class, (cs', axioms)))))))
   729   end;
   730 
   731 fun gen_class prep_spec prep_param bname
   732     raw_supclasses raw_includes_elems raw_other_consts thy =
   733   let
   734     val class = Sign.full_name thy bname;
   735     val (((sups, supconsts), (supsort, base_sort, mergeexpr)), elems_syn) =
   736       prep_spec thy raw_supclasses raw_includes_elems;
   737     val other_consts = map (tap (Sign.the_const_type thy) o prep_param thy) raw_other_consts;
   738     fun mk_inst class cs =
   739       (map o apsnd o Term.map_type_tfree) (fn (v, _) => TFree (v, [class])) cs;
   740     fun fork_syntax (Element.Fixes xs) =
   741           fold_map (fn (c, ty, syn) => cons (c, syn) #> pair (c, ty, NoSyn)) xs
   742           #>> Element.Fixes
   743       | fork_syntax x = pair x;
   744     val (elems, global_syn) = fold_map fork_syntax elems_syn [];
   745     fun globalize (c, ty) = 
   746       ((c, Term.map_type_tfree (K (TFree (Name.aT, base_sort))) ty),
   747         (the_default NoSyn o AList.lookup (op =) global_syn) c);
   748     fun extract_params thy =
   749       let
   750         val params = map fst (Locale.parameters_of thy class);
   751       in
   752         (params, (map globalize o snd o chop (length supconsts)) params)
   753       end;
   754     fun extract_assumes params thy cs =
   755       let
   756         val consts = supconsts @ (map (fst o fst) params ~~ cs);
   757         fun subst (Free (c, ty)) =
   758               Const ((fst o the o AList.lookup (op =) consts) c, ty)
   759           | subst t = t;
   760         fun prep_asm ((name, atts), ts) =
   761           ((Sign.base_name name, map (Attrib.attribute_i thy) atts),
   762             (map o map_aterms) subst ts);
   763       in
   764         Locale.global_asms_of thy class
   765         |> map prep_asm
   766       end;
   767   in
   768     thy
   769     |> Locale.add_locale_i (SOME "") bname mergeexpr elems
   770     |> snd
   771     |> ProofContext.theory (`extract_params
   772       #-> (fn (all_params, params) =>
   773         define_class_params (bname, supsort) params
   774           (extract_assumes params) other_consts
   775       #-> (fn (_, (consts, axioms)) =>
   776         `(fn thy => class_intro thy class sups)
   777       #-> (fn class_intro =>
   778         PureThy.note_thmss_qualified "" (NameSpace.append class classN)
   779           [((introN, []), [([class_intro], [])])]
   780       #-> (fn [(_, [class_intro])] =>
   781         add_class_data ((class, sups),
   782           (map fst params ~~ consts, base_sort,
   783             mk_inst class (map snd supconsts @ consts),
   784               calculate_morphism class (supconsts @ (map (fst o fst) params ~~ consts)), class_intro))
   785       #> class_interpretation class axioms []
   786       )))))
   787     |> pair class
   788   end;
   789 
   790 in
   791 
   792 val class_cmd = gen_class read_class_spec ((#1 o Term.dest_Const) oo Sign.read_const);
   793 val class = gen_class check_class_spec (K I);
   794 
   795 end; (*local*)
   796 
   797 
   798 (* definition in class target *)
   799 
   800 fun add_logical_const class pos ((c, mx), dict) thy =
   801   let
   802     val prfx = class_prefix class;
   803     val thy' = thy |> Sign.add_path prfx;
   804     val phi = morphism thy' class;
   805 
   806     val c' = Sign.full_name thy' c;
   807     val dict' = (map_types Logic.unvarifyT o Morphism.term phi) dict;
   808     val ty' = Term.fastype_of dict';
   809     val ty'' = Type.strip_sorts ty';
   810     val def_eq = Logic.mk_equals (Const (c', ty'), dict');
   811 
   812     val c'' = NameSpace.full (Sign.naming_of thy' |> NameSpace.add_path prfx) c;
   813   in
   814     thy'
   815     |> Sign.hide_consts_i false [c''] (*FIXME*)
   816     |> Sign.declare_const pos (c, ty'', mx) |> snd
   817     |> Thm.add_def false (c, def_eq)
   818     |>> Thm.symmetric
   819     |-> (fn def => class_interpretation class [def] [Thm.prop_of def]
   820           #> register_operation class ((c', (dict, dict')), SOME (Thm.varifyT def)))
   821     |> Sign.restore_naming thy
   822     |> Sign.add_const_constraint (c', SOME ty')
   823   end;
   824 
   825 
   826 (* abbreviation in class target *)
   827 
   828 fun add_syntactic_const class prmode pos ((c, mx), rhs) thy =
   829   let
   830     val prfx = class_prefix class;
   831     val thy' = thy |> Sign.add_path prfx;
   832     val phi = morphism thy class;
   833 
   834     val c' = Sign.full_name thy' c;
   835     val rews = map (Logic.dest_equals o Thm.prop_of) (these_defs thy' [class])
   836     val rhs' = (Pattern.rewrite_term thy rews [] o Morphism.term phi) rhs;
   837     val rhs'' = map_types Logic.unvarifyT rhs';
   838     val ty' = Term.fastype_of rhs'';
   839 
   840     val c'' = NameSpace.full (Sign.naming_of thy' |> NameSpace.add_path prfx) c;
   841     val ty'' = (Type.strip_sorts o Logic.unvarifyT) (Sign.the_const_constraint thy' c'');
   842   in
   843     thy'
   844     |> Sign.add_const_constraint (c'', SOME ty'') (*FIXME*)
   845     |> Sign.hide_consts_i false [c''] (*FIXME*)
   846     |> Sign.add_abbrev (#1 prmode) pos (c, map_types Type.strip_sorts rhs') |> snd
   847     |> Sign.add_const_constraint (c', SOME ty')
   848     |> Sign.notation true prmode [(Const (c', ty'), mx)]
   849     |> register_operation class ((c', (rhs, rhs'')), NONE)
   850     |> Sign.restore_naming thy
   851   end;
   852 
   853 end;