src/Pure/pure_thy.ML
author wenzelm
Tue Nov 28 00:35:21 2006 +0100 (2006-11-28)
changeset 21566 af2932baf068
parent 21524 7843e2fd14a9
child 21567 c097a926ba78
permissions -rw-r--r--
dest_term: strip_imp_concl;
     1 (*  Title:      Pure/pure_thy.ML
     2     ID:         $Id$
     3     Author:     Markus Wenzel, TU Muenchen
     4 
     5 Theorem storage.  The ProtoPure theory.
     6 *)
     7 
     8 signature BASIC_PURE_THY =
     9 sig
    10   datatype interval = FromTo of int * int | From of int | Single of int
    11   datatype thmref =
    12     Name of string |
    13     NameSelection of string * interval list |
    14     Fact of string
    15   val get_thm: theory -> thmref -> thm
    16   val get_thms: theory -> thmref -> thm list
    17   val get_thmss: theory -> thmref list -> thm list
    18   val thm: xstring -> thm
    19   val thms: xstring -> thm list
    20   structure ProtoPure:
    21     sig
    22       val thy: theory
    23       val prop_def: thm
    24       val term_def: thm
    25       val conjunction_def: thm
    26     end
    27 end;
    28 
    29 signature PURE_THY =
    30 sig
    31   include BASIC_PURE_THY
    32   val map_tags: (tag list -> tag list) -> thm -> thm
    33   val tag_rule: tag -> thm -> thm
    34   val untag_rule: string -> thm -> thm
    35   val tag: tag -> attribute
    36   val untag: string -> attribute
    37   val get_kind: thm -> string
    38   val kind_rule: string -> thm -> thm
    39   val kind: string -> attribute
    40   val kind_internal: attribute
    41   val has_internal: tag list -> bool
    42   val is_internal: thm -> bool
    43   val string_of_thmref: thmref -> string
    44   val get_thm_closure: theory -> thmref -> thm
    45   val get_thms_closure: theory -> thmref -> thm list
    46   val single_thm: string -> thm list -> thm
    47   val name_of_thmref: thmref -> string
    48   val map_name_of_thmref: (string -> string) -> thmref -> thmref
    49   val select_thm: thmref -> thm list -> thm list
    50   val selections: string * thm list -> (thmref * thm) list
    51   val theorems_of: theory -> thm list NameSpace.table
    52   val theorem_space: theory -> NameSpace.T
    53   val fact_index_of: theory -> FactIndex.T
    54   val valid_thms: theory -> thmref * thm list -> bool
    55   val thms_containing: theory -> FactIndex.spec -> (string * thm list) list
    56   val thms_containing_consts: theory -> string list -> (string * thm) list
    57   val thms_of: theory -> (string * thm) list
    58   val all_thms_of: theory -> (string * thm) list
    59   val hide_thms: bool -> string list -> theory -> theory
    60   val name_thms: bool -> string -> thm list -> thm list
    61   val name_thmss: string -> (thm list * 'a) list -> (thm list * 'a) list
    62   val store_thm: (bstring * thm) * attribute list -> theory -> thm * theory
    63   val smart_store_thms: (bstring * thm list) -> thm list
    64   val smart_store_thms_open: (bstring * thm list) -> thm list
    65   val forall_elim_var: int -> thm -> thm
    66   val forall_elim_vars: int -> thm -> thm
    67   val name_multi: string -> 'a list -> (string * 'a) list
    68   val add_thms: ((bstring * thm) * attribute list) list -> theory -> thm list * theory
    69   val add_thmss: ((bstring * thm list) * attribute list) list -> theory -> thm list list * theory 
    70   val note_thmss: string -> ((bstring * attribute list) *
    71     (thmref * attribute list) list) list -> theory -> (bstring * thm list) list * theory
    72   val note_thmss_i: string -> ((bstring * attribute list) *
    73     (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
    74   val note_thmss_qualified: string -> string -> ((bstring * attribute list) *
    75     (thm list * attribute list) list) list -> theory -> (bstring * thm list) list * theory
    76   val add_axioms: ((bstring * string) * attribute list) list -> theory -> thm list * theory
    77   val add_axioms_i: ((bstring * term) * attribute list) list -> theory -> thm list * theory
    78   val add_axiomss: ((bstring * string list) * attribute list) list ->
    79     theory -> thm list list * theory
    80   val add_axiomss_i: ((bstring * term list) * attribute list) list ->
    81     theory -> thm list list * theory
    82   val add_defs: bool -> ((bstring * string) * attribute list) list ->
    83     theory -> thm list * theory
    84   val add_defs_i: bool -> ((bstring * term) * attribute list) list ->
    85     theory -> thm list * theory
    86   val add_defs_unchecked: bool -> ((bstring * string) * attribute list) list ->
    87     theory -> thm list * theory
    88   val add_defs_unchecked_i: bool -> ((bstring * term) * attribute list) list ->
    89     theory -> thm list * theory
    90   val add_defss: bool -> ((bstring * string list) * attribute list) list ->
    91     theory -> thm list list * theory
    92   val add_defss_i: bool -> ((bstring * term list) * attribute list) list ->
    93     theory -> thm list list * theory
    94   val generic_setup: string option -> theory -> theory
    95   val add_oracle: bstring * string * string -> theory -> theory
    96 end;
    97 
    98 structure PureThy: PURE_THY =
    99 struct
   100 
   101 
   102 (*** theorem tags ***)
   103 
   104 (* add / delete tags *)
   105 
   106 fun map_tags f thm =
   107   let val (name, tags) = Thm.get_name_tags thm
   108   in Thm.put_name_tags (name, f tags) thm end;
   109 
   110 fun tag_rule tg = map_tags (fn tgs => if member (op =) tgs tg then tgs else tgs @ [tg]);
   111 fun untag_rule s = map_tags (filter_out (fn (s', _) => s = s'));
   112 
   113 fun tag tg x = Thm.rule_attribute (K (tag_rule tg)) x;
   114 fun untag s x = Thm.rule_attribute (K (untag_rule s)) x;
   115 
   116 fun simple_tag name x = tag (name, []) x;
   117 
   118 
   119 (* theorem kinds *)
   120 
   121 fun get_kind thm =
   122   (case AList.lookup (op =) ((#2 o Thm.get_name_tags) thm) "kind" of
   123     SOME (k :: _) => k
   124   | _ => "unknown");
   125 
   126 fun kind_rule k = tag_rule ("kind", [k]) o untag_rule "kind";
   127 fun kind k x = if k = "" then x else Thm.rule_attribute (K (kind_rule k)) x;
   128 fun kind_internal x = kind internalK x;
   129 fun has_internal tags = exists (fn ("kind", [k]) => k = internalK | _ => false) tags;
   130 val is_internal = has_internal o Thm.tags_of_thm;
   131 
   132 
   133 
   134 (*** theorem database ***)
   135 
   136 (** dataype theorems **)
   137 
   138 structure TheoremsData = TheoryDataFun
   139 (struct
   140   val name = "Pure/theorems";
   141   type T =
   142    {theorems: thm list NameSpace.table,
   143     index: FactIndex.T} ref;
   144 
   145   fun mk_empty _ =
   146     ref {theorems = NameSpace.empty_table, index = FactIndex.empty}: T;
   147 
   148   val empty = mk_empty ();
   149   fun copy (ref x) = ref x;
   150   val extend = mk_empty;
   151   fun merge _ = mk_empty;
   152   fun print _ _ = ();
   153 end);
   154 
   155 val get_theorems_ref = TheoremsData.get;
   156 val get_theorems = ! o get_theorems_ref;
   157 val theorems_of = #theorems o get_theorems;
   158 val theorem_space = #1 o theorems_of;
   159 val fact_index_of = #index o get_theorems;
   160 
   161 
   162 
   163 (** retrieve theorems **)
   164 
   165 fun the_thms _ (SOME thms) = thms
   166   | the_thms name NONE = error ("Unknown theorem(s) " ^ quote name);
   167 
   168 fun single_thm _ [thm] = thm
   169   | single_thm name _ = error ("Single theorem expected " ^ quote name);
   170 
   171 
   172 (* datatype interval *)
   173 
   174 datatype interval =
   175   FromTo of int * int |
   176   From of int |
   177   Single of int;
   178 
   179 fun interval _ (FromTo (i, j)) = i upto j
   180   | interval n (From i) = i upto n
   181   | interval _ (Single i) = [i];
   182 
   183 fun string_of_interval (FromTo (i, j)) = string_of_int i ^ "-" ^ string_of_int j
   184   | string_of_interval (From i) = string_of_int i ^ "-"
   185   | string_of_interval (Single i) = string_of_int i;
   186 
   187 
   188 (* datatype thmref *)
   189 
   190 datatype thmref =
   191   Name of string |
   192   NameSelection of string * interval list |
   193   Fact of string;
   194 
   195 fun name_of_thmref (Name name) = name
   196   | name_of_thmref (NameSelection (name, _)) = name
   197   | name_of_thmref (Fact _) = error "Illegal literal fact";
   198 
   199 fun map_name_of_thmref f (Name name) = Name (f name)
   200   | map_name_of_thmref f (NameSelection (name, is)) = NameSelection (f name, is)
   201   | map_name_of_thmref _ thmref = thmref;
   202 
   203 fun string_of_thmref (Name name) = name
   204   | string_of_thmref (NameSelection (name, is)) =
   205       name ^ enclose "(" ")" (commas (map string_of_interval is))
   206   | string_of_thmref (Fact _) = error "Illegal literal fact";
   207 
   208 
   209 (* select_thm *)
   210 
   211 fun select_thm (Name _) thms = thms
   212   | select_thm (Fact _) thms = thms
   213   | select_thm (NameSelection (name, is)) thms =
   214       let
   215         val n = length thms;
   216         fun select i =
   217           if i < 1 orelse i > n then
   218             error ("Bad subscript " ^ string_of_int i ^ " for " ^
   219               quote name ^ " (length " ^ string_of_int n ^ ")")
   220           else List.nth (thms, i - 1);
   221       in map select (maps (interval n) is) end;
   222 
   223 
   224 (* selections *)
   225 
   226 fun selections (name, [thm]) = [(Name name, thm)]
   227   | selections (name, thms) = (1 upto length thms, thms) |> ListPair.map (fn (i, thm) =>
   228       (NameSelection (name, [Single i]), thm));
   229 
   230 
   231 (* get_thm(s)_closure -- statically scoped versions *)
   232 
   233 (*beware of proper order of evaluation!*)
   234 
   235 fun lookup_thms thy =
   236   let
   237     val thy_ref = Theory.self_ref thy;
   238     val (space, thms) = #theorems (get_theorems thy);
   239   in
   240     fn name =>
   241       Option.map (map (Thm.transfer (Theory.deref thy_ref)))     (*dynamic identity*)
   242       (Symtab.lookup thms (NameSpace.intern space name)) (*static content*)
   243   end;
   244 
   245 fun get_thms_closure thy =
   246   let val closures = map lookup_thms (thy :: Theory.ancestors_of thy) in
   247     fn thmref =>
   248       let val name = name_of_thmref thmref;
   249       in select_thm thmref (the_thms name (get_first (fn f => f name) closures)) end
   250   end;
   251 
   252 fun get_thm_closure thy =
   253   let val get = get_thms_closure thy
   254   in fn thmref => single_thm (name_of_thmref thmref) (get thmref) end;
   255 
   256 
   257 (* get_thms etc. *)
   258 
   259 fun get_thms theory thmref =
   260   let val name = name_of_thmref thmref in
   261     get_first (fn thy => lookup_thms thy name) (theory :: Theory.ancestors_of theory)
   262     |> the_thms name |> select_thm thmref |> map (Thm.transfer theory)
   263   end;
   264 
   265 fun get_thmss thy thmrefs = maps (get_thms thy) thmrefs;
   266 fun get_thm thy thmref = single_thm (name_of_thmref thmref) (get_thms thy thmref);
   267 
   268 fun thm name = get_thm (the_context ()) (Name name);
   269 fun thms name = get_thms (the_context ()) (Name name);
   270 
   271 
   272 (* thms_containing etc. *)
   273 
   274 fun valid_thms thy (thmref, ths) =
   275   (case try (get_thms thy) thmref of
   276     NONE => false
   277   | SOME ths' => Thm.eq_thms (ths, ths'));
   278 
   279 fun thms_containing theory spec =
   280   (theory :: Theory.ancestors_of theory)
   281   |> maps (fn thy =>
   282       FactIndex.find (fact_index_of thy) spec
   283       |> List.filter (fn (name, ths) => valid_thms theory (Name name, ths))
   284       |> distinct (eq_fst (op =)));
   285 
   286 fun thms_containing_consts thy consts =
   287   thms_containing thy (consts, []) |> maps #2
   288   |> map (fn th => (Thm.name_of_thm th, th));
   289 
   290 
   291 (* thms_of etc. *)
   292 
   293 fun thms_of thy =
   294   let val thms = #2 (theorems_of thy)
   295   in map (fn th => (Thm.name_of_thm th, th)) (maps snd (Symtab.dest thms)) end;
   296 
   297 fun all_thms_of thy = maps thms_of (thy :: Theory.ancestors_of thy);
   298 
   299 
   300 
   301 (** store theorems **)                    (*DESTRUCTIVE*)
   302 
   303 (* hiding -- affects current theory node only *)
   304 
   305 fun hide_thms fully names thy =
   306   let
   307     val r as ref {theorems = (space, thms), index} = get_theorems_ref thy;
   308     val space' = fold (NameSpace.hide fully) names space;
   309   in r := {theorems = (space', thms), index = index}; thy end;
   310 
   311 
   312 (* naming *)
   313 
   314 fun gen_names _ len "" = replicate len ""
   315   | gen_names j len name = map (fn i => name ^ "_" ^ string_of_int i) (j + 1 upto j + len);
   316 
   317 fun name_multi name [x] = [(name, x)]
   318   | name_multi name xs = gen_names 0 (length xs) name ~~ xs;
   319 
   320 fun name_thm pre (name, thm) =
   321   if Thm.name_of_thm thm <> "" andalso pre then thm else Thm.name_thm (name, thm);
   322 
   323 fun name_thms pre name xs = map (name_thm pre) (name_multi name xs);
   324 
   325 fun name_thmss name xs =
   326   (case filter_out (null o fst) xs of
   327     [([x], z)] => [([name_thm true (name, x)], z)]
   328   | _ => fst (fold_map (fn (ys, z) => fn i =>
   329     ((map (name_thm true) (gen_names i (length ys) name ~~ ys), z), i + length ys)) xs 0));
   330 
   331 
   332 (* enter_thms *)
   333 
   334 fun warn_overwrite name = warning ("Replaced old copy of theorems " ^ quote name);
   335 fun warn_same name = warning ("Theorem database already contains a copy of " ^ quote name);
   336 
   337 fun enter_thms _ _ app_att ("", thms) thy = app_att (thy, thms) |> swap
   338   | enter_thms pre_name post_name app_att (bname, thms) thy =
   339       let
   340         val name = Sign.full_name thy bname;
   341         val (thy', thms') = apsnd (post_name name) (app_att (thy, pre_name name thms));
   342         val r as ref {theorems = (space, theorems), index} = get_theorems_ref thy';
   343         val space' = Sign.declare_name thy' name space;
   344         val theorems' = Symtab.update (name, thms') theorems;
   345         val index' = FactIndex.add_global (name, thms') index;
   346       in
   347         (case Symtab.lookup theorems name of
   348           NONE => ()
   349         | SOME thms'' =>
   350             if Thm.eq_thms (thms', thms'') then warn_same name
   351             else warn_overwrite name);
   352         r := {theorems = (space', theorems'), index = index'};
   353         (thms', thy')
   354       end;
   355 
   356 
   357 (* add_thms(s) *)
   358 
   359 fun add_thms_atts pre_name ((bname, thms), atts) =
   360   enter_thms pre_name (name_thms false) (foldl_map (Thm.theory_attributes atts)) (bname, thms);
   361 
   362 fun gen_add_thmss pre_name =
   363   fold_map (add_thms_atts pre_name);
   364 
   365 fun gen_add_thms pre_name args =
   366   apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
   367 
   368 val add_thmss = gen_add_thmss (name_thms true);
   369 val add_thms = gen_add_thms (name_thms true);
   370 
   371 
   372 (* note_thmss(_i) *)
   373 
   374 local
   375 
   376 fun gen_note_thmss get k = fold_map (fn ((bname, more_atts), ths_atts) => fn thy =>
   377   let
   378     fun app (x, (ths, atts)) = foldl_map (Thm.theory_attributes atts) (x, ths);
   379     val (thms, thy') = thy |> enter_thms
   380       name_thmss (name_thms false) (apsnd flat o foldl_map app)
   381       (bname, map (fn (ths, atts) => (get thy ths, atts @ more_atts @ [kind k])) ths_atts);
   382   in ((bname, thms), thy') end);
   383 
   384 in
   385 
   386 val note_thmss = gen_note_thmss get_thms;
   387 val note_thmss_i = gen_note_thmss (K I);
   388 
   389 end;
   390 
   391 fun note_thmss_qualified k path facts thy =
   392   thy
   393   |> Theory.add_path path
   394   |> Theory.no_base_names
   395   |> note_thmss_i k facts
   396   ||> Theory.restore_naming thy;
   397 
   398 
   399 (* store_thm *)
   400 
   401 fun store_thm ((bname, thm), atts) thy =
   402   let val ([th'], thy') = add_thms_atts (name_thms true) ((bname, [thm]), atts) thy
   403   in (th', thy') end;
   404 
   405 
   406 (* smart_store_thms(_open) *)
   407 
   408 local
   409 
   410 fun smart_store _ (name, []) =
   411       error ("Cannot store empty list of theorems: " ^ quote name)
   412   | smart_store name_thm (name, [thm]) =
   413       fst (enter_thms (name_thm true) (name_thm false) I (name, [thm]) (Thm.theory_of_thm thm))
   414   | smart_store name_thm (name, thms) =
   415       let
   416         fun merge th thy = Theory.merge (thy, Thm.theory_of_thm th)
   417           handle TERM (msg, _) => raise THM (msg, 0, [th]);
   418         val thy = fold merge (tl thms) (Thm.theory_of_thm (hd thms));
   419       in fst (enter_thms (name_thm true) (name_thm false) I (name, thms) thy) end;
   420 
   421 in
   422 
   423 val smart_store_thms = smart_store name_thms;
   424 val smart_store_thms_open = smart_store (K (K I));
   425 
   426 end;
   427 
   428 
   429 (* forall_elim_var(s) -- belongs to drule.ML *)
   430 
   431 fun forall_elim_vars_aux strip_vars i th =
   432   let
   433     val {thy, tpairs, prop, ...} = Thm.rep_thm th;
   434     val add_used = Term.fold_aterms
   435       (fn Var ((x, j), _) => if i = j then insert (op =) x else I | _ => I);
   436     val used = fold (fn (t, u) => add_used t o add_used u) tpairs (add_used prop []);
   437     val vars = strip_vars prop;
   438     val cvars = (Name.variant_list used (map #1 vars), vars)
   439       |> ListPair.map (fn (x, (_, T)) => Thm.cterm_of thy (Var ((x, i), T)));
   440   in fold Thm.forall_elim cvars th end;
   441 
   442 val forall_elim_vars = forall_elim_vars_aux Term.strip_all_vars;
   443 
   444 fun forall_elim_var i th = forall_elim_vars_aux
   445   (fn Const ("all", _) $ Abs (a, T, _) => [(a, T)]
   446   | _ => raise THM ("forall_elim_vars", i, [th])) i th;
   447 
   448 
   449 (* store axioms as theorems *)
   450 
   451 local
   452   fun get_ax thy (name, _) = Thm.get_axiom_i thy (Sign.full_name thy name);
   453   fun get_axs thy named_axs = map (forall_elim_vars 0 o get_ax thy) named_axs;
   454   fun add_single add ((name, ax), atts) thy =
   455     let
   456       val named_ax = [(name, ax)];
   457       val thy' = add named_ax thy;
   458       val thm = hd (get_axs thy' named_ax);
   459     in apfst hd (gen_add_thms (K I) [((name, thm), atts)] thy') end;
   460   fun add_multi add ((name, axs), atts) thy =
   461     let
   462       val named_axs = name_multi name axs;
   463       val thy' = add named_axs thy;
   464       val thms = get_axs thy' named_axs;
   465     in apfst hd (gen_add_thmss (K I) [((name, thms), atts)] thy') end;
   466   fun add_singles add = fold_map (add_single add);
   467   fun add_multis add = fold_map (add_multi add);
   468 in
   469   val add_axioms           = add_singles Theory.add_axioms;
   470   val add_axioms_i         = add_singles Theory.add_axioms_i;
   471   val add_axiomss          = add_multis Theory.add_axioms;
   472   val add_axiomss_i        = add_multis Theory.add_axioms_i;
   473   val add_defs             = add_singles o (Theory.add_defs false);
   474   val add_defs_i           = add_singles o (Theory.add_defs_i false);
   475   val add_defs_unchecked   = add_singles o (Theory.add_defs true);
   476   val add_defs_unchecked_i = add_singles o (Theory.add_defs_i true);
   477   val add_defss            = add_multis o (Theory.add_defs false);
   478   val add_defss_i          = add_multis o (Theory.add_defs_i false);
   479 end;
   480 
   481 
   482 
   483 (*** ML setup ***)
   484 
   485 (* generic_setup *)
   486 
   487 fun generic_setup NONE = (fn thy => thy |> Context.setup ())
   488   | generic_setup (SOME txt) = Context.use_let "val setup: theory -> theory" "setup" txt;
   489 
   490 
   491 (* add_oracle *)
   492 
   493 fun add_oracle (name, T, oracle) =
   494   let val txt =
   495     "local\n\
   496     \  type T = " ^ T ^ ";\n\
   497     \  val oracle: theory -> T -> term = " ^ oracle ^ ";\n\
   498     \  val name = " ^ quote name ^ ";\n\
   499     \  exception Arg of T;\n\
   500     \  val _ = Context.>> (Theory.add_oracle (name, fn (thy, Arg x) => oracle thy x));\n\
   501     \  val thy = Context.the_context ();\n\
   502     \  val invoke_" ^ name ^ " = Thm.invoke_oracle_i thy (Sign.full_name thy name);\n\
   503     \in\n\
   504     \  fun " ^ name ^ " thy x = invoke_" ^ name ^ " (thy, Arg x);\n\
   505     \end;\n";
   506   in Context.use_mltext_theory txt false end;
   507 
   508 
   509 
   510 (*** the ProtoPure theory ***)
   511 
   512 val aT = TFree ("'a", []);
   513 val A = Free ("A", propT);
   514 
   515 val proto_pure =
   516   Context.pre_pure_thy
   517   |> Compress.init_data
   518   |> Sign.init_data
   519   |> Theory.init_data
   520   |> Proofterm.init_data
   521   |> TheoremsData.init
   522   |> Theory.add_types
   523    [("fun", 2, NoSyn),
   524     ("prop", 0, NoSyn),
   525     ("itself", 1, NoSyn),
   526     ("dummy", 0, NoSyn)]
   527   |> Theory.add_nonterminals Syntax.basic_nonterms
   528   |> Theory.add_syntax
   529    [("_lambda",     "[pttrns, 'a] => logic",     Mixfix ("(3%_./ _)", [0, 3], 3)),
   530     ("_abs",        "'a",                        NoSyn),
   531     ("",            "'a => args",                Delimfix "_"),
   532     ("_args",       "['a, args] => args",        Delimfix "_,/ _"),
   533     ("",            "id => idt",                 Delimfix "_"),
   534     ("_idtdummy",   "idt",                       Delimfix "'_"),
   535     ("_idtyp",      "[id, type] => idt",         Mixfix ("_::_", [], 0)),
   536     ("_idtypdummy", "type => idt",               Mixfix ("'_()::_", [], 0)),
   537     ("",            "idt => idt",                Delimfix "'(_')"),
   538     ("",            "idt => idts",               Delimfix "_"),
   539     ("_idts",       "[idt, idts] => idts",       Mixfix ("_/ _", [1, 0], 0)),
   540     ("",            "idt => pttrn",              Delimfix "_"),
   541     ("",            "pttrn => pttrns",           Delimfix "_"),
   542     ("_pttrns",     "[pttrn, pttrns] => pttrns", Mixfix ("_/ _", [1, 0], 0)),
   543     ("",            "id => aprop",               Delimfix "_"),
   544     ("",            "longid => aprop",           Delimfix "_"),
   545     ("",            "var => aprop",              Delimfix "_"),
   546     ("_DDDOT",      "aprop",                     Delimfix "..."),
   547     ("_aprop",      "aprop => prop",             Delimfix "PROP _"),
   548     ("_asm",        "prop => asms",              Delimfix "_"),
   549     ("_asms",       "[prop, asms] => asms",      Delimfix "_;/ _"),
   550     ("_bigimpl",    "[asms, prop] => prop",      Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)),
   551     ("_ofclass",    "[type, logic] => prop",     Delimfix "(1OFCLASS/(1'(_,/ _')))"),
   552     ("_mk_ofclass", "_",                         NoSyn),
   553     ("_TYPE",       "type => logic",             Delimfix "(1TYPE/(1'(_')))"),
   554     ("",            "id => logic",               Delimfix "_"),
   555     ("",            "longid => logic",           Delimfix "_"),
   556     ("",            "var => logic",              Delimfix "_"),
   557     ("_DDDOT",      "logic",                     Delimfix "..."),
   558     ("_constify",   "num => num_const",          Delimfix "_"),
   559     ("_indexnum",   "num_const => index",        Delimfix "\\<^sub>_"),
   560     ("_index",      "logic => index",            Delimfix "(00\\<^bsub>_\\<^esub>)"),
   561     ("_indexdefault", "index",                   Delimfix ""),
   562     ("_indexvar",   "index",                     Delimfix "'\\<index>"),
   563     ("_struct",     "index => logic",            Mixfix ("\\<struct>_", [1000], 1000)),
   564     ("==>",         "prop => prop => prop",      Delimfix "op ==>"),
   565     (Term.dummy_patternN, "aprop",               Delimfix "'_")]
   566   |> Theory.add_syntax Syntax.appl_syntax
   567   |> Theory.add_modesyntax (Symbol.xsymbolsN, true)
   568    [("fun",      "[type, type] => type",  Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)),
   569     ("_bracket", "[types, type] => type", Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)),
   570     ("_ofsort",  "[tid, sort] => type",   Mixfix ("_\\<Colon>_", [1000, 0], 1000)),
   571     ("_constrain", "['a, type] => 'a",    Mixfix ("_\\<Colon>_", [4, 0], 3)),
   572     ("_idtyp",    "[id, type] => idt",    Mixfix ("_\\<Colon>_", [], 0)),
   573     ("_idtypdummy", "type => idt",        Mixfix ("'_()\\<Colon>_", [], 0)),
   574     ("_type_constraint_", "'a",           NoSyn),
   575     ("_lambda",  "[pttrns, 'a] => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)),
   576     ("==",       "['a, 'a] => prop",      InfixrName ("\\<equiv>", 2)),
   577     ("all_binder", "[idts, prop] => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)),
   578     ("==>",      "[prop, prop] => prop",  InfixrName ("\\<Longrightarrow>", 1)),
   579     ("_DDDOT",   "aprop",                 Delimfix "\\<dots>"),
   580     ("_bigimpl", "[asms, prop] => prop",  Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)),
   581     ("_DDDOT",   "logic",                 Delimfix "\\<dots>")]
   582   |> Theory.add_modesyntax ("", false)
   583    [("prop", "prop => prop", Mixfix ("_", [0], 0)),
   584     ("ProtoPure.term", "'a => prop", Delimfix "TERM _"),
   585     ("ProtoPure.conjunction", "prop => prop => prop", InfixrName ("&&", 2))]
   586   |> Theory.add_modesyntax ("HTML", false)
   587    [("_lambda",  "[pttrns, 'a] => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))]
   588   |> Theory.add_consts
   589    [("==", "'a => 'a => prop", InfixrName ("==", 2)),
   590     ("==>", "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
   591     ("all", "('a => prop) => prop", Binder ("!!", 0, 0)),
   592     ("prop", "prop => prop", NoSyn),
   593     ("TYPE", "'a itself", NoSyn),
   594     (Term.dummy_patternN, "'a", Delimfix "'_")]
   595   |> Theory.add_finals_i false
   596     [Const ("==", [aT, aT] ---> propT),
   597      Const ("==>", [propT, propT] ---> propT),
   598      Const ("all", (aT --> propT) --> propT),
   599      Const ("TYPE", Term.a_itselfT),
   600      Const (Term.dummy_patternN, aT)]
   601   |> Theory.add_trfuns Syntax.pure_trfuns
   602   |> Theory.add_trfunsT Syntax.pure_trfunsT
   603   |> Sign.local_path
   604   |> Theory.add_consts
   605    [("term", "'a => prop", NoSyn),
   606     ("conjunction", "prop => prop => prop", NoSyn)]
   607   |> (add_defs false o map Thm.no_attributes)
   608    [("prop_def", "prop(A) == A"),
   609     ("term_def", "term(x) == (!!A. PROP A ==> PROP A)"),
   610     ("conjunction_def",
   611       "conjunction(A, B) == (!!C. (PROP A ==> PROP B ==> PROP C) ==> PROP C)")] |> snd
   612   |> Sign.hide_consts false ["conjunction", "term"]
   613   |> add_thmss [(("nothing", []), [])] |> snd
   614   |> Theory.add_axioms_i Proofterm.equality_axms
   615   |> Theory.end_theory;
   616 
   617 structure ProtoPure =
   618 struct
   619   val thy = proto_pure;
   620   val prop_def = get_axiom thy "prop_def";
   621   val term_def = get_axiom thy "term_def";
   622   val conjunction_def = get_axiom thy "conjunction_def";
   623 end;
   624 
   625 end;
   626 
   627 structure BasicPureThy: BASIC_PURE_THY = PureThy;
   628 open BasicPureThy;