wenzelm@404: (*  Title:      Pure/axclass.ML
wenzelm@404:     ID:         $Id$
wenzelm@404:     Author:     Markus Wenzel, TU Muenchen
wenzelm@404: 
wenzelm@6379: Axiomatic type class package.
wenzelm@404: *)
wenzelm@404: 
wenzelm@404: signature AX_CLASS =
wenzelm@3938: sig
wenzelm@5685:   val quiet_mode: bool ref
wenzelm@6379:   val print_axclasses: theory -> unit
paulson@1498:   val add_classrel_thms: thm list -> theory -> theory
paulson@1498:   val add_arity_thms: thm list -> theory -> theory
wenzelm@15703:   val add_axclass: bclass * xclass list -> ((bstring * string) * Attrib.src list) list
wenzelm@6379:     -> theory -> theory * {intro: thm, axioms: thm list}
wenzelm@6379:   val add_axclass_i: bclass * class list -> ((bstring * term) * theory attribute list) list
wenzelm@6379:     -> theory -> theory * {intro: thm, axioms: thm list}
wenzelm@11828:   val add_inst_subclass_x: xclass * xclass -> string list -> thm list
wenzelm@3788:     -> tactic option -> theory -> theory
wenzelm@11828:   val add_inst_subclass: xclass * xclass -> tactic -> theory -> theory
wenzelm@11828:   val add_inst_subclass_i: class * class -> tactic -> theory -> theory
wenzelm@11828:   val add_inst_arity_x: xstring * string list * string -> string list
wenzelm@3938:     -> thm list -> tactic option -> theory -> theory
wenzelm@11828:   val add_inst_arity: xstring * string list * string -> tactic -> theory -> theory
wenzelm@11828:   val add_inst_arity_i: string * sort list * sort -> tactic -> theory -> theory
wenzelm@14605:   val default_intro_classes_tac: thm list -> tactic
wenzelm@6379:   val axclass_tac: thm list -> tactic
wenzelm@12876:   val instance_subclass_proof: xclass * xclass -> bool -> theory -> ProofHistory.T
wenzelm@12876:   val instance_subclass_proof_i: class * class -> bool -> theory -> ProofHistory.T
wenzelm@14605:   val instance_arity_proof: xstring * string list * string -> bool -> theory -> ProofHistory.T
wenzelm@14605:   val instance_arity_proof_i: string * sort list * sort -> bool -> theory -> ProofHistory.T
wenzelm@3938: end;
wenzelm@404: 
wenzelm@15801: structure AxClass: AX_CLASS =
wenzelm@404: struct
wenzelm@404: 
wenzelm@4015: 
wenzelm@404: (** utilities **)
wenzelm@404: 
wenzelm@5685: (* messages *)
wenzelm@5685: 
wenzelm@5685: val quiet_mode = ref false;
wenzelm@5685: fun message s = if ! quiet_mode then () else writeln s;
wenzelm@5685: 
wenzelm@5685: 
wenzelm@404: (* type vars *)
wenzelm@404: 
wenzelm@404: fun map_typ_frees f (Type (t, tys)) = Type (t, map (map_typ_frees f) tys)
wenzelm@404:   | map_typ_frees f (TFree a) = f a
wenzelm@404:   | map_typ_frees _ a = a;
wenzelm@404: 
wenzelm@404: val map_term_tfrees = map_term_types o map_typ_frees;
wenzelm@404: 
wenzelm@404: fun aT S = TFree ("'a", S);
wenzelm@404: 
wenzelm@3395: fun dest_varT (TFree (x, S)) = ((x, ~1), S)
wenzelm@3395:   | dest_varT (TVar xi_S) = xi_S
wenzelm@3788:   | dest_varT T = raise TYPE ("dest_varT", [T], []);
wenzelm@3395: 
wenzelm@404: 
wenzelm@886: (* get axioms and theorems *)
wenzelm@404: 
paulson@1498: val is_def = Logic.is_equals o #prop o rep_thm;
wenzelm@886: 
wenzelm@4934: fun witnesses thy names thms =
skalberg@15570:   PureThy.get_thmss thy (map (rpair NONE) names) @ thms @ List.filter is_def (map snd (axioms_of thy));
wenzelm@886: 
wenzelm@404: 
wenzelm@404: 
wenzelm@560: (** abstract syntax operations **)
wenzelm@423: 
wenzelm@6379: (* names *)
wenzelm@6379: 
wenzelm@6379: fun intro_name c = c ^ "I";
wenzelm@6379: val introN = "intro";
wenzelm@6379: val axiomsN = "axioms";
wenzelm@6379: 
wenzelm@6379: 
wenzelm@423: (* subclass relations as terms *)
wenzelm@423: 
paulson@1498: fun mk_classrel (c1, c2) = Logic.mk_inclass (aT [c1], c2);
wenzelm@423: 
wenzelm@423: fun dest_classrel tm =
wenzelm@423:   let
wenzelm@3788:     fun err () = raise TERM ("dest_classrel", [tm]);
wenzelm@423: 
wenzelm@3395:     val (ty, c2) = Logic.dest_inclass tm handle TERM _ => err ();
wenzelm@3395:     val c1 = (case dest_varT ty of (_, [c]) => c | _ => err ())
wenzelm@3395:       handle TYPE _ => err ();
wenzelm@6379:   in (c1, c2) end;
wenzelm@423: 
wenzelm@423: 
wenzelm@423: (* arities as terms *)
wenzelm@423: 
wenzelm@14605: fun mk_arity (t, Ss, c) =
wenzelm@423:   let
wenzelm@14695:     val tfrees = ListPair.map TFree (Term.invent_names [] "'a" (length Ss), Ss);
wenzelm@6379:   in Logic.mk_inclass (Type (t, tfrees), c) end;
wenzelm@423: 
wenzelm@14605: fun mk_arities (t, Ss, S) = map (fn c => mk_arity (t, Ss, c)) S;
wenzelm@14605: 
wenzelm@423: fun dest_arity tm =
wenzelm@423:   let
wenzelm@3788:     fun err () = raise TERM ("dest_arity", [tm]);
wenzelm@423: 
wenzelm@3395:     val (ty, c) = Logic.dest_inclass tm handle TERM _ => err ();
wenzelm@3395:     val (t, tvars) =
wenzelm@423:       (case ty of
wenzelm@3395:         Type (t, tys) => (t, map dest_varT tys handle TYPE _ => err ())
wenzelm@423:       | _ => err ());
wenzelm@423:     val ss =
wenzelm@3395:       if null (gen_duplicates eq_fst tvars)
wenzelm@3395:       then map snd tvars else err ();
wenzelm@6379:   in (t, ss, c) end;
wenzelm@423: 
wenzelm@423: 
wenzelm@423: 
wenzelm@560: (** add theorems as axioms **)
wenzelm@423: 
wenzelm@423: fun prep_thm_axm thy thm =
wenzelm@423:   let
wenzelm@423:     fun err msg = raise THM ("prep_thm_axm: " ^ msg, 0, [thm]);
wenzelm@423: 
wenzelm@1237:     val {sign, hyps, prop, ...} = rep_thm thm;
wenzelm@423:   in
wenzelm@6390:     if not (Sign.subsig (sign, Theory.sign_of thy)) then
wenzelm@423:       err "theorem not of same theory"
wenzelm@1237:     else if not (null (extra_shyps thm)) orelse not (null hyps) then
wenzelm@423:       err "theorem may not contain hypotheses"
wenzelm@423:     else prop
wenzelm@423:   end;
wenzelm@423: 
wenzelm@423: (*theorems expressing class relations*)
wenzelm@423: fun add_classrel_thms thms thy =
wenzelm@423:   let
wenzelm@423:     fun prep_thm thm =
wenzelm@423:       let
wenzelm@423:         val prop = prep_thm_axm thy thm;
wenzelm@423:         val (c1, c2) = dest_classrel prop handle TERM _ =>
wenzelm@423:           raise THM ("add_classrel_thms: theorem is not a class relation", 0, [thm]);
wenzelm@423:       in (c1, c2) end;
wenzelm@8897:   in Theory.add_classrel_i (map prep_thm thms) thy end;
wenzelm@423: 
wenzelm@423: (*theorems expressing arities*)
wenzelm@423: fun add_arity_thms thms thy =
wenzelm@423:   let
wenzelm@423:     fun prep_thm thm =
wenzelm@423:       let
wenzelm@423:         val prop = prep_thm_axm thy thm;
wenzelm@423:         val (t, ss, c) = dest_arity prop handle TERM _ =>
wenzelm@423:           raise THM ("add_arity_thms: theorem is not an arity", 0, [thm]);
wenzelm@423:       in (t, ss, [c]) end;
wenzelm@8897:   in Theory.add_arities_i (map prep_thm thms) thy end;
wenzelm@6379: 
wenzelm@6379: 
wenzelm@6379: 
wenzelm@6379: (** axclass info **)
wenzelm@6379: 
wenzelm@6379: (* data kind 'Pure/axclasses' *)
wenzelm@6379: 
wenzelm@6379: type axclass_info =
wenzelm@6379:   {super_classes: class list,
wenzelm@6379:     intro: thm,
wenzelm@6379:     axioms: thm list};
wenzelm@6379: 
wenzelm@6379: structure AxclassesArgs =
wenzelm@6379: struct
wenzelm@6379:   val name = "Pure/axclasses";
wenzelm@6379:   type T = axclass_info Symtab.table;
wenzelm@6379: 
wenzelm@6379:   val empty = Symtab.empty;
wenzelm@6546:   val copy = I;
wenzelm@6379:   val prep_ext = I;
wenzelm@6379:   fun merge (tab1, tab2) = Symtab.merge (K true) (tab1, tab2);
wenzelm@6379: 
wenzelm@6379:   fun print sg tab =
wenzelm@6379:     let
wenzelm@6379:       val ext_class = Sign.cond_extern sg Sign.classK;
wenzelm@6379:       val ext_thm = PureThy.cond_extern_thm_sg sg;
wenzelm@6379: 
wenzelm@6379:       fun pretty_class c cs = Pretty.block
wenzelm@6379:         (Pretty.str (ext_class c) :: Pretty.str " <" :: Pretty.brk 1 ::
wenzelm@6379:           Pretty.breaks (map (Pretty.str o ext_class) cs));
wenzelm@6379: 
wenzelm@10008:       fun pretty_thms name thms = Pretty.big_list (name ^ ":")
wenzelm@10008:         (map (Display.pretty_thm_sg sg) thms);
wenzelm@6379: 
wenzelm@6379:       fun pretty_axclass (name, {super_classes, intro, axioms}) = Pretty.block (Pretty.fbreaks
wenzelm@6379:         [pretty_class name super_classes, pretty_thms introN [intro], pretty_thms axiomsN axioms]);
wenzelm@8720:     in Pretty.writeln (Pretty.chunks (map pretty_axclass (Symtab.dest tab))) end;
wenzelm@6379: end;
wenzelm@6379: 
wenzelm@6379: structure AxclassesData = TheoryDataFun(AxclassesArgs);
wenzelm@15801: val _ = Context.add_setup [AxclassesData.init];
wenzelm@6379: val print_axclasses = AxclassesData.print;
wenzelm@6379: 
wenzelm@6379: 
wenzelm@6379: (* get and put data *)
wenzelm@6379: 
wenzelm@6379: fun lookup_axclass_info_sg sg c = Symtab.lookup (AxclassesData.get_sg sg, c);
wenzelm@6379: 
wenzelm@6379: fun get_axclass_info thy c =
wenzelm@6379:   (case lookup_axclass_info_sg (Theory.sign_of thy) c of
skalberg@15531:     NONE => error ("Unknown axclass " ^ quote c)
skalberg@15531:   | SOME info => info);
wenzelm@6379: 
wenzelm@6379: fun put_axclass_info c info thy =
wenzelm@6379:   thy |> AxclassesData.put (Symtab.update ((c, info), AxclassesData.get thy));
wenzelm@423: 
wenzelm@423: 
wenzelm@423: 
wenzelm@423: (** add axiomatic type classes **)
wenzelm@404: 
wenzelm@404: (* errors *)
wenzelm@404: 
wenzelm@404: fun err_bad_axsort ax c =
wenzelm@404:   error ("Sort constraint in axiom " ^ quote ax ^ " not supersort of " ^ quote c);
wenzelm@404: 
wenzelm@404: fun err_bad_tfrees ax =
wenzelm@404:   error ("More than one type variable in axiom " ^ quote ax);
wenzelm@404: 
wenzelm@404: 
wenzelm@404: (* ext_axclass *)
wenzelm@404: 
wenzelm@6379: fun ext_axclass prep_class prep_axm prep_att (bclass, raw_super_classes) raw_axioms_atts thy =
wenzelm@404:   let
wenzelm@6379:     val sign = Theory.sign_of thy;
wenzelm@3938: 
wenzelm@6379:     val class = Sign.full_name sign bclass;
wenzelm@6379:     val super_classes = map (prep_class sign) raw_super_classes;
wenzelm@6379:     val axms = map (prep_axm sign o fst) raw_axioms_atts;
wenzelm@6379:     val atts = map (map (prep_att thy) o snd) raw_axioms_atts;
wenzelm@404: 
wenzelm@6379:     (*declare class*)
wenzelm@6379:     val class_thy =
wenzelm@6379:       thy |> Theory.add_classes_i [(bclass, super_classes)];
wenzelm@6379:     val class_sign = Theory.sign_of class_thy;
wenzelm@404: 
wenzelm@6379:     (*prepare abstract axioms*)
wenzelm@404:     fun abs_axm ax =
wenzelm@404:       if null (term_tfrees ax) then
wenzelm@14854:         Logic.mk_implies (Logic.mk_inclass (aT [], class), ax)
wenzelm@3788:       else map_term_tfrees (K (aT [class])) ax;
wenzelm@6379:     val abs_axms = map (abs_axm o #2) axms;
wenzelm@404: 
wenzelm@404:     fun axm_sort (name, ax) =
wenzelm@404:       (case term_tfrees ax of
wenzelm@404:         [] => []
wenzelm@6379:       | [(_, S)] => if Sign.subsort class_sign ([class], S) then S else err_bad_axsort name class
wenzelm@404:       | _ => err_bad_tfrees name);
skalberg@15570:     val axS = Sign.certify_sort class_sign (List.concat (map axm_sort axms));
wenzelm@404: 
paulson@1498:     val int_axm = Logic.close_form o map_term_tfrees (K (aT axS));
paulson@1498:     fun inclass c = Logic.mk_inclass (aT axS, c);
wenzelm@404: 
paulson@1498:     val intro_axm = Logic.list_implies
wenzelm@6379:       (map inclass super_classes @ map (int_axm o #2) axms, inclass class);
wenzelm@6379: 
wenzelm@6379:     (*declare axioms and rule*)
wenzelm@8420:     val (axms_thy, ([intro], [axioms])) =
wenzelm@6379:       class_thy
wenzelm@6379:       |> Theory.add_path bclass
wenzelm@6379:       |> PureThy.add_axioms_i [Thm.no_attributes (introN, intro_axm)]
wenzelm@8420:       |>>> PureThy.add_axiomss_i [Thm.no_attributes (axiomsN, abs_axms)];
wenzelm@6379:     val info = {super_classes = super_classes, intro = intro, axioms = axioms};
wenzelm@6379: 
wenzelm@6379:     (*store info*)
wenzelm@6379:     val final_thy =
wenzelm@6379:       axms_thy
wenzelm@8420:       |> (#1 o PureThy.add_thms ((map #1 axms ~~ axioms) ~~ atts))
wenzelm@6379:       |> Theory.parent_path
wenzelm@8420:       |> (#1 o PureThy.add_thms [Thm.no_attributes (intro_name bclass, intro)])
wenzelm@6379:       |> put_axclass_info class info;
wenzelm@6379:   in (final_thy, {intro = intro, axioms = axioms}) end;
wenzelm@404: 
wenzelm@404: 
wenzelm@404: (* external interfaces *)
wenzelm@404: 
wenzelm@6390: val add_axclass = ext_axclass Sign.intern_class Theory.read_axm Attrib.global_attribute;
wenzelm@6390: val add_axclass_i = ext_axclass (K I) Theory.cert_axm (K I);
wenzelm@404: 
wenzelm@404: 
wenzelm@404: 
wenzelm@423: (** prove class relations and type arities **)
wenzelm@423: 
wenzelm@423: (* class_axms *)
wenzelm@404: 
wenzelm@6379: fun class_axms sign =
wenzelm@6379:   let val classes = Sign.classes sign in
wenzelm@6379:     map (Thm.class_triv sign) classes @
skalberg@15570:     List.mapPartial (Option.map #intro o lookup_axclass_info_sg sign) classes
wenzelm@404:   end;
wenzelm@404: 
wenzelm@423: 
wenzelm@15801: (* proof methods *)
wenzelm@6379: 
wenzelm@14605: fun intro_classes_tac facts st =
wenzelm@14605:   (ALLGOALS (Method.insert_tac facts THEN'
wenzelm@14605:       REPEAT_ALL_NEW (resolve_tac (class_axms (Thm.sign_of_thm st))))
wenzelm@14605:     THEN Tactic.distinct_subgoals_tac) st;
wenzelm@6379: 
wenzelm@14605: fun default_intro_classes_tac [] = intro_classes_tac []
wenzelm@14605:   | default_intro_classes_tac _ = Tactical.no_tac;    (*no error message!*)
wenzelm@10309: 
wenzelm@10309: fun default_tac rules ctxt facts =
wenzelm@14605:   HEADGOAL (Method.some_rule_tac rules ctxt facts) ORELSE
wenzelm@14605:     default_intro_classes_tac facts;
wenzelm@10309: 
wenzelm@15801: val _ = Context.add_setup [Method.add_methods
wenzelm@15801:  [("intro_classes", Method.no_args (Method.METHOD intro_classes_tac),
wenzelm@15801:    "back-chain introduction rules of axiomatic type classes"),
wenzelm@15801:   ("default", Method.thms_ctxt_args (Method.METHOD oo default_tac), "apply some intro/elim rule")]];
wenzelm@10309: 
wenzelm@10309: 
wenzelm@14605: (* old-style axclass_tac *)
wenzelm@423: 
wenzelm@487: (*(1) repeatedly resolve goals of form "OFCLASS(ty, c_class)",
wenzelm@1217:       try class_trivs first, then "cI" axioms
wenzelm@423:   (2) rewrite goals using user supplied definitions
wenzelm@423:   (3) repeatedly resolve goals with user supplied non-definitions*)
wenzelm@423: 
wenzelm@6379: fun axclass_tac thms =
wenzelm@1217:   let
skalberg@15570:     val defs = List.filter is_def thms;
wenzelm@1217:     val non_defs = filter_out is_def thms;
wenzelm@1217:   in
wenzelm@14605:     intro_classes_tac [] THEN
wenzelm@1217:     TRY (rewrite_goals_tac defs) THEN
wenzelm@1217:     TRY (REPEAT_FIRST (fn i => assume_tac i ORELSE resolve_tac non_defs i))
wenzelm@1217:   end;
wenzelm@404: 
wenzelm@404: 
wenzelm@14605: (* old-style provers *)
wenzelm@404: 
wenzelm@11969: fun prove mk_prop str_of sign prop thms usr_tac =
skalberg@15570:   (Tactic.prove sign [] [] (mk_prop prop) (K (axclass_tac thms THEN (getOpt (usr_tac,all_tac))))
wenzelm@11969:     handle ERROR => error ("The error(s) above occurred while trying to prove " ^
wenzelm@11969:      quote (str_of sign prop))) |> Drule.standard;
wenzelm@404: 
wenzelm@14824: val prove_subclass = prove mk_classrel (fn sg => fn (c1, c2) =>
wenzelm@14824:   Pretty.string_of_classrel (Sign.pp sg) [c1, c2]);
wenzelm@404: 
wenzelm@14824: val prove_arity = prove mk_arity (fn sg => fn (t, Ss, c) =>
wenzelm@14824:   Pretty.string_of_arity (Sign.pp sg) (t, Ss, [c]));
wenzelm@404: 
wenzelm@404: 
wenzelm@423: 
wenzelm@449: (** add proved subclass relations and arities **)
wenzelm@404: 
wenzelm@8897: (* prepare classes and arities *)
wenzelm@8897: 
wenzelm@8897: fun read_class sg c = Sign.certify_class sg (Sign.intern_class sg c);
wenzelm@8897: 
wenzelm@14824: fun test_classrel sg cc = (Type.add_classrel (Sign.pp sg) [cc] (Sign.tsig_of sg); cc);
wenzelm@14785: fun cert_classrel sg = test_classrel sg o Library.pairself (Sign.certify_class sg);
wenzelm@14785: fun read_classrel sg = test_classrel sg o Library.pairself (read_class sg);
wenzelm@3949: 
wenzelm@14824: fun test_arity sg ar = (Type.add_arities (Sign.pp sg) [ar] (Sign.tsig_of sg); ar);
wenzelm@6379: 
wenzelm@8897: fun prep_arity prep_tycon prep_sort prep_x sg (t, Ss, x) =
wenzelm@14824:   test_arity sg (prep_tycon sg t, map (prep_sort sg) Ss, prep_x sg x);
wenzelm@8897: 
wenzelm@8897: val read_arity = prep_arity Sign.intern_tycon Sign.read_sort Sign.read_sort;
wenzelm@8897: val cert_arity = prep_arity (K I) Sign.certify_sort Sign.certify_sort;
wenzelm@8897: 
wenzelm@8897: 
wenzelm@8897: (* old-style instance declarations *)
wenzelm@6379: 
wenzelm@6379: fun ext_inst_subclass prep_classrel raw_c1_c2 names thms usr_tac thy =
wenzelm@11969:   let
wenzelm@11969:     val sign = Theory.sign_of thy;
wenzelm@14824:     val (c1, c2) = prep_classrel sign raw_c1_c2;
wenzelm@11969:   in
wenzelm@14824:     message ("Proving class inclusion " ^ quote (Sign.string_of_classrel sign [c1, c2]) ^ " ...");
wenzelm@14824:     thy |> add_classrel_thms [prove_subclass sign (c1, c2) (witnesses thy names thms) usr_tac]
wenzelm@3788:   end;
wenzelm@423: 
wenzelm@6379: fun ext_inst_arity prep_arity (raw_t, raw_Ss, raw_cs) names thms usr_tac thy =
wenzelm@423:   let
wenzelm@6379:     val sign = Theory.sign_of thy;
wenzelm@6379:     val (t, Ss, cs) = prep_arity sign (raw_t, raw_Ss, raw_cs);
wenzelm@4934:     val wthms = witnesses thy names thms;
wenzelm@423:     fun prove c =
wenzelm@5685:      (message ("Proving type arity " ^
wenzelm@14824:         quote (Sign.string_of_arity sign (t, Ss, [c])) ^ " ...");
wenzelm@11969:         prove_arity sign (t, Ss, c) wthms usr_tac);
wenzelm@6379:   in add_arity_thms (map prove cs) thy end;
wenzelm@6379: 
skalberg@15531: fun sane_inst_subclass prep sub tac = ext_inst_subclass prep sub [] [] (SOME tac);
skalberg@15531: fun sane_inst_arity prep arity tac = ext_inst_arity prep arity [] [] (SOME tac);
wenzelm@6379: 
wenzelm@11828: val add_inst_subclass_x = ext_inst_subclass read_classrel;
wenzelm@11828: val add_inst_subclass = sane_inst_subclass read_classrel;
wenzelm@11828: val add_inst_subclass_i = sane_inst_subclass cert_classrel;
wenzelm@11828: val add_inst_arity_x = ext_inst_arity read_arity;
wenzelm@11828: val add_inst_arity = sane_inst_arity read_arity;
wenzelm@11828: val add_inst_arity_i = sane_inst_arity cert_arity;
wenzelm@6379: 
wenzelm@404: 
wenzelm@404: 
wenzelm@6379: (** instance proof interfaces **)
wenzelm@6379: 
wenzelm@14605: fun inst_proof mk_prop add_thms inst int theory =
wenzelm@14605:   theory
ballarin@15696:   |> IsarThy.multi_theorem_i Drule.internalK I ProofContext.export_standard
wenzelm@14605:     ("", [fn (thy, th) => (add_thms [th] thy, th)]) []
wenzelm@14605:     (map (fn t => (("", []), [(t, ([], []))])) (mk_prop (Theory.sign_of theory) inst)) int;
wenzelm@6379: 
wenzelm@14605: val instance_subclass_proof =
wenzelm@14605:   inst_proof (single oo (mk_classrel oo read_classrel)) add_classrel_thms;
wenzelm@14605: val instance_subclass_proof_i =
wenzelm@14605:   inst_proof (single oo (mk_classrel oo cert_classrel)) add_classrel_thms;
wenzelm@14605: val instance_arity_proof = inst_proof (mk_arities oo read_arity) add_arity_thms;
wenzelm@14605: val instance_arity_proof_i = inst_proof (mk_arities oo cert_arity) add_arity_thms;
wenzelm@6379: 
wenzelm@6379: 
wenzelm@6379: (* outer syntax *)
wenzelm@6379: 
wenzelm@6719: local structure P = OuterParse and K = OuterSyntax.Keyword in
wenzelm@3949: 
wenzelm@6379: val axclassP =
wenzelm@6719:   OuterSyntax.command "axclass" "define axiomatic type class" K.thy_decl
wenzelm@12876:     ((P.name -- Scan.optional ((P.$$$ "\\<subseteq>" || P.$$$ "<") |--
wenzelm@12876:         P.!!! (P.list1 P.xname)) []) -- Scan.repeat P.spec_name
wenzelm@6379:       >> (fn (cls, axs) => Toplevel.theory (#1 o add_axclass cls axs)));
wenzelm@6379: 
wenzelm@6379: val instanceP =
wenzelm@6719:   OuterSyntax.command "instance" "prove type arity or subclass relation" K.thy_goal
wenzelm@12876:     ((P.xname -- ((P.$$$ "\\<subseteq>" || P.$$$ "<") |-- P.xname) >> instance_subclass_proof ||
wenzelm@14605:       (P.xname -- (P.$$$ "::" |-- P.arity) >> P.triple2) >> instance_arity_proof)
wenzelm@6379:       >> (Toplevel.print oo Toplevel.theory_to_proof));
wenzelm@6379: 
wenzelm@6379: val _ = OuterSyntax.add_parsers [axclassP, instanceP];
wenzelm@6379: 
wenzelm@6379: end;
wenzelm@3949: 
wenzelm@404: end;