src/Pure/theory.ML
author berghofe
Wed Oct 31 19:37:04 2001 +0100 (2001-10-31)
changeset 11998 b14e7686ce84
parent 11501 3b6415035d1a
child 12123 739eba13e2cd
permissions -rw-r--r--
- enter_thmx -> enter_thms
- improved naming of theorems: enter_thms now takes functions pre_name and post_name
as arguments
     1 (*  Title:      Pure/theory.ML
     2     ID:         $Id$
     3     Author:     Lawrence C Paulson and Markus Wenzel
     4     Copyright   1996  University of Cambridge
     5 
     6 The abstract type "theory" of theories.
     7 *)
     8 
     9 signature BASIC_THEORY =
    10 sig
    11   type theory
    12   exception THEORY of string * theory list
    13   val rep_theory: theory ->
    14     {sign: Sign.sg,
    15       const_deps: unit Graph.T,
    16       axioms: term Symtab.table,
    17       oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table,
    18       parents: theory list,
    19       ancestors: theory list}
    20   val sign_of: theory -> Sign.sg
    21   val is_draft: theory -> bool
    22   val syn_of: theory -> Syntax.syntax
    23   val parents_of: theory -> theory list
    24   val ancestors_of: theory -> theory list
    25   val subthy: theory * theory -> bool
    26   val eq_thy: theory * theory -> bool
    27   val cert_axm: Sign.sg -> string * term -> string * term
    28   val read_def_axm: Sign.sg * (indexname -> typ option) * (indexname -> sort option) ->
    29     string list -> string * string -> string * term
    30   val read_axm: Sign.sg -> string * string -> string * term
    31   val inferT_axm: Sign.sg -> string * term -> string * term
    32 end
    33 
    34 signature THEORY =
    35 sig
    36   include BASIC_THEORY
    37   val axiomK: string
    38   val oracleK: string
    39   (*theory extension primitives*)
    40   val add_classes: (bclass * xclass list) list -> theory -> theory
    41   val add_classes_i: (bclass * class list) list -> theory -> theory
    42   val add_classrel: (xclass * xclass) list -> theory -> theory
    43   val add_classrel_i: (class * class) list -> theory -> theory
    44   val add_defsort: string -> theory -> theory
    45   val add_defsort_i: sort -> theory -> theory
    46   val add_types: (bstring * int * mixfix) list -> theory -> theory
    47   val add_nonterminals: bstring list -> theory -> theory
    48   val add_tyabbrs: (bstring * string list * string * mixfix) list
    49     -> theory -> theory
    50   val add_tyabbrs_i: (bstring * string list * typ * mixfix) list
    51     -> theory -> theory
    52   val add_arities: (xstring * string list * string) list -> theory -> theory
    53   val add_arities_i: (string * sort list * sort) list -> theory -> theory
    54   val add_consts: (bstring * string * mixfix) list -> theory -> theory
    55   val add_consts_i: (bstring * typ * mixfix) list -> theory -> theory
    56   val add_syntax: (bstring * string * mixfix) list -> theory -> theory
    57   val add_syntax_i: (bstring * typ * mixfix) list -> theory -> theory
    58   val add_modesyntax: string * bool -> (bstring * string * mixfix) list -> theory -> theory
    59   val add_modesyntax_i: string * bool -> (bstring * typ * mixfix) list -> theory -> theory
    60   val add_trfuns:
    61     (string * (Syntax.ast list -> Syntax.ast)) list *
    62     (string * (term list -> term)) list *
    63     (string * (term list -> term)) list *
    64     (string * (Syntax.ast list -> Syntax.ast)) list -> theory -> theory
    65   val add_trfunsT:
    66     (string * (bool -> typ -> term list -> term)) list -> theory -> theory
    67   val add_tokentrfuns:
    68     (string * string * (string -> string * real)) list -> theory -> theory
    69   val add_mode_tokentrfuns: string -> (string * (string -> string * real)) list
    70     -> theory -> theory
    71   val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
    72   val add_trrules_i: Syntax.ast Syntax.trrule list -> theory -> theory
    73   val add_axioms: (bstring * string) list -> theory -> theory
    74   val add_axioms_i: (bstring * term) list -> theory -> theory
    75   val add_oracle: bstring * (Sign.sg * Object.T -> term) -> theory -> theory
    76   val add_defs: bool -> (bstring * string) list -> theory -> theory
    77   val add_defs_i: bool -> (bstring * term) list -> theory -> theory
    78   val add_path: string -> theory -> theory
    79   val parent_path: theory -> theory
    80   val root_path: theory -> theory
    81   val absolute_path: theory -> theory
    82   val hide_space: string * xstring list -> theory -> theory
    83   val hide_space_i: string * string list -> theory -> theory
    84   val hide_classes: string list -> theory -> theory
    85   val hide_types: string list -> theory -> theory
    86   val hide_consts: string list -> theory -> theory
    87   val add_name: string -> theory -> theory
    88   val copy: theory -> theory
    89   val prep_ext: theory -> theory
    90   val prep_ext_merge: theory list -> theory
    91   val requires: theory -> string -> string -> unit
    92   val assert_super: theory -> theory -> theory
    93   val pre_pure: theory
    94 end;
    95 
    96 signature PRIVATE_THEORY =
    97 sig
    98   include THEORY
    99   val init_data: Object.kind -> (Object.T * (Object.T -> Object.T) * (Object.T -> Object.T) *
   100     (Object.T * Object.T -> Object.T) * (Sign.sg -> Object.T -> unit)) -> theory -> theory
   101   val print_data: Object.kind -> theory -> unit
   102   val get_data: Object.kind -> (Object.T -> 'a) -> theory -> 'a
   103   val put_data: Object.kind -> ('a -> Object.T) -> 'a -> theory -> theory
   104 end;
   105 
   106 
   107 structure Theory: PRIVATE_THEORY =
   108 struct
   109 
   110 
   111 (** datatype theory **)
   112 
   113 (*Note: dependencies are only tracked for non-overloaded constant definitions*)
   114 
   115 datatype theory =
   116   Theory of {
   117     sign: Sign.sg,
   118     const_deps: unit Graph.T,
   119     axioms: term Symtab.table,
   120     oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table,
   121     parents: theory list,
   122     ancestors: theory list};
   123 
   124 fun make_theory sign const_deps axioms oracles parents ancestors =
   125   Theory {sign = sign, const_deps = const_deps, axioms = axioms, oracles = oracles,
   126     parents = parents, ancestors = ancestors};
   127 
   128 fun rep_theory (Theory args) = args;
   129 
   130 val sign_of = #sign o rep_theory;
   131 val is_draft = Sign.is_draft o sign_of;
   132 val syn_of = #syn o Sign.rep_sg o sign_of;
   133 val parents_of = #parents o rep_theory;
   134 val ancestors_of = #ancestors o rep_theory;
   135 
   136 (*errors involving theories*)
   137 exception THEORY of string * theory list;
   138 
   139 (*compare theories*)
   140 val subthy = Sign.subsig o pairself sign_of;
   141 val eq_thy = Sign.eq_sg o pairself sign_of;
   142 
   143 (*check for some theory*)
   144 fun requires thy name what =
   145   if Sign.exists_stamp name (sign_of thy) then ()
   146   else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what);
   147 
   148 fun assert_super thy1 thy2 =
   149   if subthy (thy1, thy2) then thy2
   150   else raise THEORY ("Not a super theory", [thy1, thy2]);
   151 
   152 (*partial Pure theory*)
   153 val pre_pure =
   154   make_theory Sign.pre_pure Graph.empty Symtab.empty Symtab.empty [] [];
   155 
   156 
   157 
   158 (** extend theory **)
   159 
   160 (*name spaces*)
   161 val axiomK = "axiom";
   162 val oracleK = "oracle";
   163 
   164 
   165 (* extend logical part of a theory *)
   166 
   167 fun err_dup_axms names =
   168   error ("Duplicate axiom name(s): " ^ commas_quote names);
   169 
   170 fun err_dup_oras names =
   171   error ("Duplicate oracles: " ^ commas_quote names);
   172 
   173 fun ext_theory thy ext_sg ext_deps new_axms new_oras =
   174   let
   175     val Theory {sign, const_deps, axioms, oracles, parents, ancestors} = thy;
   176     val draft = Sign.is_draft sign;
   177     val axioms' =
   178       Symtab.extend (if draft then axioms else Symtab.empty, new_axms)
   179         handle Symtab.DUPS names => err_dup_axms names;
   180     val oracles' =
   181       Symtab.extend (oracles, new_oras)
   182         handle Symtab.DUPS names => err_dup_oras names;
   183     val (parents', ancestors') =
   184       if draft then (parents, ancestors) else ([thy], thy :: ancestors);
   185   in
   186     make_theory (ext_sg sign) (ext_deps const_deps) axioms' oracles' parents' ancestors'
   187   end;
   188 
   189 
   190 (* extend signature of a theory *)
   191 
   192 fun ext_sign extfun decls thy = ext_theory thy (extfun decls) I [] [];
   193 
   194 val add_classes      = ext_sign Sign.add_classes;
   195 val add_classes_i    = ext_sign Sign.add_classes_i;
   196 val add_classrel     = ext_sign Sign.add_classrel;
   197 val add_classrel_i   = ext_sign Sign.add_classrel_i;
   198 val add_defsort      = ext_sign Sign.add_defsort;
   199 val add_defsort_i    = ext_sign Sign.add_defsort_i;
   200 val add_types        = ext_sign Sign.add_types;
   201 val add_nonterminals = ext_sign Sign.add_nonterminals;
   202 val add_tyabbrs      = ext_sign Sign.add_tyabbrs;
   203 val add_tyabbrs_i    = ext_sign Sign.add_tyabbrs_i;
   204 val add_arities      = ext_sign Sign.add_arities;
   205 val add_arities_i    = ext_sign Sign.add_arities_i;
   206 val add_consts       = ext_sign Sign.add_consts;
   207 val add_consts_i     = ext_sign Sign.add_consts_i;
   208 val add_syntax       = ext_sign Sign.add_syntax;
   209 val add_syntax_i     = ext_sign Sign.add_syntax_i;
   210 val add_modesyntax   = curry (ext_sign Sign.add_modesyntax);
   211 val add_modesyntax_i = curry (ext_sign Sign.add_modesyntax_i);
   212 val add_trfuns       = ext_sign Sign.add_trfuns;
   213 val add_trfunsT      = ext_sign Sign.add_trfunsT;
   214 val add_tokentrfuns  = ext_sign Sign.add_tokentrfuns;
   215 fun add_mode_tokentrfuns m = add_tokentrfuns o map (fn (s, f) => (m, s, f));
   216 val add_trrules      = ext_sign Sign.add_trrules;
   217 val add_trrules_i    = ext_sign Sign.add_trrules_i;
   218 val add_path         = ext_sign Sign.add_path;
   219 val parent_path      = add_path "..";
   220 val root_path        = add_path "/";
   221 val absolute_path    = add_path "//";
   222 val add_space        = ext_sign Sign.add_space;
   223 val hide_space       = ext_sign Sign.hide_space;
   224 val hide_space_i     = ext_sign Sign.hide_space_i;
   225 val hide_classes     = curry hide_space_i Sign.classK;
   226 val hide_types       = curry hide_space_i Sign.typeK;
   227 val hide_consts      = curry hide_space_i Sign.constK;
   228 val add_name         = ext_sign Sign.add_name;
   229 val copy             = ext_sign (K Sign.copy) ();
   230 val prep_ext         = ext_sign (K Sign.prep_ext) ();
   231 
   232 
   233 
   234 (** add axioms **)
   235 
   236 (* prepare axioms *)
   237 
   238 fun err_in_axm name =
   239   error ("The error(s) above occurred in axiom " ^ quote name);
   240 
   241 fun no_vars tm =
   242   if null (term_vars tm) andalso null (term_tvars tm) then tm
   243   else error "Illegal schematic variable(s) in term";
   244 
   245 fun cert_axm sg (name, raw_tm) =
   246   let
   247     val (t, T, _) = Sign.certify_term sg raw_tm
   248       handle TYPE (msg, _, _) => error msg
   249            | TERM (msg, _) => error msg;
   250   in
   251     Term.no_dummy_patterns t handle TERM (msg, _) => error msg;
   252     assert (T = propT) "Term not of type prop";
   253     (name, no_vars t)
   254   end;
   255 
   256 (*some duplication of code with read_def_cterm*)
   257 fun read_def_axm (sg, types, sorts) used (name, str) =
   258   let
   259     val ts = Syntax.read (#syn (Sign.rep_sg sg)) propT str;
   260     val (t, _) = Sign.infer_types sg types sorts used true (ts, propT);
   261   in cert_axm sg (name, t) end
   262   handle ERROR => err_in_axm name;
   263 
   264 fun read_axm sg name_str = read_def_axm (sg, K None, K None) [] name_str;
   265 
   266 fun inferT_axm sg (name, pre_tm) =
   267   let
   268     val (t, _) = Sign.infer_types sg (K None) (K None) [] true ([pre_tm], propT);
   269   in (name, no_vars t) end
   270   handle ERROR => err_in_axm name;
   271 
   272 
   273 (* extend axioms of a theory *)
   274 
   275 fun ext_axms prep_axm raw_axms (thy as Theory {sign, ...}) =
   276   let
   277     val raw_axms' = map (apfst (Sign.full_name sign)) raw_axms;
   278     val axioms =
   279       map (apsnd (Term.compress_term o Logic.varify) o prep_axm sign) raw_axms';
   280     val ext_sg = Sign.add_space (axiomK, map fst axioms);
   281   in ext_theory thy ext_sg I axioms [] end;
   282 
   283 val add_axioms = ext_axms read_axm;
   284 val add_axioms_i = ext_axms cert_axm;
   285 
   286 
   287 (* add oracle **)
   288 
   289 fun add_oracle (raw_name, oracle) (thy as Theory {sign, ...}) =
   290   let
   291     val name = Sign.full_name sign raw_name;
   292     val ext_sg = Sign.add_space (oracleK, [name]);
   293   in ext_theory thy ext_sg I [] [(name, (oracle, stamp ()))] end;
   294 
   295 
   296 
   297 (** add constant definitions **)
   298 
   299 (* clash_types, clash_consts *)
   300 
   301 (*check if types have common instance (ignoring sorts)*)
   302 
   303 fun clash_types ty1 ty2 =
   304   let
   305     val ty1' = Type.varifyT ty1;
   306     val ty2' = incr_tvar (maxidx_of_typ ty1' + 1) (Type.varifyT ty2);
   307   in Type.raw_unify (ty1', ty2') end;
   308 
   309 fun clash_consts (c1, ty1) (c2, ty2) =
   310   c1 = c2 andalso clash_types ty1 ty2;
   311 
   312 
   313 (* clash_defns *)
   314 
   315 fun clash_defn c_ty (name, tm) =
   316   let val (c, ty') = dest_Const (head_of (fst (Logic.dest_equals tm))) in
   317     if clash_consts c_ty (c, ty') then Some (name, ty') else None
   318   end handle TERM _ => None;
   319 
   320 fun clash_defns c_ty axms =
   321   distinct (mapfilter (clash_defn c_ty) axms);
   322 
   323 
   324 (* overloading *)
   325 
   326 datatype overloading = NoOverloading | Useless | Plain;
   327 
   328 fun overloading sg declT defT =
   329   let val T = Term.incr_tvar (maxidx_of_typ declT + 1) (Type.varifyT defT) in
   330     if Sign.typ_instance sg (declT, T) then NoOverloading
   331     else if Sign.typ_instance sg (Type.rem_sorts declT, Type.rem_sorts T) then Useless
   332     else Plain
   333   end;
   334 
   335 
   336 (* dest_defn *)
   337 
   338 fun dest_defn tm =
   339   let
   340     fun err msg = raise TERM (msg, [tm]);
   341 
   342     val (lhs, rhs) = Logic.dest_equals (Logic.strip_imp_concl tm)
   343       handle TERM _ => err "Not a meta-equality (==)";
   344     val (head, args) = strip_comb lhs;
   345     val c_ty as (c, ty) = dest_Const head
   346       handle TERM _ => err "Head of lhs not a constant";
   347 
   348     fun dest_free (Free (x, _)) = x
   349       | dest_free (Const ("TYPE", Type ("itself", [TFree (x, _)]))) = x
   350       | dest_free _ = raise Match;
   351 
   352     val show_frees = commas_quote o map dest_free;
   353     val show_tfrees = commas_quote o map fst;
   354 
   355     val lhs_dups = duplicates args;
   356     val rhs_extras = gen_rems (op =) (term_frees rhs, args);
   357     val rhs_extrasT = gen_rems (op =) (term_tfrees rhs, typ_tfrees ty);
   358   in
   359     if not (forall (can dest_free) args) then
   360       err "Arguments (on lhs) must be variables"
   361     else if not (null lhs_dups) then
   362       err ("Duplicate variables on lhs: " ^ show_frees lhs_dups)
   363     else if not (null rhs_extras) then
   364       err ("Extra variables on rhs: " ^ show_frees rhs_extras)
   365     else if not (null rhs_extrasT) then
   366       err ("Extra type variables on rhs: " ^ show_tfrees rhs_extrasT)
   367     else if exists_Const (fn c_ty' => c_ty' = c_ty) rhs then
   368       err ("Constant to be defined occurs on rhs")
   369     else (c_ty, rhs)
   370   end;
   371 
   372 
   373 (* check_defn *)
   374 
   375 fun err_in_defn sg name msg =
   376   (error_msg msg;
   377     error ("The error(s) above occurred in definition " ^ quote (Sign.full_name sg name)));
   378 
   379 fun cycle_msg namess = "Cyclic dependency of constants:\n" ^
   380   cat_lines (map (space_implode " -> " o map quote o rev) namess);
   381 
   382 fun add_deps (c, cs) deps =
   383   let fun declare (G, x) = Graph.new_node (x, ()) G handle Graph.DUP _ => G
   384   in foldl declare (deps, c :: cs) |> Graph.add_deps_acyclic (c, cs) end;
   385 
   386 
   387 fun check_defn sg overloaded ((deps, axms), def as (name, tm)) =
   388   let
   389     fun pretty_const (c, ty) = [Pretty.str c, Pretty.str " ::", Pretty.brk 1,
   390       Pretty.quote (Sign.pretty_typ sg (#1 (Type.freeze_thaw_type ty)))];
   391 
   392     fun def_txt (c_ty, txt) = Pretty.block
   393       (Pretty.str "Definition of " :: pretty_const c_ty @
   394         (if txt = "" then [] else [Pretty.str txt]));
   395 
   396     fun show_defn c (dfn, ty') = Pretty.block
   397       (Pretty.str "  " :: pretty_const (c, ty') @ [Pretty.str " in ", Pretty.str dfn]);
   398 
   399     val (c_ty as (c, ty), rhs) = dest_defn tm
   400       handle TERM (msg, _) => err_in_defn sg name msg;
   401     val c_decl =
   402       (case Sign.const_type sg c of Some T => T
   403       | None => err_in_defn sg name ("Undeclared constant " ^ quote c));
   404 
   405     val clashed = clash_defns c_ty axms;
   406   in
   407     if not (null clashed) then
   408       err_in_defn sg name (Pretty.string_of (Pretty.chunks
   409         (def_txt (c_ty, " clashes with") :: map (show_defn c) clashed)))
   410     else
   411       (case overloading sg c_decl ty of
   412         NoOverloading =>
   413           (add_deps (c, Term.add_term_consts (rhs, [])) deps
   414               handle Graph.CYCLES namess => err_in_defn sg name (cycle_msg namess),
   415             def :: axms)
   416       | Useless =>
   417            err_in_defn sg name (Pretty.string_of (Pretty.chunks
   418              [Library.setmp show_sorts true def_txt (c_ty, ""), Pretty.str
   419                  "imposes additional sort constraints on the declared type of the constant"]))
   420       | Plain =>
   421          (if not overloaded then warning (Pretty.string_of (Pretty.chunks
   422            [def_txt (c_ty, ""), Pretty.str ("is strictly less general than the declared type (see "
   423                ^ quote (Sign.full_name sg name) ^ ")")]))
   424          else (); (deps, def :: axms)))
   425   end;
   426 
   427 
   428 (* add_defs *)
   429 
   430 fun ext_defns prep_axm overloaded raw_axms thy =
   431   let
   432     val Theory {sign, const_deps, axioms, oracles, parents, ancestors} = thy;
   433     val all_axioms = flat (map (Symtab.dest o #axioms o rep_theory) (thy :: ancestors));
   434 
   435     val axms = map (prep_axm sign) raw_axms;
   436     val (const_deps', _) = foldl (check_defn sign overloaded) ((const_deps, all_axioms), axms);
   437   in
   438     make_theory sign const_deps' axioms oracles parents ancestors
   439     |> add_axioms_i axms
   440   end;
   441 
   442 val add_defs_i = ext_defns cert_axm;
   443 val add_defs = ext_defns read_axm;
   444 
   445 
   446 
   447 (** additional theory data **)
   448 
   449 val init_data = curry (ext_sign Sign.init_data);
   450 fun print_data kind = Sign.print_data kind o sign_of;
   451 fun get_data kind f = Sign.get_data kind f o sign_of;
   452 fun put_data kind f = ext_sign (Sign.put_data kind f);
   453 
   454 
   455 
   456 (** merge theories **)          (*exception ERROR*)
   457 
   458 fun merge_sign (sg, thy) =
   459   Sign.nontriv_merge (sg, sign_of thy) handle TERM (msg, _) => error msg;
   460 
   461 (*merge list of theories from left to right, preparing extend*)
   462 fun prep_ext_merge thys =
   463   if null thys then
   464     error "Merge: no parent theories"
   465   else if exists is_draft thys then
   466     error "Attempt to merge draft theories"
   467   else
   468     let
   469       val sign' =
   470         foldl merge_sign (sign_of (hd thys), tl thys)
   471         |> Sign.prep_ext
   472         |> Sign.add_path "/";
   473 
   474       val depss = map (#const_deps o rep_theory) thys;
   475       val deps' = foldl (Graph.merge_acyclic (K true)) (hd depss, tl depss)
   476         handle Graph.CYCLES namess => error (cycle_msg namess);
   477 
   478       val axioms' = Symtab.empty;
   479 
   480       fun eq_ora ((_, (_, s1: stamp)), (_, (_, s2))) = s1 = s2;
   481       val oracles' =
   482         Symtab.make (gen_distinct eq_ora
   483           (flat (map (Symtab.dest o #oracles o rep_theory) thys)))
   484         handle Symtab.DUPS names => err_dup_oras names;
   485 
   486       val parents' = gen_distinct eq_thy thys;
   487       val ancestors' =
   488         gen_distinct eq_thy (parents' @ flat (map ancestors_of thys));
   489     in
   490       make_theory sign' deps' axioms' oracles' parents' ancestors'
   491     end;
   492 
   493 
   494 end;
   495 
   496 structure BasicTheory: BASIC_THEORY = Theory;
   497 open BasicTheory;