src/Pure/pure_thy.ML
author wenzelm
Wed Jan 21 22:26:49 2009 +0100 (2009-01-21)
changeset 29605 f2924219125e
parent 29579 cb520b766e00
child 30190 479806475f3c
child 30240 5b25fee0362c
permissions -rw-r--r--
eliminated obsolete var morphism;
     1 (*  Title:      Pure/pure_thy.ML
     2     Author:     Markus Wenzel, TU Muenchen
     3 
     4 Theorem storage.  Pure theory syntax and logical content.
     5 *)
     6 
     7 signature PURE_THY =
     8 sig
     9   val facts_of: theory -> Facts.T
    10   val intern_fact: theory -> xstring -> string
    11   val defined_fact: theory -> string -> bool
    12   val hide_fact: bool -> string -> theory -> theory
    13   val join_proofs: theory -> exn list
    14   val cancel_proofs: theory -> unit
    15   val get_fact: Context.generic -> theory -> Facts.ref -> thm list
    16   val get_thms: theory -> xstring -> thm list
    17   val get_thm: theory -> xstring -> thm
    18   val all_thms_of: theory -> (string * thm) list
    19   val map_facts: ('a -> 'b) -> ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
    20   val burrow_fact: ('a list -> 'b list) -> ('a list * 'c) list -> ('b list * 'c) list
    21   val burrow_facts: ('a list -> 'b list) ->
    22     ('c * ('a list * 'd) list) list -> ('c * ('b list * 'd) list) list
    23   val name_multi: string -> 'a list -> (string * 'a) list
    24   val name_thm: bool -> bool -> Position.T -> string -> thm -> thm
    25   val name_thms: bool -> bool -> Position.T -> string -> thm list -> thm list
    26   val name_thmss: bool -> Position.T -> string -> (thm list * 'a) list -> (thm list * 'a) list
    27   val store_thms: binding * thm list -> theory -> thm list * theory
    28   val store_thm: binding * thm -> theory -> thm * theory
    29   val store_thm_open: binding * thm -> theory -> thm * theory
    30   val add_thms: ((binding * thm) * attribute list) list -> theory -> thm list * theory
    31   val add_thm: (binding * thm) * attribute list -> theory -> thm * theory
    32   val add_thmss: ((binding * thm list) * attribute list) list -> theory -> thm list list * theory
    33   val add_thms_dynamic: binding * (Context.generic -> thm list) -> theory -> theory
    34   val note_thmss: string -> ((binding * attribute list) *
    35     (thm list * attribute list) list) list -> theory -> (string * thm list) list * theory
    36   val note_thmss_grouped: string -> string -> ((binding * attribute list) *
    37     (thm list * attribute list) list) list -> theory -> (string * thm list) list * theory
    38   val add_axioms: ((binding * term) * attribute list) list -> theory -> thm list * theory
    39   val add_axioms_cmd: ((bstring * string) * attribute list) list -> theory -> thm list * theory
    40   val add_defs: bool -> ((binding * term) * attribute list) list ->
    41     theory -> thm list * theory
    42   val add_defs_unchecked: bool -> ((binding * term) * attribute list) list ->
    43     theory -> thm list * theory
    44   val add_defs_cmd: bool -> ((bstring * string) * attribute list) list ->
    45     theory -> thm list * theory
    46   val add_defs_unchecked_cmd: bool -> ((bstring * string) * attribute list) list ->
    47     theory -> thm list * theory
    48   val old_appl_syntax: theory -> bool
    49   val old_appl_syntax_setup: theory -> theory
    50 end;
    51 
    52 structure PureThy: PURE_THY =
    53 struct
    54 
    55 
    56 (*** stored facts ***)
    57 
    58 (** theory data **)
    59 
    60 structure FactsData = TheoryDataFun
    61 (
    62   type T = Facts.T * (unit lazy list * Task_Queue.group list);
    63   val empty = (Facts.empty, ([], []));
    64   val copy = I;
    65   fun extend (facts, _) = (facts, ([], []));
    66   fun merge _ ((facts1, _), (facts2, _)) = (Facts.merge (facts1, facts2), ([], []));
    67 );
    68 
    69 
    70 (* facts *)
    71 
    72 val facts_of = #1 o FactsData.get;
    73 
    74 val intern_fact = Facts.intern o facts_of;
    75 val defined_fact = Facts.defined o facts_of;
    76 
    77 fun hide_fact fully name = FactsData.map (apfst (Facts.hide fully name));
    78 
    79 
    80 (* proofs *)
    81 
    82 fun lazy_proof thm = Lazy.lazy (fn () => Thm.join_proof thm);
    83 
    84 fun join_proofs thy =
    85   map_filter (Exn.get_exn o Lazy.force_result) (rev (#1 (#2 (FactsData.get thy))));
    86 
    87 fun cancel_proofs thy = List.app Future.cancel_group (#2 (#2 (FactsData.get thy)));
    88 
    89 
    90 
    91 (** retrieve theorems **)
    92 
    93 fun get_fact context thy xthmref =
    94   let
    95     val xname = Facts.name_of_ref xthmref;
    96     val pos = Facts.pos_of_ref xthmref;
    97 
    98     val name = intern_fact thy xname;
    99     val res = Facts.lookup context (facts_of thy) name;
   100     val _ = Theory.check_thy thy;
   101   in
   102     (case res of
   103       NONE => error ("Unknown fact " ^ quote name ^ Position.str_of pos)
   104     | SOME (static, ths) =>
   105         (Position.report ((if static then Markup.fact else Markup.dynamic_fact) name) pos;
   106          Facts.select xthmref (map (Thm.transfer thy) ths)))
   107   end;
   108 
   109 fun get_thms thy = get_fact (Context.Theory thy) thy o Facts.named;
   110 fun get_thm thy name = Facts.the_single name (get_thms thy name);
   111 
   112 fun all_thms_of thy =
   113   Facts.fold_static (fn (_, ths) => append (map (`(Thm.get_name_hint)) ths)) (facts_of thy) [];
   114 
   115 
   116 
   117 (** store theorems **)
   118 
   119 (* fact specifications *)
   120 
   121 fun map_facts f = map (apsnd (map (apfst (map f))));
   122 fun burrow_fact f = split_list #>> burrow f #> op ~~;
   123 fun burrow_facts f = split_list ##> burrow (burrow_fact f) #> op ~~;
   124 
   125 
   126 (* naming *)
   127 
   128 fun name_multi name [x] = [(name, x)]
   129   | name_multi "" xs = map (pair "") xs
   130   | name_multi name xs = map_index (fn (i, x) => (name ^ "_" ^ string_of_int (i + 1), x)) xs;
   131 
   132 fun name_thm pre official pos name thm = thm
   133   |> (if Thm.get_name thm <> "" andalso pre orelse not official then I else Thm.put_name name)
   134   |> (if Thm.has_name_hint thm andalso pre orelse name = "" then I else Thm.put_name_hint name)
   135   |> Thm.default_position pos
   136   |> Thm.default_position (Position.thread_data ());
   137 
   138 fun name_thms pre official pos name xs =
   139   map (uncurry (name_thm pre official pos)) (name_multi name xs);
   140 
   141 fun name_thmss official pos name fact =
   142   burrow_fact (name_thms true official pos name) fact;
   143 
   144 
   145 (* enter_thms *)
   146 
   147 fun enter_proofs (thy, thms) =
   148   (FactsData.map (apsnd (fn (proofs, groups) =>
   149     (fold (cons o lazy_proof) thms proofs, fold Thm.pending_groups thms groups))) thy, thms);
   150 
   151 fun enter_thms pre_name post_name app_att (b, thms) thy =
   152   if Binding.is_empty b
   153   then swap (enter_proofs (app_att (thy, thms)))
   154   else let
   155     val naming = Sign.naming_of thy;
   156     val name = NameSpace.full_name naming b;
   157     val (thy', thms') =
   158       enter_proofs (apsnd (post_name name) (app_att (thy, pre_name name thms)));
   159     val thms'' = map (Thm.transfer thy') thms';
   160     val thy'' = thy' |> (FactsData.map o apfst) (Facts.add_global naming (b, thms'') #> snd);
   161   in (thms'', thy'') end;
   162 
   163 
   164 (* store_thm(s) *)
   165 
   166 fun store_thms (b, thms) = enter_thms (name_thms true true Position.none)
   167   (name_thms false true Position.none) I (b, thms);
   168 
   169 fun store_thm (b, th) = store_thms (b, [th]) #>> the_single;
   170 
   171 fun store_thm_open (b, th) =
   172   enter_thms (name_thms true false Position.none) (name_thms false false Position.none) I
   173     (b, [th]) #>> the_single;
   174 
   175 
   176 (* add_thms(s) *)
   177 
   178 fun add_thms_atts pre_name ((b, thms), atts) =
   179   enter_thms pre_name (name_thms false true Position.none)
   180     (foldl_map (Thm.theory_attributes atts)) (b, thms);
   181 
   182 fun gen_add_thmss pre_name =
   183   fold_map (add_thms_atts pre_name);
   184 
   185 fun gen_add_thms pre_name args =
   186   apfst (map hd) o gen_add_thmss pre_name (map (apfst (apsnd single)) args);
   187 
   188 val add_thmss = gen_add_thmss (name_thms true true Position.none);
   189 val add_thms = gen_add_thms (name_thms true true Position.none);
   190 val add_thm = yield_singleton add_thms;
   191 
   192 
   193 (* add_thms_dynamic *)
   194 
   195 fun add_thms_dynamic (b, f) thy = thy
   196   |> (FactsData.map o apfst)
   197       (Facts.add_dynamic (Sign.naming_of thy) (b, f) #> snd);
   198 
   199 
   200 (* note_thmss *)
   201 
   202 local
   203 
   204 fun gen_note_thmss tag = fold_map (fn ((b, more_atts), ths_atts) => fn thy =>
   205   let
   206     val pos = Binding.pos_of b;
   207     val name = Sign.full_name thy b;
   208     val _ = Position.report (Markup.fact_decl name) pos;
   209 
   210     fun app (x, (ths, atts)) = foldl_map (Thm.theory_attributes atts) (x, ths);
   211     val (thms, thy') = thy |> enter_thms
   212       (name_thmss true pos) (name_thms false true pos) (apsnd flat o foldl_map app)
   213       (b, map (fn (ths, atts) => (ths, surround tag (atts @ more_atts))) ths_atts);
   214   in ((name, thms), thy') end);
   215 
   216 in
   217 
   218 fun note_thmss k = gen_note_thmss (Thm.kind k);
   219 fun note_thmss_grouped k g = gen_note_thmss (Thm.kind k #> Thm.group g);
   220 
   221 end;
   222 
   223 
   224 (* store axioms as theorems *)
   225 
   226 local
   227   fun get_ax thy (b, _) = Thm.axiom thy (Sign.full_name thy b);
   228   fun get_axs thy named_axs = map (Thm.forall_elim_vars 0 o get_ax thy) named_axs;
   229   fun add_axm prep_b add = fold_map (fn ((b, ax), atts) => fn thy =>
   230     let
   231       val named_ax = [(b, ax)];
   232       val thy' = add named_ax thy;
   233       val thm = hd (get_axs thy' ((map o apfst) prep_b named_ax));
   234     in apfst hd (gen_add_thms (K I) [((prep_b b, thm), atts)] thy') end);
   235 in
   236   val add_defs               = add_axm I o Theory.add_defs_i false;
   237   val add_defs_unchecked     = add_axm I o Theory.add_defs_i true;
   238   val add_axioms             = add_axm I Theory.add_axioms_i;
   239   val add_defs_cmd           = add_axm Binding.name o Theory.add_defs false;
   240   val add_defs_unchecked_cmd = add_axm Binding.name o Theory.add_defs true;
   241   val add_axioms_cmd         = add_axm Binding.name Theory.add_axioms;
   242 end;
   243 
   244 
   245 
   246 (*** Pure theory syntax and logical content ***)
   247 
   248 val typ = SimpleSyntax.read_typ;
   249 val term = SimpleSyntax.read_term;
   250 val prop = SimpleSyntax.read_prop;
   251 
   252 val typeT = Syntax.typeT;
   253 val spropT = Syntax.spropT;
   254 
   255 
   256 (* application syntax variants *)
   257 
   258 val appl_syntax =
   259  [("_appl", typ "('b => 'a) => args => logic", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000)),
   260   ("_appl", typ "('b => 'a) => args => aprop", Mixfix ("(1_/(1'(_')))", [1000, 0], 1000))];
   261 
   262 val applC_syntax =
   263  [("",       typ "'a => cargs",                  Delimfix "_"),
   264   ("_cargs", typ "'a => cargs => cargs",         Mixfix ("_/ _", [1000, 1000], 1000)),
   265   ("_applC", typ "('b => 'a) => cargs => logic", Mixfix ("(1_/ _)", [1000, 1000], 999)),
   266   ("_applC", typ "('b => 'a) => cargs => aprop", Mixfix ("(1_/ _)", [1000, 1000], 999))];
   267 
   268 structure OldApplSyntax = TheoryDataFun
   269 (
   270   type T = bool;
   271   val empty = false;
   272   val copy = I;
   273   val extend = I;
   274   fun merge _ (b1, b2) : T =
   275     if b1 = b2 then b1
   276     else error "Cannot merge theories with different application syntax";
   277 );
   278 
   279 val old_appl_syntax = OldApplSyntax.get;
   280 
   281 val old_appl_syntax_setup =
   282   OldApplSyntax.put true #>
   283   Sign.del_modesyntax_i Syntax.mode_default applC_syntax #>
   284   Sign.add_syntax_i appl_syntax;
   285 
   286 
   287 (* main content *)
   288 
   289 val _ = Context.>> (Context.map_theory
   290   (OldApplSyntax.init #>
   291    Sign.add_types
   292    [("fun", 2, NoSyn),
   293     ("prop", 0, NoSyn),
   294     ("itself", 1, NoSyn),
   295     ("dummy", 0, NoSyn)]
   296   #> Sign.add_nonterminals Syntax.basic_nonterms
   297   #> Sign.add_syntax_i
   298    [("_lambda",     typ "pttrns => 'a => logic",       Mixfix ("(3%_./ _)", [0, 3], 3)),
   299     ("_abs",        typ "'a",                          NoSyn),
   300     ("",            typ "'a => args",                  Delimfix "_"),
   301     ("_args",       typ "'a => args => args",          Delimfix "_,/ _"),
   302     ("",            typ "id => idt",                   Delimfix "_"),
   303     ("_idtdummy",   typ "idt",                         Delimfix "'_"),
   304     ("_idtyp",      typ "id => type => idt",           Mixfix ("_::_", [], 0)),
   305     ("_idtypdummy", typ "type => idt",                 Mixfix ("'_()::_", [], 0)),
   306     ("",            typ "idt => idt",                  Delimfix "'(_')"),
   307     ("",            typ "idt => idts",                 Delimfix "_"),
   308     ("_idts",       typ "idt => idts => idts",         Mixfix ("_/ _", [1, 0], 0)),
   309     ("",            typ "idt => pttrn",                Delimfix "_"),
   310     ("",            typ "pttrn => pttrns",             Delimfix "_"),
   311     ("_pttrns",     typ "pttrn => pttrns => pttrns",   Mixfix ("_/ _", [1, 0], 0)),
   312     ("",            typ "aprop => aprop",              Delimfix "'(_')"),
   313     ("",            typ "id => aprop",                 Delimfix "_"),
   314     ("",            typ "longid => aprop",             Delimfix "_"),
   315     ("",            typ "var => aprop",                Delimfix "_"),
   316     ("_DDDOT",      typ "aprop",                       Delimfix "..."),
   317     ("_aprop",      typ "aprop => prop",               Delimfix "PROP _"),
   318     ("_asm",        typ "prop => asms",                Delimfix "_"),
   319     ("_asms",       typ "prop => asms => asms",        Delimfix "_;/ _"),
   320     ("_bigimpl",    typ "asms => prop => prop",        Mixfix ("((3[| _ |])/ ==> _)", [0, 1], 1)),
   321     ("_ofclass",    typ "type => logic => prop",       Delimfix "(1OFCLASS/(1'(_,/ _')))"),
   322     ("_mk_ofclass", typ "dummy",                       NoSyn),
   323     ("_TYPE",       typ "type => logic",               Delimfix "(1TYPE/(1'(_')))"),
   324     ("",            typ "id => logic",                 Delimfix "_"),
   325     ("",            typ "longid => logic",             Delimfix "_"),
   326     ("",            typ "var => logic",                Delimfix "_"),
   327     ("_DDDOT",      typ "logic",                       Delimfix "..."),
   328     ("_constify",   typ "num => num_const",            Delimfix "_"),
   329     ("_constify",   typ "float_token => float_const",  Delimfix "_"),
   330     ("_indexnum",   typ "num_const => index",          Delimfix "\\<^sub>_"),
   331     ("_index",      typ "logic => index",              Delimfix "(00\\<^bsub>_\\<^esub>)"),
   332     ("_indexdefault", typ "index",                     Delimfix ""),
   333     ("_indexvar",   typ "index",                       Delimfix "'\\<index>"),
   334     ("_struct",     typ "index => logic",              Mixfix ("\\<struct>_", [1000], 1000)),
   335     ("==>",         typ "prop => prop => prop",        Delimfix "op ==>"),
   336     (Term.dummy_patternN, typ "aprop",                 Delimfix "'_"),
   337     ("_sort_constraint", typ "type => prop",           Delimfix "(1SORT'_CONSTRAINT/(1'(_')))"),
   338     ("Pure.term",   typ "logic => prop",               Delimfix "TERM _"),
   339     ("Pure.conjunction", typ "prop => prop => prop",   InfixrName ("&&&", 2))]
   340   #> Sign.add_syntax_i applC_syntax
   341   #> Sign.add_modesyntax_i (Symbol.xsymbolsN, true)
   342    [("fun",      typ "type => type => type",   Mixfix ("(_/ \\<Rightarrow> _)", [1, 0], 0)),
   343     ("_bracket", typ "types => type => type",  Mixfix ("([_]/ \\<Rightarrow> _)", [0, 0], 0)),
   344     ("_ofsort",  typ "tid => sort => type",    Mixfix ("_\\<Colon>_", [1000, 0], 1000)),
   345     ("_constrain", typ "logic => type => logic", Mixfix ("_\\<Colon>_", [4, 0], 3)),
   346     ("_constrain", [spropT, typeT] ---> spropT, Mixfix ("_\\<Colon>_", [4, 0], 3)),
   347     ("_idtyp",    typ "id => type => idt",     Mixfix ("_\\<Colon>_", [], 0)),
   348     ("_idtypdummy", typ "type => idt",         Mixfix ("'_()\\<Colon>_", [], 0)),
   349     ("_type_constraint_", typ "'a",            NoSyn),
   350     ("_lambda",  typ "pttrns => 'a => logic",  Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3)),
   351     ("==",       typ "'a => 'a => prop",       InfixrName ("\\<equiv>", 2)),
   352     ("all_binder", typ "idts => prop => prop", Mixfix ("(3\\<And>_./ _)", [0, 0], 0)),
   353     ("==>",      typ "prop => prop => prop",   InfixrName ("\\<Longrightarrow>", 1)),
   354     ("_DDDOT",   typ "aprop",                  Delimfix "\\<dots>"),
   355     ("_bigimpl", typ "asms => prop => prop",   Mixfix ("((1\\<lbrakk>_\\<rbrakk>)/ \\<Longrightarrow> _)", [0, 1], 1)),
   356     ("_DDDOT",   typ "logic",                  Delimfix "\\<dots>")]
   357   #> Sign.add_modesyntax_i ("", false)
   358    [("prop", typ "prop => prop", Mixfix ("_", [0], 0))]
   359   #> Sign.add_modesyntax_i ("HTML", false)
   360    [("_lambda", typ "pttrns => 'a => logic", Mixfix ("(3\\<lambda>_./ _)", [0, 3], 3))]
   361   #> Sign.add_consts_i
   362    [("==", typ "'a => 'a => prop", InfixrName ("==", 2)),
   363     ("==>", typ "prop => prop => prop", Mixfix ("(_/ ==> _)", [2, 1], 1)),
   364     ("all", typ "('a => prop) => prop", Binder ("!!", 0, 0)),
   365     ("prop", typ "prop => prop", NoSyn),
   366     ("TYPE", typ "'a itself", NoSyn),
   367     (Term.dummy_patternN, typ "'a", Delimfix "'_")]
   368   #> Theory.add_deps "==" ("==", typ "'a => 'a => prop") []
   369   #> Theory.add_deps "==>" ("==>", typ "prop => prop => prop") []
   370   #> Theory.add_deps "all" ("all", typ "('a => prop) => prop") []
   371   #> Theory.add_deps "TYPE" ("TYPE", typ "'a itself") []
   372   #> Theory.add_deps Term.dummy_patternN (Term.dummy_patternN, typ "'a") []
   373   #> Sign.add_trfuns Syntax.pure_trfuns
   374   #> Sign.add_trfunsT Syntax.pure_trfunsT
   375   #> Sign.local_path
   376   #> Sign.add_consts_i
   377    [("term", typ "'a => prop", NoSyn),
   378     ("sort_constraint", typ "'a itself => prop", NoSyn),
   379     ("conjunction", typ "prop => prop => prop", NoSyn)]
   380   #> (add_defs false o map Thm.no_attributes)
   381    [(Binding.name "prop_def", prop "(CONST prop :: prop => prop) (A::prop) == A::prop"),
   382     (Binding.name "term_def", prop "(CONST Pure.term :: 'a => prop) (x::'a) == (!!A::prop. A ==> A)"),
   383     (Binding.name "sort_constraint_def",
   384       prop "(CONST Pure.sort_constraint :: 'a itself => prop) (CONST TYPE :: 'a itself) ==\
   385       \ (CONST Pure.term :: 'a itself => prop) (CONST TYPE :: 'a itself)"),
   386     (Binding.name "conjunction_def", prop "(A &&& B) == (!!C::prop. (A ==> B ==> C) ==> C)")] #> snd
   387   #> Sign.hide_const false "Pure.term"
   388   #> Sign.hide_const false "Pure.sort_constraint"
   389   #> Sign.hide_const false "Pure.conjunction"
   390   #> add_thmss [((Binding.name "nothing", []), [])] #> snd
   391   #> Theory.add_axioms_i ((map o apfst) Binding.name Proofterm.equality_axms)));
   392 
   393 end;