src/Pure/theory.ML
author wenzelm
Sat Nov 14 13:25:16 1998 +0100 (1998-11-14)
changeset 5862 3a1f9ec7c8a2
parent 5837 ce9a8b05d652
child 5905 68cdba6c178f
permissions -rw-r--r--
val copy: theory -> theory;
     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       axioms: term Symtab.table,
    16       oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table,
    17       parents: theory list,
    18       ancestors: theory list}
    19   val sign_of: theory -> Sign.sg
    20   val syn_of: theory -> Syntax.syntax
    21   val parents_of: theory -> theory list
    22   val ancestors_of: theory -> theory list
    23   val subthy: theory * theory -> bool
    24   val eq_thy: theory * theory -> bool
    25   val cert_axm: Sign.sg -> string * term -> string * term
    26   val read_def_axm: Sign.sg * (indexname -> typ option) * (indexname -> sort option) -> string list ->
    27     string * string -> string * term
    28   val read_axm: Sign.sg -> string * string -> string * term
    29   val inferT_axm: Sign.sg -> string * term -> string * term
    30   val merge_theories: string -> theory * theory -> theory
    31 end
    32 
    33 signature THEORY =
    34 sig
    35   include BASIC_THEORY
    36   val apply: (theory -> theory) list -> theory -> 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: xsort -> 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 * xsort list * xsort) 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 * int)) list -> theory -> theory
    69   val add_trrules: (xstring * string) Syntax.trrule list -> theory -> theory
    70   val add_trrules_i: Syntax.ast Syntax.trrule list -> theory -> theory
    71   val add_axioms: (bstring * string) list -> theory -> theory
    72   val add_axioms_i: (bstring * term) list -> theory -> theory
    73   val add_oracle: bstring * (Sign.sg * Object.T -> term) -> theory -> theory
    74   val add_defs: (bstring * string) list -> theory -> theory
    75   val add_defs_i: (bstring * term) list -> theory -> theory
    76   val add_path: string -> theory -> theory
    77   val parent_path: theory -> theory
    78   val root_path: theory -> theory
    79   val add_space: string * string list -> theory -> theory
    80   val add_name: string -> theory -> theory
    81   val copy: theory -> theory
    82   val prep_ext: theory -> theory
    83   val prep_ext_merge: theory list -> theory
    84   val requires: theory -> string -> string -> unit
    85   val pre_pure: theory
    86 end;
    87 
    88 signature THEORY_PRIVATE =
    89 sig
    90   include THEORY
    91   val init_data: Object.kind -> (Object.T * (Object.T -> Object.T) *
    92     (Object.T * Object.T -> Object.T) * (Sign.sg -> Object.T -> unit)) -> theory -> theory
    93   val print_data: Object.kind -> theory -> unit
    94   val get_data: Object.kind -> (Object.T -> 'a) -> theory -> 'a
    95   val put_data: Object.kind -> ('a -> Object.T) -> 'a -> theory -> theory
    96 end;
    97 
    98 
    99 structure Theory: THEORY_PRIVATE =
   100 struct
   101 
   102 
   103 (** datatype theory **)
   104 
   105 datatype theory =
   106   Theory of {
   107     sign: Sign.sg,
   108     axioms: term Symtab.table,
   109     oracles: ((Sign.sg * Object.T -> term) * stamp) Symtab.table,
   110     parents: theory list,
   111     ancestors: theory list};
   112 
   113 fun make_theory sign axms oras parents ancestors =
   114   Theory {sign = sign, axioms = axms, oracles = oras,
   115     parents = parents, ancestors = ancestors};
   116 
   117 fun rep_theory (Theory args) = args;
   118 
   119 val sign_of = #sign o rep_theory;
   120 val syn_of = #syn o Sign.rep_sg o sign_of;
   121 val parents_of = #parents o rep_theory;
   122 val ancestors_of = #ancestors o rep_theory;
   123 
   124 (*errors involving theories*)
   125 exception THEORY of string * theory list;
   126 
   127 (*compare theories*)
   128 val subthy = Sign.subsig o pairself sign_of;
   129 val eq_thy = Sign.eq_sg o pairself sign_of;
   130 
   131 (*check for some named theory*)
   132 fun requires thy name what =
   133   if exists (equal name) (Sign.stamp_names_of (sign_of thy)) then ()
   134   else error ("Require theory " ^ quote name ^ " as an ancestor for " ^ what);
   135 
   136 (*partial Pure theory*)
   137 val pre_pure = make_theory Sign.pre_pure Symtab.empty Symtab.empty [] [];
   138 
   139 (*apply transformers*)
   140 fun apply [] thy = thy
   141   | apply (f :: fs) thy = apply fs (f thy);
   142 
   143 
   144 
   145 (** extend theory **)
   146 
   147 (*name space kinds*)
   148 val axiomK = "axiom";
   149 val oracleK = "oracle";
   150 
   151 
   152 (* extend logical part of a theory *)
   153 
   154 fun err_dup_axms names =
   155   error ("Duplicate axiom name(s) " ^ commas_quote names);
   156 
   157 fun err_dup_oras names =
   158   error ("Duplicate oracles " ^ commas_quote names);
   159 
   160 fun ext_theory thy ext_sg new_axms new_oras =
   161   let
   162     val Theory {sign, axioms, oracles, parents, ancestors} = thy;
   163     val draft = Sign.is_draft sign;
   164     val axioms' =
   165       Symtab.extend (if draft then axioms else Symtab.empty, new_axms)
   166         handle Symtab.DUPS names => err_dup_axms names;
   167     val oracles' =
   168       Symtab.extend (oracles, new_oras)
   169         handle Symtab.DUPS names => err_dup_oras names;
   170     val (parents', ancestors') =
   171       if draft then (parents, ancestors) else ([thy], thy :: ancestors);
   172   in
   173     make_theory (ext_sg sign) axioms' oracles' parents' ancestors'
   174   end;
   175 
   176 
   177 (* extend signature of a theory *)
   178 
   179 fun ext_sign extfun decls thy = ext_theory thy (extfun decls) [] [];
   180 
   181 val add_classes      = ext_sign Sign.add_classes;
   182 val add_classes_i    = ext_sign Sign.add_classes_i;
   183 val add_classrel     = ext_sign Sign.add_classrel;
   184 val add_classrel_i   = ext_sign Sign.add_classrel_i;
   185 val add_defsort      = ext_sign Sign.add_defsort;
   186 val add_defsort_i    = ext_sign Sign.add_defsort_i;
   187 val add_types        = ext_sign Sign.add_types;
   188 val add_nonterminals = ext_sign Sign.add_nonterminals;
   189 val add_tyabbrs      = ext_sign Sign.add_tyabbrs;
   190 val add_tyabbrs_i    = ext_sign Sign.add_tyabbrs_i;
   191 val add_arities      = ext_sign Sign.add_arities;
   192 val add_arities_i    = ext_sign Sign.add_arities_i;
   193 val add_consts       = ext_sign Sign.add_consts;
   194 val add_consts_i     = ext_sign Sign.add_consts_i;
   195 val add_syntax       = ext_sign Sign.add_syntax;
   196 val add_syntax_i     = ext_sign Sign.add_syntax_i;
   197 val add_modesyntax   = curry (ext_sign Sign.add_modesyntax);
   198 val add_modesyntax_i = curry (ext_sign Sign.add_modesyntax_i);
   199 val add_trfuns       = ext_sign Sign.add_trfuns;
   200 val add_trfunsT      = ext_sign Sign.add_trfunsT;
   201 val add_tokentrfuns  = ext_sign Sign.add_tokentrfuns;
   202 val add_trrules      = ext_sign Sign.add_trrules;
   203 val add_trrules_i    = ext_sign Sign.add_trrules_i;
   204 val add_path         = ext_sign Sign.add_path;
   205 val parent_path      = add_path "..";
   206 val root_path        = add_path "/";
   207 val add_space        = ext_sign Sign.add_space;
   208 val add_name         = ext_sign Sign.add_name;
   209 val prep_ext         = ext_sign (K Sign.prep_ext) ();
   210 val copy             = prep_ext;	(*an approximation ...*)
   211 
   212 
   213 (** add axioms **)
   214 
   215 (* prepare axioms *)
   216 
   217 fun err_in_axm name =
   218   error ("The error(s) above occurred in axiom " ^ quote name);
   219 
   220 fun no_vars tm =
   221   if null (term_vars tm) andalso null (term_tvars tm) then tm
   222   else error "Illegal schematic variable(s) in term";
   223 
   224 fun cert_axm sg (name, raw_tm) =
   225   let
   226     val (t, T, _) = Sign.certify_term sg raw_tm
   227       handle TYPE (msg, _, _) => error msg
   228            | TERM (msg, _) => error msg;
   229   in
   230     assert (T = propT) "Term not of type prop";
   231     (name, no_vars t)
   232   end
   233   handle ERROR => err_in_axm name;
   234 
   235 (*some duplication of code with read_def_cterm*)
   236 fun read_def_axm (sg, types, sorts) used (name, str) = 
   237   let
   238     val ts = Syntax.read (#syn (Sign.rep_sg sg)) propT str;
   239     val (t, _) = Sign.infer_types sg types sorts used true (ts, propT);
   240   in cert_axm sg (name,t) end
   241   handle ERROR => err_in_axm name;
   242 
   243 fun read_axm sg name_str = read_def_axm (sg, K None, K None) [] name_str;
   244 
   245 fun inferT_axm sg (name, pre_tm) =
   246   let
   247     val (t, _) = Sign.infer_types sg (K None) (K None) [] true ([pre_tm], propT);
   248   in (name, no_vars t) end
   249   handle ERROR => err_in_axm name;
   250 
   251 
   252 (* extend axioms of a theory *)
   253 
   254 fun ext_axms prep_axm raw_axms (thy as Theory {sign, ...}) =
   255   let
   256     val raw_axms' = map (apfst (Sign.full_name sign)) raw_axms;
   257     val axioms =
   258       map (apsnd (Term.compress_term o Logic.varify) o prep_axm sign) raw_axms';
   259     val ext_sg = Sign.add_space (axiomK, map fst axioms);
   260   in
   261     ext_theory thy ext_sg axioms []
   262   end;
   263 
   264 val add_axioms = ext_axms read_axm;
   265 val add_axioms_i = ext_axms cert_axm;
   266 
   267 
   268 (* add oracle **)
   269 
   270 fun add_oracle (raw_name, oracle) (thy as Theory {sign, ...}) =
   271   let
   272     val name = Sign.full_name sign raw_name;
   273     val ext_sg = Sign.add_space (oracleK, [name]);
   274   in
   275     ext_theory thy ext_sg [] [(name, (oracle, stamp ()))]
   276   end;
   277 
   278 
   279 
   280 (** add constant definitions **)
   281 
   282 (* all_axioms_of *)
   283 
   284 (*results may contain duplicates!*)
   285 
   286 fun all_axioms_of thy =
   287   flat (map (Symtab.dest o #axioms o rep_theory) (thy :: ancestors_of thy));
   288 
   289 
   290 (* clash_types, clash_consts *)
   291 
   292 (*check if types have common instance (ignoring sorts)*)
   293 
   294 fun clash_types ty1 ty2 =
   295   let
   296     val ty1' = Type.varifyT ty1;
   297     val ty2' = incr_tvar (maxidx_of_typ ty1' + 1) (Type.varifyT ty2);
   298   in
   299     Type.raw_unify (ty1', ty2')
   300   end;
   301 
   302 fun clash_consts (c1, ty1) (c2, ty2) =
   303   c1 = c2 andalso clash_types ty1 ty2;
   304 
   305 
   306 (* clash_defns *)
   307 
   308 fun clash_defn c_ty (name, tm) =
   309   let val (c, ty') = dest_Const (head_of (fst (Logic.dest_equals tm))) in
   310     if clash_consts c_ty (c, ty') then Some (name, ty') else None
   311   end handle TERM _ => None;
   312 
   313 fun clash_defns c_ty axms =
   314   distinct (mapfilter (clash_defn c_ty) axms);
   315 
   316 
   317 (* dest_defn *)
   318 
   319 fun dest_defn tm =
   320   let
   321     fun err msg = raise TERM (msg, [tm]);
   322 
   323     val (lhs, rhs) = Logic.dest_equals (Logic.strip_imp_concl tm)
   324       handle TERM _ => err "Not a meta-equality (==)";
   325     val (head, args) = strip_comb lhs;
   326     val (c, ty) = dest_Const head
   327       handle TERM _ => err "Head of lhs not a constant";
   328 
   329     fun occs_const (Const c_ty') = (c_ty' = (c, ty))
   330       | occs_const (Abs (_, _, t)) = occs_const t
   331       | occs_const (t $ u) = occs_const t orelse occs_const u
   332       | occs_const _ = false;
   333 
   334     fun dest_free (Free (x, _)) = x
   335       | dest_free (Const ("TYPE", Type ("itself", [TFree (x, _)]))) = x
   336       | dest_free _ = raise Match;
   337 
   338     val show_frees = commas_quote o map dest_free;
   339     val show_tfrees = commas_quote o map fst;
   340 
   341     val lhs_dups = duplicates args;
   342     val rhs_extras = gen_rems (op =) (term_frees rhs, args);
   343     val rhs_extrasT = gen_rems (op =) (term_tfrees rhs, typ_tfrees ty);
   344   in
   345     if not (forall (can dest_free) args) then
   346       err "Arguments (on lhs) must be variables"
   347     else if not (null lhs_dups) then
   348       err ("Duplicate variables on lhs: " ^ show_frees lhs_dups)
   349     else if not (null rhs_extras) then
   350       err ("Extra variables on rhs: " ^ show_frees rhs_extras)
   351     else if not (null rhs_extrasT) then
   352       err ("Extra type variables on rhs: " ^ show_tfrees rhs_extrasT)
   353     else if occs_const rhs then
   354       err ("Constant to be defined occurs on rhs")
   355     else (c, ty)
   356   end;
   357 
   358 
   359 (* check_defn *)
   360 
   361 fun err_in_defn sg name msg =
   362   (error_msg msg; error ("The error(s) above occurred in definition " ^
   363     quote (Sign.full_name sg name)));
   364 
   365 fun check_defn sign (axms, (name, tm)) =
   366   let
   367     fun show_const (c, ty) = quote (Pretty.string_of (Pretty.block
   368       [Pretty.str (c ^ " ::"), Pretty.brk 1, Sign.pretty_typ sign ty]));
   369 
   370     fun show_defn c (dfn, ty') = show_const (c, ty') ^ " in " ^ dfn;
   371     fun show_defns c = cat_lines o map (show_defn c);
   372 
   373     val (c, ty) = dest_defn tm
   374       handle TERM (msg, _) => err_in_defn sign name msg;
   375     val defns = clash_defns (c, ty) axms;
   376   in
   377     if not (null defns) then
   378       err_in_defn sign name ("Definition of " ^ show_const (c, ty) ^
   379         "\nclashes with " ^ show_defns c defns)
   380     else (name, tm) :: axms
   381   end;
   382 
   383 
   384 (* add_defs *)
   385 
   386 fun ext_defns prep_axm raw_axms thy =
   387   let
   388     val axms = map (prep_axm (sign_of thy)) raw_axms;
   389     val all_axms = all_axioms_of thy;
   390   in
   391     foldl (check_defn (sign_of thy)) (all_axms, axms);
   392     add_axioms_i axms thy
   393   end;
   394 
   395 val add_defs_i = ext_defns cert_axm;
   396 val add_defs = ext_defns read_axm;
   397 
   398 
   399 
   400 (** additional theory data **)
   401 
   402 val init_data = curry (ext_sign Sign.init_data);
   403 fun print_data kind = Sign.print_data kind o sign_of;
   404 fun get_data kind f = Sign.get_data kind f o sign_of;
   405 fun put_data kind f = ext_sign (Sign.put_data kind f);
   406 
   407 
   408 
   409 (** merge theories **)		(*exception ERROR*)
   410 
   411 fun merge_sign (sg, thy) =
   412   Sign.nontriv_merge (sg, sign_of thy) handle TERM (msg, _) => error msg;
   413 
   414 (*merge list of theories from left to right, preparing extend*)
   415 fun prep_ext_merge thys =
   416   if null thys then
   417     error "Merge: no parent theories"
   418   else if exists (Sign.is_draft o sign_of) thys then
   419     error "Attempt to merge draft theories"
   420   else
   421     let
   422       val sign' =
   423         foldl merge_sign (sign_of (hd thys), tl thys)
   424         |> Sign.prep_ext
   425         |> Sign.add_path "/";
   426 
   427       val axioms' = Symtab.empty;
   428 
   429       fun eq_ora ((_, (_, s1: stamp)), (_, (_, s2))) = s1 = s2;
   430       val oracles' =
   431         Symtab.make (gen_distinct eq_ora
   432           (flat (map (Symtab.dest o #oracles o rep_theory) thys)))
   433         handle Symtab.DUPS names => err_dup_oras names;
   434 
   435       val parents' = gen_distinct eq_thy thys;
   436       val ancestors' =
   437         gen_distinct eq_thy (parents' @ flat (map ancestors_of thys));
   438     in
   439       make_theory sign' axioms' oracles' parents' ancestors'
   440     end;
   441 
   442 fun merge_theories name (thy1, thy2) =
   443   prep_ext_merge [thy1, thy2]
   444   |> add_name name;
   445 
   446 
   447 end;
   448 
   449 structure BasicTheory: BASIC_THEORY = Theory;
   450 open BasicTheory;